Complexity Issues in Logic Programming |
Contents
Introduction | 257 |
Propositional case | 289 |
T Eiter and G Gottlob 289 | 322 |
Copyright | |
5 other sections not shown
Common terms and phrases
3-valued algorithm antichain Artificial Intelligence atoms autoepistemic autoepistemic logic b₁ Closed World Assumption complexity results computable queries consistent constant symbols database Datalog default logic default theories defined Definition denote derivation deterministic disjunctive default disjunctive F-program disjunctive logic programs Editors EDLPs elements embedding encoding finitely computable formula function symbols GCWA Hence Herbrand universe homomorphism Horn clause inferences integers integrity clauses language Lemma logic programs Marek Min(P minimal answer set minimal model minimal model classes MM(P Mod(P natural numbers negation non-deterministic nonmonotonic NP-complete P₁ paper partial recursive function perfect model polynomial polynomial hierarchy predicate problem Proc program completion semantics Proof propositional propositional logic relation resp rule satisfies stable answer set stable model classes stable model semantics stable semantics stratified aggregation stratified programs structure subset topology tuples Turing machines u₁ universal domain UNIVERSITY OF CALIFORNIA variables well-founded semantics