Extensions of Logic Programming
International Workshop, Tübingen, FRG, December 8-10,1989.Proceedings, Lecture Notes in Computer Science 475 - Lecture Notes in Artificial Intelligence
Erschienen am
12.02.1991
Beschreibung
InhaltsangabeLogic programming with sequent systems.- Predicates as parameters in logic programming.- A survey of GCLA: A definitional approach to logic programming.- Some applications of Gentzen's proof theory in automated deduction.- A logic program for transforming sequent proofs to natural deduction proofs.- Modal provability foundations for negation by failure.- Extensions to logic programming motivated by the construction of a generic theorem prover.- A decision procedure for propositional N-Prolog.- A logic programming language with lambda-abstraction, function variables, and simple unification.- Logic programming, functional programming, and inductive definitions.- Logic programming with strong negation.- Hypothetical reasoning and definitional reflection in logic programming.- Non-monotonicity and conditionals in dialogue logic.
Produktsicherheitsverordnung
Hersteller:
Springer Verlag GmbH
juergen.hartmann@springer.com
Tiergartenstr. 17
DE 69121 Heidelberg