Filters








5,899 Hits in 6.0 sec

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.  ...  Therefore constraint satisfaction problems can be reduced to (di)graph homomorphism problems studied in graph theory for over thirty years.  ...  Although this article is mainly concerned with the traditional finite-domain decision-problem version of the constraint satisfaction problem, we also briefly cover in Section 9 the case of infinite domains  ... 
doi:10.1007/s10601-015-9198-6 fatcat:fl7kxmceh5bqzpyd2c37rtohii

The Structure of Tractable Constraint Satisfaction Problems [chapter]

Martin Grohe
2006 Lecture Notes in Computer Science  
We give a survey of recent results on the complexity of constraint satisfaction problems. Our main emphasis is on tractable structural restrictions.  ...  Introduction The objective of a constraint satisfaction problem (CSP) is to assign values to variables subject to constraints on the values.  ...  Then Csp(T, −) is tractable. To see this, it will be most convenient to view Csp(T, −) as a homomorphism problem (as described in Section 1.2).  ... 
doi:10.1007/11821069_5 fatcat:kxf72vtot5eolengxjuhlvq2m4

Constraint Satisfaction Problems Parameterized Above or Below Tight Bounds: A Survey [article]

G. Gutin, A. Yeo
2011 arXiv   pre-print
We consider constraint satisfaction problems parameterized above or below tight bounds.  ...  We also consider Max-r-CSP-AA, a natural generalization of both Max-r-Lin2-AA and Max-r-Sat-AA, order (or, permutation) constraint satisfaction problems of arities 2 and 3 parameterized above the average  ...  Ordering CSPs In this section we will discuss recent results in the area of Ordering Constraint Satisfaction Problems (Ordering CSPs) parameterized above average.  ... 
arXiv:1108.4803v1 fatcat:3wxkx7blgjfkzmqtw4jn7qdlqa

The Complexity of Surjective Homomorphism Problems -- a Survey [article]

Manuel Bodirsky, Jan Kara, Barnaby Martin
2011 arXiv   pre-print
We survey known results about the complexity of surjective homomorphism problems, studied in the context of related problems in the literature such as list homomorphism, retraction and compaction.  ...  In comparison with these problems, surjective homomorphism problems seem to be harder to classify and we examine especially three concrete problems that have arisen from the literature, two of which remain  ...  constraint satisfaction problems for trees can be reduced to surjective homo-morphism problems).  ... 
arXiv:1104.5257v2 fatcat:upng3txz5rbtlgzzmhfldkwiyq

A Survey on Graph Problems Parameterized Above and Below Guaranteed Values [article]

Gregory Gutin, Matthias Mnich
2022 arXiv   pre-print
We survey the field of algorithms and complexity for graph problems parameterized above or below guaranteed values, a research area which was pioneered by Venkatesh Raman.  ...  Those problems seek, for a given graph G, a solution whose value is at least g(G)+k or at most g(G)-k, where g(G) is a guarantee on the value that any solution on G takes.  ...  As a result, the next survey paper by Gutin and Yeo [31] covered only results on constraint satisfaction problems. The survey [31] was updated later by the same authors [32] .  ... 
arXiv:2207.12278v1 fatcat:va33yl356fh5xn64qge6tvhpuq

The complexity of surjective homomorphism problems—a survey

Manuel Bodirsky, Jan Kára, Barnaby Martin
2012 Discrete Applied Mathematics  
We survey known results about the complexity of surjective homomorphism problems, studied in the context of related problems in the literature such as list homomorphism, retraction and compaction.  ...  In comparison with these problems, surjective homomorphism problems seem to be harder to classify and we examine especially three concrete problems that have arisen from the literature, two of whose complexity  ...  constraint satisfaction problems for trees can be reduced to surjective homomorphism problems).  ... 
doi:10.1016/j.dam.2012.03.029 fatcat:bghwzonlezbyznkkptjvnm6tju

Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey [chapter]

Gregory Gutin, Anders Yeo
2012 Lecture Notes in Computer Science  
We consider constraint satisfaction problems parameterized above or below tight bounds.  ...  We also consider Max-r-CSP-AA, a natural generalization of both Max-r-Lin2-AA and Max-r-Sat-AA, order (or, permutation) constraint satisfaction problems of arities 2 and 3 parameterized above the average  ...  Ordering CSPs In this section we will discuss recent results in the area of Ordering Constraint Satisfaction Problems (Ordering CSPs) parameterized above average.  ... 
doi:10.1007/978-3-642-30891-8_14 fatcat:r6ztg5kqybefhfxd2myyxtbq6q

A Survey on Workflow Satisfiability, Resiliency, and Related Problems [article]

Daniel Ricardo dos Santos, Silvio Ranise
2017 arXiv   pre-print
In this paper, we survey the work done on these problems in the past 20 years.  ...  The WSP is inherently hard, but solutions to this problem have a practical application in reconciling business compliance and business continuity.  ...  In this paper, we present a survey of the most relevant work in the areas of workflow satisfiability, resiliency, and related problems.  ... 
arXiv:1706.07205v1 fatcat:r54f5z6ykvaojpleu6cjwqtmni

Hypertree Decompositions: A Survey [chapter]

Georg Gottlob, Nicola Leone, Francesco Scarcello
2001 Lecture Notes in Computer Science  
Important NP hard problems become tractable if restricted to instances whose associated hypergraphs are of bounded hypertree width.  ...  We also review a number of complexity results on problems whose structure is described by acyclic or nearly acyclic hypergraphs.  ...  Z; (D) the marshals capture the robber in W Fig. 7 . 7 Constraint tractability hierarchy 2 (The Constraint Satisfaction Problem CSP.).  ... 
doi:10.1007/3-540-44683-4_5 fatcat:e2x57x7rdbesflhlesjfs6426e

A survey of the machine interference problem

Lani Haque, Michael J. Armstrong
2007 European Journal of Operational Research  
This paper surveys the research published on the machine interference problem since the 1985 review by Stecke & Aronson.  ...  We then note how research has evolved since the 1985 review, including a trend towards the modelling of stochastic (rather than deterministic) systems and the corresponding use of more advanced queuing  ...  Acknowledgements We thank the anonymous referees for their suggestions on improving this survey, in particular for pointing out a number of additional references for inclusion.  ... 
doi:10.1016/j.ejor.2006.02.036 fatcat:klsfdotq5jdithwybliscae5w4

A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems [article]

Nicolas Bousquet and Amer E. Mouawad and Naomi Nishimura and Sebastian Siebertz
2022 arXiv   pre-print
We survey both older and more recent work on the parameterized complexity of all three problems when parameterized by the number of tokens k.  ...  Many algorithmic questions present themselves in the form of reconfiguration problems: Given the description of an initial system state and the description of a target state, is it possible to transform  ...  Reconfiguration problems independently emerged in different areas such as graph theory [16, 61] , constraint satisfaction [30, 50] , computational geometry [49] , and even quantum complexity theory  ... 
arXiv:2204.10526v1 fatcat:ua3pkqxtabatbbl6jydhy3i3b4

Methods for solving reasoning problems in abstract argumentation – A survey

Günther Charwat, Wolfgang Dvořák, Sarah A. Gaggl, Johannes P. Wallner, Stefan Woltran
2015 Artificial Intelligence  
In this survey, we give an overview on different methods for solving reasoning problems in abstract argumentation and compare their particular features.  ...  Although the idea of abstract argumentation is appealingly simple, several reasoning problems in this formalism exhibit high computational complexity.  ...  The authors would like to thank all colleagues who participated in the development of the systems ASPARTIX, CEGARTIX, D-FLAT and dynPARTIX.  ... 
doi:10.1016/j.artint.2014.11.008 pmid:25737590 pmcid:PMC4318991 fatcat:qrw6bic4vjc5zdqkvi5tlhcs7m

Temporal Reasoning in Natural Language Processing: A Survey

Suresh Kumar Sanampudi, G.Vijaya Kumari
2010 International Journal of Computer Applications  
A discussion of the frameworks for temporal reasoning and tractable classes is described.  ...  The present paper is a survey of various proposals to address these issues. Various annotation schemas developed to represent temporal information in natural language text.  ...  Reasoning in this framework becomes a temporal constraint satisfaction problem (TCSP).  ... 
doi:10.5120/100-209 fatcat:hrlouzt2onc6njhxr6uqydu2ym

Harnessing tractability in constraint satisfaction problems Directeur(s) de Thèse : Membre(s) du jury

M Martin, Cooper Emmanuel, Hebrard Rapporteurs, Nadia Mme, Aix-Marseille Creignou, Président Universite, Laas Hebrard, Membre Toulouse, Paul Cooper, Membre Sabatier, Jegou
unpublished
It has been a pleasure and an honour working with him.  ...  Ph.D. in the best possible conditions.  ...  This chapter is organized as follows: • Section 2.1 defines the Constraint Satisfaction Problem and introduces basic notation. • Section 2.2 is a survey of tractable classes for CSP based on restrictions  ... 
fatcat:t3c7mmehpzhp7g2326ogtselbu

A Survey of Linear and Mixed-Integer Optimization Tutorials

Alexandra M. Newman, Martin Weiss
2013 INFORMS Transactions on Education  
A s advanced undergraduate and graduate students in optimization begin conducting research, they must base their work on articles found in academic journals.  ...  However, there is often a gap between the levels at which a journal article and a textbook are written.  ...  Brailsford et al. (1999) provide a tutorial on constraint satisfaction problems. The authors define these combinatorial problems as those requiring a solution that satisfies a set of constraints.  ... 
doi:10.1287/ited.2013.0115 fatcat:jbcbekk57fe27lydnvictgtoqy
« Previous Showing results 1 — 15 out of 5,899 results