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.
Author(s): Luís Moniz Pereira, Luis Caires, José Alferes (auth.), E. Lamma, P. Mello (eds.)
Series: Lecture Notes in Computer Science 660 : Lecture Notes in Artificial Intelligence
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1993
Language: English
Pages: 426
Tags: Programming Techniques; Artificial Intelligence (incl. Robotics)
SLWV — A theorem prover for logic programming....Pages 1-23
A Correct goal-directed proof procedure for a general logic program with integrity constraints....Pages 24-44
Declarative semantics of hypothetical logic programming with negation as failure....Pages 45-58
Conditional narrowing with constructive negation....Pages 59-79
CLP $$(\mathcal{A}\mathcal{D})$$ as a deductive database language with updates....Pages 80-99
Logic programming with functions over order-sorted feature terms....Pages 100-119
A direct semantic characterization of RELFUN....Pages 120-149
Embedding finite sets in a logic programming language....Pages 150-167
A modal framework for structured logic programs....Pages 168-186
Metalogic for state oriented programming....Pages 187-204
On the semantics of inheritance in logic programming: Compositionality and full abstraction....Pages 205-215
The abstract scheme for concurrent programming....Pages 216-241
The π-calculus as a theory in linear logic: Preliminary results....Pages 242-264
Natural deduction proof theory for logic programming....Pages 265-281
A typed foundation for directional logic programming....Pages 282-318
An architecture for Prolog extensions....Pages 319-338
Techniques for implementing contexts in Logic Programming....Pages 339-358
Implementing a notion of modules in the logic programming language λProlog....Pages 359-393
Implementational issues in GCLA: A-sufficiency and the definiens operation....Pages 394-417
