KA-Prolog: Erweiterungen einer logischen Programmiersprache und ihre effiziente 
Implementierung

Bockmayr, Alexander; Brzoska, Christoph; Deussen, Peter; Varsek, Igor

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

KA-Prolog: Erweiterungen einer logischen Programmiersprache und ihre effiziente Implementierung

MPS-Authors

There are no MPG-Authors in the publication available

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Bockmayr, A., Brzoska, C., Deussen, P., & Varsek, I. (1991). KA-Prolog: Erweiterungen einer logischen Programmiersprache und ihre effiziente Implementierung. Informatik - Forschung und Entwicklung, 6, 128-140.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0027-A413-F

Abstract

Logic programming is one of the main paradigms in the area of declarative programming. Often it is identified with the programming language Prolog. In this paper we discuss a number of extensions of Prolog that have been investigated in the Sonderforschungsbereich 314 ``Artificial Intelligence - Knowledge-Based Systems'' at the University of Karlsruhe. On the level of unification we extend Prolog's syntactical unification to order-sorted and Boolean unification, on the level of resolution we generalize Prolog's Horn clauses and SLD-Resolution to conditional equations and conditional narrowing. In addition to language extensions themselves we present also methods and tools for their efficient implementation.