Computing finite models by reduction to function-free clause logic

Journal of Applied Logic

Volumn 7, Issue 1, 2009, Pages 58-74

  Baumgartner, Peter ^a   Fuchs, Alexander ^b   de Nivelle, Hans ^c   Tinelli, Cesare ^b  

^a CSIRO   (Australia)

^b UNIVERSITY OF IOWA   (United States)

^c UNIVERSITY OF WROC AW   (Poland)

Author keywords

Automated theorem proving; Model building

Indexed keywords

BUILDINGS; FORMAL LOGIC; FUNCTIONS; MODEL BUILDINGS; PROBABILITY DENSITY FUNCTION; PROBLEM SOLVING;

AUTOMATED THEOREM PROVING; EVOLUTION (CO); FINITE MODELS; LOGIC SPECIFICATIONS; MODEL BUILDING; SATISFIABILITY (QSAT); SATISFIABILITY (SAT) PROBLEMS; SATISFIABILITY (SAT) SOLVERS; TPTP LIBRARY;

THEOREM PROVING;

EID: 58549114439     PISSN: 15708683     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jal.2007.07.005     Document Type: Article

References (25)

1. Bachmair L., Ganzinger H., and Voronkov A. Elimination of equality via transformation with ordering constraints. In: Kirchner C., and Kirchner H. (Eds). Automated Deduction-CADE 15. Lecture Notes in Artificial Intelligence vol. 1421 (1998), Springer, Lindau, Germany 175-190
2. Baumgartner P., Fuchs A., and Tinelli C. Implementing the model evolution calculus. International Journal of Artificial Intelligence Tools 15 1 (2006) 21-52
3. Baumgartner P., Fuchs A., and Tinelli C. Lemma learning in the model evolution calculus. In: Hermann M., and Voronkov A. (Eds). Logic for Programming, Artificial Intelligence and Reasoning (LPAR). Lecture Notes in Artificial Intelligence vol. 4246 (2006), Springer 572-586
4. Baumgartner P., Furbach U., and Stolzenburg F. Computing answers with model elimination. Artificial Intelligence 90 1-2 (1997) 135-176
5. Baumgartner P., and Schmidt R. Blocking and other enhancements for bottom-up model generation methods. In: Furbach U., and Shankar N. (Eds). Automated Reasoning-Third International Joint Conference on Automated Reasoning (IJCAR). Lecture Notes in Artificial Intelligence vol. 4130 (2006), Springer 125-139
6. Baumgartner P., and Tinelli C. The model evolution calculus. In: Baader F. (Ed). CADE-19-The 19th International Conference on Automated Deduction. Lecture Notes in Artificial Intelligence vol. 2741 (2003), Springer 350-364
7. M. Bezem, Disproving distributivity in lattices using geometry logic, in: Proc. CADE-20 Workshop on Disproving, 2005, pp. 2-9
8. Brand D. Proving theorems with the modification method. SIAM Journal on Computing 4 (1975) 412-430
9. Bry F., and Torge S. A deduction method complete for refutation and finite satisfiability. Proc. 6th European Workshop on Logics in AI (JELIA). Lecture Notes in Artificial Intelligence vol. 1489 (1998), Springer 122-138
10. Claessen K., and Sörensson N. New techniques that improve mace-style finite model building. In: Baumgartner P., and Fermüller C.G. (Eds). CADE-19 Workshop: Model Computation-Principles, Algorithms, Applications (2003) 11-27. http://www.cs.miami.edu/~geoff/Conferences/CADE-19/WS4/
11. de Nivelle H., and Meng J. Geometric resolution: A proof procedure based on finite model search. In: Furbach U., and Shankar N. (Eds). Proc. International Joint Conference on Automated Reasoning (IJCAR). Lecture Notes in Artificial Intelligence vol. 4130 (2006), Springer 303-317
12. Ganzinger H., and Korovin K. New directions in instantiation-based theorem proving. LICS (2003), IEEE Computer Society 55-64
13. Genesereth M.M., and Nilsson N.J. Logical Foundations of Artificial Intelligence (1987), Morgan Kaufmann
14. Jia X., and Zhang J. A powerful technique to eliminate isomorphism in finite model search. In: Furbach U., and Shankar N. (Eds). Proc. International Joint Conference on Automated Reasoning (IJCAR). Lecture Notes in Artificial Intelligence vol. 4130 (2006), Springer 318-331
15. H. Kautz, B. Selman, Pushing the envelope: Planning, propositional logic, and stochastic search, in: Proceedings of the 13th National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference, Portland, OR, USA, 1996, pp. 1194-1201
16. Letz R., and Stenz G. Proof and model generation with disconnection tableaux. In: Nieuwenhuis R., and Voronkov A. (Eds). Logic for Programming, Artificial Intelligence, and Reasoning, 8th International Conference, LPAR 2001. Havana, Cuba. Lecture Notes in Artificial Intelligence vol. 2250 (2001), Springer 142-156
17. W. McCune, A Davis-Putnam program and its application to finite first-order model search: Quasigroup existence problems, Tech. rep., Argonne National Laboratory, 1994
18. W. McCune, Mace4 reference manual and guide, Tech. Rep. ANL/MCS-TM-264, Argonne National Laboratory, 2003
19. M.W. Moskewicz, C.F. Madigan, Y. Zhao, L. Zhang, S. Malik, Jun., Chaff: Engineering an efficient SAT solver, in: Proceedings of the 38th Design Automation Conference. Las Vegas, Nevada, 2001, pp. 530-535
20. In: Robinson A., and Voronkov A. (Eds). Handbook of Automated Reasoning (2001), Elsevier
21. Schulz S. System description: E 0.81. In: Basin D., and Rusinowitch M. (Eds). Proc. of the 2nd IJCAR. Cork, Ireland. Lecture Notes in Artificial Intelligence vol. 3097 (2004), Springer 223-228
22. J. Slaney, Finder (finite domain enumerator): Notes and guide, Tech. Rep. TR-ARP-1/92, Australian National University, Automated Reasoning Project, Canberra, 1992
23. Sutcliffe G., and Suttner C. The TPTP problem library: CNF release v1.2.1. Journal of Automated Reasoning 21 2 (1998) 177-203
24. Sutcliffe G., and Suttner C. The state of CASC. AI Communications 19 1 (2006) 35-48
25. J. Zhang, H. Zhang, Sem: A system for enumerating models, in: IJCAI-95-Proceedings of the 14th International Joint Conference on Artificial Intelligence, Montreal, 1995, pp. 298-303