Filters








103 Hits in 5.2 sec

On Singleton Arc Consistency for CSPs Defined by Monotone Patterns [article]

Clement Carbonnel and David A. Cohen and Martin C. Cooper and Stanislav Zivny
2018 arXiv   pre-print
We aim to characterise all classes of CSPs defined by a forbidden pattern that are solved by singleton arc consistency and closed under removing constraints.  ...  We identify five new patterns whose absence ensures solvability by singleton arc consistency, four of which are provably maximal and three of which generalise 2-SAT.  ...  CSP(R8) is solved by singleton arc consistency. Proof. Let I ∈ CSP(R8) and suppose that I is singleton arc consistent. Let x ∈ X and v ∈ D(x).  ... 
arXiv:1704.06215v4 fatcat:q4bwigjw5jashh3beedms63lwa

On Singleton Arc Consistency for CSPs Defined by Monotone Patterns

Clément Carbonnel, David A. Cohen, Martin C. Cooper, Stanislav Živný
2018 Algorithmica  
We aim to characterise all classes of CSPs defined by a forbidden pattern that are solved by singleton arc consistency and closed under removing constraints.  ...  We identify five new patterns whose absence ensures solvability by singleton arc consistency, four of which are provably maximal and three of which generalise 2-SAT.  ...  Theorem 5 CSP(R5) is solved by singleton arc consistency.  ... 
doi:10.1007/s00453-018-0498-2 pmid:31007327 pmcid:PMC6449328 fatcat:hexfkxyuh5awngv76xkzamhqze

Local consistency for extended CSPs

Michael J. Maher
2009 Theoretical Computer Science  
Some rough principles for local consistency conditions in the extended framework are developed, appropriate notions of local consistency are formulated, and relationships between the various consistency  ...  We extend the framework of Constraint Satisfaction Problems to make it more suitable for/applicable to modern constraint programming languages where both constraint satisfaction and constraint solving  ...  Acknowledgements Thanks to Rina Dechter, Jeremy Frank, Mark Wallace, Toby Walsh and anonymous reviewers for discussions and suggestions that were helpful for this paper.  ... 
doi:10.1016/j.tcs.2009.07.042 fatcat:22zs73fbvzddtom6voefoir4ia

Strengthening neighbourhood substitution [article]

Martin C. Cooper
2020 arXiv   pre-print
In the binary CSP, neighbourhood substitution consists in eliminating a value if there exists another value which can be substituted for it in each constraint.  ...  Domain reduction is an essential tool for solving the constraint satisfaction problem (CSP).  ...  For example, two values can be merged if the so-called broken triangle (BT) pattern does not occur on these two values [11] .  ... 
arXiv:2007.06282v1 fatcat:4wvehvgf6ra4jk4o4spobp4po4

Colouring, constraint satisfaction, and complexity

Pavol Hell, Jaroslav Nešetřil
2008 Computer Science Review  
However, for general constraint satisfaction problems, dichotomy has only been conjectured.  ...  Similar dichotomy has been proved for the class of graph homomorphism problems, which are intermediate problems between graph colouring and constraint satisfaction.  ...  Indeed, much of the current research on the Dichotomy Conjecture amounts to a hunt for new polynomial algorithms. We are grateful to G. Kun and M. Szegedy, as well as to M.  ... 
doi:10.1016/j.cosrev.2008.10.003 fatcat:ttj3i4ajvnauhe4iyuqy2qpfni

Complexity Analysis vs. Engineering Design in CSP Algorithms: Contravening Conventional Wisdom Again

Richard J. Wallace
2016 International Conference of the Italian Association for Artificial Intelligence  
These include algorithms for arc consistency, singleton arc consistency, arc consistency used with MAC, maxRPC algorithms, and algorithms for simple table reduction with non-binary constraints.  ...  In this work we compare simple and 'advanced' algorithms that have been used to perform various functions in connection with constraint satisfaction problems (CSPs).  ...  Maintained arc consistency (MAC) is a complete algorithm for CSP search, that for any CSP either returns a solution or proves that the problem is unsatisfiable.  ... 
dblp:conf/aiia/Wallace16 fatcat:unlaft7c4re7xcmnutxer2qk2e

Using a constraint satisfaction formulation and solution techniques for random test program generation

E. Bin, R. Emek, G. Shurek, A. Ziv
2002 IBM Systems Journal  
A constraint satisfaction problem consists of a finite set of variables and a set of constraints. Each variable is associated with a set of possible values, known  ...  Maintaining Arc Consistency (MAC) 8 is a family of CSP solution algorithms that use a procedure for achieving arc-consistency as its filtering component.  ...  We use AC-3 9 to achieve arc consistency because of its relative simplicity and because it is less affected by the domain sizes than other arc consistency algorithms.  ... 
doi:10.1147/sj.413.0386 fatcat:kabz7p7x4jc5rnym3i25drrw2q

Tractability in constraint satisfaction problems: a survey

Clément Carbonnel, Martin C. Cooper
2015 Constraints  
Acknowledgments We are grateful to Peter Jeavons and StanislavŽivný for their detailed comments on a first draft of this paper, and to the reviewers for their constructive comments.  ...  It has been recently shown that singleton arc-consistency solves CSP(Γ ) when Γ admits a majority polymorphism [40] .  ...  Any class of instances defined by a forbidden pattern is necessarily recognisable in polynomial time by a simple exhaustive search for the pattern.  ... 
doi:10.1007/s10601-015-9198-6 fatcat:fl7kxmceh5bqzpyd2c37rtohii

Constraint Programming viewed as Rule-based Programming [article]

Krzysztof R. Apt, Eric Monfroy
2001 arXiv   pre-print
hyper-arc consistency in MS98b).  ...  The first type, that we call equality rules, leads to a new notion of local consistency, called rule consistency that turns out to be weaker than arc consistency for constraints of arbitrary arity (called  ...  Acknowledgements We would like to thank Thom Frühwirth, Andrea Schaerf and all three referees for several useful suggestions. Victor Marek provided material for Section 3 and suggested Section 4.  ... 
arXiv:cs/0003076v2 fatcat:mi3xlavnwjbzlgmzw7fn3n53py

Transformations of representation in constraint satisfaction

András Z. Salamon
2015 Constraints  
My main contribution is an investigation of such hybrid CSPs which cannot be defined with either one of these kinds of restrictions.  ...  For the common case where all constraints involve only two variables, I show how the microstructure can be used to define CSPs that are tractable because their clause structures fall within classes of  ...  A binary CSP instance is renamable right monotone with respect to a variable ordering ≤ if for every variable w there is an ordering ≤ w on D such that R uw is right monotone with respect to ≤ w for every  ... 
doi:10.1007/s10601-015-9224-8 fatcat:lollakqzx5h7xeajtfrmaz6u4q

Front Matter, Table of Contents, Preface, Conference Organization

Rolf Niedermeier, Brigitte Vallée, Marc Herbstritt
2018 Symposium on Theoretical Aspects of Computer Science  
Arc Consistency for CSPs Defined by Monotone Patterns Clément Carbonnel, David A.  ...  0:vi Contents Efficient Oracles and Routing Schemes for Replacement Paths Davide Bilò, Keerti Choudhary, Luciano Gualà, Stefano Leucci, Merav Parter, On the Tree Conjecture for the Network Creation  ...  Foreword The Symposium on Theoretical Aspects of Computer Science (STACS) conference series is an international forum for original research on theoretical aspects of computer science.  ... 
doi:10.4230/lipics.stacs.2018.0 dblp:conf/stacs/X18 fatcat:jgvgsziyhbc6jkcm4wszlwgrsa

On the subgraph epimorphism problem

Steven Gay, François Fages, Thierry Martinez, Sylvain Soliman, Christine Solnon
2014 Discrete Applied Mathematics  
Then we study the graph distance measures induced by these transformations. We show that they define metrics on graphs and compare them.  ...  On the algorithmic side, we show that the SEPI existence problem is NP-complete by reduction of SAT, and present a constraint satisfaction algorithm that has been successfully used to solve practical SEPI  ...  For a SEPI CSP, the search strategy with VariableValueSelection antecedents yields a solution once every antecedent variable has been instantiated, by instantiating the remaining non-singleton source vertex  ... 
doi:10.1016/j.dam.2013.08.008 fatcat:t3ecsi2d5vaxxp4gyjcuxqfb4i

Schedulers for rule-based constraint programming

Krzysztof R. Apt, Sebastian Brand
2003 Proceedings of the 2003 ACM symposium on Applied computing - SAC '03  
We study here schedulers for a class of rules that naturally arise in the context of rule-based constraint programming.  ...  This leads to an implementation that yields for these rules a considerably better performance than their execution as standard CHR rules.  ...  Acknowledgments We thank Christian Holzbaur and Eric Monfroy for helpful discussions on the implementation and on an early version of this paper, and the referees for useful comments.  ... 
doi:10.1145/952533.952537 fatcat:nw4iizo4qzbnnladjww25h5p2a

Schedulers and Redundancy for a Class of Constraint Propagation Rules [article]

Sebastian Brand, Krzysztof R. Apt
2004 arXiv   pre-print
We study here schedulers for a class of rules that naturally arise in the context of rule-based constraint programming.  ...  This leads to an implementation that yields a considerably better performance for these rules than their execution as standard CHR rules.  ...  Acknowledgments We thank Christian Holzbaur and Eric Monfroy for helpful discussions on the implementation and on an early version of this paper.  ... 
arXiv:cs/0403037v3 fatcat:k77jvxrtlbdlvbremwimezhufa

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.  ...  Much of its success is due to the simple and elegant underlying formulation: describe the world in terms of decision variables that must be assigned values, place clear and explicit restrictions on the  ...  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
« Previous Showing results 1 — 15 out of 103 results