Filters








18 Hits in 2.5 sec

Value ordering for quantified CSPs

David Stynes, Kenneth N. Brown
2008 Constraints  
(QCSP-solve: A solver for quantified constraint satisfaction problems. In Proceedings of IJCAI, pp. 138-143, 2005).  ...  We investigate the use of value ordering in backtracking search for Quantified Constraint Satisfaction problems (QCSPs). We consider two approaches for ordering heuristics.  ...  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

BlockSolve: A Bottom-Up Approach for Solving Quantified CSPs [chapter]

Guillaume Verger, Christian Bessiere
2006 Lecture Notes in Computer Science  
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 CSP formalism.  ...  An experimental study shows the good performance of BlockSolve compared to a state of the art QCSP solver.  ...  Acknowledgements We are very grateful to Kostas Stergiou, Peter Nightingale and Ian Gent, who kindly provided us with the code of QCSP-Solve.  ... 
doi:10.1007/11889205_45 fatcat:gf6yr6whjfat7eqzgddntwkiiu

Integrating Standard Dependency Schemes in QCSP Solvers

Ji-Wei Jin, Fei-Fei Ma, Jian Zhang
2012 Journal of Computer Science and Technology  
Quantified constraint satisfaction problems (QCSPs) are an extension to constraint satisfaction problems (CSPs) with both universal quantifiers and existential quantifiers.  ...  In this paper we apply variable ordering heuristics and integrate standard dependency schemes in QCSP solvers. The technique can help to decide the next variable to be assigned in QCSP solving.  ...  Introduction Quantified constraint satisfaction problems (QC-SPs) are an extension to constraint satisfaction problems (CSPs) that allow variables to be universally quantified.  ... 
doi:10.1007/s11390-012-1204-5 fatcat:kcgjhsff35fllorksytyag5dju

Repair-Based Methods for Quantified CSPs [chapter]

Kostas Stergiou
2005 Lecture Notes in Computer Science  
Experimental results demonstrate that even simple repair-based techniques can outperform the state-of-the-art solver QCSP-Solve.  ...  The Quantified CSP (QCSP) is a generalization of the CSP which allows for universally quantified variables.  ...  Acknowledgements This research is supported by the Pythagoras grand no. 1349 under the Operational Program for Education and Initial Training.  ... 
doi:10.1007/11564751_48 fatcat:o4xph2sr2fcjdohacwnic342s4

Solving quantified constraint satisfaction problems

Ian P. Gent, Peter Nightingale, Andrew Rowley, Kostas Stergiou
2008 Artificial Intelligence  
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP).  ...  The QCSP is an extension of the constraint satisfaction problem that can be used to model combinatorial problems containing contingency or uncertainty.  ...  Acknowledgements We would like to thank the anonymous reviewers for their comments and suggestions that helped greatly improve the presentation of this paper.  ... 
doi:10.1016/j.artint.2007.11.003 fatcat:3fmxgpa6rrbojiueahzaual7b4

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

Realtime Online Solving of Quantified CSPs [chapter]

David Stynes, Kenneth N. Brown
2009 Lecture Notes in Computer Science  
We define Realtime Online solving of Quantified Constraint Satisfaction Problems (QCSPs) as a model for realtime online CSP solving.  ...  For random opponents, we show that we can frequently achieve solutions even on problems which lack a winning strategy and that we can improve our success rate by using Existential Quantified Generalised  ...  [3] proposed QCSP-Solve as a solver for QCSP, and included a Pure Value Rule for binary constraints, later extended to cover non-binary constraints [4] .  ... 
doi:10.1007/978-3-642-04244-7_60 fatcat:mvthexfjbrc4plomdn2prnk2le

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  
Aiming at generalizing the weighted and quantified constraint satisfaction frameworks, a Quantified Weighted Constraint Satisfaction Problem (QWCSP) consists of a set of finite domain variables, a set  ...  of soft constraints, and a min or max quantifier associated with each of these variables.  ...  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

Quantified Constraint Handling Rules

Vincent Barichard, Igor Stéphan
2019 Electronic Proceedings in Theoretical Computer Science  
We shift the QCSP (Quantified Constraint Satisfaction Problems) framework to the QCHR (Quantified Constraint Handling Rules) framework by enabling dynamic binder and access to user-defined constraints.  ...  QCSP offers a natural framework to express PSPACE problems as finite two-players games.  ...  We also presented some very intuitive QCHR models and we solved them with a QCHR solver, Q CHR++.  ... 
doi:10.4204/eptcs.306.25 fatcat:4iq4flgu45ecdlbsck5uk3b72i

Constraint programming approach to a bilevel scheduling problem

András Kovács, Tamás Kis
2010 Constraints  
We demonstrate our first results on a simple bilevel scheduling problem.  ...  However, up to now, very little is known about solution techniques of discrete bilevel problems. In this paper we show that constraint programming can be used to model and solve such problems.  ...  A. Kovács acknowledges the support of the János Bolyai scholarship No. BO/00138/07.  ... 
doi:10.1007/s10601-010-9102-3 fatcat:c535ofsjejd3pchsrm4f6crzta

Beyond QCSP for Solving Control Problems [chapter]

Cédric Pralet, Gérard Verfaillie
2011 Lecture Notes in Computer Science  
Quantified Constraint Satisfaction Problems (QCSP) are often claimed to be adapted to model and solve problems such as twoplayer games, planning under uncertainty, and more generally problems in which  ...  This paper shows that for a quite large class of such problems, using standard QCSP or QCSP+ is not the best approach.  ...  Dyncode was also compared with Queso, a QCSP solver which was shown in [4] to outperform other QCSP solvers such as BlockSolve or QCSP-solve.  ... 
doi:10.1007/978-3-642-23786-7_56 fatcat:4vxkvpopkbez3bc56zkbtjzsqy

Generalizing consistency and other constraint properties to quantified constraints

Lucas Bordeaux, Marco Cadoli, Toni Mancini
2009 ACM Transactions on Computational Logic  
As a consequence, basic properties of Constraint Satisfaction Problems (CSP), such as consistency or substitutability, are not completely understood in the quantified case.  ...  In this paper, we show that most of the properties that are used by solvers for CSP can be generalized to quantified CSP.  ...  The pure value property is used in the solver QCSP-Solve as a main tool for reasoning on values from the domains of universal variables.  ... 
doi:10.1145/1507244.1507247 fatcat:5b3zavwmjfg67ecir5clvvtqhy

A Constraint Satisfaction Framework for Executing Perceptions and Actions in Diagrammatic Reasoning

B. Banerjee, B. Chandrasekaran
2010 The Journal of Artificial Intelligence Research  
We specify a spatial problem as a quantified constraint satisfaction problem in the real domain using an open-ended vocabulary of properties, relations and actions involving three kinds of diagrammatic  ...  This requires determining the similarity of two problems, the existence of a mapping between them computable in polynomial time, and designing a memory for storing previously solved problems so as to facilitate  ...  We thank the anonymous reviewers for their constructive comments.  ... 
doi:10.1613/jair.3069 fatcat:aptbke4ltjchlmhtl4ejazaige

Solution Directed Backjumping for QCSP [chapter]

Fahiem Bacchus, Kostas Stergiou
Principles and Practice of Constraint Programming – CP 2007  
In this paper we present new techniques for improving backtracking based Quantified Constraint Satisfaction Problem (QCSP) solvers.  ...  Experiments with the solver QCSP-Solve demonstrate that SBJ can improve its performance on random instances by orders of magnitude.  ...  Introduction In this paper we present new techniques for improving the performance of solvers for Quantified Constraint Satisfaction Problems (QCSPs).  ... 
doi:10.1007/978-3-540-74970-7_13 dblp:conf/cp/BacchusS07 fatcat:r4hf36wu5jbbfkgajog66l45ze

Extending the Notion of Preferred Explanations for Quantified Constraint Satisfaction Problems [chapter]

Deepak Mehta, Barry O'Sullivan, Luis Quesada
2015 Lecture Notes in Computer Science  
The Quantified Constraint Satisfaction Problem (QCSP) is a generalization of classical constraint satisfaction problem in which some variables can be universally quantified.  ...  This paper unifies work from the fields of constraint satisfaction, explanation generation, and reasoning under preferences and uncertainty.  ...  Constraint Satisfaction Problem (qcsp) [1] .  ... 
doi:10.1007/978-3-319-25150-9_19 fatcat:23jh76rz25dw7dtaw5c4aar5pm
« Previous Showing results 1 — 15 out of 18 results