Combining Enumeration and Deductive Techniques in order to Increase the Class of Constructible Infinite Models

Journal of Symbolic Computation

Volumn 29, Issue 2, 2000, Pages 177-211

  Caferra, Ricardo ^a   Peltier, Nicolas ^a  

^a NONE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001107914     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1999.0360     Document Type: Article

References (44)

1. Baumgartner P., Furbach U., Niemela I. Hyper-tableaux. Logics in AI, JELIA'96. 1996;Springer.
2. Bourely C., Caferra R., Peltier N. A method for building models automatically. E xperiments with an extension of Otter. Proceedings of CADE-12. 1994;Springer. p. 72-86.
3. Boy de la Tour T. An optimality result for clause form translation. J. Symb. Comput. 14:1992;283-301.
4. Bry F., Yahya A. Minimal model generation with positive unit hyper-resolution tableaux. Proceeding of Tableaux'96. 1996;Springer. p. 143-159.
5. Caferra R., Peltier N. A new technique for verifying and correcting logic programs. J. Autom. Reasoning. 19:1997;277-318.
6. Caferra R., Zabel N. Extending resolution for model construction. Logics in AI, JELIA'90. 1991;Springer. p. 153-169.
7. Caferra R., Zabel N. A method for simultaneous search for refutations and models by equational constraint solving. J. Symb. Comput. 13:1992;613-641.
8. Caferra R., Zabel N. Building models by using tableaux extended by equational problems. J. Logic Comput. 3:1993;3-25.
9. Chu H., Plaisted D. Model finding in semantically guided instance-based theorem-proving. Fundam. Inform. 21:1994;221-235.
10. Comon H., Lescanne P. Equational problems and disunification. J. Symb. Comput. 7:1989;371-475.
11. Davis M., Putnam H. A computing procedure for quantification theory. J. ACM. 7:1960;201-215.
12. Dreben B., Goldfarb W. D. The Decision Problem, Solvable Classes of Quantificational Formulas. 1979;Addison-Wesley.
13. Egly U., Rath T. On the practical value of different definitional translations to normal form. Proceedings of CADE-13. 1996;Springer. p. 403-417.
14. Fermüller C., Leitsch A. Hyperresolution and automated model building. J. Logic Comput. 6:1996;173-203.
15. Fermüller C., Leitsch A. Decision procedures and model building in equational clause logic. J. IGPL. 6:1998;17-41.
16. Fermüller C., Leitsch A., Tammet T., Zamov N. Resolution Methods for the Decision Problem. 1993;Springer.
17. Fitting M. First-Order Logic and Automated Theorem Proving. 1990;Springer-Verlag.
18. Gödel K. Ergebnisse eines mathematischen kolloquiums. Ein Spezialfall des Entscheidungsproblems der theoretischen Logik. 2:1932a;27-28.
19. Gödel K. Monatshefte für mathematik und physik. Zum Entscheidungsproblems des logischen Funktionenkalküls. 40:1932b;433-443.
20. Goldfarb W. D. The unsolvability of the Gödel class with identity. J. Symb. Logic. 49:1984;1237-1252.
21. Hasegawa R., Hoshimura M., Fujita H. Mgtp: a parallel theorem prover based on lazy model generation. Proceedings of CADE-11. 1992;Springer. p. 776-780.
22. Kirchner C., Kirchner H., Rusinowitch M. Deduction with symbolic constraints. Rev. Fr. Intell. Artif. 4:1990;9-52.
23. S. Klingenbeck, 1996.
24. Manthey R., Bry F. SATCHMO: A theorem prover implemented in Prolog. Proceedings of CADE-9. 1988;Springer. p. 415-434.
25. Matzinger R. Computational representations of Herbrand models using grammars. Computer Science Logic, CSL'96. 1997.
26. W. McCune, 1994, Argonne National Laboratory.
27. W. W. McCune, 2.0 Users Guide.
28. Paramasivam M., Plaisted D. Automated deduction techniques for classification in description. J. Autom. Reasoning. 20:1998;337-364.
29. Peltier N. Increasing the capabilities of model building by constraint solving with terms with integer exponents. J. Symb. Comput. 24:1997a;59-101.
30. N. Peltier, 1997b.
31. Peltier N. Simplifying formulae in tableaux. Pruning the search space and building models. Proceeding of Tableaux'97. 1997c;Springer. p. 313-327.
32. Peltier N. Tree automata and automated model building. Fundam. Inform. 30:1997d;59-81.
33. N. Peltier.
34. Peltier N. A new method for automated finite model building exploiting failures and symmetries. J. Logic Comput. 8:1998b;511-543.
35. Peltier N. System description: an equational constraints solver. Proceedings of CADE-15. 1998c;Springer.
36. Plaisted D., Greenbaum S. A structure-preserving clause form translation. J. Symb. Comput. 2:1986;293-304.
37. Slaney J. scott : a model-guided theorem prover. Proceedings IJCAI-93. 1993;Kaufmann, Morgan. p. 109-114.
38. Slaney J. Finder: finite domain enumerator. Proceedings of CADE-12. 1994;Springer. p. 798-801.
39. Smullyan R. M. First-order Logic. 1968;Springer.
40. C. Suttner, G. Sutcliffe, 1996, TU München, James Cook University.
41. Tammet T. Using resolution for deciding solvable classes and building finite models. Baltic Computer Science. 1991;Springer. p. 33-64.
42. Winker S. Generation and verification of finite models and counter-examples using an automated theorem prover answering two open questions. J. ACM. 29:1982;273-284.
43. Zhang H. Sato: an efficient propositional prover. Proceedings of CADE-14. 1997;Springer. p. 272-275.
44. Zhang J., Zhang H. SEM: a system for enumerating models. Proceedings of IJCAI-95. 1995;Morgan Kaufmann. p. 298-303.