Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? (2402.03539v1)

Published 5 Feb 2024 in cs.AI and cs.LO

Abstract: Answer Set Programming (ASP) is a generic problem modeling and solving framework with a strong focus on knowledge representation and a rapid growth of industrial applications. So far, the study of complexity resulted in characterizing hardness and determining their sources, fine-grained insights in the form of dichotomy-style results, as well as detailed parameterized complexity landscapes. Unfortunately, for the well-known parameter treewidth disjunctive programs require double-exponential runtime under reasonable complexity assumptions. This quickly becomes out of reach. We deal with the classification of structural parameters for disjunctive ASP on the program's rule structure (incidence graph). First, we provide a polynomial kernel to obtain single-exponential runtime in terms of vertex cover size, despite subset-minimization being not represented in the program's structure. Then we turn our attention to strictly better structural parameters between vertex cover size and treewidth. Here, we provide double-exponential lower bounds for the most prominent parameters in that range: treedepth, feedback vertex size, and cliquewidth. Based on this, we argue that unfortunately our options beyond vertex cover size are limited. Our results provide an in-depth hardness study, relying on a novel reduction from normal to disjunctive programs, trading the increase of complexity for an exponential parameter compression.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (59)
  1. Train Scheduling with Hybrid ASP. In LPNMR, volume 11481 of LNCS, 3–17. Springer.
  2. Evaluation of Disjunctive Programs in WASP. In LPNMR’19, volume 11481 of LNCS, 241–255. Springer.
  3. Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution. J. Artif. Intell. Res., 40: 353–373.
  4. Answer set based design of knowledge systems. Ann. Math. Artif. Intell., 47(1-2): 183–219.
  5. Propositional Semantics for Disjunctive Logic Programs. Ann. Math. Artif. Intell., 12(1): 53–87.
  6. selp: A Single-Shot Epistemic Logic Program Solver. Theory Pract. Log. Program., 20(4): 435–455.
  7. Negation by default and unstratifiable logic programs. Theo. Comput. Science, 78(1): 85–112.
  8. Handbook of Satisfiability, volume 185 of Frontiers in Artif. Intellig. and Applications. IOS Press. ISBN 978-1-58603-929-5.
  9. The Impact of Treewidth on Grounding and Solving of Answer Set Programs. J. Artif. Intell. Res., 67: 35–80.
  10. Answer set programming at a glance. Comm. of the ACM, 54(12): 92–103.
  11. I-dlv: The New Intelligent Grounder of dlv. In AI*IA, volume 10037 of LNCS, 192–207. Springer.
  12. Clark, K. L. 1977. Negation as Failure. In Logic and Data Bases, Advances in Data Base Theory, 293–322. Plemum Press.
  13. Parameterized Algorithms. Springer. ISBN 978-3-319-21274-6.
  14. Diestel, R. 2012. Graph Theory, 4th Edition, volume 173 of Graduate Texts in Mathematics. Springer. ISBN 978-3-642-14278-9.
  15. Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer. ISBN 978-1-4471-5558-4.
  16. Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. In AAAI/IAAI’00, 417–422. AAAI Press / The MIT Press.
  17. On the computational cost of disjunctive logic programming: Propositional case. Ann. Math. Artif. Intell., 15(3–4): 289–323.
  18. Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting. In KR’21, 269–279.
  19. Clique-Width is NP-Complete. SIAM J. Discret. Math., 23(2): 909–939.
  20. Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF. In LICS’23, 1–14.
  21. The Model Counting Competition 2020. ACM J. Exp. Algorithmics, 26.
  22. Lower Bounds for QBFs of Bounded Treewidth. In LICS’20, 410–424. Assoc. Comput. Mach.
  23. A multiparametric view on answer set programming. Ann. Math. Artif. Intell., 86(1-3): 121–147.
  24. Parameterized Complexity Theory, volume XIV of Theo. Comput. Science. Springer. ISBN 978-3-540-29952-3.
  25. Answer Set Solving in Practice. Morgan & Claypool.
  26. Solution Enumeration for Projected Boolean Search Problems. In CPAIOR’09, volume 5547 of LNCS, 71–86. Springer. ISBN 978-3-642-01929-6.
  27. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Comput., 9(3/4): 365–386.
  28. Bounded treewidth as a key to tractability of knowledge representation and reasoning. Artificial Intelligence, 174(1): 105–132.
  29. Fixed-parameter complexity in AI and nonmonotonic reasoning. Artif. Intell., 138(1-2): 55–86.
  30. Approximating Pathwidth for Graphs of Small Treewidth. ACM Trans. Algorithms, 19(2): 16:1–16:19.
  31. Exhaustively characterizing feasible logic models of a signaling network using Answer Set Programming. Bioinformatics, 29(18): 2320–2326. Erratum see Bioinformatics 30, 13, 1942.
  32. Hecher, M. 2022. Treewidth-aware reductions of normal ASP to SAT - Is normal ASP harder than SAT after all? Artif. Intell., 304: 103651.
  33. Which Problems Have Strongly Exponential Complexity? J. of Computer and System Sciences, 63(4): 512–530.
  34. Answer-Set Programming with Bounded Treewidth. In IJCAI’09, volume 2, 816–822.
  35. Janhunen, T. 2006. Some (in)translatability results for normal logic programs and propositional theories. J. of Applied Non-Classical Logics, 16(1-2): 35–86.
  36. The Answer Set Programming Paradigm. AI Magazine, 37(3): 13–24.
  37. Propositional logic: deduction and algorithms. Cambridge University Press. ISBN 978-0521630177.
  38. Kloks, T. 1994. Treewidth. Computations and Approximations, volume 842 of LNCS. Springer. ISBN 3-540-58356-4.
  39. Faster deterministic Feedback Vertex Set. Inf. Process. Lett., 114(10): 556–560.
  40. Tree-Width, Path-Widt, and Cutwidth. Discret. Appl. Math., 43(1): 97–101.
  41. Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters. In CP’21, volume 210 of LIPIcs, 8:1–8:11. Dagstuhl Publishing.
  42. An Improved Parameterized Algorithm for Treewidth. In STOC’23, 528–541. ACM.
  43. Fixed-Parameter Algorithms for Finding Minimal Models. In KR’12. AAAI Press.
  44. Treewidth with a Quantifier Alternation Revisited. In IPEC’17, volume 89, 26:1–26:12. Dagstuhl Publishing.
  45. On tight logic programs and yet another translation from normal logic programs to propositional logic. In IJCAI’03, 853–858. Morgan Kaufmann.
  46. ASSAT: computing answer sets of a logic program by SAT solvers. Artif. Intell., 157(1-2): 115–137.
  47. Slightly Superexponential Parameterized Problems. In SODA’11, 760–776. SIAM.
  48. Autoepistemic logic. J. of the ACM, 38(3): 588–619.
  49. Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth. In ICALP’16, volume 55 of LIPIcs, 28:1–28:15. Dagstuhl Publishing. ISBN 978-3-95977-013-2.
  50. Niedermeier, R. 2006. Invitation to Fixed-Parameter Algorithms, volume 31 of Oxford Lecture Series in Mathematics and its Applications. Oxford University Press. ISBN 978-0-19-856607-6.
  51. Upper bounds for vertex cover further improved. In STACS 99: 16th Annual Symposium on Theoretical Aspects of Computer Science Trier, Germany, March 4–6, 1999 Proceedings 16, 561–570. Springer.
  52. Stable model semantics of weight constraint rules. In LPNMR’99, volume 1730 of LNCS, 317–331. Springer. ISBN 3-540-66749-0.
  53. An A-Prolog Decision Support System for the Space Shuttle. In PADL’01, volume 1990 of LNCS, 169–183. Springer. ISBN 978-3-540-45241-6.
  54. Fixed-Parameter Hierarchies inside PSPACE. In LICS’06, 27–36. IEEE Computer Society.
  55. Papadimitriou, C. H. 1994. Computational Complexity. Addison-Wesley. ISBN 0-470-86412-5.
  56. Tractable answer-set programming with weight constraints: bounded treewidth is not enough. Theory Pract. Log. Program., 14(2).
  57. Graph minors II: Algorithmic aspects of tree-width. J. Algorithms, 7: 309–322.
  58. Special Issue on Answer Set Programming. KI, 32(2-3): 101–103.
  59. Truszczynski, M. 2011. Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs. Theory Pract. Log. Program., 11(6): 881–904.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets