On the computational cost of disjunctive logic programming: Propositional case
暂无分享,去创建一个
[1] Howard A. Blair,et al. The Complexity of Local Stratification , 1994, Fundam. Informaticae.
[2] Christine Froidevaux,et al. Negation by Default and Unstratifiable Logic Programs , 1991, Theor. Comput. Sci..
[3] Alan van Gelser. Negation as failure using tight derivations for general logic programs , 1989 .
[4] Raymond Reiter,et al. A Logic for Default Reasoning , 1987, Artif. Intell..
[5] Georg Gottlob,et al. Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics , 1993, ILPS.
[6] Robert C. Moore. Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.
[7] Jorge Lobo,et al. Weak Generalized Closed World Assumption , 1989, Journal of Automated Reasoning.
[8] Chiaki Sakama,et al. Possible Model Semantics for Disjunctive Databases , 1989, DOOD.
[9] John S. Schlipf,et al. When is Closed World Reasoning Tractable? , 1988, International Syposium on Methodologies for Intelligent Systems.
[10] Jorge Lobo,et al. Generalized disjunctive well-founded semantics for logic programs , 2005, Annals of Mathematics and Artificial Intelligence.
[11] M. Gelfond,et al. Disjunctive Defaults , 1991 .
[12] Bart Selman,et al. Hard Problems for Simple Default Logics , 1989, Artif. Intell..
[13] David Harel,et al. Horn Clauses Queries and Generalizations , 1985, J. Log. Program..
[14] John S. Schlipf. A Survey of Complexity and Undecidability Results in Logic Programming , 1992, Structural Complexity and Recursion-theoretic methods in Logic-Programming.
[15] Victor W. Marek,et al. A theory of nonmonotonic rule systems I , 2005, Annals of Mathematics and Artificial Intelligence.
[16] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[17] Jack Minker,et al. Semantics of Disjunctive Deductive Databases , 1992, ICDT.
[18] John S. Schlipf,et al. The expressive powers of the logic programming semantics (extended abstract) , 1990, PODS.
[19] Kenneth A. Ross,et al. Inferring negative information from disjunctive databases , 2004, Journal of Automated Reasoning.
[20] John McCarthy,et al. Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..
[21] John McCarthy,et al. Applications of Circumscription to Formalizing Common Sense Knowledge , 1987, NMR.
[22] Marco Cadoli,et al. The Complexity of Model Checking for Circumscriptive Formulae , 1992, Inf. Process. Lett..
[23] Maurizio Lenzerini,et al. The Complexity of Closed World Reasoning and Circumscription , 1990, AAAI.
[24] Teodor C. Przymusinski. Three-Valued Nonmonotonic Formalisms and Semantics of Logic Programs , 1991, Artif. Intell..
[25] Klaus W. Wagner,et al. Bounded Query Classes , 1990, SIAM J. Comput..
[26] Christine Froidevaux,et al. General Logical Databases and Programs: Default Logic Semantics and Stratification , 1991, Inf. Comput..
[27] Georg Gottlob,et al. Reasoning with parsimonious and moderately grounded expansions , 1992, Fundam. Informaticae.
[28] Edward P. F. Chan. A Possible World Semantics for Disjunctive Databases , 1993, IEEE Trans. Knowl. Data Eng..
[29] Jürgen Dix,et al. Abstract Properties and Computational Complexity of Semantics for Disjunctive Logic Programs , 1992, Structural Complexity and Recursion-theoretic methods in Logic-Programming.
[30] Jürgen Dix,et al. Implementing Semantics of Disjunctive Logic Programs Using Fringes and Abstract Properties (Extended Abstract) , 1993, LPNMR.
[31] Kenneth A. Ross,et al. The well-founded semantics for general logic programs , 1991, JACM.
[32] Jan Chomicki,et al. Generalized Closed World Assumptions is Pi^0_2-Complete , 1990, Inf. Process. Lett..
[33] Jack Minker. Foundations of deductive databases and logic programming , 1988 .
[34] Victor W. Marek,et al. How Complicated is the Set of Stable Models of a Recursive Logic Program? , 1992, Ann. Pure Appl. Log..
[35] Michael Gelfond,et al. Negation as Failure: Careful Closure Procedure , 1986, Artif. Intell..
[36] Jack Minker,et al. On Indefinite Databases and the Closed World Assumption , 1987, CADE.
[37] Jorge Lobo,et al. Foundations of disjunctive logic programming , 1992, Logic Programming.
[38] Kenneth A. Ross,et al. The Well Founded Semantics for Disjunctive Logic Programs , 1989, DOOD.
[39] Victor W. Marek,et al. Autoepistemic logic , 1991, JACM.
[40] Jonathan Stillman,et al. The Complexity of Propositional Default Logics , 1992, AAAI.
[41] Rina Dechter,et al. Propositional semantics for disjunctive logic programs , 1994, Annals of Mathematics and Artificial Intelligence.
[42] Adrian Walker,et al. Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..
[43] Marco Schaerf. Logic Programming and Autoepistemic Logics: New Relations and Complexity Results , 1993, AI*IA.
[44] Raymond Reiter. On Closed World Data Bases , 1977, Logic and Data Bases.
[45] Richard Chang,et al. On Unique Satisfiability and the Threshold Behavior of Randomized Reductions , 1995, J. Comput. Syst. Sci..
[46] Teodor C. Przymusinski,et al. On the Relationship Between Circumscription and Negation as Failure , 1989, Artif. Intell..
[47] G. Gottlob,et al. Propositional circumscription and extended closed-world reasoning are ΠP2-complete , 1993 .
[48] Victor W. Marek,et al. Complexity of computing with extended propositional logic programs , 2005, Annals of Mathematics and Artificial Intelligence.
[49] Marco Schaerf,et al. A Survey of Complexity Results for Planning , 1993 .
[50] Grigori Schwarz. Autoepistemic Logic of Knowledge , 1991, LPNMR.
[51] Albert R. Meyer,et al. Word problems requiring exponential time(Preliminary Report) , 1973, STOC.
[52] Georg Gottlob,et al. Complexity Results for Nonmonotonic Logics , 1992, J. Log. Comput..
[53] Victor W. Marek,et al. The expressiveness of locally stratified programs , 2005, Annals of Mathematics and Artificial Intelligence.
[54] Victor W. Marek,et al. Computing Intersection of Autoepistemic Expansions , 1991, LPNMR.
[55] Vladimir Lifschitz,et al. Computing Circumscription , 1985, IJCAI.
[56] Victor W. Marek,et al. A theory of nonmonotonic rule systems II , 2005, Annals of Mathematics and Artificial Intelligence.
[57] David S. Johnson,et al. A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[58] Lawrence J. Henschen,et al. Deduction in non-Horn databases , 1985, Journal of Automated Reasoning.
[59] Anil Nerode,et al. Reflexive autoepistemic logic and logic programming , 1993 .
[60] Vladimir Lifschitz,et al. Extended Logic Programs as Autoepistemic Theories , 1993, LPNMR.
[61] Krzysztof R. Apt,et al. Arithmetic classification of perfect models of stratified programs , 1991, Fundam. Informaticae.
[62] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[63] A. Nerode,et al. Implementing Semantics of Disjunctive Logic Programs Using Fringes and Abstract Properties , 1993 .