168 search results - page 11 / 34 » On Models for Quantified Boolean Formulas |
129
Voted
AAAI
2006
15 years 6 months ago
2006
Some search problems are most directly specified by boolean combinations of pseudo-boolean constraints. We study a logic PL(PB) whose formulas are of this form, and design local-s...
205
Voted
CC
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
128
click to vote
SIGSOFT
2000
ACM
15 years 9 months ago
2000
ACM
An automatic analysis method for first-order logic with sets and relations is described. A first-order formula is translated to a quantifier-free boolean formula, which has a mode...
143
click to vote
FSEN
2007
Springer
15 years 8 months ago
2007
Springer
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulae. Test cases are modeled as ground formulae and any spe...
131
click to vote
SIAMCOMP
2010
14 years 11 months ago
2010
An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities. We ...