A dichotomy in the complexity of propositional circumscription

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2001, Pages 71-80

  Kirousis, Lefteris M ^a   Kolaitis, Phokion G ^b  

^a UNIVERSITY OF PATRAS   (Greece)

^b University of California Santa Cruz   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; THEOREM PROVING;

PROPOSITIONAL LOGIC; SATISFIABILITY PROBLEM;

FORMAL LOGIC;

EID: 0034865416     PISSN: 10436871     EISSN: None     Source Type: Journal    
DOI: 10.1109/LICS.2001.932484     Document Type: Article

References (16)

1. Complexity of generalized satisfiability counting problems
2. On generating all solutions of generalized satisfiability problems
3. The complexity of closed world reasoning and circumscription
4. A dichotomy theorem for maximum generalized satisfiability problems
5. Structure identification in relational data
6. P-complete
7. On the relationship between circumscription and negation as failure
8. The complexity of minimal satisfiability problems
9. The inverse satisfiability problem
10. A complete classification of the approximability of maximization problems derived from Boolean constraint satisfaction
11. On the structure of polynomial time reducibility
12. Circumscription - a form of non-monotonic reasoning
13. Oprimal satisfiability of propositional calculi and constraint satisfaction problems
14. The complexity of satisfiability problems