Propositional Circumscription and Extended Closed-World Reasoning are IIp2-Complete
暂无分享,去创建一个
[1] Richard Chang,et al. On Unique Satisfiability and the Threshold Behavior of Randomized Reductions , 1995, J. Comput. Syst. Sci..
[2] David S. Johnson,et al. The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.
[3] Mark W. Krentel. The Complexity of Optimization Problems , 1986, Computational Complexity Conference.
[4] Teodor C. Przymusinski,et al. On the Relationship Between Circumscription and Negation as Failure , 1989, Artif. Intell..
[5] Jack Minker,et al. On Indefinite Databases and the Closed World Assumption , 1987, CADE.
[6] J. McCarthy. Circumscription|a Form of Nonmonotonic Reasoning , 1979 .
[7] Klaus W. Wagner,et al. Bounded Query Classes , 1990, SIAM J. Comput..
[8] Richard Chang,et al. On the Structure of Uniquely Satisfiable Formulas , 1990 .
[9] J. Van Leeuwen,et al. Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .
[10] Klaus W. Wagner. More Complicated Questions About Maxima and Minima, and Some Closures of NP , 1987, Theor. Comput. Sci..
[11] Leslie G. Valiant,et al. NP is as easy as detecting unique solutions , 1985, STOC '85.
[12] David S. Johnson,et al. A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[13] Jim Kadin. The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses , 1988, SIAM J. Comput..
[14] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[15] John McCarthy,et al. Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..
[16] John S. Schlipf,et al. When is Closed World Reasoning Tractable? , 1988, International Syposium on Methodologies for Intelligent Systems.
[17] Amihood Amir,et al. Polynomial Terse Sets , 1988, Inf. Comput..
[18] Frank P. Coyle,et al. Aaai '90 , 1990, IEEE Expert.
[19] David S. Johnson. The NP-Completeness Column: An Ongoing Guide , 1986, J. Algorithms.
[20] Michael Gelfond,et al. Negation as Failure: Careful Closure Procedure , 1986, Artif. Intell..
[21] Jan Chomicki,et al. Generalized Closed World Assumptions is Pi^0_2-Complete , 1990, Inf. Process. Lett..
[22] Krzysztof R. Apt,et al. Arithmetic classification of perfect models of stratified programs , 1991, Fundam. Informaticae.
[23] Mihalis Yannakakis,et al. The complexity of facets (and some facets of complexity) , 1982, STOC '82.
[24] Andreas Blass,et al. On the Unique Satisfiability Problem , 1982, Inf. Control..
[25] Jim Kadin,et al. P^(NP[O(log n)]) and Sparse Turing-Complete Sets for NP , 1989, J. Comput. Syst. Sci..
[26] Maurizio Lenzerini,et al. The Complexity of Closed World Reasoning and Circumscription , 1990, AAAI.
[27] Christos H. Papadimitriou,et al. Some computational aspects of circumscription , 1988, JACM.
[28] John S. Schlipf,et al. Decidability and definability with circumscription , 1987, Ann. Pure Appl. Log..
[29] Robert A. Kowalski,et al. The Semantics of Predicate Logic as a Programming Language , 1976, JACM.