Superposition with simplification as a decision procedure for the monadic class 
with equality

Bachmair, Leo; Ganzinger, Harald; Waldmann, Uwe

doi:doi.org/10.1007/BFb0022557

アイテム詳細

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

一時保存へ追加

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

公開

会議論文

Superposition with simplification as a decision procedure for the monadic class with equality

MPS-Authors

/persons/resource/persons44055

Bachmair, Leo
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons44474

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

/persons/resource/persons45689

Waldmann, Uwe
Automation of Logic, MPI for Informatics, Max Planck Society;
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/ds5Dx
(出版社版)

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., & Waldmann, U. (1993). Superposition with simplification as a decision procedure for the monadic class with equality. In G., Gottlob, A., Leitsch, & D., Mundici (Eds.), Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, KGC'93 (pp. 83-96). Berlin, Germany: Springer.

引用: https://hdl.handle.net/11858/00-001M-0000-0014-ADE9-2

要旨

We show that superposition, a restricted form of paramodulation, can be
combined with specifically designed simplification rules such that it becomes a
decision procedure for the monadic class with equality. The completeness of the
method follows from a general notion of redundancy for clauses and
superposition inferences.