77 search results - page 5 / 16 » Testing Basic Boolean Formulae |
SAT
2004
Springer
14 years 3 months ago
2004
Springer
We present a novel expansion based decision procedure for quantified boolean formulas (QBF) in conjunctive normal form (CNF). The basic idea is to resolve existentially quantifie...
DFT
2003
IEEE
14 years 3 months ago
2003
IEEE
In this paper, we propose a new concept of testing only functionally testable transition faults in Broadside Transition testing via a novel constrained ATPG. For each functionally...
IJCAI
2001
13 years 11 months ago
2001
The implementation of effective reasoning tools for deciding the satisfiability of Quantified Boolean Formulas (QBFs) is an important research issue in Artificial Intelligence. Ma...
APAL
2004
13 years 9 months ago
2004
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
SAT
2005
Springer
14 years 3 months ago
2005
Springer
An important extension of satisfiability testing is model-counting, a task that corresponds to problems such as probabilistic reasoning and computing the permanent of a Boolean ma...