Generalized Closed World Assumptions is Pi^0_2-Complete

The generalized closed world assumption, as opposed to the closed world assumption, does not lead to inconsistency and has been adopted as a standard rule for inferring negative information from a disjunctive logic program.

[1]  Lawrence J. Henschen,et al.  Compiling the GCWA in Indefinite Deductive Databases , 1988, Foundations of Deductive Databases and Logic Programming..

[2]  Kenneth Kunen,et al.  Negation in Logic Programming , 1987, J. Log. Program..

[3]  Jack Minker,et al.  Procedural Interpretation of Non-Horn Logic Programs , 1988, CADE.

[4]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[5]  Krzysztof R. Apt,et al.  Arithmetic classification of perfect models of stratified programs , 1991, Fundam. Informaticae.

[6]  Jack Minker,et al.  Logic and Databases: A Deductive Approach , 1984, CSUR.

[7]  Teodor C. Przymusinski,et al.  On the Relationship Between Circumscription and Negation as Failure , 1989, Artif. Intell..

[8]  Richard Hull,et al.  Positivism vs minimalism in deductive databases , 1985, PODS '86.

[9]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[10]  John S. Schlipf,et al.  Decidability and definability with circumscription , 1987, Ann. Pure Appl. Log..

[11]  D. C. Cooper,et al.  Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.

[12]  Hajnal Andréka,et al.  The generalized completeness of Horn predicate-logic as a programming language , 1978, Acta Cybern..

[13]  Jack Minker,et al.  On Indefinite Databases and the Closed World Assumption , 1987, CADE.