Sciweavers

26 search results - page 3 / 6
» Using Boolean Constraint Propagation for Sub-clauses Deducti...
Sort
View
CL
2000
Springer
13 years 10 months ago
Modelling Digital Circuits Problems with Set Constraints
A number of diagnostic and optimisation problems in Electronics Computer Aided Design have usually been handled either by specific tools or by mapping them into a general problem s...
Francisco Azevedo, Pedro Barahona
AI
2010
Springer
13 years 6 months ago
Implementing logical connectives in constraint programming
Combining constraints using logical connectives such as disjunction is ubiquitous in constraint programming, because it adds considerable expressive power to a constraint language...
Christopher Jefferson, Neil C. A. Moore, Peter Nig...
LPAR
2005
Springer
13 years 11 months ago
Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...
Chao Wang, Franjo Ivancic, Malay K. Ganai, Aarti G...
SAT
2007
Springer
81views Hardware» more  SAT 2007»
14 years 12 days ago
Short XORs for Model Counting: From Theory to Practice
Abstract. A promising approach for model counting was recently introduced, which in theory requires the use of large random xor or parity constraints to obtain near-exact counts of...
Carla P. Gomes, Jörg Hoffmann, Ashish Sabharw...
BVAI
2007
Springer
13 years 8 months ago
Logic as Energy: A SAT-Based Approach
This paper presents the implementation of ARQ-PROP II, a limited-depth propositional reasoner, via the compilation of its specification into an exact formulation using the satyrus...
Priscila Machado Vieira Lima, M. Mariela Morveli-E...