Extensions of Logic Programming: 4th International Workshop, ELP '93, St Andrews, U.K., March 29 - April 1, 1993. Proceedings
Springer Science & Business Media, May 20, 1994 - Computers - 360 pages
The papers in this volume are extended versions of presentations at the fourth International Workshop on Extensions of Logic Programming, held at the University of St Andrews, March/April 1993. Among the topics covered in the volume are: defintional reflection and completion, modules in lambda-Prolog, representation of logics as partial inductive definitions, non-procedural logic programming, knowledge representation, contradiction avoidance, disjunctive databases, strong negation, linear logic programming, proof theory and regular search spaces, finite sets and constraint logic programming, search-space pruning and universal algebra, and implementation on transputer networks.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
abstract acceptable allowed answer apply approach argument assume assumption atomic axiom binding calculus called clauses complete computation condition consider consistent constants constraint construct contains corresponding costs database defined definition derivation domain Environment equality evaluation example exclusion execution expressions extended fact false finite formula function give given goal holds hypotheses implementation inductive inference rules instance instantiations interpretation intervals introduce intuitionistic logic italy judgment knowledge language linear literals Logic Programming means method module Name Note object obtained occur operator parallel partial particular possible predicate present problem procedural Proceedings Prolog proof properties Proposition query reasoning relation removal represent representation restricted result revision rule scenario semantics sequent signature solution specific strategy structure substitution supports theory translation true truth unification unify variables