2519 search results - page 266 / 504 » Reasoning with Textual Cases |
155
click to vote
CADE
2003
Springer
16 years 7 months ago
2003
Springer
The DPLL procedure is the basis of some of the most successful propositional satisfiability solvers to date. Although originally devised as a proofprocedure for first-order logic, ...
162
click to vote
CADE
2002
Springer
16 years 7 months ago
2002
Springer
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical s...
164
click to vote
PLPV
2010
ACM
16 years 3 months ago
2010
ACM
Type-based reasoning is popular in functional programming. In particular, parametric polymorphism constrains functions in such a way that statements about their behavior can be de...
165
click to vote
AVSS
2009
IEEE
16 years 1 months ago
2009
IEEE
—Demand for bus surveillance is growing due to the increased threats of terrorist attack, vandalism and litigation. However, CCTV systems are traditionally used in forensic mode,...
158
click to vote
ISQED
2009
IEEE
16 years 1 months ago
2009
IEEE
Modern CMOS manufacturing processes have significant variability, which necessitates guard banding to achieve reasonable yield. It is our thesis that variability should be addres...