Filters








448 Hits in 5.8 sec

Adaptive Parameterized Consistency for Non-binary CSPs by Counting Supports [chapter]

Robert J. Woodward, Anthony Schneider, Berthe Y. Choueiry, Christian Bessiere
2014 Lecture Notes in Computer Science  
Parameterized Adaptive Consistency 〈x i ,v i 〉 is p-stable for GAC if for every constraint c j on x i gacSupports[R j ](〈x i ,v i 〉): data structure to store σ xi=vi (R j • ∀c j , ∀x i in c j , ∀v i in  ...  dom(x i ) -Enforce LC when 〈x i ,v i 〉 is not p-stable for GAC -Enforce STR when 〈x i ,v i 〉 has no support Issue: Position is not a precise measure of support.  ... 
doi:10.1007/978-3-319-10428-7_54 fatcat:5erriyvvhrgylitnt2twr4lhku

Adapting Consistency in Constraint Solving [chapter]

Amine Balafrej, Christian Bessiere, Anastasia Paparrizou, Gilles Trombettoni
2016 Lecture Notes in Computer Science  
The first approach, parameterized local consistency, uses as parameter the stability of values, which is a feature computed by arc consistency algorithms during their execution.  ...  Our experiments show that adaptive parameterized maxRPC and adaptive partition-one-AC can obtain significant speed-ups over arc consistency and over the full versions of maxRPC and partition-one-AC.  ...  However, the notions we introduce can be extended to non-binary constraints, by using maxRPWC for instance [BSW08] .  ... 
doi:10.1007/978-3-319-50137-6_9 fatcat:zkqixsd3yfbnxlf7qtpmanf6ge

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.  ...  This property is satisfied, for example, by instances consisting of unary constraints and AllDifferent constraints on non-overlapping subsets of the variables, and in particular by the class C AllDiff  ...  Language classes solved by local consistency Local consistency methods are the most common and well-studied polynomial-time algorithmic techniques for CSP.  ... 
doi:10.1007/s10601-015-9198-6 fatcat:fl7kxmceh5bqzpyd2c37rtohii

Revisiting the Linear Programming Relaxation Approach to Gibbs Energy Minimization and Weighted Constraint Satisfaction

Tomas Werner
2010 IEEE Transactions on Pattern Analysis and Machine Intelligence  
While the approach has been mostly considered only for binary constraints, we generalize it to n-ary constraints in a simple and natural way.  ...  The diffusion iteration is tractable for a certain class of higharity constraints represented as a black-box, which is analogical to propagators for global constraints CSP.  ...  It is defined for binary CSPs, while we need a local consistency defined for CSPs of any arity.  ... 
doi:10.1109/tpami.2009.134 pmid:20558878 fatcat:35lmkjaxnrawlkwqjkdgyqso6m

Heuristics for dynamically adapting propagation in constraint satisfaction problems

Kostas Stergiou
2009 AI Communications  
Finally, we make an experimental study on various binary CSPs demonstrating the effectiveness of the proposed heuristics.  ...  In this paper we first give some experimental results displaying the clustering of propagation events in structured binary CSPs.  ...  As in [13] , the scheme is based on information gathered by examining the supports of values in constraints which can be very expensive for non-binary constraints.  ... 
doi:10.3233/aic-2009-0450 fatcat:d4quqgs3qvdjzm5hftzgqgth5e

Bio-ModelChecker: Using Bounded Constraint Satisfaction to Seamlessly Integrate Observed Behavior With Prior Knowledge of Biological Networks

Hooman Sedghamiz, Matthew Morris, Travis J. A Craddock, Darrell Whitley, Gordon Broderick
2019 Frontiers in Bioengineering and Biotechnology  
The in silico study and reverse engineering of regulatory networks has gained in recognition as an insightful tool for the qualitative study of biological mechanisms that underlie a broad range of complex  ...  In this paper, we propose a bounded Constraint Satisfaction (CS) based model checking framework for parameter set identification that readily accommodates partial records and the exponential complexity  ...  In order to compute the robustness, we only count the number of branches for the shortest trajectories.  ... 
doi:10.3389/fbioe.2019.00048 pmid:30972331 pmcid:PMC6443719 fatcat:56q5hw3x7fhvlbzehfvxnthnei

Conflict Ordering Search for Scheduling Problems [chapter]

Steven Gay, Renaud Hartert, Christophe Lecoutre, Pierre Schaus
2015 Lecture Notes in Computer Science  
Importantly, the initial ordering behind COS is given by a specified variable ordering heuristic, but contrary to LC, once consumed, this first ordering is forgotten, which makes COS conflict-driven.  ...  The authors would like to thank Petr Vilím for his help with the comparison to FDS in CP Optimizer.  ...  Christophe Lecoutre benefits from the financial support of CNRS and OSEO (BPI France) within the ISI project Pajero.  ... 
doi:10.1007/978-3-319-23219-5_10 fatcat:gwtin22j7vanzef6bou6gwxxre

Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning [chapter]

Georg Gottlob, Francesco Scarcello, Martha Sideri
1999 Lecture Notes in Computer Science  
The theory of parameterized complexity deals with such issues, and provides general techniques for identifying fixed-parameter tractable and fixed-parameter intractable problems.  ...  We study the parameterized complexity of various problems in AI and nonmonotonic reasoning. We show that a number of relevant parameterized problems in these areas are fixed-parameter tractable.  ...  Acknowledgements We thank the anonymous referees for their useful comments and suggestions. Research supported by FWF (Austrian Science Funds) under the project Z29-INF.  ... 
doi:10.1007/3-540-46767-x_1 fatcat:tui4rdaidrh6rjcvi6ybqaibgq

Fixed-parameter complexity in AI and nonmonotonic reasoning

Georg Gottlob, Francesco Scarcello, Martha Sideri
2002 Artificial Intelligence  
The theory of parameterized complexity deals with such issues, and provides general techniques for identifying fixed-parameter tractable and fixed-parameter intractable problems.  ...  We study the parameterized complexity of various problems in AI and nonmonotonic reasoning. We show that a number of relevant parameterized problems in these areas are fixed-parameter tractable.  ...  Acknowledgements We thank the anonymous referees for their useful comments and suggestions. Research supported by FWF (Austrian Science Funds) under the project Z29-INF.  ... 
doi:10.1016/s0004-3702(02)00182-0 fatcat:vrfcg23nyjettjkvt2y3nne4ky

Strong consistencies for weighted constraint satisfaction problems

Thi Hong Hiep Nguyen, Thomas Schiex, Christian Bessiere
2015 Constraints  
Je voudrais remercier Mahuna et Aurélie pour leur gentillesse et leur sympathie ; grâce à eux, j'ai pu me rapprocher de la bande des non-permanents.  ...  A binary CSP has only unary and binary constraints and a non-binary CSP has also non-binary constraints.  ...  In the case of non-binary CSPs, maxRPC requires AC for non-binary constraints and maxRPC as defined above for binary constraints. maxRPC prunes more values than PIC.  ... 
doi:10.1007/s10601-015-9208-8 fatcat:5bzqtjq63neddovzd6w5flf45a

The Complexity of Weighted Boolean #CSP

Martin Dyer, Leslie Ann Goldberg, Mark Jerrum
2009 SIAM journal on computing (Print)  
The problem is parameterised by a finite set F of non-negative functions that may be used to assign weights to the configurations (feasible solutions) of a problem instance.  ...  For every other fixed set F, computing the partition function is FP^#P-complete.  ...  A weighted #CSP problem is parameterized by a finite subset F of F q and will be denoted by #CSP(F ). An instance I of #CSP(F ) consists of a set V of variables and a set C of constraints.  ... 
doi:10.1137/070690201 fatcat:cxwtrejxuvb45pbvsqjxnsmely

Thought-based row-column scanning communication board for individuals with cerebral palsy

Reinhold Scherer, Martin Billinger, Johanna Wagner, Andreas Schwarz, Dirk Tassilo Hettich, Elaina Bolinger, Mariano Lloria Garcia, Juan Navarro, Gernot Müller-Putz
2015 Annals of Physical and Rehabilitation Medicine  
Non-invasive electroencephalogram (EEG) based brain-computer interfaces (BCIs) have been proposed as potential assistive devices for individuals with CP.  ...  Fourteen users with CP participated in a supporting online study and helped to evaluate the performance of the developed system.  ...  Acknowledgements This work was supported by the FP7 Framework EU Research Project ABC (No. 287774).  ... 
doi:10.1016/j.rehab.2014.11.005 pmid:25661447 fatcat:wadfydvhu5ha7gvo2s7ehfqrpu

A Decision Theoretic Meta-reasoner for Constraint Optimization [chapter]

Jingfang Zheng, Michael C. Horsch
2005 Lecture Notes in Computer Science  
By choosing the action with the estimated maximal expected utility, the meta-reasoner finds a stopping point with a good tradeoff between the solution quality and the time cost.  ...  Acknowledgements The second author acknowledges support by NSERC through RGPIN2387870-01.  ...  The average error rate for each set of 5 models was measured by counting correct predictions of ub' on a test set, as well as by computing the predicted error in the expectation of ub' for the test set  ... 
doi:10.1007/11424918_8 fatcat:fblw47656bawdbp44z4suvbxwu

The complexity of weighted counting for acyclic conjunctive queries

Arnaud Durand, Stefan Mengel
2014 Journal of computer and system sciences (Print)  
Thus we completely determines the tractability frontier for weighted counting for ACQ. * Partially supported by DFG grants BU 1371/2-2 and BU 1371/3-1.  ...  We show that, up to a standard assumption from parameterized complexity, this parameter fully characterizes tractable subclasses for counting weighted solutions of ACQ queries.  ...  In the recent past, counting and weighted counting for CSP have been mainly stated in the non uniform version of the problem i.e. when the template T is fixed and only S is given as input (see e.g.  ... 
doi:10.1016/j.jcss.2013.08.001 fatcat:vktz4kerkjhtjgg2xw7fyhjg3a

A Holant Dichotomy: Is the FKT Algorithm Universal? [article]

Jin-Yi Cai, Zhiguo Fu, Heng Guo, Tyson Williams
2015 arXiv   pre-print
Surprisingly, for planar Holant, we discover new planar tractable problems that are not expressible by a holographic reduction to FKT.  ...  We prove a dichotomy for planar #CSP^2. We apply this planar #CSP^2 dichotomy in the proof of the planar Holant dichotomy.  ...  For any non-degenerate binary signature h ∈ F, it must be that h ∈ R + 2 as otherwise Pl-Holant(f, h) is #P-hard by Lemma 4.3. 3.  ... 
arXiv:1505.02993v1 fatcat:u5ns6bv675dwngdigha5lfvpe4
« Previous Showing results 1 — 15 out of 448 results