Parallel Computational Complexity of Logic Programs and Alternating Turing Machines.
Yasuo OkabeShuzo YajimaPublished in: FGCS (1988)
Keyphrases
- logic programs
- turing machine
- computational complexity
- logic programming
- answer sets
- fixpoint
- stable models
- background knowledge
- partial deduction
- inductive logic programming
- answer set programming
- computational properties
- prolog programs
- horn clauses
- normal logic programs
- strong equivalence
- term rewriting systems
- decision problems
- stable model semantics
- existentially quantified
- np complete
- monotonicity constraints
- logic program updates