A new method for automated finite model building exploiting failures and symmetries

Journal of Logic and Computation

Volumn 8, Issue 4, 1998, Pages 511-543

  Peltier, Nicolas ^a  

^a INPG IMAG   (France)

Author keywords

Finite model building

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS;

FINITE MODELS;

FORMAL LOGIC;

EID: 0032136060     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/8.4.511     Document Type: Article

References (35)

1. J. Barwise. Handbook of Mathematical Logic. North Holland, 1977.
2. B. Benhamou and L. Sais. Tractability through symmetries in propositional calculus. Journal of Automated Reasoning, 12, 89-102, 1994.
3. C. Berge. Graphes et Hypergraphes, 2nd edn. Dunod, 1970.
4. C. Bourely, R. Caferra and N. Peltier. A method for building models automatically. Experiments with an extension of Otter. In Proceedings of CADE-12, pp. 72-86. Vol. 814 of Lecture Notes in Artificial Intelligence, A. Bundy (Ed), Springer Verlag, Berlin, 1994.
5. T. Boy de la Tour. An optimality result for clause form translation. Journal of Symbolic Computation, 14, 283-301, 1992.
6. T. Boy de la Tour. Ground resolution with group computations on semantic symmetries. In Proceedings of CADE-13, pp. 478-492. Vol. 1104 of Lecture Notes in Artificial Intelligence, M.A. Robbie and J.K. Slaney (Eds), Springer Verlag, Berlin, 1996.
7. T. Boy de la Tour and S. Demri. On the complexity of extending ground resolution with symmetry rules. In Proceeding of IJCAI'95, pp. 289-295. Morgan Kaufmann, Cambridge, MA, 1995.
8. R. Caferra and M. Herment. A generic graphic framework for combining inference tools and editing proofs and formulae. Journal of Symbolic Computation, 19, 217-243, 1995.
9. R. Caferra, M. Herment and N. Zabel. User-oriented theorem proving with the ATINF graphic proof editor. In Fundamentals of Artificial Intelligence Research, pp. 2-10. Vol. 535 of Lecture Notes in Computer Science, Ph. Jorrand and J. Kelemen (Eds), Springer Verlag, Berlin, 1991.
10. R. Caferra and N. Peltier. Extending semantic resolution via automated model building: applications. In Proceedings of UCAI'95, pp. 328-334. Morgan Kaufman, Cambridge, MA, 1995.
11. R. Caferra and N. Peltier. A new technique for verifying and correcting logic programs. Journal of Automated Reasoning, 1997, vol 20, no 3, in press.
12. R. Caferra and N. Zabel. Extending resolution for model construction. In Logics in AI, JELIA'90, pp. 153-169. Vol. 478 of Lecture Notes in Artificial Intelligence, Springer Verlag, Berlin, 1990.
13. R. Caferra and N. Zabel. A method for simultaneous search for refutations and models by equational constraint solving. Journal of Symbolic Computation, 13, 613-641, 1992.
14. A. Church. Introduction to Mathematical Logic I. Princeton University Press, Princeton, NJ, 1956.
15. C. Delorme, C. Guíac, D. Quiroz and O. Ordaz. Tools for studying path and cycles in digraphs. Research Report, Universidad Central de Venezuela, October 1995.
16. U. Egly and T. Rath. On the practical value of different definitional translations to normal form. In Proceedings of CADE-13 pp. 403-417. Vol. 1104 of Lecture Notes in Artificial Intelligence, Springer Verlag, Berlin, 1996.
17. C. Fermüller and A. Leitsch. Hyperresolution and automated model building. Journal of Logic and Computation, 6, 173-203, 1996.
18. C. Fermüller, A. Leitsch, T. Tammet and N. Zamov. Resolution Methods for the Decision Problem. Vol. 679 of Lecture Notes in Artificial Intelligence, Springer Verlag, Berlin, 1993.
19. M. Fujita and Hasegawa. A model generation theorem proverin KLI using a ramified stack algorithm. In Proceedings of the 8th International Conference Symposium on Logic Programming, pp. 1070-1080, 1991.
20. J. H. Gallier. Logic for Computer Science. Harper & Row, New York, 1986.
21. H. Gelernter, J. Hansen, and D. Loveland. Empirical explorations of the geometry theorem-proving machine. In Automation of Reasoning, Vol. 1, J. Siekmann and G. Wrightson, eds. pp. 140-150. Springer Verlag, Berlin, 1983. Originally published in 1960.
22. R. Manthey and F. Bry. SATCHMO: A theorem prover implemented in Prolog. In Proceedings of CADE-9, pp. 415-434. Vol. 310 of Lecture Notes in Computer Science, E. Lusk and R. Overbeek (Eds), Springer Verlag, Berlin, 1988.
23. W. McCune. Single axioms for groups and abelian groups with various operations. Journal of Automated Reasoning, 10, 1-13, 1993.
24. J. R. Slagle. Automatic theorem proving with renamable and semantic resolution. Journal of the ACM, 14, 687-697, 1967.
25. J. Slaney. Finder (finite domain enumerator): Notes and guides. Technical report, Australian National University Automated Reasoning Project, Canberra, 1992.
26. J. Slaney. SCOTT: a model-guided theorem prover. In Proceedings of IJCAI-93, Vol. 1, pp. 109-114. Morgan Kaufmann, Cambridge, MA, 1993.
27. C. B. Suttner and G. Sutcliffe. The TPTP problem library. Technical report, TU München/James Cook University, 1995. V-1.2.0.
28. T. Tammet. Using resolution for deciding solvable classes and building finite models. In Baltic Computer Science, pp. 33-64. Vol. 502 of Lecture Notes in Computer Science, Springer Verlag, Berlin, 1991.
29. P. Tarau. Binprolog 3.45. Research report. Département d'Informatique, Université de Moncton, Canada, June 1995.
30. S. Winker. Generation and verification of finite models and counter-examples using an automated theorem prover answering two open questions. Journal of the ACM, 29, 273-284, 1982.
31. L. Wos. The kernel strategy and its use for the study of combinatory logic. Journal of Automated Reasoning, 10, 287-343, 1993.
32. L. Wos, S. Winker, W. McCune et al. Automated reasoning contributes to mathematics and logic. In Proceedings of CADE-10, pp. 485-499. Vol. 449 of Lecture Notes in Artificial Intelligence, Springer Verlag, Berlin, 1990.
33. J. Zhang. Search for models of equational theories. In Proceedings of ICYCS-93, pp. 60-63, 1993.
34. J. Zhang. Problems on the generation of finite models. In Proceedings of CADE-12, pp. 753-757. Vol. 814 of Lecture Notes in Artificial Intelligence, Springer Verlag, Berlin, 1994.
35. J. Zhang and H. Zhang. SEM: a system for enumerating models. In Proceedings of IJCAI-95, Vol. 1, pp. 298-303. Morgan Kaufmann, Cambridge MA, 1995.