Backdoors to tractable answer-set programming

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2011, Pages 863-868

  Fichte, Johannes Klaus ^a   Szeider, Stefan ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ACYCLIC PROGRAMS; ANSWER-SET PROGRAMMING; CONSTRAINT SATISFACTION; FIXED-PARAMETER TRACTABILITY; PARAMETERIZED; PROPOSITIONAL SATISFIABILITY; SEARCH SPACES; STRUCTURAL PARAMETER;

ARTIFICIAL INTELLIGENCE;

EID: 84860715892     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-150     Document Type: Conference Paper

References (35)

1. K. R. Apt, H. A. Blair, and A. Walker. Towards a theory of declarative knowledge, Morgan Kaufmann, 1988.
2. Asparagus. http://asparagus.cs.uni-potsdam.de, 2009.
3. A. Ayari and D. Basin. Bounded model construction for monadic second-order logics. CAV 2000.
4. R. Ben-Eliyahu. A hierarchy of tractable subsets for computing stable models. J. Artif. Intell. Res., 5, 1996.
5. P. Bonsma and D. Lokshtanov. Feedback vertex set in mixed graphs. arXiv 1010.5974, 2010.
6. J. Chen, I. A. Kanj, and G. Xia. Improved parameterized upper bounds for vertex cover. MFCS 2006.
7. J. Chen, Y. Liu, S. Lu, B. O'Sullivan, and I. Razgon. A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM, 55(5), 2008.
8. M. Cygan, M. Pilipczuk, M. Pilipczuk, and J. O. Wojtaszczyk. Subset feedback vertex set is fixed parameter tractable. arXiv 1004.2972, 2010.
9. W. F. Dowling and J. H. Gallier. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. J. Logic Programming, 1(3), 1984.
10. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.
11. T. Eiter and G. Gottlob. On the computational cost of disjunctive logic programming: propositional case. Ann. Math. Artif. Intell., 15(3-4), 1995.
12. J. K. Fichte. The good, the bad, the odd - cycles in answer set programming. submitted, 2011.
13. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. ICLP 1988.
14. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Comput., 9(3/4), 1991.
15. G. Gottlob and S. Szeider. Fixedparameter algorithms for artificial intelligence, constraint satisfaction, and database problems. The Computer Journal, 51(3), 2006.
16. G. Gottlob, F. Scarcello, and M. Sideri. Fixed-parameter complexity in AI and nonmonotonic reasoning. Artificial Intelligence, 138(1-2), 2002.
17. M. Jakl, R. Pichler, and S. Woltran. Answer-set programming with bounded treewidth. IJCAI 2009.
18. T. Janhunen and E. Oikarinen. Testing the equivalence of logic programs under stable model semantics. Logics in AI, 2002.
19. K. Kawarabayashi and Y. Kobayashi. Fixed-parameter tractability for the subset feedback set problem and the s-cycle packing problem. Technical report, University of Tokyo, Japan, 2010.
20. F. Lin and J. Zhao. On tight logic programs and yet another translation from normal logic programs to propositional logic. IJCAI 2003.
21. F. Lin and X. Zhao. On odd and even cycles in normal logic programs. AAAI 2004.
22. M. Maratea, F. Ricca, W. Faber, and N. Leone. Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers. J. Algorithms, 63, 2008.
23. V. W. Marek and M. Truszczyński. Autoepistemic logic. J. ACM, 38(3), 1991.
24. V. W. Marek and M. Truszczyński. Stable models and an alternative logic programming paradigm. The Logic Programming Paradigm: a 25-Year Perspective, 1999.
25. I. Niemelä. Logic programs with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell., 25(3-4), 1999.
26. N. Nishimura, P. Ragde, and S. Szeider. Detecting backdoor sets with respect to Horn and binary clauses. SAT 2004.
27. N. Nishimura, P. Ragde, and S. Szeider. Solving #SAT using vertex covers. Acta Informatica, 44(7-8), 2007.
28. S. Ordyniak and S. Szeider Augmenting Tractable Fragments of Abstract Argumentation. IJCAI 2011.
29. I. Razgon and B. O'Sullivan. Almost 2-sat is fixed-parameter tractable (extended abstract). ICALP 2008.
30. M. Samer and S. Szeider. Backdoor trees. AAAI 2008.
31. M. Samer and S. Szeider. Fixed-parameter tractability. Handbook of Satisfiability, ch. 13, 2009.
32. M. Samer and S. Szeider. Backdoor sets of quantified Boolean formulas. JAR, 42(1):77-97, 2009.
33. C. Sinz, A. Kaiser, and W. Küchlin. Formal methods for the validation of automotive product configuration data. AI EDAM 2003.
34. R. Williams, C. Gomes, and B. Selman. Backdoors to typical case complexity. IJCAI 2003.
35. Y. Zhao and F. Lin. Answer set programming phase transition: A study on randomly generated programs. ICLP 2003.