339 search results - page 5 / 68 » Universality Results for Models in Locally Boolean Domains |
SAT
2005
Springer
14 years 29 days ago
2005
Springer
Advances in SAT solver technology have enabled many automated analysis and reasoning tools to reduce their input problem to a SAT problem, and then to use an efficient SAT solver ...
DATE
1999
IEEE
13 years 11 months ago
1999
IEEE
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation, It finds application in test pattern generation, delay-fault testing, combinational equivalen...
PLDI
2009
ACM
14 years 2 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
SDM
2010
SIAM
13 years 9 months ago
2010
SIAM
Given a collection of Boolean spatio-temporal(ST) event types, the cascading spatio-temporal pattern (CSTP) discovery process finds partially ordered subsets of event-types whose ...
CLEF
2006
Springer
13 years 11 months ago
2006
Springer
This paper describes our participation in the GeoCLEF monolingual English task of the Cross Language Evaluation Forum 2006. The main objective of this study is to evaluate the retr...