Filters








19 Hits in 2.3 sec

Reusing CSP Propagators for QCSPs [chapter]

Marco Benedetti, Arnaud Lallouet, Jérémie Vautard
Lecture Notes in Computer Science  
In this paper, instead of designing specific consistency operators for constraints w.r.t each possible quantification pattern, we propose to build them by relying on classical existential propagators and  ...  It allows to reuse a large set of constraints already carefully implemented in existing solvers.  ...  QCSPs and CSPs are close enough to allow to reuse most of the technology, including local consistency.  ... 
doi:10.1007/978-3-540-73817-6_4 dblp:conf/csclp/BenedettiLV06 fatcat:lzzqhg736jah5mu7papraj7fee

QCSP Made Practical by Virtue of Restricted Quantification

Marco Benedetti, Arnaud Lallouet, Jérémie Vautard
2007 International Joint Conference on Artificial Intelligence  
Restricted quantifiers turn out to be a convenient solution to the crippling modeling issues we encounter in QCSP and-surprisinglythey help to reuse propagation technology and to prune the search space  ...  The QCSP + language we introduce extends the framework of Quantified Constraint Satisfaction Problems (QCSPs) by enabling us to neatly express restricted quantifications via a chain of nested CSPs to be  ...  What is peculiar to QCSP + is exactly the way this propagation operates, and the way it builds on top of standard CSP propagation.  ... 
dblp:conf/ijcai/BenedettiLV07 fatcat:udpecx7cwnhoxdwvn43litmcyi

Non-binary quantified CSP: algorithms and modelling

Peter Nightingale
2009 Constraints  
The Quantified Constraint Satisfaction Problem (QCSP) extends classical CSP in a way which allows reasoning about uncertainty. In this paper I present novel algorithms for solving QCSP.  ...  These contribute to the art of modelling in QCSP, and are a proof of concept for applying QCSP methods to complex, realistic problems.  ...  I would like to thank EPSRC for providing the funding for this work through a doctoral training grant and grant number EP/E030394/1.  ... 
doi:10.1007/s10601-009-9068-1 fatcat:plyelr46xza4vamqefwtpqq7cu

Value ordering for quantified CSPs

David Stynes, Kenneth N. Brown
2008 Constraints  
We investigate the use of value ordering in backtracking search for Quantified Constraint Satisfaction problems (QCSPs). We consider two approaches for ordering heuristics.  ...  In particular, we give instantiations of this approach using QCSP-Solve's pure-value rule Gent et al. (QCSP-solve: A solver for quantified constraint satisfaction problems.  ...  Acknowledgements We wish to thank IRCSET and Microsoft for their financial support, Youssef Hamadi and Lucas Bordeaux for their comments, and the anonymous referees for their constructive suggestions.  ... 
doi:10.1007/s10601-008-9052-1 fatcat:56nxxtim3bhvxnxhliulsbhtue

Beyond QCSP for Solving Control Problems [chapter]

Cédric Pralet, Gérard Verfaillie
2011 Lecture Notes in Computer Science  
This paper shows that for a quite large class of such problems, using standard QCSP or QCSP+ is not the best approach.  ...  for winning strategies defined as "memoryfull" policy trees instead of winning strategies defined as "memoryless" mappings from states to decisions.  ...  Whereas Queso uses techniques called pure value rules and constraint propagation for reified disjunction constraints, the limited constraint propagation performed by Dyncode reduces computation times.  ... 
doi:10.1007/978-3-642-23786-7_56 fatcat:4vxkvpopkbez3bc56zkbtjzsqy

The Complexity of Quantified Constraint Satisfaction Problems under Structural Restrictions

Georg Gottlob, Gianluigi Greco, Francesco Scarcello
2005 International Joint Conference on Artificial Intelligence  
On the negative side, we prove that checking QCSP satisfiability remains PSPACE-hard for all known structural properties more general than bounded treewidth and for the incomparable hypergraph acyclicity  ...  We give a clear picture of the tractability/intractability frontier for quantified constraint satisfaction problems (QCSPs) under structural restrictions.  ...  ., quantified variables are not reused.  ... 
dblp:conf/ijcai/GottlobGS05 fatcat:no5gfcorsfhrvf7ea7tf2bodim

Weighted Constraint Satisfaction Problems with Min-Max Quantifiers

Jimmy H.M. Lee, Terrence W.K. Mak, Justin Yip
2011 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence  
Restricting our attention to only QWCSPs, we show empirically that our proposed solving techniques can better exploit problem characteristics than those developed for QCOP/QCOP+.  ...  We reuse the definition of firstx(P) defined in QCSPs.  ...  We also thank Ian Gent for giving us QCSP-Solve, which serves as a basis for our solver. independently, however, defies opportunities for exploiting global problem structure and characteristics, and reuse  ... 
doi:10.1109/ictai.2011.121 dblp:conf/ictai/LeeMY11 fatcat:ue7rydihdrebllm6g5pjgoes5y

Containment, Equivalence and Coreness from CSP to QCSP and Beyond [chapter]

Florent Madelaine, Barnaby Martin
2012 Lecture Notes in Computer Science  
The constraint satisfaction problem (CSP) and its quantified extensions, whether without (QCSP) or with disjunction (QCSP ∨ ), correspond naturally to the model checking problem for three increasingly  ...  One can also ask for a smallest possible equivalent template: this is known as the core for CSP.  ...  From the perspective of computational complexity of CSP and QCSP, this distinction is unimportant as equalities may be propagated out by substitution.  ... 
doi:10.1007/978-3-642-33558-7_36 fatcat:3dw4ug4e7vfkrba445hdzg2fmq

Containment, Equivalence and Coreness from CSP to QCSP and beyond [article]

Florent Madelaine, Barnaby Martin
2012 arXiv   pre-print
The constraint satisfaction problem (CSP) and its quantified extensions, whether without (QCSP) or with disjunction (QCSP_or), correspond naturally to the model checking problem for three increasingly  ...  One can also ask for a smallest possible equivalent template: this is known as the core for CSP.  ...  From the perspective of computational complexity of CSP and QCSP, this distinction is unimportant as equalities may be propagated out by substitution.  ... 
arXiv:1204.5981v1 fatcat:udlc5zynlzhepgtfddhjikfchq

Consistencies for Ultra-Weak Solutions in Minimax Weighted CSPs Using the Duality Principle [chapter]

Arnaud Lallouet, Jimmy H. M. Lee, Terrence W. K. Mak
2012 Lecture Notes in Computer Science  
CSPs.  ...  Minimax Weighted Constraint Satisfaction Problems (formerly called Quantified Weighted CSPs) are a framework for modeling soft constrained problems with adversarial conditions.  ...  Similar to cascade propagation [2] in CSPs, a value of a variable being pruned may trigger prunings of other values in other variables and re-computation of the lbaf() and ubaf() functions.  ... 
doi:10.1007/978-3-642-33558-7_29 fatcat:shazybmrwbcbnauebdz5ox4j7y

Algebraic Properties of Qualitative Spatio-temporal Calculi [chapter]

Frank Dylla, Till Mossakowski, Thomas Schneider, Diedrich Wolter
2013 Lecture Notes in Computer Science  
In this paper we identify the minimal requirements to binary spatio-temporal calculi and we discuss the relevance of the according axioms for representation and reasoning.  ...  Acknowledgments: We would like to thank Immo Colonius, Arne Kreutzmann, Jae Hee Lee, André Scholz and Jasper van de Ven for inspiring discussions during the "spatial reasoning tea time".  ...  Several techniques originally developed for finite domain CSP can be adapted to spatio-temporal QCSPs.  ... 
doi:10.1007/978-3-319-01790-7_28 fatcat:3jw2wvnm7jed3oesw2dbxfpom4

Algebraic Properties of Qualitative Spatio-Temporal Calculi [article]

Frank Dylla, Till Mossakowski, Thomas Schneider, Diedrich Wolter
2013 arXiv   pre-print
In this paper we identify the minimal requirements to binary spatio-temporal calculi and we discuss the relevance of the according axioms for representation and reasoning.  ...  Acknowledgments: We would like to thank Immo Colonius, Arne Kreutzmann, Jae Hee Lee, André Scholz and Jasper van de Ven for inspiring discussions during the "spatial reasoning tea time".  ...  Several techniques originally developed for finite domain CSP can be adapted to spatio-temporal QCSPs.  ... 
arXiv:1305.7345v2 fatcat:pgqhgdofszg4pgfmeyy5zrf2yq

Ultra-weak solutions and consistency enforcement in minimax weighted constraint satisfaction

Arnaud Lallouet, Jimmy H. M. Lee, Terrence W. K. Mak, Justin Yip
2014 Constraints  
discuss in depth our novel definitions and implementations of node, arc and full directional arc consistency notions to help reduce search space on top of the basic tree search with alpha-beta pruning for  ...  In particular, these consistencies approximate the lower and upper bounds of the cost of a problem by exploiting the semantics of the quantifiers and reusing techniques from both Weighted and Quantified  ...  One potential drawback in our definition for normalized form is that we cannot reuse the valuation structure for WCSPs (or the valuation structure for dual problem) to bound costs within [0..k] (or [−k  ... 
doi:10.1007/s10601-014-9174-6 fatcat:ju7oma62fnahzlg56t3zdsitwa

Constraint Games: Framework and Local Search Solver

Thi-Van-Anh Nguyen, Arnaud Lallouet, Lucas Bordeaux
2013 2013 IEEE 25th International Conference on Tools with Artificial Intelligence  
Game theory is a highly successful paradigm for strategic decision making between multiple agents having conflicting objectives.  ...  Indeed, the main representation for general games is still a n-dimensional matrix of exponential size called normal form.  ...  An important point is that our solver accepts all constraints provided by Choco, and reuses the constraint propagators already present in the library.  ... 
doi:10.1109/ictai.2013.146 dblp:conf/ictai/NguyenLB13 fatcat:vw5tnrqfjzccfpq5h2mr2jfnmi

An Algebraic Graphical Model for Decision with Uncertainties, Feasibilities, and Utilities

C. Pralet, G. Verfaillie, T. Schiex
2007 The Journal of Artificial Intelligence Research  
A natural decision-tree semantics for such queries is completed by an equivalent operational semantics, which induces generic algorithms.  ...  In this article, we introduce an algebraic graphical model that encompasses a large number of such formalisms: (1) we first adapt previous structures from Friedman, Chu and Halpern for representing uncertainty  ...  Acknowledgments We would like to thank Jean-Loup Farges, Jérôme Lang, Régis Sabbadin, and the three anonymous reviewers for useful comments on previous versions of this article. The work  ... 
doi:10.1613/jair.2151 fatcat:upnkvhtzf5af7aju26c6lo77ue
« Previous Showing results 1 — 15 out of 19 results