Defining Winning Strategies in Fixed-Point Logic

We study definability questions for positional winning strategies in infinite games on graphs. The quest for efficient algorithmic constructions of winning regions and winning strategies in infinite games, in particular parity games, is of importance in many branches of logic and computer science. A...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science s. 366 - 377
Hlavní autoři: Canavoi, Felix, Gradel, Erich, Lessenich, Simon, Pakusa, Wied
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.07.2015
Témata:
Classification algorithms
Color
Complexity theory
Computer science
fixed-point logic
Games
Games on graphs
Polynomials
Safety
ISSN:1043-6871
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract We study definability questions for positional winning strategies in infinite games on graphs. The quest for efficient algorithmic constructions of winning regions and winning strategies in infinite games, in particular parity games, is of importance in many branches of logic and computer science. A closely related, yet different, facet of this problem concerns the definability of winning regions and winning strategies in logical systems such as monadic second-order logic, least fixed-point logic LFP, the modal-calculus and some of its fragments. While a number of results concerning definability issues for winning regions have been established, so far almost nothing has been known concerning the definability of winning strategies. We make the notion of logical definability of positional winning strategies precise and study systematically the possibility of translations between definitions of winning regions and definitions of winning strategies. We present explicit LFP-definitions for winning strategies in games with relatively simple objectives, such as safety, reachability, eventual safety (Co-Buchi) and recurrent reachability (Buchi), and then prove, based on the Stage Comparison Theorem, that winning strategies for any class of parity games with a bounded number of priorities are LFP-definable. For parity games with an unbounded number of priorities, LFP-definitions of winning strategies are provably impossible on arbitrary (finite and infinite) game graphs. On finite game graphs however, this definability problem turns out to be equivalent to the fundamental open question about the algorithmic complexity of parity games. Indeed, based on a general argument about LFP-translations we prove that LFP-definable winning strategies on the class of all finite parity games exist if, and only if, parity games can be solved in polynomial time, despite the fact that LFP is, in general, strictly weaker than polynomial time.
AbstractList We study definability questions for positional winning strategies in infinite games on graphs. The quest for efficient algorithmic constructions of winning regions and winning strategies in infinite games, in particular parity games, is of importance in many branches of logic and computer science. A closely related, yet different, facet of this problem concerns the definability of winning regions and winning strategies in logical systems such as monadic second-order logic, least fixed-point logic LFP, the modal-calculus and some of its fragments. While a number of results concerning definability issues for winning regions have been established, so far almost nothing has been known concerning the definability of winning strategies. We make the notion of logical definability of positional winning strategies precise and study systematically the possibility of translations between definitions of winning regions and definitions of winning strategies. We present explicit LFP-definitions for winning strategies in games with relatively simple objectives, such as safety, reachability, eventual safety (Co-Buchi) and recurrent reachability (Buchi), and then prove, based on the Stage Comparison Theorem, that winning strategies for any class of parity games with a bounded number of priorities are LFP-definable. For parity games with an unbounded number of priorities, LFP-definitions of winning strategies are provably impossible on arbitrary (finite and infinite) game graphs. On finite game graphs however, this definability problem turns out to be equivalent to the fundamental open question about the algorithmic complexity of parity games. Indeed, based on a general argument about LFP-translations we prove that LFP-definable winning strategies on the class of all finite parity games exist if, and only if, parity games can be solved in polynomial time, despite the fact that LFP is, in general, strictly weaker than polynomial time.
Author Gradel, Erich
Lessenich, Simon
Pakusa, Wied
Canavoi, Felix
Author_xml – sequence: 1
  givenname: Felix
  surname: Canavoi
  fullname: Canavoi, Felix
  email: canavoi@mathematik.tu-darmstadt.de
  organization: Tech. Univ. Darmstadt, Darmstadt, Germany
– sequence: 2
  givenname: Erich
  surname: Gradel
  fullname: Gradel, Erich
  email: graedel@logic.rwth-aachen.de
  organization: RWTH Aachen Univ., Aachen, Germany
– sequence: 3
  givenname: Simon
  surname: Lessenich
  fullname: Lessenich, Simon
  email: lessenich@logic.rwth-aachen.de
  organization: RWTH Aachen Univ., Aachen, Germany
– sequence: 4
  givenname: Wied
  surname: Pakusa
  fullname: Pakusa, Wied
  email: pakusa@logic.rwth-aachen.de
  organization: RWTH Aachen Univ., Aachen, Germany
BookMark eNotzE1LwzAYAOAIE9zmbt689A-0vknefB2lOh0UHGzicSTmTYloKm0P-u8F9fTcnhVblKEQY1ccGs7B3XS79tAI4KpBccY2zliOxjlrjcIFW3JAWWtr-AVbTdMbAAiNsGRwRymXXPrqJZdfD_PoZ-ozTVUu1TZ_Uaz3Qy5z1Q19fr1k58m_T7T5d82et_fH9rHunh527W1Xe2FwrgkQvKGkTQxaoHSoYrLSqaSRkqIYE1kdVKLAhQIBFILHyL1G6aUGuWbXf28motPnmD_8-H0y3KB1Wv4AM5NEWQ
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/LICS.2015.42
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9781479988754
1479988758
EndPage 377
ExternalDocumentID 7174896
Genre orig-research
GroupedDBID --Z
23M
29P
6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
IPLJI
M43
OCL
RIE
RIL
RIO
RNS
ID FETCH-LOGICAL-a274t-e040a7ef67db6243945df8395f64ef5eddfe86b5feb125020ebba4d1a643a3603
IEDL.DBID RIE
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000380427100034&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1043-6871
IngestDate Wed Aug 27 02:33:29 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a274t-e040a7ef67db6243945df8395f64ef5eddfe86b5feb125020ebba4d1a643a3603
PageCount 12
ParticipantIDs ieee_primary_7174896
PublicationCentury 2000
PublicationDate 20150701
PublicationDateYYYYMMDD 2015-07-01
PublicationDate_xml – month: 07
  year: 2015
  text: 20150701
  day: 01
PublicationDecade 2010
PublicationTitle 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science
PublicationTitleAbbrev LICS
PublicationYear 2015
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0002640
ssj0002179874
Score 1.9448903
Snippet We study definability questions for positional winning strategies in infinite games on graphs. The quest for efficient algorithmic constructions of winning...
SourceID ieee
SourceType Publisher
StartPage 366
SubjectTerms Classification algorithms
Color
Complexity theory
Computer science
fixed-point logic
Games
Games on graphs
Polynomials
Safety
Title Defining Winning Strategies in Fixed-Point Logic
URI https://ieeexplore.ieee.org/document/7174896
WOSCitedRecordID wos000380427100034&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
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwED61iIGpQIt4ywMjbpPGduy5UIFUVZUA0a1y7LOUJUVtivj52EkaGFjYbE_2ne7pu_sA7iKveIVjimoVO8q4tVQnfmu8OZDSycTVnJ6l87lcLtWiA_dtLwwiVsVnOAzL6i_frs0upMpGPvRgUokudNNU1L1abT5lHCZvBVem0cLe0DeTCBIqfFTQFr2r0ex58hKKuvgwALT_AlWpbMq097_bHMPgpzmPLFqzcwIdLE6ht0dnII2w9iF6QFehP5D3vMIlIvtJtLgleUGm-RdauljnRUkC4rIZwNv08XXyRBt8BKp9LFlS9AKoU3QitZkYhxZXbj11FXeCoeNorUMpMu68PvaezjjCLNPMxtp7IToRUXIGB8W6wHMgljmhVcajLJEsjozUOjXKitg4xpiWF9APBFh91CMwVs3bL_8-voKjQN66qvUaDsrNDm_g0HyW-XZzW_HtG8uFllE
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NT8IwFH9BNNETKhi_7cGjhY11XXtGCcRJSMTIjXTra7LLMDCMf77tGNODF29tT-17eZ997_0A7j2reLlhkirpG8pCrakK7Da15kAIIwKz5XQcTSZiPpfTBjzUvTCIWBafYdcty798vUw3LlXWs6EHE5Lvwb5Dzqq6teqMSt_N3nLOTKWHramvZhEElNu4oC57l714PHh1ZV1h10G0_4JVKa3KsPW_-xxD56c9j0xrw3MCDcxPobXDZyCVuLbBe0RT4j-Q96xEJiK7WbS4JllOhtkXajpdZnlBHOZy2oG34dNsMKIVQgJVNposKFoRVBEaHumE912Ta6gtfWVoOEMTotYGBU9CYzWy9XX6HiaJYtpX1g9RAfeCM2jmyxzPgWhmuJJJ6CWBYL6XCqWiVGrup4YxpsQFtB0BFh_bIRiL6u2Xfx_fweFo9hIv4vHk-QqOHKm3Na7X0CxWG7yBg_SzyNar25KH39WGmZo
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%3Abook&rft.genre=proceeding&rft.title=2015+30th+Annual+ACM%2FIEEE+Symposium+on+Logic+in+Computer+Science&rft.atitle=Defining+Winning+Strategies+in+Fixed-Point+Logic&rft.au=Canavoi%2C+Felix&rft.au=Gradel%2C+Erich&rft.au=Lessenich%2C+Simon&rft.au=Pakusa%2C+Wied&rft.date=2015-07-01&rft.pub=IEEE&rft.issn=1043-6871&rft.spage=366&rft.epage=377&rft_id=info:doi/10.1109%2FLICS.2015.42&rft.externalDocID=7174896
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1043-6871&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1043-6871&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1043-6871&client=summon