基本説明
Subseries: Lecture Notes in Artificial Intelligence.
Full Description
This book contains papers which investigate how to extend
logic programming toward the artificial intelligence and
software engineering areas, covering both theoretical and
practical aspects. Some papers investigate topics such as
abductive reasoning and negation. Some works discuss how to
enhance the expressive power of logic programming by
introducing constraints, sets, and integration with
functional programming. Other papers deal with the
structuring of knowledge into modules, taxonomies, and
objects, withthe aim of extending logic programming toward
software engineering applications. A section is devoted to
papers concentrating on proof theory and inspired by
Gentzen-style sequent or natural deduction systems. Topics
such as concurrency are considered to enhance the expressive
power of logic languages. Finally, some papers mainly
concernimplementation techniques for some of these logic
programming extensions.
Contents
SLWV — A theorem prover for logic programming.- A Correct goal-directed proof procedure for a general logic program with integrity constraints.- Declarative semantics of hypothetical logic programming with negation as failure.- Conditional narrowing with constructive negation.- CLP $$(\mathcal{A}\mathcal{D})$$ as a deductive database language with updates.- Logic programming with functions over order-sorted feature terms.- A direct semantic characterization of RELFUN.- Embedding finite sets in a logic programming language.- A modal framework for structured logic programs.- Metalogic for state oriented programming.- On the semantics of inheritance in logic programming: Compositionality and full abstraction.- The abstract scheme for concurrent programming.- The ?-calculus as a theory in linear logic: Preliminary results.- Natural deduction proof theory for logic programming.- A typed foundation for directional logic programming.- An architecture for Prolog extensions.- Techniques for implementing contexts in Logic Programming.- Implementing a notion of modules in the logic programming language ?Prolog.- Implementational issues in GCLA: A-sufficiency and the definiens operation.
