On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?
Markus HecherRafael KieselPublished in: AAAI (2024)
Keyphrases
- answer set programming
- logic programs
- answer sets
- logic programming
- constraint logic programming
- computational complexity
- answer set programs
- phase transition
- disjunctive logic programming
- machine learning
- database
- np complete
- propositional logic
- general purpose
- reasoning tasks
- np hard
- search algorithm
- haplotype inference