Lower Bounds for Existential Pebble Games and k-Consistency Tests

The existential k-pebble game characterizes the expressive power of the existential-positive k-variable fragment of first-order logic on finite structures. The winner of the existential k-pebble game on two given finite structures can be determined in time O(n2k) by dynamic programming on the graph...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Logical methods in computer science Jg. 9, Issue 4
1. Verfasser: Berkholz, Christoph
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Logical Methods in Computer Science e.V 08.10.2013
Schlagworte:
computer science - computational complexity
computer science - logic in computer science
ISSN:1860-5974, 1860-5974
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract The existential k-pebble game characterizes the expressive power of the existential-positive k-variable fragment of first-order logic on finite structures. The winner of the existential k-pebble game on two given finite structures can be determined in time O(n2k) by dynamic programming on the graph of game configurations. We show that there is no O(n(k-3)/12)-time algorithm that decides which player can win the existential k-pebble game on two given structures. This lower bound is unconditional and does not rely on any complexity-theoretic assumptions. Establishing strong k-consistency is a well-known heuristic for solving the constraint satisfaction problem (CSP). By the game characterization of Kolaitis and Vardi our result implies that there is no O(n(k-3)/12)-time algorithm that decides if strong k-consistency can be established for a given CSP-instance.
AbstractList The existential k-pebble game characterizes the expressive power of the existential-positive k-variable fragment of first-order logic on finite structures. The winner of the existential k-pebble game on two given finite structures can be determined in time O(n2k) by dynamic programming on the graph of game configurations. We show that there is no O(n(k-3)/12)-time algorithm that decides which player can win the existential k-pebble game on two given structures. This lower bound is unconditional and does not rely on any complexity-theoretic assumptions. Establishing strong k-consistency is a well-known heuristic for solving the constraint satisfaction problem (CSP). By the game characterization of Kolaitis and Vardi our result implies that there is no O(n(k-3)/12)-time algorithm that decides if strong k-consistency can be established for a given CSP-instance.
The existential k-pebble game characterizes the expressive power of the existential-positive k-variable fragment of first-order logic on finite structures. The winner of the existential k-pebble game on two given finite structures can be determined in time O(n2k) by dynamic programming on the graph of game configurations. We show that there is no O(n(k-3)/12)-time algorithm that decides which player can win the existential k-pebble game on two given structures. This lower bound is unconditional and does not rely on any complexity-theoretic assumptions. Establishing strong k-consistency is a well-known heuristic for solving the constraint satisfaction problem (CSP). By the game characterization of Kolaitis and Vardi our result implies that there is no O(n(k-3)/12)-time algorithm that decides if strong k-consistency can be established for a given CSP-instance.
Author Berkholz, Christoph
Author_xml – sequence: 1
  givenname: Christoph
  surname: Berkholz
  fullname: Berkholz, Christoph
BookMark eNp1kM1LAzEQxYNUsNaeveaoh7X52mzWWy21FlYUrOeQTWZl63YjyYr2v3fbKojgu8wwzHs8fqdo0PoWEDqn5IpRqSbF_ewpyS_ENbtkhPIjNKRKkiTNMzH4tZ-gcYxr0otzqpgcomnhPyDgG__euogrH_D8s44dtF1tGvwIZdkAXpgNRGxah1-TmW_j_sFu8QpiF8_QcWWaCOPvOULPt_PV7C4pHhbL2bRILBeqS4BSIypnHbFpCURwm3JlMqKcBAmMMQBVpopUxkqrTCpFBjk4RlMhMmdyPkLLQ67zZq3fQr0xYau9qfX-4MOLNqGrbQO6zGReGeCEM9GLlcQpyGxWOiKV7fmMUHrIssHHGKDStu5MV_u2C6ZuNCV6h1XvsOpcC830Dmvvm_zx_fT4z_EFHa17og
CitedBy_id crossref_primary_10_1016_j_jcss_2017_09_003
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.2168/LMCS-9(4:2)2013
DatabaseName CrossRef
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList
CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1860-5974
ExternalDocumentID oai_doaj_org_article_b769fae303244442b0d8e7c7bd068c01
10_2168_LMCS_9_4_2_2013
GroupedDBID .4S
.DC
29L
2WC
5GY
5VS
AAFWJ
AAYXX
ADBBV
ADMLS
ADQAK
AENEX
AFPKN
ALMA_UNASSIGNED_HOLDINGS
ARCSS
BCNDV
CITATION
EBS
EJD
FRP
GROUPED_DOAJ
J9A
KQ8
MK~
ML~
M~E
OK1
OVT
P2P
TR2
TUS
XSB
ID FETCH-LOGICAL-c348t-e11a4fdcd0c5be043c538a708d6e6e222ee8b580fac6c8a5647e9ed215447da93
IEDL.DBID DOA
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000329566000002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1860-5974
IngestDate Fri Oct 03 12:45:00 EDT 2025
Sat Nov 29 06:21:50 EST 2025
Tue Nov 18 22:15:00 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
License https://arxiv.org/licenses/nonexclusive-distrib/1.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c348t-e11a4fdcd0c5be043c538a708d6e6e222ee8b580fac6c8a5647e9ed215447da93
OpenAccessLink https://doaj.org/article/b769fae303244442b0d8e7c7bd068c01
ParticipantIDs doaj_primary_oai_doaj_org_article_b769fae303244442b0d8e7c7bd068c01
crossref_citationtrail_10_2168_LMCS_9_4_2_2013
crossref_primary_10_2168_LMCS_9_4_2_2013
PublicationCentury 2000
PublicationDate 2013-10-08
PublicationDateYYYYMMDD 2013-10-08
PublicationDate_xml – month: 10
  year: 2013
  text: 2013-10-08
  day: 08
PublicationDecade 2010
PublicationTitle Logical methods in computer science
PublicationYear 2013
Publisher Logical Methods in Computer Science e.V
Publisher_xml – name: Logical Methods in Computer Science e.V
References 810:not-found
References_xml – ident: 810:not-found
SSID ssj0000331826
Score 1.9313897
Snippet The existential k-pebble game characterizes the expressive power of the existential-positive k-variable fragment of first-order logic on finite structures. The...
The existential k-pebble game characterizes the expressive power of the existential-positive k-variable fragment of first-order logic on finite structures. The...
SourceID doaj
crossref
SourceType Open Website
Enrichment Source
Index Database
SubjectTerms computer science - computational complexity
computer science - logic in computer science
Title Lower Bounds for Existential Pebble Games and k-Consistency Tests
URI https://doaj.org/article/b769fae303244442b0d8e7c7bd068c01
Volume 9, Issue 4
WOSCitedRecordID wos000329566000002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 1860-5974
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000331826
  issn: 1860-5974
  databaseCode: DOA
  dateStart: 20040101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1860-5974
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000331826
  issn: 1860-5974
  databaseCode: M~E
  dateStart: 20040101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV05T8MwFLZQxcDCjSiXPDCUITSH44ONVi0MbVWJInWzfDxLiCogWhAs_HbsJEVlQCwsGSInsr6XdynP34fQuRFO6DxXUfiJFZFcuUhw7SJIXOKo794S5kqxCTYa8elUjFekvsJMWEUPXAHX1owKp8BHWp-ICEl1bDkww7SNKTfVya2YiZVmqozBWRYK54rLJ00obw-G3btItMhVeuFzXvYjDa2w9Zdppb-NNut6EF9X-9hBa1Dsoq2l1gKuXW8PXQ-CnBnuBBWkOfaVJu69BwsV3kNneAxazwDfhJFXrAqLH6NSiTMsMB944kP_fB_d93uT7m1Uyx9EJiN84eFKFHHW2NjkGmKSGR-cFIu5pUDB53UArnMeO2Wo4SqnhIEAmwZ-HWaVyA5Qo3gq4BBh6-sG0ExoIEC8V3OmdQKgVKkcRLImulyiIU3NDR4kKmbS9wgBPhngk0ISmcoAXxO1vh94rmgxfl_aCfB-Lwt81uUNb2VZW1n-ZeWj_3jJMdoIG6om-E5QY_HyCqdo3bwtHuYvZ-UH5K_Dz94XMSjLCw
linkProvider Directory of Open Access Journals
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=Lower+Bounds+for+Existential+Pebble+Games+and+k-Consistency+Tests&rft.jtitle=Logical+methods+in+computer+science&rft.au=Christoph+Berkholz&rft.date=2013-10-08&rft.pub=Logical+Methods+in+Computer+Science+e.V&rft.eissn=1860-5974&rft.volume=9%2C+Issue+4&rft_id=info:doi/10.2168%2FLMCS-9%284%3A2%292013&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_b769fae303244442b0d8e7c7bd068c01
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1860-5974&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1860-5974&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1860-5974&client=summon