CSP duality and trees of bounded pathwidth

We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the use of non-linearity. We show how such problems can be described in terms of homomorphism dualities involving trees of bounded pathwidth and in algebraic terms. For this, we introduce a new parameter...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 411; no. 34; pp. 3188 - 3208
Main Authors Carvalho, Catarina, Dalmau, Víctor, Krokhin, Andrei
Format Journal Article
LanguageEnglish
Published Oxford Elsevier B.V 17.07.2010
Elsevier
Subjects
Algebra
Applied sciences
Approximation
Bounded pathwidth
C (programming language)
Combinatorics
Combinatorics. Ordered structures
Computer science; control theory; systems
Constraint satisfaction problem
Datalog
Exact sciences and technology
Games
Graph theory
Homomorphism duality
Homomorphisms
Mathematics
Miscellaneous
Nonlinearity
Polymorphisms
Sciences and techniques of general use
Searching
Theoretical computing
Trees
Constraint satisfaction problem
Homomorphism duality
Datalog
Polymorphisms
Bounded pathwidth
Hypergraph
Computer theory
Linearity
Tree
Duality
DATALOG
Homomorphism
Polymorphism
Online AccessGet full text

Cover

Abstract We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the use of non-linearity. We show how such problems can be described in terms of homomorphism dualities involving trees of bounded pathwidth and in algebraic terms. For this, we introduce a new parameter for trees that closely approximates pathwidth and can be characterised via a hypergraph searching game.
AbstractList We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the use of non-linearity. We show how such problems can be described in terms of homomorphism dualities involving trees of bounded pathwidth and in algebraic terms. For this, we introduce a new parameter for trees that closely approximates pathwidth and can be characterised via a hypergraph searching game.
We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the use of non-linearity. We show how such problems can be described in terms of homomorphism dualities involving trees of bounded pathwidth and in algebraic terms. For this, we introduce a new parameter for trees that closely approximates pathwidth and can be characterised via a hypergraph searching game. The first author is supported by FCT grant SFRH/BPD/26216/2006 and also by FCT and FEDER within the project ISFL-1-143 of the Centre for Algebra of the University of Lisbon. The second author is supported by grants TIN2006-15387-C03-03 and TIN2007-68005-C04 funded by the MCyT. The third author is supported by the UK EPSRC grants EP/G011001/1 and EP/C543831/1.
Author Dalmau, Víctor
Carvalho, Catarina
Krokhin, Andrei
Author_xml – sequence: 1
  givenname: Catarina
  surname: Carvalho
  fullname: Carvalho, Catarina
  email: ccarvalho@cii.fc.ul.pt
  organization: Centre for Algebra, University of Lisbon, 1649-003 Lisbon, Portugal
– sequence: 2
  givenname: Víctor
  surname: Dalmau
  fullname: Dalmau, Víctor
  email: victor.dalmau@upf.edu
  organization: Department of Technology, University Pompeu Fabra, Barcelona, 08018, Spain
– sequence: 3
  givenname: Andrei
  surname: Krokhin
  fullname: Krokhin, Andrei
  email: andrei.krokhin@durham.ac.uk
  organization: School of Engineering and Computing Sciences, Durham University, Durham, DH1 3LE, UK
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=23015081$$DView record in Pascal Francis
BookMark eNp9UMtKBDEQDKLg-vgAb3MRQZg1j8lkBk-y-AJBQT2H3qTDZhln1iSj-Pdm2UU92dA0XXRVNXVAdvuhR0JOGJ0yyuqL5TSZOOU071ROM7JDJqxRbcl5W-2SCRW0KkWr5D45iHFJc0lVT8j57PmpsCN0Pn0V0NsiBcRYDK6YD2Nv0RYrSItPb9PiiOw56CIeb-cheb25fpndlQ-Pt_ezq4fSVFWVyoYrB42hilvknCmL0tQ1AiisnXQUgTklnGhRcjtnIPL_iC04p9S8rSpxSNhG18TR6IAGg4GkB_C_y7p5ttCiqgXnmXO24azC8D5iTPrNR4NdBz0OY9SqUVTKmqo_6mGIMaDTq-DfIHxpRvU6Sr3UOUq9jlJTqTOSOadbdYgGOhegNz7-ELmgTNKG5bvLzR3meD48Bh2Nx96g9fnzpO3g_3H5BqCbiUw
CODEN TCSCDI
CitedBy_id crossref_primary_10_1007_s00224_011_9333_8
crossref_primary_10_1145_2540090
crossref_primary_10_1137_18M1163932
crossref_primary_10_1007_s10601_023_09341_8
crossref_primary_10_1016_j_artint_2022_103709
Cites_doi 10.1109/LICS.2007.47
10.1145/151261.151263
10.1145/1120582.1120584
10.1006/jctb.1993.1027
10.1093/logcom/exl014
10.1007/s00012-008-2122-9
10.1016/0012-365X(95)00312-K
10.1002/jgt.20025
10.1137/S0097539700376676
10.1137/S0895480101389478
10.1016/j.ejc.2007.11.020
10.1016/0168-0072(95)00021-6
10.1145/73007.73018
10.1137/S0097539794266766
10.1017/S0004972700012284
10.1016/0095-8956(89)90039-7
10.1007/978-3-7091-9076-0_2
10.1109/FOCS.2009.32
10.2168/LMCS-1(1:5)2005
10.1016/S0022-0000(03)00030-8
10.1016/j.tcs.2008.12.048
10.1145/42267.42268
10.1007/BF01190934
10.1006/inco.1994.1064
10.1007/s00012-007-2012-6
10.1023/A:1010676831037
10.1016/0020-0190(92)90234-M
10.1016/0304-3975(86)90146-5
10.1109/LICS.2008.19
ContentType Journal Article
Copyright 2010 Elsevier B.V.
2015 INIST-CNRS
info:eu-repo/semantics/openAccess © Elsevier http://dx.doi.org/10.1016/j.tcs.2010.05.016
Copyright_xml – notice: 2010 Elsevier B.V.
– notice: 2015 INIST-CNRS
– notice: info:eu-repo/semantics/openAccess © Elsevier <a href="http://dx.doi.org/10.1016/j.tcs.2010.05.016">http://dx.doi.org/10.1016/j.tcs.2010.05.016</a>
DBID 6I.
AAFTH
IQODW
AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
XX2
DOI 10.1016/j.tcs.2010.05.016
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
Pascal-Francis
CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Recercat
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList

Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
Applied Sciences
EISSN 1879-2294
EndPage 3208
ExternalDocumentID oai_recercat_cat_2072_346322
10_1016_j_tcs_2010_05_016
23015081
S0304397510002975
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
123
1B1
1RT
1~.
1~5
29Q
4.4
457
4G.
5VS
6I.
7-5
71M
8P~
9JN
AABNK
AACTN
AAEDT
AAEDW
AAFTH
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABAOU
ABBOA
ABEFU
ABFNM
ABJNI
ABMAC
ABTAH
ABVKL
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADMUD
AEBSH
AEKER
AENEX
AEXQZ
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
G8K
GBLVA
GBOLZ
HVGLF
HZ~
IHE
IXB
J1W
KOM
LG9
M26
M41
MHUIS
MO0
N9A
NCXOZ
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
ROL
RPZ
SCC
SDF
SDG
SES
SEW
SPC
SPCBC
SSV
SSW
SSZ
T5K
TAE
TN5
WH7
WUQ
XJT
YNT
ZMT
ZY4
~G-
ABPIF
ABPTK
IQODW
0SF
AAXKI
AAYXX
ADVLN
AFJKZ
AKRWK
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
ABDPE
XX2
ID FETCH-LOGICAL-c444t-827fa8c072de2217de5c66eaa7e6f5f0ea1f73f39e52db1a3101ee9aff77b9443
IEDL.DBID ABVKL
ISSN 0304-3975
IngestDate Fri Nov 15 12:51:05 EST 2024
Fri Oct 25 06:03:30 EDT 2024
Thu Sep 26 19:02:05 EDT 2024
Sun Oct 22 16:04:44 EDT 2023
Fri Feb 23 02:16:39 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 34
Keywords Constraint satisfaction problem
Homomorphism duality
Datalog
Polymorphisms
Bounded pathwidth
Hypergraph
Computer theory
Linearity
Tree
Duality
DATALOG
Homomorphism
Polymorphism
Language English
License http://www.elsevier.com/open-access/userlicense/1.0
CC BY 4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c444t-827fa8c072de2217de5c66eaa7e6f5f0ea1f73f39e52db1a3101ee9aff77b9443
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
OpenAccessLink https://www.sciencedirect.com/science/article/pii/S0304397510002975
PQID 787055607
PQPubID 23500
PageCount 21
ParticipantIDs csuc_recercat_oai_recercat_cat_2072_346322
proquest_miscellaneous_787055607
crossref_primary_10_1016_j_tcs_2010_05_016
pascalfrancis_primary_23015081
elsevier_sciencedirect_doi_10_1016_j_tcs_2010_05_016
PublicationCentury 2000
PublicationDate 2010-07-17
PublicationDateYYYYMMDD 2010-07-17
PublicationDate_xml – month: 07
  year: 2010
  text: 2010-07-17
  day: 17
PublicationDecade 2010
PublicationPlace Oxford
PublicationPlace_xml – name: Oxford
PublicationTitle Theoretical computer science
PublicationYear 2010
Publisher Elsevier B.V
Elsevier
Publisher_xml – name: Elsevier B.V
– name: Elsevier
References Bulatov (b6) 2006; 53
Cohen, Jeavons (b11) 2006
Dalmau (b13) 2005; 1
A. Bulatov, Tractable conservative constraint satisfaction problems, in: LICS’03, 2003, pp. 321–330.
Meggido, Hakimi, Garey, Johnson, Papadimitriou (b32) 1988; 35
Larose, Tesson (b27) 2009; 410
Bulatov, Krokhin, Larose (b8) 2008; vol. 5250
Barrière, Fraigniaud, Santoro, Thilikos (b3) 2003; vol. 2880
Maróti, McKenzie (b31) 2008; 59
Kirousis, Papadimitriou (b23) 1986; 47
LaPaugh (b26) 1993; 40
Kinnersley (b22) 1992; 42
Adler (b1) 2004; 47
Möhring (b33) 1990; 7
Creignou, Khanna, Sudan (b12) 2001; vol. 7
Larose, Zádori (b29) 2003; 17
Zádori (b37) 1993; 47
Kolaitis (b24) 2007
Bulatov, Jeavons, Krokhin (b7) 2005; 34
Larose, Zádori (b28) 1997; 163
Bulatov, Valeriote (b9) 2008; vol. 5250
Ellis, Sudborough, Turner (b17) 1994; 113
L. Barto, M. Kozik, Constraint satisfaction problems of bounded width, in: FOCS’09, 2009, pp. 595–603.
Dalmau, Krokhin (b14) 2008; 29
Larose, Zádori (b30) 2007; 56
Seymour, Thomas (b35) 1993; 58
Feder, Vardi (b18) 1998; 28
F. Afrati, S. Cosmodakis, Expressiveness of restricted recursive queries, in: STOC’89, 1989, pp. 113–126.
Grädel, McColm (b21) 1996; 77
Dalmau, Krokhin, Larose (b15) 2007; 17
Nešetřil, Rödl (b34) 1989; 46
C. Carvalho, V. Dalmau, A. Krokhin, Caterpillar duality for constraint satisfaction problems, in: LICS’08, 2008, pp. 307–316.
L. Egri, B. Larose, P. Tesson, Symmetric Datalog and constraint satisfaction problems in Logspace, in: LICS’07, 2007, pp. 193–202.
Kolaitis, Vardi (b25) 2007
Gottlob, Leone, Scarcello (b20) 2003; 66
Szabó, Zádori (b36) 2001; 18
Zádori (b38) 1995; 33
Fomin, Thilikos (b19) 2008; 41
Dalmau (10.1016/j.tcs.2010.05.016_b15) 2007; 17
Dalmau (10.1016/j.tcs.2010.05.016_b14) 2008; 29
Seymour (10.1016/j.tcs.2010.05.016_b35) 1993; 58
Kirousis (10.1016/j.tcs.2010.05.016_b23) 1986; 47
Feder (10.1016/j.tcs.2010.05.016_b18) 1998; 28
Adler (10.1016/j.tcs.2010.05.016_b1) 2004; 47
Larose (10.1016/j.tcs.2010.05.016_b27) 2009; 410
Larose (10.1016/j.tcs.2010.05.016_b30) 2007; 56
Larose (10.1016/j.tcs.2010.05.016_b28) 1997; 163
Kinnersley (10.1016/j.tcs.2010.05.016_b22) 1992; 42
Larose (10.1016/j.tcs.2010.05.016_b29) 2003; 17
Bulatov (10.1016/j.tcs.2010.05.016_b8) 2008; vol. 5250
Zádori (10.1016/j.tcs.2010.05.016_b38) 1995; 33
Cohen (10.1016/j.tcs.2010.05.016_b11) 2006
Kolaitis (10.1016/j.tcs.2010.05.016_b25) 2007
Nešetřil (10.1016/j.tcs.2010.05.016_b34) 1989; 46
Bulatov (10.1016/j.tcs.2010.05.016_b9) 2008; vol. 5250
Möhring (10.1016/j.tcs.2010.05.016_b33) 1990; 7
Barrière (10.1016/j.tcs.2010.05.016_b3) 2003; vol. 2880
Bulatov (10.1016/j.tcs.2010.05.016_b7) 2005; 34
Meggido (10.1016/j.tcs.2010.05.016_b32) 1988; 35
Maróti (10.1016/j.tcs.2010.05.016_b31) 2008; 59
10.1016/j.tcs.2010.05.016_b10
Dalmau (10.1016/j.tcs.2010.05.016_b13) 2005; 1
10.1016/j.tcs.2010.05.016_b16
Szabó (10.1016/j.tcs.2010.05.016_b36) 2001; 18
10.1016/j.tcs.2010.05.016_b4
Ellis (10.1016/j.tcs.2010.05.016_b17) 1994; 113
10.1016/j.tcs.2010.05.016_b5
10.1016/j.tcs.2010.05.016_b2
Fomin (10.1016/j.tcs.2010.05.016_b19) 2008; 41
Grädel (10.1016/j.tcs.2010.05.016_b21) 1996; 77
Gottlob (10.1016/j.tcs.2010.05.016_b20) 2003; 66
Zádori (10.1016/j.tcs.2010.05.016_b37) 1993; 47
Bulatov (10.1016/j.tcs.2010.05.016_b6) 2006; 53
Creignou (10.1016/j.tcs.2010.05.016_b12) 2001; vol. 7
LaPaugh (10.1016/j.tcs.2010.05.016_b26) 1993; 40
Kolaitis (10.1016/j.tcs.2010.05.016_b24) 2007
References_xml – volume: 41
  start-page: 381
  year: 2008
  end-page: 393
  ident: b19
  article-title: An annotated bibliography on guaranteed graph searching
  publication-title: Theoretical Computer Science
  contributor:
    fullname: Thilikos
– volume: 17
  start-page: 31
  year: 2007
  end-page: 51
  ident: b15
  article-title: First-order definable retraction problems for reflexive graphs and posets
  publication-title: Journal of Logic and Computation
  contributor:
    fullname: Larose
– volume: 77
  start-page: 169
  year: 1996
  end-page: 199
  ident: b21
  article-title: Hierarchies in transitive closure logic, stratified Datalog and infinitary logic
  publication-title: Annals of Pure and Applied Logic
  contributor:
    fullname: McColm
– volume: 17
  start-page: 114
  year: 2003
  end-page: 121
  ident: b29
  article-title: The complexity of the extendibility problem for finite posets
  publication-title: SIAM Journal on Discrete Mathematics
  contributor:
    fullname: Zádori
– volume: 163
  start-page: 89
  year: 1997
  end-page: 99
  ident: b28
  article-title: Algebraic properties and dismantlability of finite posets
  publication-title: Discrete Mathematics
  contributor:
    fullname: Zádori
– volume: vol. 5250
  start-page: 93
  year: 2008
  end-page: 124
  ident: b8
  article-title: Dualities for constraint satisfaction problems
  publication-title: Complexity of Constraints
  contributor:
    fullname: Larose
– volume: 56
  start-page: 439
  year: 2007
  end-page: 466
  ident: b30
  article-title: Bounded width problems and algebras
  publication-title: Algebra Universalis
  contributor:
    fullname: Zádori
– volume: 47
  start-page: 275
  year: 2004
  end-page: 296
  ident: b1
  article-title: Marshals, monotone marshals, and hypertree width
  publication-title: Journal of Graph Theory
  contributor:
    fullname: Adler
– volume: 47
  start-page: 205
  year: 1986
  end-page: 218
  ident: b23
  article-title: Searching and pebbling
  publication-title: Theoretical Computer Science
  contributor:
    fullname: Papadimitriou
– volume: 7
  start-page: 17
  year: 1990
  end-page: 51
  ident: b33
  article-title: Graph problems related to gate matrix layout and PLA folding
  publication-title: Computing, Suppl.
  contributor:
    fullname: Möhring
– year: 2006
  ident: b11
  article-title: The complexity of constraint languages
  publication-title: Handbook of Constraint Programming
  contributor:
    fullname: Jeavons
– volume: 35
  start-page: 18
  year: 1988
  end-page: 44
  ident: b32
  article-title: The complexity of searching a graph
  publication-title: Journal of the ACM
  contributor:
    fullname: Papadimitriou
– volume: 42
  start-page: 345
  year: 1992
  end-page: 350
  ident: b22
  article-title: The vertex separation number of a graph is equal to its path-width
  publication-title: Information Processing Letters
  contributor:
    fullname: Kinnersley
– volume: 59
  start-page: 463
  year: 2008
  end-page: 489
  ident: b31
  article-title: Existence theorems for weakly symmetric operations
  publication-title: Algebra Universalis
  contributor:
    fullname: McKenzie
– start-page: 27
  year: 2007
  end-page: 124
  ident: b24
  article-title: On the expressive power of logics on finite models
  publication-title: Finite Model Theory and its Applications
  contributor:
    fullname: Kolaitis
– volume: 29
  start-page: 821
  year: 2008
  end-page: 837
  ident: b14
  article-title: Majority constraints have bounded pathwidth duality
  publication-title: European Journal of Combinatorics
  contributor:
    fullname: Krokhin
– volume: 53
  start-page: 66
  year: 2006
  end-page: 120
  ident: b6
  article-title: A dichotomy theorem for constraint satisfaction problems on a 3-element set
  publication-title: Journal of the ACM
  contributor:
    fullname: Bulatov
– volume: 58
  start-page: 22
  year: 1993
  end-page: 33
  ident: b35
  article-title: Graph searching and a min–max theorem for tree-width
  publication-title: Journal of Combinatorial Theory, Series B
  contributor:
    fullname: Thomas
– volume: 1
  year: 2005
  ident: b13
  article-title: Linear Datalog and bounded path duality for relational structures
  publication-title: Logical Methods in Computer Science
  contributor:
    fullname: Dalmau
– volume: 46
  start-page: 133
  year: 1989
  end-page: 141
  ident: b34
  article-title: Chromatically optimal rigid graphs
  publication-title: Journal of Combinatorial Theory, Series B
  contributor:
    fullname: Rödl
– volume: vol. 5250
  start-page: 68
  year: 2008
  end-page: 92
  ident: b9
  article-title: Recent results on the algebraic approach to the CSP
  publication-title: Complexity of Constraints
  contributor:
    fullname: Valeriote
– volume: vol. 2880
  start-page: 34
  year: 2003
  end-page: 45
  ident: b3
  article-title: Searching is not jumping
  publication-title: WG’03
  contributor:
    fullname: Thilikos
– volume: 33
  start-page: 216
  year: 1995
  end-page: 236
  ident: b38
  article-title: Monotone Jónsson operations and near unanimity functions
  publication-title: Algebra Universalis
  contributor:
    fullname: Zádori
– volume: 66
  start-page: 775
  year: 2003
  end-page: 808
  ident: b20
  article-title: Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
  publication-title: Journal of Computer and System Sciences
  contributor:
    fullname: Scarcello
– volume: 40
  start-page: 224
  year: 1993
  end-page: 245
  ident: b26
  article-title: Recontamination does not help to search a graph
  publication-title: Journal of the ACM
  contributor:
    fullname: LaPaugh
– volume: 410
  start-page: 1629
  year: 2009
  end-page: 1647
  ident: b27
  article-title: Universal algebra and hardness results for constraint satisfaction problems
  publication-title: Theoretical Computer Science
  contributor:
    fullname: Tesson
– volume: 28
  start-page: 57
  year: 1998
  end-page: 104
  ident: b18
  article-title: The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory
  publication-title: SIAM Journal on Computing
  contributor:
    fullname: Vardi
– volume: vol. 7
  year: 2001
  ident: b12
  publication-title: Complexity Classifications of Boolean Constraint Satisfaction Problems
  contributor:
    fullname: Sudan
– start-page: 339
  year: 2007
  end-page: 370
  ident: b25
  article-title: A logical approach to constraint satisfaction
  publication-title: Finite Model Theory and its Applications
  contributor:
    fullname: Vardi
– volume: 47
  start-page: 79
  year: 1993
  end-page: 93
  ident: b37
  article-title: Posets, near-unanimity functions and zigzags
  publication-title: Bulletin of the Australian Mathematical Society
  contributor:
    fullname: Zádori
– volume: 18
  start-page: 39
  year: 2001
  end-page: 47
  ident: b36
  article-title: Idempotent totally symmetric operations on finite posets
  publication-title: Order
  contributor:
    fullname: Zádori
– volume: 34
  start-page: 720
  year: 2005
  end-page: 742
  ident: b7
  article-title: Classifying complexity of constraints using finite algebras
  publication-title: SIAM Journal on Computing
  contributor:
    fullname: Krokhin
– volume: 113
  start-page: 50
  year: 1994
  end-page: 79
  ident: b17
  article-title: The vertex separation and search number of a graph
  publication-title: Information and Computation
  contributor:
    fullname: Turner
– ident: 10.1016/j.tcs.2010.05.016_b16
  doi: 10.1109/LICS.2007.47
– volume: 40
  start-page: 224
  year: 1993
  ident: 10.1016/j.tcs.2010.05.016_b26
  article-title: Recontamination does not help to search a graph
  publication-title: Journal of the ACM
  doi: 10.1145/151261.151263
  contributor:
    fullname: LaPaugh
– volume: 53
  start-page: 66
  issue: 1
  year: 2006
  ident: 10.1016/j.tcs.2010.05.016_b6
  article-title: A dichotomy theorem for constraint satisfaction problems on a 3-element set
  publication-title: Journal of the ACM
  doi: 10.1145/1120582.1120584
  contributor:
    fullname: Bulatov
– volume: 58
  start-page: 22
  year: 1993
  ident: 10.1016/j.tcs.2010.05.016_b35
  article-title: Graph searching and a min–max theorem for tree-width
  publication-title: Journal of Combinatorial Theory, Series B
  doi: 10.1006/jctb.1993.1027
  contributor:
    fullname: Seymour
– volume: 17
  start-page: 31
  issue: 1
  year: 2007
  ident: 10.1016/j.tcs.2010.05.016_b15
  article-title: First-order definable retraction problems for reflexive graphs and posets
  publication-title: Journal of Logic and Computation
  doi: 10.1093/logcom/exl014
  contributor:
    fullname: Dalmau
– volume: 59
  start-page: 463
  issue: 3–4
  year: 2008
  ident: 10.1016/j.tcs.2010.05.016_b31
  article-title: Existence theorems for weakly symmetric operations
  publication-title: Algebra Universalis
  doi: 10.1007/s00012-008-2122-9
  contributor:
    fullname: Maróti
– volume: 163
  start-page: 89
  year: 1997
  ident: 10.1016/j.tcs.2010.05.016_b28
  article-title: Algebraic properties and dismantlability of finite posets
  publication-title: Discrete Mathematics
  doi: 10.1016/0012-365X(95)00312-K
  contributor:
    fullname: Larose
– volume: vol. 5250
  start-page: 68
  year: 2008
  ident: 10.1016/j.tcs.2010.05.016_b9
  article-title: Recent results on the algebraic approach to the CSP
  contributor:
    fullname: Bulatov
– volume: vol. 2880
  start-page: 34
  year: 2003
  ident: 10.1016/j.tcs.2010.05.016_b3
  article-title: Searching is not jumping
  contributor:
    fullname: Barrière
– start-page: 339
  year: 2007
  ident: 10.1016/j.tcs.2010.05.016_b25
  article-title: A logical approach to constraint satisfaction
  contributor:
    fullname: Kolaitis
– volume: 47
  start-page: 275
  issue: 4
  year: 2004
  ident: 10.1016/j.tcs.2010.05.016_b1
  article-title: Marshals, monotone marshals, and hypertree width
  publication-title: Journal of Graph Theory
  doi: 10.1002/jgt.20025
  contributor:
    fullname: Adler
– volume: 34
  start-page: 720
  issue: 3
  year: 2005
  ident: 10.1016/j.tcs.2010.05.016_b7
  article-title: Classifying complexity of constraints using finite algebras
  publication-title: SIAM Journal on Computing
  doi: 10.1137/S0097539700376676
  contributor:
    fullname: Bulatov
– volume: 17
  start-page: 114
  issue: 1
  year: 2003
  ident: 10.1016/j.tcs.2010.05.016_b29
  article-title: The complexity of the extendibility problem for finite posets
  publication-title: SIAM Journal on Discrete Mathematics
  doi: 10.1137/S0895480101389478
  contributor:
    fullname: Larose
– volume: 29
  start-page: 821
  issue: 4
  year: 2008
  ident: 10.1016/j.tcs.2010.05.016_b14
  article-title: Majority constraints have bounded pathwidth duality
  publication-title: European Journal of Combinatorics
  doi: 10.1016/j.ejc.2007.11.020
  contributor:
    fullname: Dalmau
– volume: 77
  start-page: 169
  issue: 2
  year: 1996
  ident: 10.1016/j.tcs.2010.05.016_b21
  article-title: Hierarchies in transitive closure logic, stratified Datalog and infinitary logic
  publication-title: Annals of Pure and Applied Logic
  doi: 10.1016/0168-0072(95)00021-6
  contributor:
    fullname: Grädel
– volume: 41
  start-page: 381
  issue: 2
  year: 2008
  ident: 10.1016/j.tcs.2010.05.016_b19
  article-title: An annotated bibliography on guaranteed graph searching
  publication-title: Theoretical Computer Science
  contributor:
    fullname: Fomin
– ident: 10.1016/j.tcs.2010.05.016_b2
  doi: 10.1145/73007.73018
– volume: 28
  start-page: 57
  year: 1998
  ident: 10.1016/j.tcs.2010.05.016_b18
  article-title: The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory
  publication-title: SIAM Journal on Computing
  doi: 10.1137/S0097539794266766
  contributor:
    fullname: Feder
– volume: 47
  start-page: 79
  year: 1993
  ident: 10.1016/j.tcs.2010.05.016_b37
  article-title: Posets, near-unanimity functions and zigzags
  publication-title: Bulletin of the Australian Mathematical Society
  doi: 10.1017/S0004972700012284
  contributor:
    fullname: Zádori
– year: 2006
  ident: 10.1016/j.tcs.2010.05.016_b11
  article-title: The complexity of constraint languages
  contributor:
    fullname: Cohen
– ident: 10.1016/j.tcs.2010.05.016_b5
– volume: vol. 5250
  start-page: 93
  year: 2008
  ident: 10.1016/j.tcs.2010.05.016_b8
  article-title: Dualities for constraint satisfaction problems
  contributor:
    fullname: Bulatov
– volume: 46
  start-page: 133
  year: 1989
  ident: 10.1016/j.tcs.2010.05.016_b34
  article-title: Chromatically optimal rigid graphs
  publication-title: Journal of Combinatorial Theory, Series B
  doi: 10.1016/0095-8956(89)90039-7
  contributor:
    fullname: Nešetřil
– volume: vol. 7
  year: 2001
  ident: 10.1016/j.tcs.2010.05.016_b12
  contributor:
    fullname: Creignou
– volume: 7
  start-page: 17
  year: 1990
  ident: 10.1016/j.tcs.2010.05.016_b33
  article-title: Graph problems related to gate matrix layout and PLA folding
  publication-title: Computing, Suppl.
  doi: 10.1007/978-3-7091-9076-0_2
  contributor:
    fullname: Möhring
– ident: 10.1016/j.tcs.2010.05.016_b4
  doi: 10.1109/FOCS.2009.32
– volume: 1
  issue: 1
  year: 2005
  ident: 10.1016/j.tcs.2010.05.016_b13
  article-title: Linear Datalog and bounded path duality for relational structures
  publication-title: Logical Methods in Computer Science
  doi: 10.2168/LMCS-1(1:5)2005
  contributor:
    fullname: Dalmau
– volume: 66
  start-page: 775
  year: 2003
  ident: 10.1016/j.tcs.2010.05.016_b20
  article-title: Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
  publication-title: Journal of Computer and System Sciences
  doi: 10.1016/S0022-0000(03)00030-8
  contributor:
    fullname: Gottlob
– volume: 410
  start-page: 1629
  issue: 18
  year: 2009
  ident: 10.1016/j.tcs.2010.05.016_b27
  article-title: Universal algebra and hardness results for constraint satisfaction problems
  publication-title: Theoretical Computer Science
  doi: 10.1016/j.tcs.2008.12.048
  contributor:
    fullname: Larose
– volume: 35
  start-page: 18
  issue: 1
  year: 1988
  ident: 10.1016/j.tcs.2010.05.016_b32
  article-title: The complexity of searching a graph
  publication-title: Journal of the ACM
  doi: 10.1145/42267.42268
  contributor:
    fullname: Meggido
– volume: 33
  start-page: 216
  issue: 2
  year: 1995
  ident: 10.1016/j.tcs.2010.05.016_b38
  article-title: Monotone Jónsson operations and near unanimity functions
  publication-title: Algebra Universalis
  doi: 10.1007/BF01190934
  contributor:
    fullname: Zádori
– volume: 113
  start-page: 50
  issue: 1
  year: 1994
  ident: 10.1016/j.tcs.2010.05.016_b17
  article-title: The vertex separation and search number of a graph
  publication-title: Information and Computation
  doi: 10.1006/inco.1994.1064
  contributor:
    fullname: Ellis
– start-page: 27
  year: 2007
  ident: 10.1016/j.tcs.2010.05.016_b24
  article-title: On the expressive power of logics on finite models
  contributor:
    fullname: Kolaitis
– volume: 56
  start-page: 439
  issue: 3–4
  year: 2007
  ident: 10.1016/j.tcs.2010.05.016_b30
  article-title: Bounded width problems and algebras
  publication-title: Algebra Universalis
  doi: 10.1007/s00012-007-2012-6
  contributor:
    fullname: Larose
– volume: 18
  start-page: 39
  year: 2001
  ident: 10.1016/j.tcs.2010.05.016_b36
  article-title: Idempotent totally symmetric operations on finite posets
  publication-title: Order
  doi: 10.1023/A:1010676831037
  contributor:
    fullname: Szabó
– volume: 42
  start-page: 345
  issue: 6
  year: 1992
  ident: 10.1016/j.tcs.2010.05.016_b22
  article-title: The vertex separation number of a graph is equal to its path-width
  publication-title: Information Processing Letters
  doi: 10.1016/0020-0190(92)90234-M
  contributor:
    fullname: Kinnersley
– volume: 47
  start-page: 205
  issue: 3
  year: 1986
  ident: 10.1016/j.tcs.2010.05.016_b23
  article-title: Searching and pebbling
  publication-title: Theoretical Computer Science
  doi: 10.1016/0304-3975(86)90146-5
  contributor:
    fullname: Kirousis
– ident: 10.1016/j.tcs.2010.05.016_b10
  doi: 10.1109/LICS.2008.19
SSID ssj0000576
Score 2.0362768
Snippet We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the use of non-linearity. We show how such problems can be...
SourceID csuc
proquest
crossref
pascalfrancis
elsevier
SourceType Open Access Repository
Aggregation Database
Index Database
Publisher
StartPage 3188
SubjectTerms Algebra
Applied sciences
Approximation
Bounded pathwidth
C (programming language)
Combinatorics
Combinatorics. Ordered structures
Computer science; control theory; systems
Constraint satisfaction problem
Datalog
Exact sciences and technology
Games
Graph theory
Homomorphism duality
Homomorphisms
Mathematics
Miscellaneous
Nonlinearity
Polymorphisms
Sciences and techniques of general use
Searching
Theoretical computing
Trees
Title CSP duality and trees of bounded pathwidth
URI https://dx.doi.org/10.1016/j.tcs.2010.05.016
https://search.proquest.com/docview/787055607
https://recercat.cat/handle/2072/346322
Volume 411
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1La9tAEB4S59JS-khb6j7MHnoKqLakfdjHxDQ4TRMKaYpvy652lrgH2UQypZf-9s7o4WIKPfQghJYVWr7d_WZGMzsD8J6TygWdycQHdIk0XidekdXqZRYiTkPUjg3Fq2u9uJWflmp5APP-LAyHVXbc33J6w9Zdy7hDc7xZrcY37NQjaar4DzWfDz2Eo4y0X9qdR6dn3y4__yFkZVqXJTsBqGPv3GzCvOqi6gK8OH-n3hNPg6LaFntS6tHGVYRdbIte_MXfjVA6fwqPO21SnLYDfgYHWB7Dk75Sg-g27jE8vNplZ62ew8n85osIzWnKn8KVQbBnuhLrKDwXWcIguE7xj1Wo717A7fnHr_NF0tVMSAopZZ1MMxPdtJiYLGBG5kZAVWiNzhnUUcUJujSaPOYzVFnwqSPtLkWcuRiN8TMp85cwKNclvgLh0Xnj8zQ0aoaTbqYka0P0SkGgxiGc9FDZTZsaw_YxY98t4WoZVztRllq4M4FpaUrxvnC15bTWuwe-MhqzzaUmhhmC7CG3e4vBEs__6xujvenZjYrMLE57nw5B9PNlaRexa8SVuN5WlmlLkfJnXv_fp9_AgzasgDNuvoVBfb_Fd6St1H4Ehx9-paNuTfL94nJxTa0Xy7PfZ0zpyQ
link.rule.ids 230,315,783,787,888,3513,4509,24128,27581,27936,27937,45597,45675,45691,45886
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LbxMxEB6VcABU8SigpkDxgVOlJdldP5JjFVEFaCqktlJvlr0eq-GwibobVVz47Z3ZR1CExIHDHtbyytZne-abnfEMwCdOKhd0JhMf0CXSeJ14RVarl1mIOAlROzYUFxd6fi2_3aibPZj1d2E4rLKT_a1Mb6R11zLq0Bytl8vRJTv1SJsq_kPN90MfwWPJ_Jg29efff-I8iJC0Dkt2AVC33rXZBHnVRdWFd3H2Tr2jnAZFtSl2dNT-2lWEXGxLXvwlvRuVdPYSnndcUpy2030Fe1gewIu-ToPoju0BPFtsc7NWr-FkdvlDhOYu5S_hyiDYL12JVRSeSyxhEFyl-H4Z6ts3cH325Wo2T7qKCUkhpayTSWaimxRjkwXMyNgIqAqt0TmDOqo4RpdGk8d8iioLPnXE7VLEqYvRGD-VMn8Lg3JV4iEIj84bn6ehIRlOuqmSzIXok4JAjUM46aGy6zYxhu0jxn5awtUyrnasLLVwZwLT0oLiXeFqy0mtty_8ZDRnm0tN8mUIsofc7mwFS1L-X2Mc7yzPdlZkZHHS-3QIol8vS2eIHSOuxNWmsiy0FFE_c_R_Q3-EJ_Orxbk9_3rx_R08bQMMOPfmexjUdxv8QLyl9sfNvnwAptfoAA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=CSP+duality+and+trees+of+bounded+pathwidth&rft.jtitle=Theoretical+computer+science&rft.au=Carvalho%2C+Catarina&rft.au=Dalmau%2C+V%C3%ADctor&rft.au=Krokhin%2C+Andrei&rft.date=2010-07-17&rft.pub=Elsevier+B.V&rft.issn=0304-3975&rft.eissn=1879-2294&rft.volume=411&rft.issue=34&rft.spage=3188&rft.epage=3208&rft_id=info:doi/10.1016%2Fj.tcs.2010.05.016&rft.externalDocID=S0304397510002975
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon