Linear and unit-resulting refutations for horn theories

Journal of Automated Reasoning

Volumn 16, Issue 3, 1996, Pages 241-319

  Baumgartner, Peter ^a  

^a University of Koblenz   (Germany)

Author keywords

Completion; Linear resolution; Unit resulting resolution

Indexed keywords

DIFFERENTIATION (CALCULUS); MATHEMATICAL MODELS; PROLOG (PROGRAMMING LANGUAGE); REDUNDANCY; SYSTEM THEORY; THEOREM PROVING;

COMPLETION; HORN THEORY; LINEAR RESOLUTION; UNIT RESULTING RESOLUTION;

LEARNING SYSTEMS;

EID: 0030170074     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF00252179     Document Type: Article

References (75)

1. Astrachan, Owen L. and Stickel, Mark E.: Caching and lemmaizing in model elimination theorem provers, in D. Kapur (ed.), Proc. 11th Int. Conf. on Automated Deduction (CADE-11), LNAI 607, Springer-Verlag, 1992, pp. 224-238.
2. Bachmair, L. and Ganzinger, H.: On restrictions of ordered paramodulation with simplification, in M. E. Stickel (ed.), Proc. CADE-10, LNCS 449, Springer, 1990, pp. 427-441.
3. Bachmair, L. and Ganzinger, H.: Rewrite Techniques for Transitive Relations, Research Report MPI-I-93-249, Max-Planck-Institut für Informatik, 1993.
4. Bachmair, Leo, Dershowitz, Nachum, and Hsiang, Jieh.: Orderings for equational proofs, IEEE (1986), 346-357.
5. Bachmair, L., Dershowitz, N., and Plaisted, D.: Completion without failure, in H. Ait-Kaci and M. Nivat (eds), Resolution of Equations in Algebraic Structures 2: Rewrite Techniques, Academic Press, 1989, pp. 1-30.
6. Bachmair, L., Ganzinger, H., Lynch, C., and Snyder, W.: Basic paramodulation and superposition, in D. Kapur (ed.), Proc. 11th CADE, Springer, 1992, pp. 462-476.
7. Bachmair, L.: Proof Methods for Equational Theories, PhD Thesis, University of Illinois at Urbana, U.S.A., 1987.
8. Bachmair, L.: Canonical Equational Proofs, Progress in Theoretical Computer Science, Birkhäuser, 1991.
9. Baumgartner, P. and Furbach, U.: Consolution as a Framework for Comparing Calculi, J. Symbolic Computation 16(5) (1993).
10. Baumgartner, P. and Furbach, U.: Model elimination without contrapositives, in A. Bundy (ed.), Automated Deduction - CADE-12, LNAI 814, Springer, 1994, pp. 87-101.
11. Baumgartner, P. and Furbach, U.: PROTEIN: A PROver with a Theory Extension Interface, in A. Bundy (ed.), Automated Deduction - CADE-12, LNAI 814, Springer, 1994, pp. 769-773.
12. Baumgartner, P., Furbach, U., and Petermann, U.: A Unified Approach to Theory Reasoning, Research Report 15/92, University of Koblenz, 1992.
13. Baumgartner, P.: A model elimination calculus with built-in theories, in H.-J. Ohlbach (ed.), Proc. 16-th German AI-Conference (GWAI-92), LNAI 671, Springer, 1992, pp. 30-42.
14. Baumgartner, P.: An ordered theory resolution calculus, in A. Voronkov (ed.), Logic Programming and Automated Reasoning (Proceedings), St. Petersburg, Russia, July 1992, LNAI 624, Springer, pp. 119-130.
15. Baumgartner, P.: Refinements of theory model elimination and a variant without contrapositives, in A. G. Cohn (ed.), 11th European Conf. Artificial Intelligence, ECAI-94, Wiley, 1994. (Long version in: Research Report 8/93, University of Koblenz, Institute for Computer Science, Koblenz, Germany).
16. Bertling, H.: Knuth-Bendix completion of Horn clause programs for restricted linear resolution and paramodulation, in S. Kaplan and M. Okada (eds), Proc. 2nd Int. Workshop on Conditional and Typed Rewriting Systems, LNCS 516, Springer-Verlag, June 1990, pp. 181-193,
17. Bledsoe, W. W.: Challenge problems in elementary calculus, J. Automated Reasoning 6 (1990), 341-359.
18. Bollinger, T.: A model elimination calculus for generalized clauses, in IJCAI, 1991.
19. Bronsard, Francois and Reddy, Uday S.: Reduction techniques for first-order reasoning, in M. Rusinowitch and J. L. Rémy (eds), Proc. 3rd Int. Workshop on Conditional Term Rewriting Systems, LNCS 656, Springer-Verlag, 1992, pp. 242-256.
20. Bürckert, H.-J.: A Resolution Principle for Clauses with Restricted Quantifiers, LNAI 568, Springer, 1991.
21. Büttner, W.: Unification in the datastructure multisets, J. Automated Reasoning 2 (1986), 75-88.
22. Chang, C. and Lee, R.: Symbolic Logic and Mechanical Theorem Proving, Academic Press, 1973.
23. Dershowitz, N. and Manna, Z.: Proving termination with multiset orderings, Comm. ACM 22 (1979), 465-476.
24. Dershowitz, N.: Orderings for term-rewriting systems, Theoretical Computer Science 17 (1982) 279-301.
25. Dershowitz, N.: Computing with rewrite systems, Information and Control 65 (1985), 122-157.
26. Dershowitz, N.: Termination of rewriting, J. Symbolic Computation 3(1-2) (1987), 69-116.
27. Dershowitz, N.: A maximal-literal unit strategy for Horn clauses, in S. Kaplan and M. Okada (eds), Proc. 2nd Int. Workshop on Conditional and Typed Rewriting Systems, LNCS 516, Springer-Verlag, June 1990, pp. 14-25.
28. Dershowitz, N.: Ordering-based strategies for Horn clauses, in Proc. IJCAI, 1991.
29. Dershowitz, N.: Canonical sets of Horn clauses, in J. Leach Albert, B. Monien, and M. Rodríguez Artalejo (eds), Proc. 18th Int. Colloquium on Automata, Languages and Programming, LNCS 510, 1991, pp. 267-278.
30. Digricoli, Vincent J. and Harrison, Malcolm C.: Equality-based binary resolution, J. Association for Computing Machinery, 1986.
31. Dixon, J.: Z-Resolution: Theorem-proving with compiled axioms, J. ACM 20(1) (1973), 127-147.
32. Furbach, Ulrich, Hölldobler, Steffen, and Schreiber, Joachim: Horn equational theories and paramodulation. J. Automated Reasoning 3 (1989), 309-337.
33. Gallier, J. H., Raatz, S., and Snyder, W.: Theorem proving using rigid e-unification: Equational matings, in Logics in Computer Science '87, Ithaca, New York, 1987.
34. Gallier, J., Narendran, P., Plaisted, D., and Snyder, W.: Rigid E-unification: NP-completeness and applications to equational matings, Information and Computation, 1990, pp. 129-195.
35. Ganzinger, Harald: A completion procedure for conditional equations, J. Symbolic Computation 11 (1991), 51-81.
36. Hines, L.: Str+ve⊆: The Str+ve-based subset prover, in M. Stickel (ed.), Proc. 10th Int. Conf. on Automated Deduction (CADE-10), LNAI 449, Springer-Verlag, 1990, pp. 193-206.
37. Hines, L.: The central variable strategy of Str+ve, in D. Kapur (ed.), Proc. 11th Int. Conf. on Automated Deduction (CADE-11), LNAI 607, Springer-Verlag, June 1992, pp. 35-49.
38. Hölldobler, S.: Foundations of Equational Logic Programming, Lecture Notes in Artificial Intelligence, 353, Subseries of Lecture Notes in Computer Science, Springer, 1989.
39. Hsiang, J. and Dershowitz, N.: Rewrite methods for clausal and non-clausal theorem proving, in Proc. ICALP'83, 1983.
40. Hsiang, J. and Rusinowitch, M.: On word problems in equational theories, in Proc. ICALP'87, LNCS 267, Springer, 1987, pp. 54-71.
41. Huet, Gérard and Oppen, Derek C.: Equations and rewrite rules. A survey, in R. Book (ed.), Formal Languages: Perspectives and Open Problems, Academic Press, 1980, pp. 349-405.
42. Hullot, J. M.: Canonical forms and unification, in Proc. Conf. Automated Deduction, 1980, pp. 318-334.
43. Kaplan, Stéphane: Simplifying conditional term rewriting systems: Unification, termination and confluence, J. Symbolic Computation 4(3) (1987), 295-334.
44. Knuth, Donald E. and Bendix, Peter, B.: Simple world problems in universal algebras, 1970.
45. Letz, R., Schumann, J., Bayerl, S., and Bibel, W.: SETHEO: A high-performance theorem prover, J. Automated Reasoning 8(2) (1992).
46. Letz, R., Mayr, K., and Goller, C.: Controlled integrations of the cut rule into connection tableau calculi, J. Automated Reasoning 1993, (to appear 1994).
47. Lloyd, J.: Foundations of Logic Programming, Springer, 1984.
48. Loveland, D.: Mechanical theorem proving by model elimination, JACM 15(2) (1968).
49. Loveland, D.: A linear format for resolution, in Symposium on Automatic Demonstration, Lecture Notes in Math. 125, 1970, pp. 147-162.
50. Loveland, D.: Automated Theorem Proving - A Logical Basis, North-Holland, 1978.
51. Manna, Z. and Waldinger, R.: Special relations in automated deduction, J. ACM 33(1) (1986), 1-59.
52. Manna, Z., Stickel, M., and Stickel, R.: Monotonicity properties in automated deduction, in V. Lifschitz (ed.), Artificial Intelligence and Mathematical Theory of Computation: Essays in Honor of John McCarthy, Academic Press, 1991, pp. 261-280.
53. McCharen, J., Overbeek, R., and Wos, L.: Complexity and related enhancements for automated theorem-proving programs, Computers and Mathematics with Applications 2 (1976), 1-16.
54. Morris, J. B.: E-Resolution: An extension of resolution to include the equality relation, in Proc. IJCAI, 1969, pp. 287-294.
55. Murray, N. and Rosenthal, E.: Theory links: Applications to automated theorem proving, J. Symbolic Computation 4 (1987), 173-190.
56. Nieuwenhuis, R. and Orejas, F.: Clausal rewriting, in S. Kaplan and M. Okada (eds), Proc. 2nd Int. Workshop on Conditional and Typed Rewriting Systems, LNCS 516, Springer-Verlag, 1990, pp. 246-258.
57. Nieuwenhuis, R. and Rubio, A.: Theorem proving with ordering constrained clauses, in D. Kapur (ed.), Proc. 11th Int. Conf. on Automated Deduction (CADE-11), LNAI 607, Springer-Verlag, 1992, pp. 477-491.
58. Ohlbach, H.-J.: Compilation of recursive two-literal clauses into unification algorithms, in V. Sgurev Ph. Jorrand (ed.), Artificial Intelligence IV - Methodology, Systems, Applications, North-Holland, 1990.
59. Paul, E.: Equational methods in first order predicate calculus, J. Symbolic Computation 1(1) (1985).
60. Paul, E.: On solving the equality problem in theories defined by horn clauses, Theoretical Computer Science 44 (1986), 127-153.
61. Petermann, U.: How to build in an open theory into connection calculi, J. Computers and Artificial Intelligence, 1991 (submitted).
62. Plaisted, D., Geoff Alexander, Heng Chu, and Shie-Jue Lee: Conditional Term Rewriting and First-Order Theorem Proving, 1993.
63. Plaisted, D.: A sequent-style model elimination strategy and a positive refinement, J. Automated Reasoning 4(6) (1990), 389-402.
64. Robinson, G. A. and Wos, L.: Paramodulation and theorem proving in first order theories with equality, in Meltzer and Mitchie (eds), Machine Intelligence 4, Edinburg University Press, 1969.
65. Siekmann, J. H.: Unification theory, J. Symbolic Computation 7(1) (1989), 207-274.
66. Steinbach, J.: Improving associative path orderings, in M. E. Stickel (ed.), Proc. CADE '10, LNCS 449, Springer, 1990, pp. 411-425.
67. Stickel, M. E.: Automated deduction by theory resolution, J. Automated Reasoning 1 (1985), 333-355.
68. Stickel, M.: An introduction to automated deduction, in Bibel, Biermann, Delgrande, Huet, Jorrand, Shapiro, Mylopoulos, and Stickel (eds), Fundamentals of Artificial Intelligence, Springer, 1986, pp. 75-132.
69. Stickel, M. L.: A Prolog Technology Theorem Prover: A New Exposition and Implementation in Prolog, Technical Note 464, SRI International, 1989.
70. Stickel, M.: A prolog technology theorem prover, in M. E. Stickel (ed.), Proc. CADE '10, LNCS 449, Springer, 1990, pp. 673-675.
71. Stickel, M.: Upside-Down Meta-Interpretation of the Model Elimination Theorem-Proving Procedure for Deduction and Abduction, 1991.
72. Stolzenburg, F. and Baumgartner, P.: Constraint Model Elimination and a PTTP-Implementation. Research Report 10/94, University of Koblenz, 1994.
73. Sutcliffe, G., Suttner, C., and Yemenis, T.: The TPTP problem library, in Proc. CADE-12, Springer, 1994.
74. Veroff, R. and Wos, L.: The linked inference principle, I: The formal treatment, J. Automated Reasoning 8(2) (1992).
75. Zhang, H. and Kapur, D.: First-order theorem proving using conditional rewrite rules, in R. Overbeek E. Lusk (ed.), Proc. 9th CADE, LNCS 310, Springer, 1988, pp. 1-20.