Boolean satisfiability with transitivity constraints
نویسندگان
چکیده
منابع مشابه
Satisfiability of Boolean Formulas over Linear Constraints
Test ing the sat is f iabi l i ty of a Boolean fo rmu la over l inear constraints is not a s imple ma t ter. Ex is t ing AI systems handle tha t k ind o f problems w i t h a general proof method for their Boolean parts and a separate module for comb in ing l inear constraints. On the contrary, t rad i t i ona l operat ions research methods need the prob lem to be t ransformed, and solved w i t ...
متن کاملModel checking with Boolean Satisfiability
The evolution of SAT algorithms over the last decade has motivated the application of SAT to model checking, initially through the use of SAT in bounded model checking and, more recently, in unbounded model checking. This paper provides an overview of modern SAT algorithms, SAT-based bounded model checking and some of the most promising approaches for unbounded model checking, namely induction ...
متن کاملHaplotype Inference with Boolean Satisfiability
Mutation in DNA is the principal cause for differences among human beings, and Single Nucleotide Polymorphisms (SNPs) are the most common mutations. Hence, a fundamental task is to complete a map of haplotypes (which identify SNPs) in the human population. Associated with this effort, a key computational problem is the inference of haplotype data from genotype data, since in practice genotype d...
متن کاملBoolean Ring Satisfiability
We propose a method for testing satisfiability based on Boolean rings. It makes heavy use of simplification, but avoids the potential size increase associated with application of the distributive law by employing a combined linear and binomial representation. Several complexity results suggest why the method may be relatively effective in many cases. The framework is also amenable to learning f...
متن کاملSymmetry in Boolean Satisfiability
This paper reviews recent approaches on how to accelerate Boolean Satisfiability (SAT) search by exploiting symmetries in the problem space. SAT search algorithms traverse an exponentially large search space looking for an assignment that satisfies a set of constraints. The presence of symmetries in the search space induces equivalence classes on the set of truth assignments. The goal is to use...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2002
ISSN: 1529-3785,1557-945X
DOI: 10.1145/566385.566390