Reasoning under minimal upper bounds in propositional logic
暂无分享,去创建一个
[1] Jack Minker,et al. Disjunctive Logic Programming: A Survey and Assessment , 2002, Computational Logic: Logic Programming and Beyond.
[2] Georg Gottlob,et al. On the computational cost of disjunctive logic programming: Propositional case , 1995, Annals of Mathematics and Artificial Intelligence.
[3] Fangzhen Lin,et al. Loop formulas for circumscription , 2004, Artif. Intell..
[4] Georg Gottlob,et al. Curb Your Theory! A Circumspective Approach for Inclusive Interpretation of Disjunctive Information , 1993, IJCAI.
[5] Jürgen Dix,et al. Semantics of Logic Programs: Their Intuitions and Formal Properties. An Overview , 1996, Logic, Action, and Information.
[6] J. van Leeuwen,et al. Logic Programming , 2002, Lecture Notes in Computer Science.
[7] Chen Avin,et al. Algorithms for Computing X-Minimal Models , 2001, LPNMR.
[8] Francesco Scarcello,et al. Semantical and Computational Aspects of Horn Approximations , 1993, IJCAI.
[9] Hans Rott,et al. Logic, Action and Information , 1996 .
[10] Chiaki Sakama,et al. Possible Model Semantics for Disjunctive Databases , 1989, DOOD.
[11] Francesco M. Donini,et al. Space Efficiency of Propositional Knowledge Representation Formalisms , 2000, J. Artif. Intell. Res..
[12] Chiaki Sakama,et al. Negation in Disjunctive Logic Programs , 1993, ICLP.
[13] Vladimir Lifschitz,et al. Nested Abnormality Theories , 1995, Artif. Intell..
[14] Armando Tacchella,et al. The Second QBF Solvers Comparative Evaluation , 2004, SAT (Selected Papers.
[15] Katsumi Inoue,et al. Compiling Prioritized Circumscription into Answer Set Programming , 2004, ICLP.
[16] Maurizio Lenzerini,et al. The Complexity of Propositional Closed World Reasoning and Circumscription , 1994, J. Comput. Syst. Sci..
[17] Tomi Janhunen,et al. Capturing Parallel Circumscription with Disjunctive Logic Programs , 2004, JELIA.
[18] François Bry,et al. SATCHMO: A Theorem Prover Implemented in Prolog , 1988, CADE.
[19] Patrick Doherty,et al. Computing Circumscription Revisited: A Reduction Algorithm , 1997, Journal of Automated Reasoning.
[20] Marianne Winslett,et al. Reasoning about Action Using a Possible Models Approach , 1988, AAAI.
[21] François Bry,et al. Minimal Model Generation with Positive Unit Hyper-Resolution Tableaux , 1996, TABLEAUX.
[22] Ilkka Niemelä. A Tableau Calculus for Minimal Model Reasoning , 1996, TABLEAUX.
[23] Marco Cadoli,et al. The Complexity of Model Checking for Circumscriptive Formulae , 1992, Inf. Process. Lett..
[24] Rachel Ben-Eliyahu – Zohary,et al. An incremental algorithm for generating all minimal models , 2005 .
[25] Pierre Marquis,et al. A Knowledge Compilation Map , 2002, J. Artif. Intell. Res..
[26] Kenneth A. Ross,et al. Inferring negative information from disjunctive databases , 2004, Journal of Automated Reasoning.
[27] Georg Gottlob,et al. On the Complexity of Theory Curbing , 2000, LPAR.
[28] Edward P. F. Chan. A Possible World Semantics for Disjunctive Databases , 1993, IEEE Trans. Knowl. Data Eng..
[29] Norman Y. Foo,et al. Updates with Disjunctive Information: From Syntactical and Semantical Perspectives , 2000, Comput. Intell..
[30] Anil Nerode,et al. Computing Circumscriptive Databases: I. Theory and Algorithms , 1995, Inf. Comput..
[31] B. Bodenstorfer. How many minimal upper bounds of minimal upper bounds , 2006, Computing.
[32] Luigi Palopoli,et al. Reasoning with Minimal Models: Efficient Algorithms and Applications , 1997, Artif. Intell..
[33] Georg Gottlob,et al. Complexity of Nested Circumscription and Nested Abnormality Theories , 2002, ArXiv.
[34] Luigi Palopoli,et al. Curbing Theories: Fixpoint Semantics and Complexity Issues , 1995, GULP-PRODE.
[35] Matthew L. Ginsberg. A Circumscriptive Theorem Prover , 1989, Artif. Intell..
[36] Dov M. Gabbay,et al. Handbook of logic in artificial intelligence and logic programming (vol. 1) , 1993 .
[37] Chiaki Sakama,et al. Embedding Circumscriptive Theories in General Disjunctive Programs , 1995, LPNMR.
[38] John McCarthy,et al. Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..
[39] Vladimir Lifschitz,et al. Computing Circumscription , 1985, IJCAI.
[40] Georg Gottlob,et al. Propositional Circumscription and Extended Closed-World Reasoning are IIp2-Complete , 1993, Theor. Comput. Sci..
[41] Kenneth A. Ross,et al. The well-founded semantics for general logic programs , 1991, JACM.
[42] Paolo Liberatore,et al. The Complexity of Belief Update , 1997, IJCAI.
[43] Hendrik Decker,et al. Sustained Models and Sustained Answers in First-Order Databases , 1993, DAISD.
[44] Georg Gottlob,et al. Complexity of propositional nested circumscription and nested abnormality theories , 2005, TOCL.
[45] Paolo Liberatore. The Complexity of Iterated Belief Revision , 1997, ICDT.
[46] John McCarthy,et al. Applications of Circumscription to Formalizing Common Sense Knowledge , 1987, NMR.
[47] Jorge Lobo,et al. Foundations of disjunctive logic programming , 1992, Logic Programming.
[48] Kenneth A. Ross,et al. The Well Founded Semantics for Disjunctive Logic Programs , 1989, DOOD.
[49] J. Van Leeuwen,et al. Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .
[50] Norman Y. Foo,et al. Updating Knowledge Bases with Disjunctive Information , 1996, AAAI/IAAI, Vol. 1.
[51] Felix Schlenk,et al. Proof of Theorem 3 , 2005 .
[52] Katsumi Inoue,et al. On theorem provers for circumscription , 1990 .