Complexity of propositional nested circumscription and nested abnormality theories
暂无分享,去创建一个
[1] Vladimir Lifschitz,et al. A Simple Formalization of Actions Using Circumscription , 1995, IJCAI.
[2] Francesco M. Donini,et al. Preprocessing of Intractable Problems , 2002, Inf. Comput..
[3] Michel Minoux,et al. LTUR: A Simplified Linear-Time Unit Resolution Algorithm for Horn Formulae and Computer Implementation , 1988, Inf. Process. Lett..
[4] Bart Selman,et al. The Comparative Linguistics of Knowledge Representation , 1995, IJCAI.
[5] Francesco M. Donini,et al. Space Efficiency of Propositional Knowledge Representation Formalisms , 2000, J. Artif. Intell. Res..
[6] Burkhard Monien,et al. A Distributed Algorithm to Evaluate Quantified Boolean Formulae , 2000, AAAI/IAAI.
[7] Patrick Doherty,et al. Computing Circumscription Revisited: A Reduction Algorithm , 1997, Journal of Automated Reasoning.
[8] David S. Johnson,et al. A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[9] Adnan Darwiche,et al. Decomposable negation normal form , 2001, JACM.
[10] Alfredo Gabaldon,et al. Value Minimization in Circumscription , 1996, Artif. Intell..
[11] G. Neelakantan Kartha,et al. A Circumscriptive Formalization of the Qualification Problem , 2001, IJCAI.
[12] Vladik Kreinovich,et al. Computational Complexity of Planning and Approximate Planning in Presence of Incompleteness , 1999, IJCAI.
[13] Kurt Konolige,et al. Eliminating the Fixed Predicates from a Circumscription , 1989, Artif. Intell..
[14] Maarten van Someren,et al. Applications of Inductive Learning Techniques: A Survey in the Netherlands , 1997, AI Commun..
[15] J. Gustafsson. An Implementation and Optimization of an Algorithm for Reducing Formulae in Second-Order Logic , 1996 .
[16] John McCarthy,et al. Applications of Circumscription to Formalizing Common Sense Knowledge , 1987, NMR.
[17] Georg Gottlob,et al. An Efficient Method for Eliminating Varying Predicates from a Circumscription , 1992, Artif. Intell..
[18] Zhendong Su,et al. Automating the Computation of Nested Abnormality Theories , 1995 .
[19] John S. Schlipf,et al. Decidability and definability with circumscription , 1987, Ann. Pure Appl. Log..
[20] Neil Immerman,et al. Relational Queries Computable in Polynomial Time , 1986, Inf. Control..
[21] Benjamin Kuipers,et al. A Logical Account of Causal and Topological Maps , 2001, IJCAI.
[22] Alfredo Gabaldon,et al. Formalizing Narratives Using Nested Circumscription , 1996, Artif. Intell..
[23] Marco Schaerf,et al. An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation , 2002, Journal of Automated Reasoning.
[24] Luigi Palopoli,et al. Circumscribing DATALOG: Expressive Power and Complexity , 1998, Theor. Comput. Sci..
[25] Enrico Giunchiglia,et al. Representing Action: Indeterminacy and Ramifications , 1997, Artif. Intell..
[26] Vladimir Lifschitz,et al. Nested Abnormality Theories , 1995, Artif. Intell..
[27] John McCarthy,et al. Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..
[28] Raymond Reiter,et al. A Theory of Diagnosis from First Principles , 1986, Artif. Intell..
[29] Chitta Baral,et al. Abductive reasoning through filtering , 2000, Artif. Intell..
[30] Bart Selman,et al. Knowledge compilation and theory approximation , 1996, JACM.
[31] Vladimir Lifschitz,et al. Computing Circumscription , 1985, IJCAI.
[32] Georg Gottlob,et al. Complexity and expressive power of logic programming , 2001, CSUR.
[33] Georg Gottlob,et al. Propositional Circumscription and Extended Closed-World Reasoning are IIp2-Complete , 1993, Theor. Comput. Sci..
[34] Erik Sandewall,et al. Filter Preferential Entailment for the Logic of Action in Almost Continuous Worlds , 1989, IJCAI.
[35] Georg Gottlob,et al. Modular Logic Programming and Generalized Quantifiers , 1997, LPNMR.
[36] Joseena Sierra-Santib,et al. Declarative Formalization of Strategies for Action Selection , 1998 .
[37] Saharon Shelah,et al. Fixed-point extensions of first-order logic , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[38] Maurizio Lenzerini,et al. The Complexity of Propositional Closed World Reasoning and Circumscription , 1994, J. Comput. Syst. Sci..
[39] Marco Cadoli,et al. A Survey on Knowledge Compilation , 1997, AI Commun..
[40] Wolfgang Faber,et al. DLV - A System for Declarative Problem Solving , 2000, ArXiv.
[41] S. Abiteboul,et al. Fixpoint extensions of first-order logic and datalog-like languages , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.
[42] Tom Costello,et al. Change, Change, Change: Three Approaches , 1997, IJCAI.
[43] Georg Gottlob,et al. Curb Your Theory! A Circumspective Approach for Inclusive Interpretation of Disjunctive Information , 1993, IJCAI.
[44] Jussi Rintanen,et al. Improvements to the Evaluation of Quantified Boolean Formulae , 1999, IJCAI.
[45] Klaus W. Wagner,et al. Bounded Query Classes , 1990, SIAM J. Comput..
[46] Tran Cao Son,et al. Formalizing sensing actions A transition function based approach , 2001, Artif. Intell..
[47] Vladimir Lifschitz,et al. Actions with Indirect Effects (Preliminary Report) , 1994, KR.
[48] Jeffrey B. Remmel,et al. Non-Monotonic Reasoning with Quantified Boolean Constraints , 1997, LPNMR.
[49] G. Gottlob,et al. Propositional circumscription and extended closed-world reasoning are ΠP2-complete , 1993 .
[50] Wolfgang Faber,et al. Declarative problem-solving using the DLV system , 2000 .
[51] Pierre Marquis,et al. A Knowledge Compilation Map , 2002, J. Artif. Intell. Res..
[52] Georg Gottlob,et al. On the Complexity of Theory Curbing , 2000, LPAR.