Satisfiability Checking with Difference Constraints

Cotton, Scott

アイテム詳細

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

一時保存へ追加

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

詳細要約

公開

学位論文

Satisfiability Checking with Difference Constraints

MPS-Authors

/persons/resource/persons44265

Cotton, Scott
International Max Planck Research School, 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

引用

Cotton, S. (2005). Satisfiability Checking with Difference Constraints. Master Thesis, Universität des Saarlandes, Saarbrücken.

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

要旨

This thesis studies the problem of determining the satisfiability of a Boolean combination of binary difference constraints of the form x-y <= c where x and y are numeric variables and c is a constant. In particular, we present an incremental and model-based interpreter for the theory of difference constraints in the context of a generic Boolean satisfiability checking procedure capable of incorporating interpreters for arbitrary theories. We show how to use the model based approach to efficiently make inferences with the option of complete inference.