Filters








37,076 Hits in 2.4 sec

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.  ...  Introduction Quantified Constraint Satisfaction Problems (QCSPs) can be used to model various PSPACE-complete combinatorial problems from domains like planning under uncertainty, design, adversary game  ... 
doi:10.1016/j.artint.2007.11.003 fatcat:3fmxgpa6rrbojiueahzaual7b4

Cooperative Problem Solving against Adversary: Quantified Distributed Constraint Satisfaction Problem

Satomi Baba, Atsushi Iwasaki, Makoto Yokoo, Marius C. Silaghi, Katsutoshi Hirayama, Toshihiro Matsui
2011 Transactions of the Japanese society for artificial intelligence  
keywords: distributed constraint satisfaction problem, quantified constraint satisfaction problem Summary In this paper, we extend the traditional formalization of distributed constraint satisfaction problems  ...  In this paper, we present the formalization of such a quantified DisCSP and develop an algorithm for solving it by generalizing the asynchronous backtracking algorithm used for solving a DisCSP.  ...  ∧ (x 1 < x 4 ) ∧ (x 2 = x 3 ) (3) • C Q ∃x 1 Q 2 x 2 · · ·Q n x n Q 2 x 2 · · ·Q n x n C[(x 1 , a)] a ∈ D 1 Q ∀x 1 Q 2 x 2 · · ·Q n x n a ∈ D 1 Q 2 x 2 · · ·Q n x n C[(x 1 , a)] (x 1 , a) x 1 a QCSP-Solve  ... 
doi:10.1527/tjsai.26.136 fatcat:34fokxrjf5edjpuqrp6lfuupuy

Introduction to the special issue on quantified CSPs and QBF

Enrico Giunchglia, Kostas Stergiou
2008 Constraints  
QCSPs with discrete finite domains Bodirsky and Chen study the relatively quantified constraint satisfaction problem (RQCSP), a subclass of the QCSP in which the values for each individual variable can  ...  Typically, such problems involve decisions or events that are beyond the control of the problem solving agent and thus cannot be handled using standard (existentially quantified) variables.  ...  QCSPs with discrete finite domains Bodirsky and Chen study the relatively quantified constraint satisfaction problem (RQCSP), a subclass of the QCSP in which the values for each individual variable can  ... 
doi:10.1007/s10601-008-9056-x fatcat:jejc5tefn5g2jl3dcxgxbv3kcm

Constraint satisfaction using soft quantifiers

Ronald R. Yager
2004 International Journal of Intelligent Systems in Accounting, Finance & Management  
We suggest the use of soft quantifiers such as "most" to guide the process of aggregating the satisfactions to the individual constraints.  ...  Here we suggest an approach to the softening of the CP problem at the meta level, the process used to aggregate the satisfactions to the individual constraints.  ...  Using a fuzzy set representation of quantifiers Yager [4, 11] Fuzzy Softening of Linear Constraint Satisfaction Problems A typical linear constraint satisfaction problem can be formulated as finding  ... 
doi:10.1002/isaf.250 fatcat:pjxgnnbxgbarxmpshqwzyvgjty

Efficient CTL Verification via Horn Constraints Solving

Tewodros A. Beyene, Corneliu Popeea, Andrey Rybalchenko
2016 Electronic Proceedings in Theoretical Computer Science  
Then, the generated set of constraints are solved by applying an off-the-shelf Horn constraints solving engine.  ...  It first generates a set of forall-exists quantified Horn constraints and well-foundedness constraints by exploiting the syntactic structure of the CTL formula.  ...  Proof system Our CTL verification method encodes the verification problem as a problem of solving forall-exists quantified Horn constraints with well-foundedness conditions.  ... 
doi:10.4204/eptcs.219.1 fatcat:6jcdxlkskrddxjf2ufmv25e5ya

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.  ...  A Quantified Weighted Constraint Satisfaction Problem (QWCSP) consists of an ordered sequence of finite domain variables, a set of soft constraints, and a min or max quantifier associated with each variable  ... 
doi:10.1109/ictai.2011.121 dblp:conf/ictai/LeeMY11 fatcat:ue7rydihdrebllm6g5pjgoes5y

Student Diet Optimization

Brad Davis, Wesley Holt
2020 Figshare  
The Satisfaction Score To incorporate a satisfaction constraint to our diet optimizer, we had to be able to quantify how happy the user is with any given diet.  ...  Solving the discrete problem turned out to be more difficult than solving the continuous problem.  ... 
doi:10.6084/m9.figshare.12135891.v1 fatcat:ritt7al7qjet7jijqjobgelkey

Student Diet Optimization

Brad Davis, Wesley Holt
2020 Figshare  
The Satisfaction Score To incorporate a satisfaction constraint to our diet optimizer, we had to be able to quantify how happy the user is with any given diet.  ...  Solving the discrete problem turned out to be more difficult than solving the continuous problem.  ... 
doi:10.6084/m9.figshare.12135891 fatcat:rvwytbw2mndrfmy44qkaq2accy

Quantified Set Inversion Algorithm with Applications to Control

Pau Herrero, Miguel A. Sainz, Josep Veh, Luc Jaulin
2005 Reliable Computing  
This algorithm allows solving problems involving quantified constraints over the reals through the characterization of their solution sets.  ...  The presented methodology can be applied over a wide range of problems involving uncertain (non)linear systems. Finally, an advanced application is solved.  ...  More recently, this formulation has been referenced by different authors under the names: Generalized Constraints Satisfaction Problems (Shary, 2002) or Quantified Constraints Satisfaction Problems (  ... 
doi:10.1007/s11155-005-0044-1 fatcat:24pbm57lzbh6var6yjpe2ewtbi

From Model-Checking to Temporal Logic Constraint Solving [chapter]

François Fages, Aurélien Rizk
2009 Lecture Notes in Computer Science  
In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some domain D, and by computing a validity  ...  We illustrate this approach with reverseengineering problems coming from systems biology, and provide some performance figures on parameter optimization problems with respect to temporal logic specifications  ...  The constraint solving problem of a QFCTL formula on a numerical trace, the computation of the satisfaction degree of a formula and its use as a fitness function for parameter optimization are implemented  ... 
doi:10.1007/978-3-642-04244-7_26 fatcat:woxsmrefkja4fn7grsp2h32ny4

Tractable Set Constraints

M. Bodirsky, M. Hils
2012 The Journal of Artificial Intelligence Research  
finite sublanguage with an NP-hard constraint satisfaction problem.  ...  Many fundamental problems in artificial intelligence, knowledge representation, and verification involve reasoning about sets and relations between sets and can be modeled as set constraint satisfaction  ...  Constraint satisfaction problems over EI can be solved in polynomial -even quadratic -time.  ... 
doi:10.1613/jair.3747 fatcat:cot3hkinuzhznh4usfxy6qqgvq

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.  ...  This is only recently that the constraint community got interested in QCSP and proposed algorithms to solve it.  ...  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

The Cut Tool for QCSP

Barichard Vincent, Igor Stephan
2014 2014 IEEE 26th International Conference on Tools with Artificial Intelligence  
Résumé en anglais Quantified Constraint Satisfaction Problems (QCSP) are a generalization of Constraint Satisfaction Problems (CSP) in which variables may be quantified existentially and universally.  ...  This tool does not need to modify the QCSP solver but has only one requirement: be able to tell the QCSP solver that the current QCSP is solved.  ... 
doi:10.1109/ictai.2014.135 dblp:conf/ictai/VincentS14 fatcat:p2lr3dwtsvayndodr3ivd54ndy

Generalized Craig Interpolation for Stochastic Satisfiability Modulo Theory Problems [chapter]

Ahmed Mahdi, Martin Fränzle
2014 Lecture Notes in Computer Science  
Craig interpolation is widely used in solving reachability and model-checking problems by SAT or SMT techniques, as it permits the computation of invariants as well as discovery of meaningful predicates  ...  The algorithm computes interpolants in SAT, SMT, SSAT, and SSMT problems.  ...  For an SSMT formula Φ, we ask for the maximum probability of satisfaction or, if formulated as a decision problem, whether this probability of satisfaction exceeds a threshold.  ... 
doi:10.1007/978-3-319-11439-2_16 fatcat:a34eo2x6d5avlnuaqrumylci3m

Decision support systems in preliminary design

Patrick Sebastian, Yann Ledoux
2009 International Journal on Interactive Design and Manufacturing  
Robust design optimization problem may be regarded as constraint satisfaction problem with universally quantifiers and therefore are equivalent to Quantified Constraint Satisfaction Problem which are known  ...  Embodiment design problem can be naturally expressed as mixed Constraint Satisfaction Problems (CSP); which cannot be solved using classical mechanical simulation tools.  ... 
doi:10.1007/s12008-009-0077-5 fatcat:5fojjwxiyfhpvi3nfouehj3te4
« Previous Showing results 1 — 15 out of 37,076 results