A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Filters
Degrees of Lookahead in Regular Infinite Games
2012
Logical Methods in Computer Science
Preserved Fulltext
Other Versions
We study variants of regular infinite games where the strict alternation of moves between the two players is subject to modifications. ...
We show that for regular infinite games the solvability by continuous strategies is decidable, and that a continuous strategy can always be reduced to one of bounded lookahead. ...
Conclusion In this paper we introduced and compared strategies with different kinds of lookahead in regular infinite games. ...
doi:10.2168/lmcs-8(3:24)2012
fatcat:kkp7wuokgrfczc6vp7zv5hot6e
Degrees of Lookahead in Regular Infinite Games
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
We study variants of regular infinite games where the strict alternation of moves between the two players is subject to modifications. ...
We show that for regular infinite games the solvability by continuous strategies is decidable, and that a continuous strategy can always be reduced to one of bounded lookahead. ...
Conclusion In this paper we introduced and compared strategies with different kinds of lookahead in regular infinite games. ...
doi:10.1007/978-3-642-12032-9_18
fatcat:3s3ax54st5d7rkpdvhj5by5c64
Degrees of Lookahead in Context-free Infinite Games
2011
Annual Conference for Computer Science Logic
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We continue the investigation of delay games, infinite games in which one player may postpone her moves for some time to obtain a lookahead on her opponent's moves. ...
We show that the problem of determining the winner of such a game is undecidable for deterministic context-free winning conditions. ...
Bounded lookahead, which is sufficient to win regular games, can always be encoded into the winning condition, hence the classical algorithms to solve regular games without lookahead are still applicable ...
doi:10.4230/lipics.csl.2011.264
dblp:conf/csl/FridmanLZ11
fatcat:wzcyudwfwvesnnlptxxoo3gaey
Finite-state Strategies in Delay Games
2017
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Our framework also yields upper bounds on the complexity of determining the winner of such delay games and upper bounds on the necessary lookahead to win the game. ...
What is a finite-state strategy in a delay game? ...
ω-regular delay games and the amount of lookahead necessary to win such games [19] . ...
doi:10.4204/eptcs.256.11
fatcat:xbabfsnirzfq5lrqjcin7ow4ue
Finite-state Strategies in Delay Games (full version)
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Our framework also yields upper bounds on the complexity of determining the winner of such delay games and upper bounds on the necessary lookahead to win the game. ...
What is a finite-state strategy in a delay game? ...
Acknowledgements The authors are very grateful to the anonymous reviewers of this and an earlier version of the paper, which significantly improved the exposition. ...
arXiv:1704.08887v5
fatcat:dqpeaqihpbc2rdlqkl6nmbp64y
Advanced Automata Minimization
[article]
2012
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Since these relations are themselves PSPACE-complete, we describe methods to compute good approximations of them in polynomial time. ...
This can be used to scale up applications of automata in formal verification tools and decision procedures for logical theories. The algorithm is based on new transition pruning techniques. ...
. 1 Practical degrees of lookahead range from 4 to 25, depending on the size and shape of the automata. ...
arXiv:1210.6624v1
fatcat:76y7x7dv5be5fobkirgfah7jjm
Advanced automata minimization
2013
Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
. 1 Practical degrees of lookahead range from 4 to 25, depending on the size and shape of the automata. ...
of the k-lookahead backward simulation game. ...
Fixpoint Logic Characterization of Lookahead Simulation In this section we give a fixpoint logic characterization of lookahead simulation, using the modal µ-calculus. ...
doi:10.1145/2429069.2429079
dblp:conf/popl/MayrC13
fatcat:4h3lktk2cvck3ixjm7f2wrpluu
Advanced automata minimization
2013
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
. 1 Practical degrees of lookahead range from 4 to 25, depending on the size and shape of the automata. ...
of the k-lookahead backward simulation game. ...
Fixpoint Logic Characterization of Lookahead Simulation In this section we give a fixpoint logic characterization of lookahead simulation, using the modal µ-calculus. ...
doi:10.1145/2480359.2429079
fatcat:yratr3f6mba4xogpmhs7cdpgwa
When is it better not to look ahead?
2010
Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The opinions in this paper are those of the authors and do not necessarily reflect the opinions of the funders. ...
Acknowledgements This work has been supported in part by AFOSR grant FA95500610405, NAVAIR contract N6133906C0149, NSF grant IIS0412812, the Slovenian Ministry of Higher Education, Science and Technology ...
Nau [3] showed mathematically that for an infinitely large class of games, lookahead pathology was inevitable if b was sufficiently large. ...
doi:10.1016/j.artint.2010.08.002
fatcat:nfykelxabrbediibw7ejsspsum
Efficient reduction of nondeterministic automata with application to language inclusion testing
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
This can be used to scale up applications of automata in formal verification tools and decision procedures for logical theories. ...
Since trace inclusion relations are themselves PSPACE-complete, we introduce lookahead simulations as good polynomial time computable approximations thereof. ...
We acknowledge the anonymous reviewers for their extensive comments on earlier drafts of this article. ...
arXiv:1711.09946v3
fatcat:3fgofy65d5cgbnklzcstmnc2zi
A Contraction Method to Decide MSO Theories of Deterministic Trees
2007
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
to decidable instances involving regular trees. ...
In this paper we generalize the contraction method, originally proposed by Elgot and Rabin and later extended by Carton and Thomas, from labeled linear orderings to colored deterministic trees. ...
The work has been funded by the bilateral project "Temporal logics in computer and information sciences", supported by the Italian Ministero degli Affari Esteri and the National Research Foundation of ...
doi:10.1109/lics.2007.6
dblp:conf/lics/MontanariP07
fatcat:n2sxpjnjlvaz5depoevutlbnbe
Weak MSO+U with Path Quantifiers over Infinite Trees
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A formula of the logic is evaluated in an infinite binary labelled tree. ...
A significantly more powerful fragment of the logic, albeit for infinite words, was shown decidable in [3] using automata with counters. ...
ωS-regular languages of infinite words, as defined in [3] . ...
doi:10.1007/978-3-662-43951-7_4
fatcat:fg7cwa6t2vgttdan4wtvs4wvs4
Weak MSO+U with Path Quantifiers over Infinite Trees
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This paper shows that over infinite trees, satisfiability is decidable for weak monadic second-order logic extended by the unbounding quantifier U and quantification over infinite paths. ...
ωS-regular languages of infinite words, as defined in [3] . ...
We also conjecture that the methods developed here, maybe the automaton mentioned in Remark 1, can be used to decide satisfiability of tree languages of the form "every path is in L", with L being ωB-or ...
arXiv:1404.7278v1
fatcat:hwgiicw2ojhvtn2jeb5s5j2xry
The Motion Grammar: Linguistic Perception, Planning, and Control
2011
Robotics: Science and Systems VII
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We implement this approach in the interactive game of Yamakuzushi on a physical robot resulting in a system that repeatably competes with a human opponent in sustained game-play for matches up to six minutes ...
Branches of the syntax tree form the levels of a hierarchical decomposition, and the individual robot sensor readings are given by tokens. ...
The authors thank Magnus Egerstedt for his insight throughout the development of our work on the Motion Grammar. ...
doi:10.15607/rss.2011.vii.007
dblp:conf/rss/DantamS11
fatcat:ycs6vcjcevaupdt6gfg5uxjvd4
Sample-based Approximation of Nash in Large Many-Player Games via Gradient Descent
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
It accomplishes this by tracing a previously established homotopy that defines a continuum of equilibria for the game regularized with decaying levels of entropy. ...
selection problem of many-player games. ...
polynomials in the strategies vs degree-2) makes many-player games much more complex. ...
arXiv:2106.01285v3
fatcat:4rw67ctfxzba3iedzab5rwzp7e
« Previous
Showing results 1 — 15 out of 224 results