248 search results - page 13 / 50 » Circuit-based Boolean Reasoning |
COLING
2000
13 years 9 months ago
2000
A reasonably simple, domain-independent, large-scale approach of lexictd semantics to paraphrase recognition is presented in this paper. It relies on the enrichment of morphosynta...
SAS
2005
Springer
14 years 1 months ago
2005
Springer
We show that the idea of predicates on heap objects can be cast in the framework of predicate abstraction. This leads to an alternative view on the underlying concepts of three-val...
CADE
2008
Springer
14 years 8 months ago
2008
Springer
Bit vectors and bit operations are proposed for efficient propositional inference. Bit arithmetic has efficient software and hardware implementations, which can be put to advantage...
JAIR
2006
13 years 7 months ago
2006
Resolution is the rule of inference at the basis of most procedures for automated reasoning. In these procedures, the input formula is first translated into an equisatisfiable for...
JSAT
2006
13 years 7 months ago
2006
In this paper, we describe and evaluate three different techniques for translating pseudoboolean constraints (linear constraints over boolean variables) into clauses that can be h...