Sciweavers

49 search results - page 4 / 10
» On Market-Inspired Approaches to Propositional Satisfiabilit...
Sort
View
SIGSOFT
2003
ACM
14 years 7 days ago
Fluent model checking for event-based systems
Model checking is an automated technique for verifying that a system satisfies a set of required properties. Such properties are typically expressed as temporal logic formulas, in...
Dimitra Giannakopoulou, Jeff Magee
ECAI
2008
Springer
13 years 8 months ago
Vivifying Propositional Clausal Formulae
Abstract. In this paper, we present a new way to preprocess Boolean formulae in Conjunctive Normal Form (CNF). In contrast to most of the current pre-processing techniques, our app...
Cédric Piette, Youssef Hamadi, Lakhdar Sais
IJISEC
2008
101views more  IJISEC 2008»
13 years 7 months ago
SAT-based model-checking for security protocols analysis
We present a model checking technique for security protocols based on a reduction to propositional logic. At the core of our approach is a procedure that, given a description of th...
Alessandro Armando, Luca Compagna
FLAIRS
2009
13 years 4 months ago
A Knowledge Compilation Technique for ALC Tboxes
Knowledge compilation is a common technique for propositional logic knowledge bases. A given knowledge base is transformed into a normal form, for which queries can be answered ef...
Ulrich Furbach, Heiko Günther, Claudia Oberma...
FROCOS
2007
Springer
13 years 11 months ago
From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain
In the last two decades we have witnessed an impressive advance in the efficiency of propositional satisfiability techniques (SAT), which has brought large and previously-intractab...
Roberto Sebastiani