Logic Programming: Proceedings of the North American Conference, 1989, Volume 1Ewing Lusk, Ross A. Overbeek |
Contents
Applications | 3 |
Expanding Query Power in Constraint Logic Programming Languages | 20 |
Simplification and Elimination of Redundant Linear Arithmetic Constraints | 37 |
Copyright | |
38 other sections not shown
Common terms and phrases
abstract interpretation abstract machine affine hull algorithm and-or tree and-parallel answer application atoms autoepistemic logic b₁ backtracking binding array called chain closed world assumption CLP(R compiler Computer Science constraint hierarchies Constraint Logic Programming construction context database default defined definition denote derivation disjunctive domain efficient elimination environment example extension finite fixpoint formula given goal G gramming ground Hence Herbrand model Horn clause i_cond implementation language Lemma Logic Pro Logic Programming meta-interpreter minimal model model semantics negation negation as failure negative literals node nonmonotonic obtained operator paper parallel execution Parcall Frame predicate problem procedure processor Prolog proof Proposition pruning query recursive redundant constraints relation result rule sequence sequential side-effect solution solved stable model stable model semantics stack strict independence subgoal substitution supported circumscription task model technique Theorem theory tree tuple unification unify variables WME-refutation
References to this book
Programming Language Implementation and Logic Programming: 4th International ... Maurice Bruynooghe,Martin Wirsing No preview available - 1992 |