Fixed-parameter complexity in AI and nonmonotonic reasoning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1730, Issue , 1999, Pages 1-18

  Gottlob, Georg ^a   Scarcello, Francesco ^a   Sideri, Martha ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS   (Greece)

Author keywords

Circumscription; Complexity; Constraint satisfaction; Fixed parameter tractability; Logic programming; Nonmonotonic reasoning; Prime implicants; Stable models

Indexed keywords

COMPUTER CIRCUITS; COMPUTER PROGRAMMING LANGUAGES; FORMAL LOGIC; LOGIC PROGRAMMING; RECONFIGURABLE HARDWARE; SEMANTICS;

CIRCUMSCRIPTION; COMPLEXITY; CONSTRAINT SATISFACTION; FIXED-PARAMETER TRACTABILITY; NON-MONOTONIC REASONING; PRIME IMPLICANTS; STABLE MODEL;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84958602721     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46767-X_1     Document Type: Conference Paper

References (24)

1. K. Apt, H. Blair, and A. Walker. Towards a Theory of Declarative Knowledge. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pp. 89–148. Morgan Kaufman,Washington DC, 1988.
2. W. Bibel. Constraint Satisfaction from a DeductiveViewpoint. Artificial Intelligence, 35,401–413, 1988.
3. H. L. Bodlaender.A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing, 25(6):1305-1317, 1996.
4. A.K. Chandra and P.M. Merlin. Optimal Implementation of Conjunctive Queries in relational Databases. In ACM Symp. on Theory of Computing (STOC’77), pp.77–90, 1977.
5. R.G. Downey and M.R. Fellows. Fixed ParameterTractability and Completeness. Congressus Numerantium, 87:161–187, 1992.
6. R.G. Downey and M.R. Fellows. Fixed Parameter Intractability (Extended Abstract). In Proc. of Structure in Complexity Theory, IEEE, pp.36–50, 1992.
7. R.G. Downey and M.R. Fellows. Fixed Parameter Tractability and Completeness I: Basic Results. SIAM J. Comput., 24:873–921, 1995.
8. R.G. Downey and M.R. Fellows. On the Parametric Complexity of Relational Database Queries and a Sharper Characterization of W[1]. In Combinatorics Complexity and Logics, Proceedings of DMTCS’96, pp.164–213, Springer, 1996.
9. R.G. Downey and M.R. Fellows. Parameterized Complexity. Springer, NewYork, 1999.
10. 2 -complete. Theoretical Computer Science, 114(2):231–245, 1993. Addendum 118:315.
11. T. Eiter, G. Gottlob, and H. Mannila. Disjunctive Datalog. ACM Trans. on Database Syst., 22(3):364–418, September 1997.
12. S. Fortune, J.E. Hopcroft, and J. Wyllie. The Directed Subgraph Homeomorphism Problem. Theoretical Computer Science, 10(2): 111-121, 1980.
13. M.R. Garey and D.S. Johnson. Computers and Intractability. A Guide to the Theory of NPcompleteness. Freeman and Comp., NY, USA, 1979.
14. M. Gelfond and V. Lifschitz. The Stable Model Semantics for Logic Programming. In Logic Programming: Proc. Fifth Intl Conference and Symposium, pp. 1070–1080, Cambridge, Mass., 1988. MIT Press.
15. G. Gottlob, N. Leone, and F. Scarcello. The Complexity of Acyclic Conjunctive Queries. Technical Report DBAI-TR-98/17, available on the web as: http://www.dbai.tuwien.ac.at/staff/gottlob/acyclic.ps, or by email from the authors. An extended abstract concerning part of this work has been published in Proc. of the IEEE Symposium on Foundations of Computer Science (FOCS’98), pp.706–715, Palo Alto, CA, 1998.
16. G. Gottlob, N. Leone, and F. Scarcello.AComparison of Structural CSP Decomposition Methods. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, pp. 394–399, Stockholm, 1999.
17. P. Jeavons, D. Cohen, and M. Gyssens. Closure Properties of Constraints. JACM, 44(4), 1997.
18. Ph G. Kolaitis and M.Y. Vardi. Conjunctive-Query Containment and Constraint Satisfaction. Proc. of Symp. on Principles of Database Systems (PODS’98), 1998.
19. C.H. Papadimitriou and M. Yannakakis. On the Complexity of Database Queries. In Proc. of Symp. on Principles of Database Systems (PODS’97), pp.12–19, Tucson, Arizona, 1997.
20. N. Robertson and P.D. Seymour. Graph Minors II. Algorithmic Aspects of Tree-Width. J. Algorithms, 7:309-322, 1986.
21. N. Robertson and P.D. Seymour. Graph Minors XX.Wagner’s Conjecture. To appear.
22. M. Truszczyński. Computing Large and Small Stable Models. In Proc. of the 16th International Conference on Logic Programming (ICLP’99), Las Cruces, New Mexico. To appear.
23. M. Vardi. Complexity of Relational Query Languages. In Proceedings 14th STOC, pages 137–146, San Francisco, 1982.
24. M. Yannakakis. Algorithms for Acyclic Database Schemes. In Proc. of Int. Conf. on Very Large Data Bases (VLDB’81), pp. 82–94, C. Zaniolo and C. Delobel Eds., Cannes, France, 1981.