1242 search results - page 57 / 249 » The Theory of Grammar Constraints |
144
click to vote
AAAI
2006
15 years 7 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...
158
click to vote
ATAL
2003
Springer
15 years 11 months ago
2003
Springer
In our previous research we suggested an approach to maximizing agents preferences over schedules of multiple tasks with temporal and precedence constraints. The proposed approach...
161
click to vote
IJCIS
1998
15 years 5 months ago
1998
The problem of integrating information from con icting sources comes up in many current applications, such as cooperative information systems, heterogeneous databases, and multi-a...
186
click to vote
VSTTE
2012
Springer
14 years 1 months ago
2012
Springer
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functio...
148
click to vote
STACS
2009
Springer
16 years 27 days ago
2009
Springer
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of...