Comparing Instance Generation Methods for Automated Reasoning

Jacobs, Swen; Waldmann, Uwe

アイテム詳細

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

一時保存へ追加

このアイテムの新しいバージョンが利用可能です:
https://pure.mpg.de/pubman/item/item_1329198_4

詳細要約

公開

会議論文

Comparing Instance Generation Methods for Automated Reasoning

MPS-Authors

/persons/resource/persons44687

Jacobs, Swen
Automation of Logic, MPI for Informatics, Max Planck Society;

/persons/resource/persons45689

Waldmann, Uwe
Automation of Logic, 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

引用

Jacobs, S., & Waldmann, U. (2005). Comparing Instance Generation Methods for Automated Reasoning. In B., Beckert (Ed.), Automated Reasoning with Analytic Tableaux and Related Methods: International Conference, TABLEAUX 2005 (pp. 153-168). Berlin, Germany: Springer.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-2894-D

要旨

The clause linking technique of Lee and Plaisted proves the unsatisfiability of a set of first-order clauses by generating a sufficiently large set of instances of these clauses that can be shown to be propositionally unsatisfiable. In recent years, this approach has been refined in several directions, leading to both tableau-based methods, such as the Disconnection Tableau Calculus, and saturation-based methods, such as Primal Partial Instantiation and Resolution-based Instance Generation. We investigate the relationship between these calculi and answer the question to what extent refutation or consistency proofs in one calculus can be simulated in another one.