260 search results - page 11 / 52 » Blocked Clause Elimination |
SAT
2009
Springer
14 years 2 months ago
2009
Springer
We use the notion of boundary points to study resolution proofs. Given a CNF formula F, a lit(x)-boundary point is a complete assignment falsifying only clauses of F having the sam...
VMCAI
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. It is a hotly researching topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. K Ravi proposes a two-stages counterexample min...
ICIP
2007
IEEE
14 years 2 months ago
2007
IEEE
Block based motion compensation techniques make frequent use of Early Termination Algorithms (ETA) to reduce the computational cost of block matching process. ETAs have been well ...
ICLP
1987
Springer
13 years 11 months ago
1987
Springer
The Near-Horn Prolog procedures have been proposed as e ective procedures in the area of disjunctive logic programming, an extension of logic programming to the ( rstorder) non-Ho...
ASPDAC
2005
ACM
13 years 9 months ago
2005
ACM
– We propose a System-on-Chip (SoC) architecture for reconfigurable applications based on the AMBA HighSpeed Bus (AHB). The architecture features multiple low-area flyby DMA bloc...