Positive Unit Hyperresolution Tableaux and Their Application to Minimal Model Generation
暂无分享,去创建一个
[1] Hiroshi Fujita,et al. A Model Generation Theorem Prover in KL1 Using a Ramified -Stack Algorithm , 1991, International Conference on Logic Programming.
[2] Jaakko Hintikka. Model minimization —An alternative to circumscription , 2004, Journal of Automated Reasoning.
[3] Danny De Schreye,et al. On the Duality of Abduction and Model Generation in a Framework for Model Generation with Equality , 1994, Theor. Comput. Sci..
[4] Dietmar Seipel,et al. DisLog - A System for Reasoning in Disjunctive Deductive Databases , 1994 .
[5] Randy Goebel,et al. Theorist: A Logical Reasoning System for Defaults and Diagnosis , 1987 .
[6] Raymond Reiter,et al. A Theory of Diagnosis from First Principles , 1986, Artif. Intell..
[7] Nicolas Peltier,et al. Simplifying and Generalizing Formulae in Tableaux. Pruning the Search Space and Building Models , 1997, TABLEAUX.
[8] K. M. Hörnig. Generating small Models of First Order Axioms , 1981, GWAI.
[9] Sunna Torge. Überprüfung der Erfüllbarkeit im Endlichen: ein Verfahren und seine Anwendung , 1998 .
[10] Paul W. Purdom,et al. Solving Satisfiability with Less Searching , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[11] Chandrabose Aravindan,et al. A Rational and Efficient Algorithm for View Deletion in Databases , 1997, ILPS.
[12] François Bry,et al. Checking Consistency of Database Constraints: a Logical Basis , 1986, VLDB.
[13] V. Wiktor Marek,et al. Nonmonotonic Logic , 1993, Artificial Intelligence.
[14] Christoph Goller,et al. Controlled integration of the cut rule into connection tableau calculi , 2004, Journal of Automated Reasoning.
[15] Ricardo Caferra,et al. Building Models by Using Tableaux Extended by Equational Problems , 1993 .
[16] Katsumi Inoue,et al. Embedding Negation as Failure into a Model Generation Theorem Prover , 1992, CADE.
[17] David W. Reed,et al. SATCHMORE: SATCHMO with RElevancy , 1995, Journal of Automated Reasoning.
[18] David Scott Warren,et al. Computation of Stable Models and Its Integration with Logical Query Processing , 1996, IEEE Trans. Knowl. Data Eng..
[19] Owen L. Astrachan. METEOR: Exploring model elimination theorem proving , 2004, Journal of Automated Reasoning.
[20] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.
[21] J. A. Robinson,et al. Automatic Deduction with Hyper-Resolution , 1983 .
[22] Adnan H. Yahya. Generalized Query Answering in Disjunctive Deductive Databases: Procedural and Non-Monotonic Aspects , 1997, LPNMR.
[23] Jack Minker,et al. Bottom-Up Evaluation of Hierarchical Disjunctive Deductive Databases , 1991, ICLP.
[24] Christian G. Fermüller,et al. Hyperresolution and Automated Model Building , 1996, J. Log. Comput..
[25] François Bry,et al. A Hyperresolution-Based Proof Procedure and its Implementation in Prolog , 1987, GWAI.
[26] Peter Baumgartner,et al. Tableaux for Diagnosis Applications , 1997, TABLEAUX.
[27] François Bry,et al. Minimal Model Generation with Positive Unit Hyper-Resolution Tableaux , 1996, TABLEAUX.
[28] Ilkka Niemelä,et al. A Tableau Calculus for Minimal Model Reasoning , 1996, TABLEAUX.
[29] Marianne Winslett,et al. Reasoning about Action Using a Possible Models Approach , 1988, AAAI.
[30] Tim Geisler,et al. Efficient Model Generation through Compilation , 1996, CADE.
[31] John Wylie Lloyd,et al. Foundations of Logic Programming , 1987, Symbolic Computation.
[32] François Bry,et al. SATCHMO: A Theorem Prover Implemented in Prolog , 1988, CADE.
[33] Peter Baumgartner,et al. Hyper Tableaux , 1996, JELIA.
[34] Slim Abdennadher,et al. Model Generation with Existentially Quantified Variables and Constraints , 1997, ALP/HOA.
[35] Jack Minker,et al. Ordered model trees: A normal form for disjunctive deductive databases , 2004, Journal of Automated Reasoning.
[36] Jean-Paul Delahaye. Formal methods in artificial intelligence , 1987 .
[37] Miyuki Koshimura,et al. MGTP: A Model Generation Theorem Prover - Its Advanced Features and Applications , 1997, TABLEAUX.
[38] Alexander Leitsch,et al. The Resolution Calculus , 1997, Texts in Theoretical Computer Science An EATCS Series.
[39] Ilkka Niemelä. Implementing Circumscription Using a Tableau Method , 1996, ECAI.
[40] Hantao Zhang,et al. SEM: a System for Enumerating Models , 1995, IJCAI.
[41] Adnan H. Yahya. Model Generation in Disjunctive Normal Databases , 1996 .
[42] François Bry,et al. Proving Finite Satisfiability of Deductive Databases , 1987, CSL.
[43] Adnan H. Yahya. A Goal-Driven Approach to Efficient Query Processing in Disjunctive Databases , 1996 .
[44] Ronald Fagin,et al. On the semantics of updates in databases , 1983, PODS.
[45] David Poole,et al. Explanation and prediction: an architecture for default and abductive reasoning , 1989, Comput. Intell..
[46] François Bry,et al. A Deduction Method Complete for Refutation and Finite Satisfiability , 1998, JELIA.
[47] N. Eisinger,et al. Sic: an Interactive Tool for the Design of Integrity Constraints (system Description) Sic: an Interactive Tool for the Design of Integrity Constraints (system Description) , 1997 .
[48] P G rdenfors,et al. Knowledge in flux: modeling the dynamics of epistemic states , 1988 .
[49] Danny De Schreye,et al. A framework for indeterministic model generation with equality , 1991 .
[50] Marek A. Suchenek. First-order syntactic characterizations of minimal entailment, domain-minimal entailment, and Herbrand entailment , 2004, Journal of Automated Reasoning.
[51] Melvin Fitting,et al. First-Order Logic and Automated Theorem Proving , 1990, Graduate Texts in Computer Science.
[52] Graham Wrightson. Preface to the special issue on tableaux , 2004, Journal of Automated Reasoning.
[53] Bernhard Beckert,et al. An Improved Method for Adding Equality to Free Variable Semantic Tableaux , 1992, CADE.
[54] Nicola Olivetti. Tableaux and sequent calculus for minimal entailment , 2004, Journal of Automated Reasoning.
[55] Victor W. Marek,et al. Nonmonotonic logic - context-dependent reasoning , 1997, Artificial intelligence.
[56] Anil Nerode,et al. Computing Circumscriptive Databases: I. Theory and Algorithms , 1995, Inf. Comput..
[57] Jorge Lobo,et al. Foundations of disjunctive logic programming , 1992, Logic Programming.
[58] W. Bibel,et al. Automated deduction : a basis for applications , 1998 .
[59] Jack Minker,et al. A Fixpoint Semantics for Disjunctive Logic Programs , 1990, J. Log. Program..
[60] Jörg Flum,et al. Mathematical logic , 1985, Undergraduate texts in mathematics.
[61] Michael Kühn. Rigid Hypertableaux , 1997, KI.
[62] Sven Lorenz,et al. A tableau prover for domain minimization , 1994, Journal of Automated Reasoning.
[63] Mark E. Stickel. Automated theorem-proving research in the Fifth Generation Computer Systems Project: Model generation theorem provers , 1993, Future Gener. Comput. Syst..
[64] Katsumi Inoue,et al. Non-Horn Magic Sets to Incorporate Top-down Inference into Bottom-up Theorem Proving , 1997, CADE.
[65] François Bry,et al. Intensional Updates: Abduction via Deduction , 1990, ICLP.
[66] David A. Plaisted,et al. Automated Deduction Techniques for Classification in Description Logic Systems , 1998, Journal of Automated Reasoning.
[67] Tim Geisler,et al. Satchmo - The Compiling and Functional Variants , 1997, Journal of Automated Reasoning.
[68] J. Minker,et al. Semantics for disjunctive logic programs , 1989 .
[69] R. Smullyan. First-Order Logic , 1968 .
[70] Tanel Tammet. Using Resolution for Deciding Solvable Classes and Building Finite Models , 1991, Baltic Computer Science.