A propositional theorem prover to solve planning and other problems
暂无分享,去创建一个
[1] Nils J. Nilsson,et al. Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[2] Hantao Zhang,et al. SATO: An Efficient Propositional Prover , 1997, CADE.
[3] Donald W. Loveland,et al. An Implementation of the Model Elimination Proof Procedure , 1974, JACM.
[4] Fumiaki Okushi. Parallel cooperative propositional theorem proving , 2004, Annals of Mathematics and Artificial Intelligence.
[5] Mark E. Stickel,et al. Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction , 1994, Journal of Automated Reasoning.
[6] Hansong Zhang,et al. Implementing the Davis-Putnam Algorithm by Tries , 1994 .
[7] W. W. Bledsoe,et al. Review of "Problem-Solving Methods in Artificial Intelligence by Nils J. Nilsson", McGraw-Hill Pub. , 1971, SGAR.
[8] Toby Walsh,et al. Towards an Understanding of Hill-Climbing Procedures for SAT , 1993, AAAI.
[9] Donald W. Loveland,et al. A Simplified Format for the Model Elimination Theorem-Proving Procedure , 1969, J. ACM.
[10] Allen Van Gelder,et al. Satisfiability testing with more reasoning and less guessing , 1995, Cliques, Coloring, and Satisfiability.
[11] Robert E. Shostak. Refutation Graphs , 1976, Artif. Intell..
[12] David A. Plaisted. The Search Efficiency of Theorem Proving Strategies , 1994, CADE.
[13] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.
[14] Robert A. Kowalski,et al. Logic for problem solving , 1982, The computer science library : Artificial intelligence series.
[15] Fausto Giunchiglia,et al. Building Decision Procedures for Modal Logics from Propositional Decision Procedures: The Case Study of Modal K(m) , 2000, Inf. Comput..
[16] David A. Plaisted,et al. Eliminating duplication with the hyper-linking strategy , 1992, Journal of Automated Reasoning.
[17] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.
[18] Allen Van Gelder. Autarky Pruning in Propositional Model Elimination Reduces Failure Redundancy , 1999 .
[19] Bart Selman,et al. Local search strategies for satisfiability testing , 1993, Cliques, Coloring, and Satisfiability.
[20] Richard Fikes,et al. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.
[21] Donald W. Loveland,et al. A Unifying View of Some Linear Herbrand Procedures , 1972, J. ACM.
[22] Tracy Larrabee,et al. Test pattern generation using Boolean satisfiability , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[23] Robert A. Kowalski,et al. The Semantics of Predicate Logic as a Programming Language , 1976, JACM.
[24] Michael D. Ernst,et al. Automatic SAT-Compilation of Planning Problems , 1997, IJCAI.
[25] Owen L. Astrachan,et al. The Use of Lemmas in the Model Elimination Procedure , 2004, Journal of Automated Reasoning.
[26] Allen Van Gelder,et al. Incomplete Thoughts about Incomplete Satissability Procedures Extended Abstract , 1993 .
[27] Joao Marques-Silva,et al. GRASP-A new search algorithm for satisfiability , 1996, Proceedings of International Conference on Computer Aided Design.
[28] W. W. Bledsoe,et al. A Linear Format for Resolution With Merging and a New Technique for Establishing Completeness , 1970, JACM.
[29] Jack Minker,et al. An Extension to Linear Resolution with Selection Function , 1982, Inf. Process. Lett..
[30] Allen Van Gelder. Complexity Analysis of Propositional Resolution with Autarky Pruning , 1999, Discret. Appl. Math..
[31] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.
[32] Christoph Goller,et al. Controlled integration of the cut rule into connection tableau calculi , 2004, Journal of Automated Reasoning.
[33] Allen Van Gelder,et al. Lemma and cut strategies for propositional model elimination , 2004, Annals of Mathematics and Artificial Intelligence.
[34] Allen VanGelder. SIMULTANEOUS CONSTRUCTION OF REFUTATIONS AND MODELS FOR PROPOSITIONAL FORMULAS , 1995 .
[35] R. Kowalski,et al. Linear Resolution with Selection Function , 1971 .
[36] Ewald Speckenmeyer,et al. Solving satisfiability in less than 2n steps , 1985, Discret. Appl. Math..
[37] Mukesh Dalal,et al. A Hierarchy of Tractable Satisfiability Problems , 1992, Inf. Process. Lett..
[38] Bart Selman,et al. Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.