## Complexity issues in logic programming |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### 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 program completion algorithm antichain Artificial Intelligence atoms autoepistemic logic Closed World Assumption complexity results computable queries Computer Science consistent constant symbols Datalog default logic defined Definition denote derivation deterministic disjunctive logic programs disjunctive programs Editors EDLPs elements embedding encoding exists finite automata finitely computable formula function symbols G vol GCWA Gelfond ground literals Hence Herbrand universe homomorphism Horn clause induction inferences infinite integers integrity clauses inverse-Scott language Lemma Marek Min(P minimal answer set minimal model minimal model classes Minker Mod(P natural numbers negation non-deterministic nonmonotonic NP-complete observable equivalence obtained ordered domains paper partial recursive function polynomial hierarchy predicate problem Proc program completion semantics Proof propositional logic Przymusinski 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 universal domain variables well-founded semantics