Sciweavers

42 search results - page 8 / 9
» Algorithms for computing backbones of propositional formulae
Sort
View
131
Voted
DAC
2006
ACM
16 years 4 months ago
Predicate learning and selective theory deduction for a difference logic solver
Design and verification of systems at the Register-Transfer (RT) or behavioral level require the ability to reason at higher levels of abstraction. Difference logic consists of an...
Chao Wang, Aarti Gupta, Malay K. Ganai
163
Voted
JAR
2000
145views more  JAR 2000»
15 years 3 months ago
Logical Cryptanalysis as a SAT Problem
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
Fabio Massacci, Laura Marraro
158
Voted
WOLLIC
2010
Springer
15 years 8 months ago
Modal Logics with Counting
Abstract. We present a modal language that includes explicit operators to count the number of elements that a model might include in the extension of a formula, and we discuss how ...
Carlos Areces, Guillaume Hoffmann, Alexandre Denis
140
Voted
AAAI
2006
15 years 5 months ago
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
Tarik Hadzic, Henrik Reif Andersen
147
Voted
FMCAD
2004
Springer
15 years 7 months ago
Memory Efficient All-Solutions SAT Solver and Its Application for Reachability Analysis
This work presents a memory-efficient All-SAT engine which, given a propositional formula over sets of important and non-important variables, returns the set of all the assignments...
Orna Grumberg, Assaf Schuster, Avi Yadgar