{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T18:20:59Z","timestamp":1747592459655,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642366741"},{"type":"electronic","value":"9783642366758"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36675-8_4","type":"book-chapter","created":{"date-parts":[[2013,2,28]],"date-time":"2013-02-28T14:04:22Z","timestamp":1362060262000},"page":"68-100","source":"Crossref","is-referenced-by-count":10,"title":["Superposition for Bounded Domains"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Hillenbrand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoph","family":"Weidenbach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-04222-5_5","volume-title":"Frontiers of Combining Systems","author":"E. Althaus","year":"2009","unstructured":"Althaus, E., Kruglov, E., Weidenbach, C.: Superposition Modulo Linear Arithmetic SUP(LA). In: Ghilardi, S., Sebastiani, R. (eds.) FroCoS 2009. LNCS, vol.\u00a05749, pp. 84\u201399. Springer, Heidelberg (2009)"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/3-540-44802-0_36","volume-title":"Computer Science Logic","author":"A. Armando","year":"2001","unstructured":"Armando, A., Ranise, S., Rusinowitch, M.: Uniform Derivation of Decision Procedures by Superposition. In: Fribourg, L. (ed.) CSL 2001. LNCS, vol.\u00a02142, pp. 513\u2013527. Springer, Heidelberg (2001)"},{"issue":"1","key":"4_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1459010.1459014","volume":"10","author":"A. Armando","year":"2009","unstructured":"Armando, A., Bonacina, M.P., Ranise, S., Schulz, S.: New results on rewrite-based satisfiability procedures. ACM Transactions on Computational Logic\u00a010(1), 4:1\u20134:51 (2009)","journal-title":"ACM Transactions on Computational Logic"},{"issue":"3","key":"4_CR4","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1093\/logcom\/4.3.217","volume":"4","author":"L. Bachmair","year":"1994","unstructured":"Bachmair, L., Ganzinger, H.: Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation\u00a04(3), 217\u2013247 (1994)","journal-title":"Journal of Logic and Computation"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01190829","volume":"5","author":"L. Bachmair","year":"1994","unstructured":"Bachmair, L., Ganzinger, H., Waldmann, U.: Refutational theorem proving for hierarchic first-order theories. Appl. Algebra Eng. Commun. Comput.\u00a05, 193\u2013212 (1994)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"4_CR6","unstructured":"Baumgartner, P., Fuchs, A., de Nivelle, H., Tinelli, C.: Computing finite models by reduction to function-free clause logic. In: Ahrendt, W., Baumgartner, P., de Nivelle, H. (eds.) Proceedings of the Third Workshop on Disproving, pp. 82\u201399 (2006)"},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1093\/logcom\/exn061","volume":"20","author":"P. Baumgartner","year":"2010","unstructured":"Baumgartner, P., Furbach, U., Pelzer, B.: The hyper tableaux calculus with equality and an application to finite model computation. Journal of Logic and Computation\u00a020(1), 77\u2013109 (2010)","journal-title":"Journal of Logic and Computation"},{"key":"4_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/11814771_11","volume-title":"Automated Reasoning","author":"P. Baumgartner","year":"2006","unstructured":"Baumgartner, P., Schmidt, R.A.: Blocking and Other Enhancements for Bottom-Up Model Generation Methods. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol.\u00a04130, pp. 125\u2013139. Springer, Heidelberg (2006)"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/BF01459101","volume":"99","author":"P. Bernays","year":"1928","unstructured":"Bernays, P., Sch\u00f6nfinkel, M.: Zum Entscheidungsproblem der mathematischen Logik. Mathematische Annalen\u00a099, 342\u2013372 (1928)","journal-title":"Mathematische Annalen"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-642-32347-8_24","volume-title":"Interactive Theorem Proving","author":"J.C. Blanchette","year":"2012","unstructured":"Blanchette, J.C., Popescu, A., Wand, D., Weidenbach, C.: More SPASS with Isabelle\u2014Superposition with Hard Sorts and Configurable Simplification. In: Beringer, L., Felty, A. (eds.) ITP 2012. LNCS, vol.\u00a07406, pp. 345\u2013360. Springer, Heidelberg (2012), \n                  \n                    http:\/\/www4.in.tum.de\/~blanchet\/more-spass.pdf"},{"key":"4_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/11814771_42","volume-title":"Automated Reasoning","author":"M.P. Bonacina","year":"2006","unstructured":"Bonacina, M.P., Ghilardi, S., Nicolini, E., Ranise, S., Zucchelli, D.: Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol.\u00a04130, pp. 513\u2013527. Springer, Heidelberg (2006)"},{"issue":"2","key":"4_CR12","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10817-010-9213-y","volume":"47","author":"M.P. Bonacina","year":"2011","unstructured":"Bonacina, M.P., Lynch, C., Mendon\u00e7a de Moura, L.: On deciding satisfiability by theorem proving with speculative inferences. Journal of Automated Reasoning\u00a047(2), 161\u2013189 (2011)","journal-title":"Journal of Automated Reasoning"},{"key":"4_CR13","unstructured":"Claessen, K., S\u00f6rensson, N.: New techniques that improve MACE-style finite model finding. In: Baumgartner, P., Fermueller, C. (eds.) Proceedings of the Workshop on Model Computation (2003)"},{"key":"4_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/11814771_28","volume-title":"Automated Reasoning","author":"H. Nivelle de","year":"2006","unstructured":"de Nivelle, H., Meng, J.: Geometric Resolution: A Proof Procedure Based on Finite Model Search. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol.\u00a04130, pp. 303\u2013317. Springer, Heidelberg (2006)"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/3-540-54317-1_78","volume-title":"Conditional and Typed Rewriting Systems","author":"N. Dershowitz","year":"1991","unstructured":"Dershowitz, N.: A Maximal-Literal Unit Strategy for Horn Clauses. In: Okada, M., Kaplan, S. (eds.) CTRS 1990. LNCS, vol.\u00a0516, pp. 14\u201325. Springer, Heidelberg (1991)"},{"issue":"1-2","key":"4_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10472-009-9150-9","volume":"55","author":"A. Fietzke","year":"2009","unstructured":"Fietzke, A., Weidenbach, C.: Labelled splitting. Annals of Mathematics and Artificial Intellelligence\u00a055(1-2), 3\u201334 (2009)","journal-title":"Annals of Mathematics and Artificial Intellelligence"},{"key":"4_CR17","unstructured":"Fietzke, A., Weidenbach, C.: Superposition as a decision procedure for timed automata. In: Ratschan, S. (ed.) MACIS 2011: Fourth International Conference on Mathematical Aspects of Computer and Information Sciences, pp. 52\u201362 (2011); Journal version to appear in the Journal of Mathematics in Computer Science"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-642-31365-3_21","volume-title":"Automated Reasoning","author":"P. Fontaine","year":"2012","unstructured":"Fontaine, P., Merz, S., Weidenbach, C.: Combination of Disjoint Theories: Beyond Decidability. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS, vol.\u00a07364, pp. 256\u2013270. Springer, Heidelberg (2012)"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/3-540-63104-6_32","volume-title":"Automated Deduction - CADE-14","author":"H. Ganzinger","year":"1997","unstructured":"Ganzinger, H., Meyer, C., Weidenbach, C.: Soft Typing for Ordered Resolution. In: McCune, W. (ed.) CADE 1997. LNCS, vol.\u00a01249, pp. 321\u2013335. Springer, Heidelberg (1997)"},{"key":"4_CR20","unstructured":"Hillenbrand, T., Topic, D., Weidenbach, C.: Sudokus as logical puzzles. In: Ahrendt, W., Baumgartner, P., de Nivelle, H. (eds.) Proceedings of the Third Workshop on Disproving, pp. 2\u201312 (2006)"},{"key":"4_CR21","unstructured":"Hillenbrand, T., Weidenbach, C.: Superposition for finite domains. Research Report MPI-I-2007-RG1-002, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken (2007), \n                  \n                    http:\/\/www.mpi-inf.mpg.de\/~hillen\/documents\/HW07.ps"},{"key":"4_CR22","unstructured":"Kamin, S., Levy, J.-J.: Attempts for generalizing the recursive path orderings. University of Illinois, Department of Computer Science. Unpublished note (1980), Available electronically from \n                  \n                    http:\/\/perso.ens-lyon.fr\/pierre.lescanne\/not_accessible.html"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1007\/11560647_39","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2005","author":"H. Kirchner","year":"2005","unstructured":"Kirchner, H., Ranise, S., Ringeissen, C., Tran, D.-K.: On Superposition-Based Satisfiability Procedures and Their Combination. In: Van Hung, D., Wirsing, M. (eds.) ICTAC 2005. LNCS, vol.\u00a03722, pp. 594\u2013608. Springer, Heidelberg (2005)"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/BFb0012847","volume-title":"9th International Conference on Automated Deduction","author":"R. Manthey","year":"1988","unstructured":"Manthey, R., Bry, F.: Satchmo: A Theorem Prover Implemented in Prolog. In: Lusk, E., Overbeek, R. (eds.) CADE 1988. LNCS, vol.\u00a0310, pp. 415\u2013434. Springer, Heidelberg (1988)"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"McCune, W.: Mace4 reference manual and guide. Technical Report ANL\/MCS-TM-264, Argonne National Laboratory (2003)","DOI":"10.2172\/822574"},{"key":"4_CR26","unstructured":"McCune, W.: Prover9 and mace4 (2005-2010), \n                  \n                    http:\/\/www.cs.unm.edu\/~ccune\/prover9\/"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"McCune, W.: Otter 3.3 reference manual. CoRR, cs.SC\/0310056 (2003)","DOI":"10.2172\/822573"},{"key":"4_CR28","unstructured":"Minsky, M.L.: Computation: Finite and Infinite Machines. Automatic Computation. Prentice-Hall (1967)"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Nieuwenhuis, R., Rubio, A.: Paramodulation-based theorem proving. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol.\u00a0I, ch. 7, pp. 371\u2013443. Elsevier (2001)","DOI":"10.1016\/B978-044450813-3\/50009-6"},{"key":"4_CR30","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1145\/1217856.1217859","volume":"53","author":"R. Nieuwenhuis","year":"2006","unstructured":"Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT modulo theories: From an abstract Davis\u2013Putnam\u2013Logemann\u2013Loveland procedure to DPLL(T). Journal of the ACM\u00a053, 937\u2013977 (2006)","journal-title":"Journal of the ACM"},{"key":"4_CR31","unstructured":"Paulson, L.C., Blanchette, J.C.: Three years of experience with Sledgehammer, a practical link between automatic and interactive theorem provers. In: Sutcliffe, G., Ternovska, E., Schulz, S. (eds.) Proceedings of the 8th International Workshop on the Implementation of Logics (2010)"},{"key":"4_CR32","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-540-71070-7_36","volume-title":"Automated Reasoning","author":"J.A. Navarro","year":"2008","unstructured":"Navarro, J.A., Voronkov, A.: Proof Systems for Effectively Propositional Logic. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol.\u00a05195, pp. 426\u2013440. Springer, Heidelberg (2008)"},{"key":"4_CR33","unstructured":"Schulz, S., Bonacina, M.P.: On Handling Distinct Objects in the Superposition Calculus. In: Konev, B., Schulz, S. (eds.) Proc. of the 5th International Workshop on the Implementation of Logics, Montevideo, Uruguay, pp. 66\u201377 (2005)"},{"key":"4_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1007\/3-540-58156-1_63","volume-title":"Automated Deduction - CADE-12","author":"J. Slaney","year":"1994","unstructured":"Slaney, J.: FINDER: Finite Domain Enumerator. In: Bundy, A. (ed.) CADE 1994. LNCS, vol.\u00a0814, pp. 798\u2013801. Springer, Heidelberg (1994)"},{"key":"4_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-642-14203-1_38","volume-title":"Automated Reasoning","author":"M. Suda","year":"2010","unstructured":"Suda, M., Weidenbach, C., Wischnewski, P.: On the Saturation of YAGO. In: Giesl, J., H\u00e4hnle, R. (eds.) IJCAR 2010. LNCS, vol.\u00a06173, pp. 441\u2013456. Springer, Heidelberg (2010)"},{"key":"4_CR36","doi-asserted-by":"crossref","unstructured":"Weidenbach, C.: Combining superposition, sorts and splitting. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol.\u00a0II, ch. 27, pp. 1965\u20132012. Elsevier (2001)","DOI":"10.1016\/B978-044450813-3\/50029-1"},{"key":"4_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-642-02959-2_10","volume-title":"Automated Deduction \u2013 CADE-22","author":"C. Weidenbach","year":"2009","unstructured":"Weidenbach, C., Dimova, D., Fietzke, A., Kumar, R., Suda, M., Wischnewski, P.: SPASS Version 3.5. In: Schmidt, R.A. (ed.) CADE 2009. LNCS, vol.\u00a05663, pp. 140\u2013145. Springer, Heidelberg (2009)"},{"key":"4_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-71067-7_7","volume-title":"Theorem Proving in Higher Order Logics","author":"M. Wenzel","year":"2008","unstructured":"Wenzel, M., Paulson, L.C., Nipkow, T.: The Isabelle Framework. In: Mohamed, O.A., Mu\u00f1oz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol.\u00a05170, pp. 33\u201338. Springer, Heidelberg (2008)"},{"key":"4_CR39","unstructured":"Zhang, J., Zhang, H.: SEM: a system for enumerating models. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence, vol.\u00a01, pp. 298\u2013303. Morgan Kaufmann (1995)"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning and Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36675-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:48:17Z","timestamp":1558302497000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36675-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642366741","9783642366758"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36675-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}