Blick ins Buch

Extensions of Logic Programming

Third International Workshop, ELP '92, Bologna, Italy, February 26-28, 1992. Proceedings

Evelina Lamma, Paola Mello (Herausgeber)

Buch | Softcover

X, 426 Seiten

1993 | 1993
Springer Berlin (Verlag)
978-3-540-56454-6 (ISBN)

Lese- und Medienproben

Inhaltsverzeichnis (PDF)

Artikel merken

This book contains papers which investigate how to extendlogic programming toward the artificial intelligence andsoftware engineering areas, covering both theoretical andpractical aspects. Some papers investigate topics such asabductive reasoning and negation. Some works discuss how toenhance the expressive power of logic programming byintroducing constraints, sets, and integration withfunctional programming. Other papers deal with thestructuring of knowledge into modules, taxonomies, andobjects, withthe aim of extending logic programming towardsoftware engineering applications. A section is devoted topapers concentrating on proof theory and inspired byGentzen-style sequent or natural deduction systems. Topicssuch as concurrency are considered to enhance the expressivepower of logic languages. Finally, some papers mainlyconcernimplementation techniques for some of these logicprogramming extensions.

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.

Erscheint lt. Verlag	12.2.1993
Reihe/Serie	Lecture Notes in Artificial Intelligence
Reihe/Serie	Lecture Notes in Computer Science
Zusatzinfo	X, 426 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	571 g
Themenwelt	Mathematik / Informatik ► Informatik ► Software Entwicklung
	Informatik ► Theorie / Studium ► Compilerbau
	Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik
Schlagworte	abductive reasoning • Artificial Intelligence • Automatisches Beweisen • Automatisches Beweisverfahren • Constraint • Deduction • Deduktion • extension • Functional Programming • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • HC/Informatik, EDV/Programmiersprachen • Intelligence • Knowledge • Künstliche Intelligenz • Logic • Logic Programming • Logische Programmierung • Logisches Programmieren • Mathematische Logik • NATURAL • Programmiersprache • Programmiersprachen • programming • Programming Languages • Proof theory • Software • Software engineering • Softwaresysteme • Software systems • Theorem-Proving • Turing
ISBN-10	3-540-56454-3 / 3540564543
ISBN-13	978-3-540-56454-6 / 9783540564546
Zustand	Neuware