Logic, programming, and Prolog
What sets this book apart from others on logic programming is the breadth of its coverage. The authors have achieved a fine balance between a clear and authoritative treatment of the theory and a practical, problem-solving approach to its applications. This edition introduces major new developments in a continually evolving field and includes such topics as concurrency and equational and constraint logic programming.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Definite Logic Programs
Negation in Logic Programming
15 other sections not shown
3-gallon jug algorithm argument arithmetic atomic formulas bill binary binary relation binding built-in predicates called Chapter closed world assumption comp(P complete computation rule computed answer substitution Consider the following constraint logic programming constraint store contains DCGs deductive databases defined definite clauses definite program denoted derivation tree described discussed domain empty equivalent expert system father(X Figure finitely failed formalized function functor goal clause goal-state grammar ground terms Herbrand base Herbrand interpretation Herbrand universe implementation inference rule infinite initial goal integers intended model least Herbrand model logical consequence loop meta-language natural numbers negation as finite negative literal node nonterminal notion object-language parent(X possible predicate logic predicate symbol problem program clause programming languages Prolog systems proof tree query rabbit recursive refutation renaming represented semantics semi-naive evaluation set of equations SLD-derivation SLD-resolution SLD-tree solution solved form strategy string subgoal succeeds Theorem transformation true unification unifier variables