An algebraic approach to the complexity of prepositional circumscription

Proceedings - Symposium on Logic in Computer Science

Volumn 19, Issue , 2004, Pages 367-376

  Nordh, Gustav ^a   Jonsson, Peter ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; CONSTRAINT THEORY; FORMAL LOGIC; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; PROBLEM SOLVING; THEOREM PROVING;

BOOLEAN LOGICS; MANY-VALUE LOGICS; REASONING;

BOOLEAN ALGEBRA;

EID: 4544367553     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. A. Bulatov. A dichotomy theorem for constraints on a three-element set. In Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science, pages 649-658, 2002.
2. A. Bulatov. Mal'tsev constraints are tractable. Technical report, PRG-RR-02-05, Computing Laboratory, University of Oxford, 2002.
3. A. Bulatov, P. Jeavons, and A. Krokhin. Constraint satisfaction problems and finite algebras. In Proceedings of the 27th International Colloquium on Automata, Languages and Programming, pages 272-282, 2000.
4. A. Bulatov, P. Jeavons, and A. Krokhin. Classifying the complexity of constraints using finite algebras (revised version). Submitted for publication, available at http://www.des.warwick.ac.uk/people/ academic/Andrei.Krokhin/ papers.html, 2003.
5. M. Cadoli. The complexity of model checking for circumscriptive formulae. Information Processing Letters, 42:113-118, 1992.
6. M. Cadoli. Tractable Reasoning in Artificial Intelligence. Number 941 in Lecture Notes in Artificial Intelligence. Springer Verlag Berlin Heidelberg, 1995.
7. M. Cadoli and M. Lenzerini. The complexity of closed world reasoning and circumscription. Journal of Information and System Sciences, pages 255-301, 1994.
8. S. Cook. The complexity of theorem proving procedures. In Proceedings of the 3rd ACM Symposium on Theory of Computing, pages 151-158, 1971.
9. P. Doherty, J. Kachniarz, and A. Szałas. Using contextually closed queries for local closed-world reasoning in rough knowledge databases. In S. Pal, L. Polkowski, and A. Skowron, editors, Rough-Neuro Computing: Techniques for Computing with Words, Cognitive Technologies, pages 219-250. Springer-Verlag, 2003.
10. A. Durand and M. Hermann. The inference problem for propositional circumscription of affine formulas is coNP-complete. In Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science, pages 451-462, 2003.
11. P -complete. Theoretical Computer Science, 114:231-245, 1993.
12. M. Gelfond, H. Przymusinska, and T. Przymusinsky. On the relationship between circumscription and negation as failure. Artificial Intelligence, 38:49-73, 1989.
13. P. Jeavons, D. Cohen, and M. Gyssens. Closure properties of constraints. Journal of the ACM, 44:527-548, 1997.
14. L. Kirousis and P. Kolaitis. A dichotomy in the complexity of propositional circumscription. In Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, pages 71-80, 2001.
15. L. Kirousis and P. Kolaitis. The complexity of minimal satisfiability problems. Information and Computation, 187(1):20-39, 2003.
16. R. Ladner. On the structure of polynomial time reducibility. Journal of the ACM, 22:155-171, 1975.
17. J. McCarthy. Circumscription - a form of nonmonotonic reasoning. Artificial Intelligence, 13:27-39, 1980.
18. R. Pöschel and L. Kaluznin. Funktionen- und Relationenalgebren. DVW, Berlin, 1979.
19. T. Schaefer. The complexity of satisfiability problems. In Proceedings of the 10th ACM Symposium on Theory of Computing, pages 216-226, 1978.