248 search results - page 38 / 50 » Circuit-based Boolean Reasoning |
SCP
2008
13 years 9 months ago
2008
This paper shows that program algebra (PGA) [8] offers a mathematical and systematic framework for reasoning about correctness and equivalence of algorithms and transformation rul...
JCST
2000
13 years 9 months ago
2000
A review of current computer-aided technologies in design and product development, the evolution of CAD modeling, and a framework of multi-volume CAD modeling system for heterogen...
LPNMR
1997
Springer
14 years 1 months ago
1997
Springer
This paper introduces power default reasoning (PDR), a framework for nonmonotonic reasoning based on the domain-theoretic idea of modeling default rules with partial-information i...
CADE
2002
Springer
14 years 9 months ago
2002
Springer
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
CADE
2009
Springer
14 years 4 months ago
2009
Springer
predicate abstraction Shuvendu K. Lahiri and Shaz Qadeer Microsoft Research In this paper, we investigate the asymptotic complexity of various predicate abstraction problems relati...