Sciweavers

1589 search results - page 83 / 318
» Constraints with Variables' Annotations
Sort
View
CP
2006
Springer
14 years 16 days ago
: A Bottom-Up Approach for Solving Quantified CSPs
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
Guillaume Verger, Christian Bessière
AAAI
1994
13 years 10 months ago
Dead-End Driven Learning
The paper evaluates the eectiveness of learning for speeding up the solution of constraint satisfaction problems. It extends previous work (Dechter 1990) by introducing a new and ...
Daniel Frost, Rina Dechter
FOSSACS
2008
Springer
13 years 10 months ago
What Else Is Decidable about Integer Arrays?
We introduce a new decidable logic for reasoning about infinite arrays of integers. The logic is in the first-order fragment and allows (1) Presburger constraints on existentially...
Peter Habermehl, Radu Iosif, Tomás Vojnar
AAAI
2006
13 years 10 months ago
Temporal Preference Optimization as Weighted Constraint Satisfaction
We present a new efficient algorithm for obtaining utilitarian optimal solutions to Disjunctive Temporal Problems with Preferences (DTPPs). The previous state-of-the-art system ac...
Michael D. Moffitt, Martha E. Pollack
JIB
2007
95views more  JIB 2007»
13 years 8 months ago
Integration of constraints documented in SBML, SBO, and the SBML Manual facilitates validation of biological models
The creation of quantitative, simulatable, Systems Biology Markup Language (SBML) models that accurately simulate the system under study is a time-intensive manual process that re...
Allyson L. Lister, Matthew R. Pocock, Anil Wipat