Sciweavers

248 search results - page 9 / 50
» Circuit-based Boolean Reasoning
Sort
View
CAV
2009
Springer
209views Hardware» more  CAV 2009»
14 years 8 months ago
Static and Precise Detection of Concurrency Errors in Systems Code Using SMT Solvers
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
Shuvendu K. Lahiri, Shaz Qadeer, Zvonimir Rakamari...
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 8 months ago
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIMEcomplete in the presence of unrestricted axioms. Sev...
Arne Meier, Thomas Schneider 0002
VIIP
2001
13 years 9 months ago
Boolean 2D Shape Similarity for Surface Reconstruction
Surface reconstruction problem (SRP) from planar samples has been traditionally approached by either (i) using local proximity between data points in adjacent layers, or by (ii) c...
Oscar E. Ruiz, Carlos A. Cadavid
AI
2000
Springer
13 years 7 months ago
Boolean connection algebras: A new approach to the Region-Connection Calculus
The Region-Connection Calculus (RCC) is a well established formal system for qualitative spatial reasoning. It provides an axiomatization of space which takes regions as primitive...
John G. Stell
SAT
2005
Springer
142views Hardware» more  SAT 2005»
14 years 1 months ago
Optimizations for Compiling Declarative Models into Boolean Formulas
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 ...
Darko Marinov, Sarfraz Khurshid, Suhabe Bugrara, L...