Persistent and Quasi-Persistent Lemmas in Propositional Model Elimination

Model elimination is a back-chaining strategy to search for and construct resolution refutations. Recent extensions to model elimination, implemented in Modoc, have made it a practical tool for satisfiability checking, particularly for problems with known goals. Many formulas can be refuted more succinctly by recording certain derived clauses, called lemmas. Lemmas can be used where a clause of the original formula would normally be required. However, recording too many lemmas overwhelms the proof search. Lemma management has a significant effect on the performance of Modoc. Earlier research studied pure persistent (global) strategies, and pure unit-lemma (local) strategies. This paper describes and evaluates a hybrid strategy to control the lifetime of lemmas, as well as a new technique for deriving certain lemmas efficiently, using a lazy strategy. Unit lemmas are recorded locally as in previous practice, but certain lemmas that are considered valuable are asserted globally. A range of functions for estimating value is studied experimentally. Criteria are reported that appear to be suitable for a wide range of application-derived formulas.

[1]  Shirley Dex,et al.  JR 旅客販売総合システム（マルス）における運用及び管理について , 1991 .

[2]  Allen Van Gelder.  Autarky Pruning in Propositional Model Elimination Reduces Failure Redundancy , 2004, Journal of Automated Reasoning.

[3]  Donald W. Loveland,et al.  An Implementation of the Model Elimination Proof Procedure , 1974, JACM.

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

[5]  Robert E. Shostak.  Refutation Graphs , 1976, Artif. Intell..

[6]  Roberto J. Bayardo,et al.  Using CSP Look-Back Techniques to Solve Real-World SAT Instances , 1997, AAAI/IAAI.

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

[8]  Yumi K. Tsuji,et al.  EVIDENCE FOR A SATISFIABILITY THRESHOLD FOR RANDOM 3CNF FORMULAS , 1992 .

[9]  Bart Selman,et al.  Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.

[10]  Allen Van Gelder,et al.  Propositional theorem proving: advanced lemma strategies and multi-agent search , 1998 .

[11]  Chu Min Li,et al.  Heuristics Based on Unit Propagation for Satisfiability Problems , 1997, IJCAI.

[12]  Tracy Larrabee,et al.  Test pattern generation using Boolean satisfiability , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  Henry Kautz,et al.  Pushing the envelope: planning , 1996 .

[14]  Joao Marques-Silva,et al.  GRASP-A new search algorithm for satisfiability , 1996, Proceedings of International Conference on Computer Aided Design.

[15]  Allen Van Gelder,et al.  A propositional theorem prover to solve planning and other problems , 2004, Annals of Mathematics and Artificial Intelligence.

[16]  W LovelandDonald.  Mechanical Theorem-Proving by Model Elimination , 1968 .

[17]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[18]  Ewald Speckenmeyer,et al.  Solving satisfiability in less than 2n steps , 1985, Discret. Appl. Math..

[19]  Jack Minker,et al.  An Extension to Linear Resolution with Selection Function , 1982, Inf. Process. Lett..

[20]  Allen Van Gelder.  Complexity Analysis of Propositional Resolution with Autarky Pruning , 1999, Discret. Appl. Math..

[21]  Hantao Zhang,et al.  SATO: An Efficient Propositional Prover , 1997, CADE.

[22]  Christoph Goller,et al.  Controlled integration of the cut rule into connection tableau calculi , 2004, Journal of Automated Reasoning.

[23]  Allen Van Gelder,et al.  Lemma and cut strategies for propositional model elimination , 2004, Annals of Mathematics and Artificial Intelligence.

[24]  Jan Friso Groote,et al.  The Propositional Formula Checker HeerHugo , 2000, Journal of Automated Reasoning.

[25]  Hector J. Levesque,et al.  Hard and Easy Distributions of SAT Problems , 1992, AAAI.

[26]  Masahiro Fujita,et al.  Symbolic model checking using SAT procedures instead of BDDs , 1999, DAC '99.

[27]  Michael D. Ernst,et al.  Automatic SAT-Compilation of Planning Problems , 1997, IJCAI.

[28]  Owen L. Astrachan,et al.  The Use of Lemmas in the Model Elimination Procedure , 2004, Journal of Automated Reasoning.

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

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

[31]  Fumiaki Okushi.  Parallel cooperative propositional theorem proving , 2004, Annals of Mathematics and Artificial Intelligence.

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

[33]  Donald W. Loveland,et al.  Mechanical Theorem-Proving by Model Elimination , 1968, JACM.