A calculus combining resolution and enumeration for building finite models

Journal of Symbolic Computation

Volumn 36, Issue 1-2, 2003, Pages 49-77

  Peltier, Nicolas ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21044454666     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0747-7171(03)00027-0     Document Type: Article

References (19)

1. Bourely, Ch., Caferra, R., Peltier, N., 1994. A method for building models automatically. Experiments With an Extension of OTTER. In: Proceedings of CADE-12. LNAI, Vol. 814. Springer, Nancy, France, pp. 72-86.
2. Brand, D., 1975. Proving theorems with the modification method. SIAM Journal on Computing 4, 412-430.
3. Caferra, R., Peltier, N., 1997. Combining inference and disinference rules with enumeration for model building. Workshop on IJCAI'97, Model-based Reasoning.
4. Caferra, R., Peltier, N., 1999. Combining enumeration and deductive techniques in order to increase the class of constructible infinite models. Journal of Symbolic Computation 29, 177-211.
5. Caferra, R., Zabel, N., 1992. A method for simultaneous search for refutations and models by equational constraint solving. Journal of Symbolic Computation 13, 613-641.
6. Caferra, R., Zabel, N., 1993. Building models by using tableaux extended by equational problems. Journal of Logic and Computation 3, 3-25.
7. Fermüller, C., Leitsch, A., 1996. Hyperresolution and automated model building. Journal of Logic and Computation 6 (2), 173-203.
8. Fermüller, C., Leitsch, A., Tammet, T., Zamov, N., 1993. Resolution Methods for the Decision Problem. LNAI, Vol. 679. Springer Verlag.
9. Fermüller, C., Leitsch, A., 1998. Decision procedures and model building in equational clause logic. Journal of the IGPL 6 (1), 17-41.
10. Matzinger, R., 1997. Computational representations of Herbrand models using grammars. In: CSL'96, Computer Science Logic.
11. Peltier, N., 1997a. Increasing the capabilities of model building by constraint solving with terms with integer exponents. Journal of Symbolic Computation 24, 59-101.
12. Peltier, N., 1997b. Tree automata and automated model building. Fundamenta Informaticae 30 (1), 59-81.
13. Peltier, N., 1998. A new method for automated finite model building exploiting failures and symmetries. Journal of Logic and Computation 8 (4), 511-543.
14. Peltier, N., 2000. Combining resolution and enumeration for finite model building. In: Baumgartner, P., Zhang, H. (Eds.), FTP'00, Third International Workshop First-Order Theorem Proving, St-Andrews, Scotland, July 2000. Technical Report, Universität Koblenz-Landau, pp. 170-181.
15. Peltier, N., 2001. On the decidability of the PVD class with equality. Logic Journal of the IGPL 9 (4), 601-624.
16. Peterson, G., 1988. Non-obviousness. One more time. Association for Automated Reasoning Newsletter 10, 4-5.
17. Slaney, J., 1992. Finder (finite domain enumerator): notes and guides. Technical Report, Australian National University Automated Reasoning Project, Canberra.
18. Zhang, J., 1993. Search for models of equational theories. In: Proceedings of ICYCS-93, pp. 60-63.
19. Zhang, J., Zhang, H., 1995. SEM: a system for enumerating models. In: Proc. IJCAI-95, Vol. 1. Morgan Kaufmann, Montreal, Canada, pp. 298-303.