On the Computational Complexity of Propositional Logic Programs with Nested Implications.
Jörg HudelmaierPublished in: ELP (1996)
Keyphrases
- logic programs
- computational complexity
- strong equivalence
- logic programs with negation
- logic programming
- horn clauses
- loop formulas
- general logic programs
- propositional theories
- answer set programs
- answer set programming
- stable models
- autoepistemic logic
- answer sets
- minimal models
- propositional logic
- refinement operators
- fixpoint
- default logic
- background knowledge
- np complete
- model theoretic
- computational properties
- normal logic programs
- first order logic
- partial deduction
- inductive logic programming
- prolog programs
- decision problems
- logic program updates
- disjunctive logic programming
- answer set semantics
- multi valued
- term rewriting systems
- monotonicity constraints
- polynomial hierarchy
- reasoning tasks
- expressive power
- np hard