First-order logic Davis-Putnam-Logemann-Loveland procedure
暂无分享,去创建一个
[1] Jens Woch,et al. Implementation of a Schema-TAG-Parser , 1999 .
[2] Martin Davis,et al. The Prehistory and Early History of Automated Deduction , 1983 .
[3] Giorgio Galloy,et al. The Satissability Problem for the Schh Oennnkel-bernays Fragment: Partial Instantiation and Hypergraph Algorithms , 1994 .
[4] Peter Baumgartner,et al. Hyper Tableau - The Next Generation , 1998, TABLEAUX.
[5] Peter Baumgartner,et al. Hyper Tableaux The Next Generation , 1997 .
[6] Harrie de Swart,et al. Automated Reasoning with Analytic Tableaux and Related Methods , 2000, Lecture Notes in Computer Science.
[7] Andreas Winter,et al. Querying as an enabling technology in software reengineering , 1999, Proceedings of the Third European Conference on Software Maintenance and Reengineering (Cat. No. PR00090).
[8] Alexander Leitsch. Deciding Clause Classes by Semantic Clash Resolution , 1993, Fundam. Informaticae.
[9] P. V. Oorschot,et al. Efficient Implementation , 2022 .
[10] Christian G. Fermüller,et al. Hyperresolution and Automated Model Building , 1996, J. Log. Comput..
[11] James M. Crawford,et al. Experimental Results on the Crossover Point in Random 3-SAT , 1996, Artif. Intell..
[12] François Bry,et al. A Deduction Method Complete for Refutation and Finite Satisfiability , 1998, JELIA.
[13] Jürgen Ebert,et al. GraX-an interchange format for reengineering tools , 1999, Sixth Working Conference on Reverse Engineering (Cat. No.PR00303).
[14] Ulrich Furbach,et al. Nonmonotonic Reasoning: Towards Efficient Calculi and Implementations , 2001, Handbook of Automated Reasoning.
[15] Katsumi Inoue,et al. Embedding Negation as Failure into a Model Generation Theorem Prover , 1992, CADE.
[16] Ian Horrocks,et al. Optimizing Description Logic Subsumption , 1999, J. Log. Comput..
[17] Richard C. T. Lee,et al. Symbolic logic and mechanical theorem proving , 1973, Computer science classics.
[18] François Bry,et al. SATCHMO: A Theorem Prover Implemented in Prolog , 1988, CADE.
[19] Ullrich Hustadt,et al. On Evaluating Decision Procedures for Modal Logic , 1997, IJCAI.
[20] Peter Baumgartner,et al. Automated Deduction Techniques for the Management of Personalized Documents , 2003, Annals of Mathematics and Artificial Intelligence.
[21] J. A. Robinson,et al. Automatic Deduction with Hyper-Resolution , 1983 .
[22] Wolfgang Bibel,et al. On Matrices with Connections , 1981, JACM.
[23] Manfred Rosendahl,et al. Specification of Symbols and Implementation of Their Constraints in JKogge , 2000 .
[24] Burkhard Freitag,et al. Transformation-Based Bottom-Up Computation of the Well-Founded Model , 1996, NMELP.
[25] David A. Plaisted,et al. Semantically Guided First-Order Theorem Proving using Hyper-Linking , 1994, CADE.
[26] Hans Jürgen Ohlbach,et al. Translation Methods for Non-Classical Logics: An Overview , 1993, Log. J. IGPL.
[27] Stephan Merz,et al. Model Checking , 2000 .
[28] Bernhard Beckert. Depth-first proof search without backtracking for free-variable clausal tableaux , 2003, J. Symb. Comput..
[29] David A. Plaisted,et al. Automated Deduction Techniques for Classification in Description Logic Systems , 1998, Journal of Automated Reasoning.
[30] François Bry,et al. Intensional Updates: Abduction via Deduction , 1990, ICLP.
[31] Peter Baumgartner,et al. Hyper Tableaux , 1996, JELIA.
[32] Jürgen Ebert,et al. A Formalization of SOCCA , 1999 .
[33] W. Bibel,et al. Automated deduction : a basis for applications , 1998 .
[34] David A. Plaisted. The Search Efficiency of Theorem Proving Strategies , 1994, CADE.
[35] Bernhard Beckert,et al. leanTAP: Lean tableau-based deduction , 1995, Journal of Automated Reasoning.
[36] Reinhold Letz,et al. Model Elimination and Connection Tableau Procedures , 2001, Handbook of Automated Reasoning.
[37] M. Fitting. First-order logic and automated theorem proving (2nd ed.) , 1996 .
[38] Jürgen Dix,et al. Super logic programs , 2000, TOCL.
[39] Mark Johnson,et al. Computing with Features as Formulae , 1994, Comput. Linguistics.
[40] David A. Plaisted,et al. Ordered Semantic Hyper-Linking , 1997, Journal of Automated Reasoning.
[41] Maria Davis,et al. Eliminating the irrelevant from mechanical proofs , 1963 .
[42] Reinhold Letz,et al. Automated Theorem Proving Proof and Model Generation with Disconnection Tableaux , 2001, LPAR.
[43] Oliver Obst,et al. Spatial Agents Implemented in a Logical Expressible Language , 1999, RoboCup.
[44] Andy Schürr,et al. GXL: toward a standard exchange format , 2000, Proceedings Seventh Working Conference on Reverse Engineering.
[45] Oliver Obst,et al. Towards a Logical Approach for Soccer Agents Engineering , 2000, RoboCup.
[46] Katsumi Inoue,et al. Bottom-up Abduction by Model Generation , 1993, IJCAI.
[47] Volker Riediger,et al. Folding: an approach to enable program understanding of preprocessed languages , 2001, Proceedings Eighth Working Conference on Reverse Engineering.
[48] Joseph Douglas Horton,et al. Merge Path Improvements for Minimal Model Hyper Tableaux , 1999, TABLEAUX.
[49] Frieder Stolzenburg,et al. Loop-Detection in Hyper-Tableaux by Powerful Model Generation , 1999, J. Univers. Comput. Sci..
[50] Guillermo R. Simari,et al. lntroducing generalized specificity in logic programming , 2000 .
[51] Peter Baumgartner,et al. FDPLL - A First Order Davis-Putnam-Longeman-Loveland Procedure , 2000, CADE.
[52] Robert A. Kowalski,et al. Semantic Trees in Automatic Theorem-Proving , 1983 .
[53] David A. Plaisted,et al. Problem Solving by Searching for Models with a Theorem Prover , 1994, Artif. Intell..
[54] Stephan Philippi,et al. Modelling a concurrent ray-tracing algorithm using object-oriented Petri-Nets , 2001 .
[55] Tanel Tammet. Using Resolution for Deciding Solvable Classes and Building Finite Models , 1991, Baltic Computer Science.
[56] Peter Baumgartner,et al. The Taming of the (X)OR , 2000, Computational Logic.
[57] Raymond Reiter. A theory of diagnosis from first principles , 1986 .
[58] Fausto Giunchiglia,et al. Building Decision Procedures for Modal Logics from Propositional Decision Procedures: The Case Study of Modal K(m) , 2000, Inf. Comput..
[59] Jean-Paul Billon,et al. The Disconnection Method - A Confluent Integration of Unification in the Analytic Framework , 1996, TABLEAUX.
[60] Ullrich Hustadt,et al. MSPASS: Modal Reasoning by Translation and First-Order Resolution , 2000, TABLEAUX.
[61] J. W. Lloyd,et al. Foundations of logic programming; (2nd extended ed.) , 1987 .
[62] John N. Hooker,et al. Partial Instantiation Methods for Inference in First-Order Logic , 2002, Journal of Automated Reasoning.
[63] Bart Selman,et al. Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.
[64] Chandrabose Aravindan,et al. Theorem Proving Techniques for View Deletion in Databases , 2000, J. Symb. Comput..
[65] Jürgen Dix,et al. Relating defeasible and normal logic programming through transformation properties , 2000, Theor. Comput. Sci..
[66] Donald W. Loveland,et al. Mechanical Theorem-Proving by Model Elimination , 1968, JACM.
[67] Raymond Reiter,et al. A Theory of Diagnosis from First Principles , 1986, Artif. Intell..
[68] Elmar Eder. Properties of Substitutions and Unifications , 1983, GWAI.
[69] Lawrence J. Henschen,et al. What Is Automated Theorem Proving? , 1985, J. Autom. Reason..
[70] Alan Bundy,et al. Automated Deduction — CADE-12 , 1994, Lecture Notes in Computer Science.
[71] Nicolas Peltier,et al. Pruning the Search Space and Extracting More Models in Tableaux , 1999, Log. J. IGPL.
[72] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.
[73] Norbert Eisinger,et al. A Confluent Connection Calculus , 2000, Intellectics and Computational Logic.
[74] Ilkka Niemelä,et al. Efficient Implementation of the Well-founded and Stable Model Semantics , 1996, JICSLP.
[75] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.
[76] Michael Kohlhase,et al. Inference and Computational Semantics , 2004, J. Log. Lang. Inf..
[77] Bernhard Nebel,et al. Representation and Reasoning with Attributive Descriptions , 1990, Sorts and Types in Artificial Intelligence.
[78] Vijay Chandru,et al. A Partial Instantiation Based First Order Theorem Prover , 1998 .
[79] Harald Ganzinger,et al. Resolution Theorem Proving , 2001, Handbook of Automated Reasoning.
[80] Martin Giese,et al. Incremental Closure of Free Variable Tableaux , 2001, IJCAR.
[81] Toshiaki Arai,et al. Multiagent systems specification by UML statecharts aiming at intelligent manufacturing , 2002, AAMAS '02.
[82] Peter Baumgartner,et al. Abductive Coreference by Model Construction , 1999 .
[83] Hantao Zhang,et al. SATO: An Efficient Propositional Prover , 1997, CADE.
[84] John McCarthy,et al. Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..
[85] Jan van Eijck. Constrained Hyper Tableaux , 2001, CSL.
[86] Ullrich Hustadt,et al. On Evaluating Decision Procedures for Modal Logics , 1997 .
[87] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.
[88] David W. Reed,et al. SATCHMORE: SATCHMO with RElevancy , 1995, Journal of Automated Reasoning.
[89] William H. Joyner. Resolution Strategies as Decision Procedures , 1976, JACM.
[90] Klaus Schild,et al. A Correspondence Theory for Terminological Logics: Preliminary Report , 1991, IJCAI.