Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory.
Hannes StrassJohannes Peter WallnerPublished in: Artif. Intell. (2015)
Keyphrases
- fixpoint
- difference equations
- computational complexity
- logic programs
- deductive databases
- proof theoretic
- semantics of logic programs
- finite state machines
- update rule
- nonmonotonic reasoning
- datalog programs
- stable models
- model theoretic
- answer sets
- special case
- np complete
- horn clauses
- data model
- fixpoint semantics
- logic programming
- proof theory
- abstract argumentation frameworks
- high level