Extending Existential Quantification in Conjunctions of BDDs
نویسندگان
چکیده
منابع مشابه
Extending Existential Quantification in Conjunctions of BDDs
We introduce new approaches intended to speed up determining the satisfiability of a given Boolean formula φ expressed as a conjunction of Boolean functions. A common practice in such cases, when using constraint-oriented methods, is to represent the functions as BDDs, then repeatedly cluster BDDs containing one or more variables, and finally existentially quantify those variables away from the...
متن کاملInferable Existential Quantification
Abstract interpretation is an excellent tool for designing complete dataflow analyses [6]. Existential quantification is an excellent tool for designing precise dataflow analyses. However, these two tools are difficult to combine. Abstract interpretation requires algorithms for deciding subtypes and constructing joins. This is problematic for existential quantification because simply subtyping ...
متن کاملhex-Programs with Existential Quantification
HEX-programs extend ASP by external sources. In this paper, we present domain-specific existential quantifiers on top of HEX-programs, i.e., ASP programs with external access which may introduce new values that also show up in the answer sets. Pure logical existential quantification corresponds to a specific instance of our approach. Programs with existential quantifiers may have infinite groun...
متن کاملExistential Quantification for Variant Ownership
Ownership types characterize the topology of objects in the heap, through a characterization of the context to which an object belongs. They have been used to support reasoning, memory management, concurrency, etc. Subtyping is traditionally invariant w.r.t. contexts, which has often proven inflexible in some situations. Recent work has introduced restricted forms of subtype variance and unknow...
متن کاملExistential Quantification as Incremental SAT
This paper presents an elegant algorithm for existential quantifier elimination using incremental SAT solving. This approach contrasts with existing techniques in that it is based solely on manipulating the SAT instance rather than requiring any reengineering of the SAT solver or needing an auxiliary data-structure such as a BDD. The algorithm combines model enumeration with the generation of s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal on Satisfiability, Boolean Modeling and Computation
سال: 2006
ISSN: 1574-0617
DOI: 10.3233/sat190004