Foundations of Logic ProgrammingDeclarative semantics; Procedural semantics; Negation; Perpetual processes; Index. |
Contents
PRELIMINARIES 1 Introduction | 1 |
2 First Order Theories | 4 |
3 Interpretations and Models | 10 |
Copyright | |
22 other sections not shown
Other editions - View all
Common terms and phrases
answer for comp(D answer for PU axioms chapter complete lattice computation rule computed answer conjunctive normal form consequence of comp(P correct answer database statements deductive database defined definite program Definition Let equality theory error diagnoser failure rule finitely failed SLDNF-tree fixpoint follows free variables function symbols G a goal gfp(Tp Herbrand interpretation Herbrand model Herbrand universe incorrect statement instance induction hypothesis infinite input clause integrity constraint intended interpretation lemma logic programming logical consequence mapping metric space missing(w model for comp(D negation as failure negD,D node normal form normal goal normal program occur check occurs positively order formula order theory posD,D pre-interpretation predicate symbol program and G program clause program statement PROLOG PROLOG systems Proof proposition Prove PU G query complexity refutation result SLD-tree SLDNF-refutation SLDNF-resolution subset successor ordinal theorem transformation tree true wrt type theory typed first order uncovered atom unifiable variable assignment wrong(v