168 search results - page 11 / 34 » On Models for Quantified Boolean Formulas |
AAAI
2006
13 years 9 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...
CC
2010
Springer
13 years 5 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...
SIGSOFT
2000
ACM
13 years 12 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...
FSEN
2007
Springer
13 years 11 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...
SIAMCOMP
2010
13 years 2 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 ...