Characterizing Structural Hardness of Logic Programs: What Makes Cycles and Reachability Hard for Treewidth?
Markus HecherPublished in: AAAI (2023)
Keyphrases
- logic programs
- logic programming
- answer sets
- stable models
- fixpoint
- answer set programming
- background knowledge
- normal logic programs
- prolog programs
- inductive logic programming
- partial deduction
- upper bound
- computational properties
- stable model semantics
- recursive programs
- logic program updates
- term rewriting systems
- boolean functions
- search space
- semantics of logic programs
- query language
- computational complexity