170 Hits in 7.1 sec

Uncertainty and Change [chapter]

Kenneth N. Brown, Ian Miguel
2006 Foundations of Artificial Intelligence  
Constraint Programming (CP) has proven to be a very successful technique for reasoning about assignment problems, as evidenced by the many applications described elsewhere in this book.  ...  Thus, CP makes two assumptions about the problems it tackles: 1. The complete set of variables is not known;  ...  Acknowledgments We thank the anonymous referee for useful comments on a draft of this chapter.  ... 
doi:10.1016/s1574-6526(06)80025-8 fatcat:bod6ylc4hbe5njdhktxxwdv3my

Logic-Based Solution Methods for Optimal Control of Hybrid Systems

A. Bemporad, N. Giorgetti
2006 IEEE Transactions on Automatic Control  
In this paper, we attempt to overcome such a difficulty by combining numerical techniques for solving convex programming problems with symbolic techniques for solving constraint satisfaction problems (  ...  The resulting "hybrid" solver proposed here takes advantage of CSP solvers for dealing with satisfiability of logic constraints very efficiently.  ...  CSP relies on logic-based methods such as domain reduction and (Boolean) constraint propagation to accelerate the search for the feasible solution.  ... 
doi:10.1109/tac.2006.876949 fatcat:5s63fkonfncizlvmylystmrx5e

Solving Intensional Weighted CSPs by Incremental Optimization with BDDs [chapter]

Miquel Bofill, Miquel Palahí, Josep Suy, Mateu Villaret
2014 Lecture Notes in Computer Science  
We present a method for solving weighted Constraint Satisfaction Problems, based on translation into a Constraint Optimization Problem and iterative calls to an SMT solver, with successively tighter bounds  ...  This offers two benefits: first, BDDs built for previous bounds can be used to build the BDDs for new (tighter) bounds, considerably reducing the BDD construction time; second, as a by-product, many clauses  ...  for the experiments.  ... 
doi:10.1007/978-3-319-10428-7_17 fatcat:tmjwrahztzbcdau7u3j6gqsgbu

Robustness and Stability in Constraint Programming under Dynamism and Uncertainty

L. Climent, R. J. Wallace, M. A. Salido, F. Barber
2014 The Journal of Artificial Intelligence Research  
We present a search algorithm that searches for both robust and stable solutions for CSPs of this nature.  ...  In this paper, we extend the concept of robustness and stability for Constraint Satisfaction Problems (CSPs) with ordered domains, where only limited assumptions need to be made as to possible changes.  ...  Diarmuid Grimes for their assistance.  ... 
doi:10.1613/jair.4126 fatcat:u3x6l4ezsvhvfi73gt32o2elpi

Robustness and Stability in Constraint Programming under Dynamism and Uncertainty [chapter]

Laura Climent, Richard J. Wallace, Miguel A. Salido, Federico Barber
2014 Lecture Notes in Computer Science  
We present a search algorithm that searches for both robust and stable solutions for CSPs of this nature.  ...  In this paper, we extend the concept of robustness and stability for Constraint Satisfaction Problems (CSPs) with ordered domains, where only limited assumptions need to be made as to possible changes.  ...  Diarmuid Grimes for their assistance.  ... 
doi:10.1007/978-3-319-10428-7_68 fatcat:fx7y6ahbfnhtdnswjgqjwfwe7u

Large-scale classroom scheduling

1996 IIE Transactions  
Requirements for CHRONOS derive from the course scheduling process at Purdue and are speci¯ed in a mathematical model of the classroom scheduling problem.  ...  An approach for solving classroom scheduling problems of practical size has been developed and implemented in CHRONOS, a scheduling support system developed at Purdue and described in this paper.  ...  Model CSP can be reformulated as a multiple choice quadratic vertex packing (MCQVP) problem.  ... 
doi:10.1080/07408179608966284 fatcat:vm4cgh3shrhtjccplsnd6wdkbq

A global optimization approach to H ∞ synthesis with parametric uncertainties applied to AUV control

D. Monnet, J. Ninin, Clement B.
2017 IFAC-PapersOnLine  
Hence, to find a solution of Problem (2), we limit the search for all the controller K(k) (2) can be reformulated as a structured H ∞ synthesis problem: with k ∈ K ⊂ R n k .  ...  The H ∞ synthesis problem is formulated as a Constraint Satisfaction Problem (CSP): find K such that T w→zi ∞ ≤ 1, ∀i ∈ {1, . . . , q}. (1) We recall that the H ∞ norm . ∞ is defined by: T w→zi ∞ = sup  ... 
doi:10.1016/j.ifacol.2017.08.297 fatcat:4y7t7pam3fcrde3u7ftony4yzq

Activity-Based Search for Black-Box Contraint-Programming Solvers [article]

L. Michel, P. Van Hentenryck
2011 arXiv   pre-print
Robust search procedures are a central component in the design of black-box constraint-programming solvers.  ...  Experimental results on a variety of benchmarks show that activity-based search is more robust than other heuristics and may produce significant improvements in performance.  ...  All the weights are initialized to 1 and, when a constraint fails, its weight is incremented. The space overhead of wdeg is Θ(|C|) for a CSP X, D, C .  ... 
arXiv:1105.6314v1 fatcat:a6lfzskgpfcahhsy7cykhekpsm

New trends in constraint satisfaction, planning, and scheduling: a survey

Roman Barták, Miguel A. Salido, Francesca Rossi
2010 Knowledge engineering review (Print)  
Formulations of a CSP Solving a constraint satisfaction problem (CSP) must be carried out in two different phases: • Modeling the problem as a constraint satisfaction problem.  ...  For such problems, techniques such as branch and bound are usually used to find an optimal solution.  ...  The typical representatives of KE for planning are the tools for problem modeling, such as the GIPO system (McCluskey et al., 2003) , methods of problem reformulation, such as the methods used in Fast  ... 
doi:10.1017/s0269888910000202 fatcat:4n7bn7rnyjbifi3nkignhwe5uy

Robust solutions for combinatorial auctions

Alan Holland, Barry O'Sullivan
2005 Proceedings of the 6th ACM conference on Electronic commerce - EC '05  
Firstly, we use the Weighted Super Solutions framework [13] , from the field of constraint programming, to solve the problem of finding a robust solution.  ...  We then examine the trade-off between robustness and revenue in different economically motivated auction scenarios for different constraints on the revenue of repair solutions.  ...  FINDING ROBUST SOLUTIONS In constraint programming [4] (CP), a constraint satisfaction problem (CSP) is modeled as a set of n variables X = {x 1 , . . . , x n }, a set of domains D = {D(x 1 ), . . .  ... 
doi:10.1145/1064009.1064029 dblp:conf/sigecom/HollandO05 fatcat:i4gjjei7efbgpe27duf4frwnte

Revisiting dynamic constraint satisfaction for model-based planning

Jeremy Frank
2016 Knowledge engineering review (Print)  
This criteria can be used to evaluate elementary transformations of a constraint satisfaction problem as well as sequences of transformations.  ...  We propose a new classification of dynamic constraint satisfaction transformations based on a formal criteria, namely the change in the fraction of solutions.  ...  Dynamic Constraint Satisfaction Problems: A New Formalism Definition 4 A transformation τ is a function that maps a CSP P i to a CSP P j denoted P i τ − → P j .  ... 
doi:10.1017/s0269888916000242 fatcat:nt6cscltjbbpndpji2hs7vdsvy

AND/OR Branch-and-Bound search for combinatorial optimization in graphical models

Radu Marinescu, Rina Dechter
2009 Artificial Intelligence  
We focus on two most common optimization problems in graphical models: finding the Most Probable Explanation in Bayesian networks and solving Weighted CSPs.  ...  The focus of this paper is on linear space search which explores the AND/OR search tree. In the second paper we explore memory intensive AND/OR search algorithms.  ...  Results for empirical evaluation of Weighted CSPs In this section we focus on Weighted CSP problems.  ... 
doi:10.1016/j.artint.2009.07.003 fatcat:ygqm7xz4kjavpoquq4ja4mzyeq

Proceedings of the 2018 XCSP3 Competition [article]

Christophe Lecoutre, Olivier Roussel
2018 arXiv   pre-print
The results of this competition of constraint solvers were presented at CP'18, the 24th International Conference on Principles and Practice of Constraint Programming, held in Lille, France from 27th August  ...  More recently, some clause learning methods were implemented in Mistral, still improving the results on disjunctive scheduling [1] and car-sequencing problems [11].  ...  This solver is produced for my PhD thesis work on data structures designed for clause-based nogood recording. A big thank-you to Gilles Audemard, for his support and help. Acknowledgements.  ... 
arXiv:1901.01830v1 fatcat:vjxlgadkpjbvtpftha4jrn2xji

A view of local search in constraint programming [chapter]

Gilles Pesant, Michel Gendreau
1996 Lecture Notes in Computer Science  
Can reinforcement learning applied to complete search lead to superior search performance? (a) What is a good reward function for CSP/COP? (b) Branching dependent on expected satisfiability?  ...  We believe that a more principled and autonomous approach for search efficiency has to be started in Constraint Programming.  ...  The weight function W G for such a factor graph thus equals one if and only if a configuration meets all of the constraints, indicating the satisfaction of the problem as a whole.  ... 
doi:10.1007/3-540-61551-2_86 fatcat:dv47xzm7n5dgtg6yyst3vfrxf4

Robust planning with incomplete domain models

Tuan Nguyen, Sarath Sreedharan, Subbarao Kambhampati
2017 Artificial Intelligence  
Current work in planning assumes that user preferences and/or domain dynamics are completely specified in advance, and aims to search for a single solution plan to satisfy these.  ...  A method of assessing plan robustness based on the weighted model counting approach is proposed. Two approaches for synthesizing robust plans are introduced.  ...  I deeply thank him for  ... 
doi:10.1016/j.artint.2016.12.003 fatcat:ifmazgyvl5gg3ojrotwid6kkoe
« Previous Showing results 1 — 15 out of 170 results