4513 search results - page 349 / 903 » Logic programming with satisfiability |
136
click to vote
SAT
2005
Springer
15 years 10 months ago
2005
Springer
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...
136
click to vote
VTS
1995
IEEE
15 years 8 months ago
1995
IEEE
This paper presents a new approach for on-chip test pattern generation. The set of test patterns generated by a pseudo-random pattern generator (e.g., an LFSR) is transformed into...
155
click to vote
SAC
2010
ACM
15 years 2 months ago
2010
ACM
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a program with respect to a specification. The technique of checking software properti...
146
click to vote
ICFP
2003
ACM
16 years 4 months ago
2003
ACM
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present proach based on the use of higher-order abstract syntax and...
149
click to vote
FOSSACS
2006
Springer
15 years 8 months ago
2006
Springer
We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The ...