Perfect Model Semantics for Logic Programs with Equality

Bachmair, Leo; Ganzinger, Harald

アイテム詳細

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

一時保存へ追加

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

公開

会議論文

Perfect Model Semantics for Logic Programs with Equality

MPS-Authors

/persons/resource/persons44474

Ganzinger, Harald
Programming Logics, MPI for Informatics, Max Planck Society;

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

引用

Bachmair, L., & Ganzinger, H. (1991). Perfect Model Semantics for Logic Programs with Equality. In Logic Programming (pp. 645-659). Cambridge, Mass.: MIT Press.

引用: https://hdl.handle.net/11858/00-001M-0000-0023-CED2-7

要旨

We develop a perfect model semantics for logic programs with negation and
equality. Our approach is based on ordered rewriting, a fundamental technique
used in equational programming. A logic program in our sense is a set of
first-order clauses with equality together with a well-founded ordering on
terms and atoms. We show that any consistent logic program has a unique perfect
model, provided the ordering is total on ground expressions. The key to this
result is a notion of saturation of a set of formulas (under certain inference
rules) together with a related concept of redundancy. Our techniques can be
applied to Prolog-programs (without equality), in which case a class of
programs can be characterized via the notion of stratification up to redundancy
for which unique perfect models exist. This extends previous results on (local
and weak) stratification.