Ordered Semantic Hyper-Linking

The ordered semantic hyper-linking strategy is complete for first-order logic and accepts a user-specified natural semantics that guides the search for a proof. Any semantics in which the meanings of the function and predicate symbols are computable on ground terms may be used. This instance-based strategy is efficient on near-propositional problems, is goal sensitive, and has an extension to equality and term rewriting. However, it sometimes has difficulty generating large terms. We compare this strategy with some others that use semantic information, and present a proof of soundness and completeness. We also give some theoretical results about the search efficiency of the strategy. Some examples illustrate the performance of the strategy.

[1]  David W. Reed,et al.  SATCHMORE: SATCHMO with RElevancy , 1995, Journal of Automated Reasoning.

[2]  David A. Plaisted,et al.  Eliminating duplication with the hyper-linking strategy , 1992, Journal of Automated Reasoning.

[3]  L. Wos,et al.  Paramodulation and Theorem-Proving in First-Order Theories with Equality , 1983 .

[4]  Larry Wos,et al.  Automated Reasoning: Introduction and Applications , 1984 .

[5]  W. W. Bledsoe,et al.  Hierarchical deduction , 1987, Journal of Automated Reasoning.

[6]  Nachum Dershowitz,et al.  Completion Without Failure11This research was supported in part by the National Science Foundation under grants DCR 85–13417 and DCR 85–16243. , 1989 .

[7]  Katsumi Inoue,et al.  Non-Horn Magic Sets to Incorporate Top-down Inference into Bottom-up Theorem Proving , 1997, CADE.

[8]  Paul C. Gilmore,et al.  A Proof Method for Quantification Theory: Its Justification and Realization , 1960, IBM J. Res. Dev..

[9]  Nicolas Peltier.  Increasing Model Building Capabilities by Constraint Solving on Terms with Integer Exponents , 1997, J. Symb. Comput..

[10]  Graem A. Ringwood,et al.  Automated theorem proving (second revised edition) by Wolfgang Bibel, Vieweg 1987 , 1988, The Knowledge Engineering Review.

[11]  David A. Plaisted,et al.  Semantically Guided First-Order Theorem Proving using Hyper-Linking , 1994, CADE.

[12]  Michaël Rusinowitch,et al.  Proving refutational completeness of theorem-proving strategies: the transfinite semantic tree method , 1991, JACM.

[13]  Geoff Sutcliffe,et al.  The TPTP Problem Library , 1994, Journal of Automated Reasoning.

[14]  W. W. Bledsoe,et al.  Using Examples to Generate Instantiations of Set Variables , 1983, IJCAI.

[15]  Alexander Leitsch,et al.  The Resolution Calculus , 1997, Texts in Theoretical Computer Science An EATCS Series.

[16]  David A. Plaisted,et al.  A Complete Semantic Back Chaining Proof System , 1990, CADE.

[17]  Ewing L. Lusk,et al.  Non-horn problems , 2004, Journal of Automated Reasoning.

[18]  Ricardo Caferra,et al.  Extending Semantic Resolution via Automated Model Building: Applications , 1995, IJCAI.

[19]  Ricardo Caferra,et al.  Building Models by Using Tableaux Extended by Equational Problems , 1993 .

[20]  William McCune,et al.  Solution of the Robbins Problem , 1997, Journal of Automated Reasoning.

[21]  David A. Plaisted,et al.  Use of replace rules in theorem proving , 1994, Methods Log. Comput. Sci..

[22]  François Bry,et al.  SATCHMO: A Theorem Prover Implemented in Prolog , 1988, CADE.

[23]  Donald W. Loveland,et al.  A Simplified Format for the Model Elimination Theorem-Proving Procedure , 1969, J. ACM.

[24]  David A. Plaisted,et al.  Non-Horn clause logic programming without contrapositives , 1988, Journal of Automated Reasoning.

[25]  Wayne Snyder,et al.  Basic Paramodulation , 1995, Inf. Comput..

[26]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[27]  Ricardo Caferra,et al.  A Method for Building Models Automatically. Experiments with an Extension of OTTER , 1994, CADE.

[28]  David A. Plaisted.  The Search Efficiency of Theorem Proving Strategies , 1994, CADE.

[29]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[30]  Donald W. Loveland,et al.  Automated theorem proving: a logical basis , 1978, Fundamental studies in computer science.

[31]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[32]  W. Reif,et al.  Theorem Proving in Large Theories , 1998 .

[33]  David A. Plaisted,et al.  RRTP - A Replacement Rule Theorem Prover , 2004, Journal of Automated Reasoning.

[34]  Harald Ganzinger,et al.  Ordered Chaining for Total Orderings , 1994, CADE.

[35]  David A. Plaisted.  The search efficiency of theorem proving strategies: an analytical comparison , 1994 .

[36]  David A. Plaisted,et al.  A Simplified Problem Reduction Format , 1982, Artif. Intell..

[37]  David A. Plaisted,et al.  Equational Reasoning using AC Constraints , 1997, IJCAI.

[38]  Kim Marriott,et al.  Explicit representation of terms defined by counter examples , 1986, Journal of Automated Reasoning.

[39]  Harald Ganzinger,et al.  Elimination of Equality via Transformation with Ordering Constraints , 1998, CADE.

[40]  Daniel Brand,et al.  Proving Theorems with the Modification Method , 1975, SIAM J. Comput..

[41]  Hansong Zhang,et al.  Implementing the Davis-Putnam Algorithm by Tries , 1994 .

[42]  James R. Slagle,et al.  Automatic Theorem Proving With Renamable and Semantic Resolution , 1967, JACM.

[43]  Walter F. Stenning,et al.  AN EMPIRICAL STUDY , 2003 .

[44]  Ricardo Caferra,et al.  A Method for Simultanous Search for Refutations and Models by Equational Constraint Solving , 1992, J. Symb. Comput..

[45]  Jean H. Gallier,et al.  Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..

[46]  Christoph Weidenbach,et al.  Soft Typing for Ordered Resolution , 1997, CADE.

[47]  H. Ganzinger,et al.  Equational Reasoning in Saturation-Based Theorem Proving , 1998 .

[48]  Larry Wos,et al.  Efficiency and Completeness of the Set of Support Strategy in Theorem Proving , 1965, JACM.

[49]  Lawrence J. Henschen,et al.  What Is Automated Theorem Proving? , 1985, J. Autom. Reason..

[50]  Bart Selman,et al.  Encoding Plans in Propositional Logic , 1996, KR.

[51]  David A. Plaisted,et al.  The efficiency of theorem proving strategies - a comparative and asymptotic analysis , 1999, Computational intelligence.

[52]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[53]  Peter Baumgartner,et al.  Semantically Guided Theorem Proving for Diagnosis Applications , 1997, IJCAI.

[54]  Bart Selman,et al.  An Empirical Study of Greedy Local Search for Satisfiability Testing , 1993, AAAI.

[55]  J. W. Lloyd,et al.  Foundations of logic programming; (2nd extended ed.) , 1987 .

[56]  D. Loveland,et al.  Empirical explorations of the geometry-theorem proving machine , 1995 .

[57]  John K. Slaney.  SCOTT: A Model-Guided Theorem Prover , 1993, IJCAI.

[58]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[59]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[60]  Christian G. Fermüller,et al.  Hyperresolution and Automated Model Building , 1996, J. Log. Comput..