Hyperresolution and automated model building

Journal of Logic and Computation

Volumn 6, Issue 2, 1996, Pages 173-203

  Fermüller, Christian ^a   Leitsch, Alexander ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Decision procedures; Model building; Resolution

Indexed keywords

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

References (23)

1. R. Caferra and N. Zabel. Extending resolution for model construction. In Logics in AI (JELIA '90), pp. 153-169. Springer Verlag, 1991. LNCS 478.
2. R. Caferra and N. Zabel. A method for simultaneous search for refutations and models by equational constraint solving. J. Symbolic Computation, 13, 613-641, 1992.
3. C.-L. Chang and R. C.-T. Lee. Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York and London, 1973.
4. B. Dreben and W. D. Goldfarb. The Decision Problem. Addison-Wesley, 1979.
5. C. Fermüller. Deciding some Horn clause sets by resolution. In Yearbook of the Kurt-Godel-Society 1989, pp. 60-73, Vienna, 1990.
6. C. Fermüller and A. Leitsch. Model building by resolution. In Computer Science Logic (CSL'92), pp. 134-148. San Miniato, Italy, 1993. Springer Verlag. LNCS 702.
7. C. Fermüller, A. Leitsch, T. Tammet, and N. Zamov. Resolution Methods for the Decision Problem. Springer Verlag, 1993. LNAI 679.
8. G. Gottlob. Complexity results on nonground Herbrand interpretations. In preparation, 1994.
9. J.-M. Hullot. Canonical forms and unification. In 5th Conference an Automated Deduction, pp. 318-334. Springer Verlag, 1980. LNCS 87.
10. W. H. Joyner. Resolution strategies as decision procedures. J. Association of Computing Machinery, 23, 398-417, 1976.
11. A. Leitsch. Deciding Horn classes by hyperresolution. In Computer Science Logic (CSL'89), pp. 225-241, Kaiserslautern, 1990. Springer Verlag. LNCS 440.
12. A. Leitsch. Deciding clause classes by semantic clash resolution. Fundamenta Informaticae, 18, 163-182, 1993.
13. D. Loveland. Automated Theorem Proving - A Logical Basis. North Holland, 1978.
14. R. Manthey and F. Bry. Satchmo: A theorem prover implemented in Prolog. In 9th Conference on Automated Deduction, pp. 415-434. Springer Verlag, 1988. LNCS 310.
15. A. Martelli and U. Montenari. An efficient unification algorithm. ACM Transactions on Programming Languages and Systems, 4, 258-282, 1982.
16. W. McCune. Otter 2.0 Users Guide. Argonne National Laboratory, Argonne, 1990.
17. H. Noll. A note on resolution: How to get rid of factoring without losing completeness. In 5th Conference on Automated Deduction, pp. 250-263. Springer Verlag, 1980. LNCS 87.
18. J. R. Slagle. Automatic theorem proving with renamable and semantic resolution. J. Association of Computing Machinery, 19, 496-516, 1972.
19. J. Slaney. Finder (finite domain enumerator): Notes and guide. Technical report TR-ARP-1/92, Australian National University Automated Reasoning Project, Canberra, 1992.
20. J. Slaney. Scott: A model-guided theorem prover. In Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI '93), vol. 1, pp. 109-114. Morgan Kaufmann, 1993.
21. T. Tammet. Using resolution for deciding solvable classes and building finite models. In Baltic Computer Science, pp. 33-64. Springer Verlag, 1991. LNCS 502.
22. T. Tammet. Resolution Method for Decision Problems and Finite Model Building. PhD thesis, Department of Computer Science, Chalmers University of Technology, Chalmers/Göteborg, 1992.
23. S. Winker. Generation and verification of finite models and counterexamples using an automated theorem prover answering two open questions. J. Association of Computing Machinery, 29, 273-284, 1982.