Analyzing the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint Theory.
Hannes StrassJohannes Peter WallnerPublished in: KR (2014)
Keyphrases
- fixpoint
- difference equations
- computational complexity
- logic programs
- deductive databases
- proof theoretic
- model theoretic
- semantics of logic programs
- update rule
- finite state machines
- horn clauses
- logic programming
- np complete
- special case
- fixpoint semantics
- stable models
- bayesian networks
- high level
- database
- integrity constraints
- datalog programs