Computing with Logic: Logic Programming with Prolog

algorithm apply argument arity atoms AVList backtracking BINDENV binding array binding frame center clause choice point clause set Consider constant copy data structures database Datalog Datalog program depth-first search dmnds empty clause establishtd evaluable predicates example expression facts false Figure formula f function symbol functional logic gives goal list ground instances head Herbrand Herbrand base Herbrand interpretation Herbrand universe Horn clauses implementation input instantiation instruction integer invocation lazy list literal logic programming logically implies LSUB match molecule NEWGL NEWREPLS NEXTCL node optimization plainWeave predicate logic predicate symbol programming language Prolog Proplog program propositional logic query refutation procedure replacement REPLS represent resolvent retrieve return(false return(true returns rule satisfied Section semantic tree semantics side clause stack STRUCT subgoal subst substitution succeeds symbol table tail recursive term theorem Tokens tree true truth assignment unifier unsatisfiable variable