503 search results - page 50 / 101 » Interpolative Boolean Logic |
101
Voted
DAC
2006
ACM
16 years 1 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...
123
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
93
Voted
APAL
1999
15 years 14 days ago
1999
We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...
115
Voted
CALCO
2005
Springer
15 years 6 months ago
2005
Springer
Every endofunctor B on the category Set can be lifted to a fibred functor on the category (fibred over Set) of equivalence relations and relation-preserving functions. In this pa...
121
click to vote
CCL
1994
Springer
15 years 4 months ago
1994
Springer
Abstract: This paper describes the application of CLP (constraint logic programming) to several digital circuit design problems. It is shown that logic programming together with ef...