Extensions of Logic Programming
4th International Workshop, ELP '93, St Andrews, U.K., March 29 - April 1,1993.Proceedings, Lecture Notes in Computer Science 798 - Lecture Notes in Artificial Intelligence
Erschienen am
20.05.1994
Beschreibung
InhaltsangabeDesign for AKL with intelligent pruning.- Contradiction: When avoidance equals removal Part I.- Birkhoff's HSP-theorem for cumulative logic programs.- Finite domains and exclusions as first-class citizens.- Some experimental results in implementing a logic language with multi-head clauses on a Transputer architecture.- A language with finite sets embedded in the CLP-scheme.- Finitary partial inductive definitions as a general logic.- Programming methodologies in GCLA.- Computing cost estimates for proof strategies.- Logic programming with multiple context management schemes.- Non-procedural logic programming.- Axioms in definitional calculi.- A proposal for modules in ?Prolog.- Regular search spaces as a foundation of logic programming.- Answer sets and nonmonotonic S4.- Contradiction: When avoidance equals removal Part II.- Cut formulae and logic programming.- Higher-order aspects of logic programming.- Representation and inference with consistent temporal propositions.- Definitional reflection and the completion.- Linear logic semantics for Concurrent Prolog.
Produktsicherheitsverordnung
Hersteller:
Springer Verlag GmbH
juergen.hartmann@springer.com
Tiergartenstr. 17
DE 69121 Heidelberg