248 search results - page 22 / 50 » Circuit-based Boolean Reasoning |
DAC
2006
ACM
14 years 9 months ago
2006
ACM
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
KR
2004
Springer
14 years 1 months ago
2004
Springer
To support commonsense reasoning about space, we require a qualitative calculus of spatial entities and their relations. One requirement for such a calculus, which has not so far ...
IJCAI
1993
13 years 9 months ago
1993
The Dempster-Shafer theory gives a solid basis for reasoning applications characterized by uncertainty. A key feature of the theory is that propositions are represented as subsets...
CADE
2009
Springer
14 years 8 months ago
2009
Springer
This paper is concerned with the problem of checking whether a given subset of an unsatisfiable Boolean CNF formula takes part in the basic causes of the inconsistency of . More ...
ASPDAC
2005
ACM
13 years 10 months ago
2005
ACM
- We address the problem of implication of assertion graphs that occur in generalized symbolic trajectory evaluation (GSTE). GSTE has demonstrated its powerful capacity in formal v...