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

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

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

学術論文

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

MPS-Authors

There are no MPG-Authors in the publication available

External Resource

There are no locators available

Fulltext (restricted access)

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

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

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.

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

要旨

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.