Characterizing Structural Hardness of Logic Programs: What makes Cycles and Reachability Hard for Treewidth?
Markus HecherPublished in: CoRR (2023)
Keyphrases
- logic programs
- logic programming
- answer sets
- stable models
- background knowledge
- fixpoint
- answer set programming
- prolog programs
- term rewriting systems
- computational properties
- inductive logic programming
- normal logic programs
- partial deduction
- loop formulas
- upper bound
- stable model semantics
- search space
- phase transition
- bounded treewidth
- computational complexity
- constraint satisfaction
- constraint satisfaction problems