Filters








13,034 Hits in 4.4 sec

Games played on partial isomorphisms

Jouko V��n�nen, Boban Velickovic
2004 Archive for Mathematical Logic  
Each partial τ -play s determines a partial isomorphism p(s) of cardinality ≤ κ.  ...  Models of size 2 ω One approach to getting (σ ) ℵ 1 from (∃) ℵ 1 ω 1 is to organize the partial isomorphisms arising from positions in the Ehrenfeucht-Fraïssé -game in such a way that they uniquely determine  ... 
doi:10.1007/s00153-003-0171-5 fatcat:c7ztl56emjcrbbefiajekdscii

Comparing different levels of interaction constraints for deriving visual problem isomorphs

Wenwen Dou, Caroline Ziemkiewicz, Lane Harrison, Dong Hyun Jeong, Roxanne Ryan, William Ribarsky, Xiaoyu Wang, Remco Chang
2010 2010 IEEE Symposium on Visual Analytics Science and Technology  
Interaction and manual manipulation have been shown in the cognitive science literature to play a critical role in problem solving.  ...  Our results indicate that constraints on interactions do affect problem solving, and that while the optimal visual isomorph is difficult to derive, certain interaction constraints can lead to a higher  ...  Mark Faust for his valuable suggestions on the experimental design.  ... 
doi:10.1109/vast.2010.5653599 dblp:conf/ieeevast/DouZHJRRWC10 fatcat:6edtd3wnjvhtjfeypsfbyencnu

On the Ehrenfeucht-Fraïssé game in theoretical computer science [chapter]

Wolfgang Thomas
1993 Lecture Notes in Computer Science  
An introduction to (first-order) Ehrenfeucht-Fra~ss~ games is presented, al~.d three applications in theoretical computer science are discussed.  ...  Instead of asking for a partial isomorphism at the end of the play, one may as well require partial isomorphisms during the whole play (because the final configuration is a partial isomorphism iff all  ...  The Game Theoretic View In the game theoretic view due to Ehrenfeucht, relations (such as partial isomorphisms) are configurations in a two-person game, and moves in this _game perform extensions of relations  ... 
doi:10.1007/3-540-56610-4_89 fatcat:mjlu34stm5ewpktubjowlkn5jy

Toward a deeper understanding of the relationship between interaction constraints and visual isomorphs

Wenwen Dou, Caroline Ziemkiewicz, Lane Harrison, Dong Hyun Jeong, William Ribarsky, Xiaoyu Wang, Remco Chang
2012 Information Visualization  
Interaction and manual manipulation have been shown in cognitive science literature to play a critical role in problem solving.  ...  Our results indicate that constraints on interactions do affect problem solving, and that although the optimal visual isomorph is difficult to derive, certain interaction constraints can lead to a higher  ...  for playing the number scrabble game.  ... 
doi:10.1177/1473871611433712 fatcat:adqipci2gzhtzlujth64eozjqi

Multi-Structural Games and Number of Quantifiers [article]

Ronald Fagin, Jonathan Lenchner, Kenneth W. Regan, Nikhil Vyas
2022 arXiv   pre-print
We study multi-structural games, played on two sets 𝒜 and ℬ of structures. These games generalize Ehrenfeucht-Fraïssé games.  ...  Whereas Ehrenfeucht-Fraïssé games capture the quantifier rank of a first-order sentence, multi-structural games capture the number of quantifiers, in the sense that Spoiler wins the r-round game if and  ...  partial isomorphisms.  ... 
arXiv:2104.14709v3 fatcat:evusridb6zefjlrqocddiwjmf4

Symmetry in concurrent games

Simon Castellan, Pierre Clairambault, Glynn Winskel
2014 Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) - CSL-LICS '14  
Behavioural symmetry is introduced into concurrent games. It expresses when plays are essentially the same. A characterization of strategies on games with symmetry is provided.  ...  This leads to a bicategory of strategies on games with symmetry. Symmetry helps allay the perhaps overly-concrete nature of games and strategies, and shares many mathematical features with homotopy.  ...  Informally, symmetry in a game concerns when one play of a game is essentially the same as another.  ... 
doi:10.1145/2603088.2603141 dblp:conf/csl/CastellanCW14 fatcat:abxhshkqnndflplpuxkhnoslva

Non-angelic Concurrent Game Semantics [chapter]

Simon Castellan, Pierre Clairambault, Jonathan Hayman, Glynn Winskel
2018 Lecture Notes in Computer Science  
Then, we show that by hiding only certain events dubbed inessential we can consider strategies up to isomorphism, and still get a category -this partial hiding remains sound up to weak bisimulation, so  ...  Accordingly, games models are usually biased towards angelic non-determinism: diverging branches are forgotten. We present here new categories of games, not suffering from this bias.  ...  Consider the strategy σ : ⊕ 1 / o / o ⊕ 2 on the game A = ⊕ 1 ⊕ 2 playing nondeterministically one of the two moves.  ... 
doi:10.1007/978-3-319-89366-2_1 fatcat:gdtzvkcs2rbglgjw4eibns3g2q

Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two

Michael A. Henning, William B. Kinnersley
2016 SIAM Journal on Discrete Mathematics  
In the domination game on a graph G, the players Dominator and Staller alternately select vertices of G. Each vertex chosen must strictly increase the number of vertices dominated.  ...  The size of the dominating set produced under optimal play is the game domination number of G, denoted by γ g (G). In this paper, we prove that γ g (G) ≤ 2n/3 for every n-vertex isolate-free graph G.  ...  Acknowledgments The authors would like to thank Boštjan Brešar, Sandi Klavžar, Gašper Košmrlj, and Douglas Rall for helpful discussions during a recent workshop on game domination hosted by Douglas Rall  ... 
doi:10.1137/140976935 fatcat:qvs3houftze5deukt2h4v2idg4

Curry-style type isomorphisms and game semantics

JOACHIM DE LATAILLADE
2008 Mathematical Structures in Computer Science  
The model is composed of: an untyped part to interpret terms, a notion of game to interpret types, and a typed part to express the fact that an untyped strategy σ plays on a game A.  ...  This is particularly appealing with functional languages, because in this case the type can really be seen as a partial specification of the program: such a library search up to isomorphisms has been implemented  ...  Definition 15 (justified sequence, play on a game) Let A be a game and s be a play (resp. a justified sequence) on the grammar M.  ... 
doi:10.1017/s0960129508006828 fatcat:2n7yaefoqbam3a2xdiucppmcny

Games and Strategies as Event Structures [article]

Simon Castellan, Silvain Rideau, Glynn Winskel
2017 arXiv   pre-print
In 2011, Rideau and Winskel introduced concurrent games and strategies as event structures, generalizing prior work on causal formulations of games.  ...  In this paper we give a detailed, self-contained and slightly-updated account of the results of Rideau and Winskel: a notion of pre-strategy based on event structures; a characterisation of those pre-strategies  ...  This general construction yields a pre-strategy playing on A ⊥ A for any game A. Definition 3.1 (Copycat). Let A be a game.  ... 
arXiv:1604.04390v4 fatcat:wtkwxncy4relrb53xbu55jeq3y

Curry-style type Isomorphisms and Game Semantics [article]

Joachim De Lataillade
2007 arXiv   pre-print
The model is composed of: an untyped part to interpret terms, a notion of game to interpret types, and a typed part to express the fact that an untyped strategy plays on a game.  ...  This paper gives a characterisation of type isomorphisms for this language, by using a game model whose intuitions come both from the syntax and from the game semantics universe.  ...  Definition 15 (justified sequence, play on a game) Let A be a game and s be a play (resp. a justified sequence) on the grammar M.  ... 
arXiv:0705.4228v1 fatcat:fi6iuqqq5jfspiyz2anvdxlkti

A note on the connected game coloring number [article]

Peter Bradshaw
2020 arXiv   pre-print
game played with an uncooperative adversary.  ...  We consider the connected game coloring number of a graph, introduced by Charpentier et al. as a game theoretic graph parameter that measures the degeneracy of a graph with respect to a certain two-player  ...  Bob wins the connected coloring game on G played with four colors whenever one of these three types of graphs is isomorphic as a partially colored graph to a subgraph of G. r v 1 v 48 w 0 w 48 · · · ·  ... 
arXiv:2006.03188v2 fatcat:z757qduy4fc3zenwiebr2hdfny

Pebble Games with Algebraic Rules [chapter]

Anuj Dawar, Bjarki Holm
2012 Lecture Notes in Computer Science  
We show that one particular such game, which we call the invertible-map game, yields a family of polynomial-time approximations of graph isomorphism that is strictly stronger than the well-known Weisfeiler-Lehman  ...  We define a general framework of partition games for formulating twoplayer pebble games over finite structures.  ...  This research was partially done whilst the authors were participants in the programme Semantics and Syntax at the Isaac Newton Institute for the Mathematical Sciences in Cambridge, UK.  ... 
doi:10.1007/978-3-642-31585-5_25 fatcat:jh5yppz4ergalfjidv3w6hgps4

Pebble games with algebraic rules [article]

Anuj Dawar, Bjarki Holm
2012 arXiv   pre-print
We show that one particular such game, which we call the invertible-map game, yields a family of polynomial-time approximations of graph isomorphism that is strictly stronger than the well-known Weisfeiler-Lehman  ...  We define a general framework of partition games for formulating two-player pebble games over finite structures.  ...  This research was partially done whilst the authors were participants in the programme Semantics and Syntax at the Isaac Newton Institute for the Mathematical Sciences in Cambridge, UK.  ... 
arXiv:1205.0913v2 fatcat:4fv64do3vzgpzn3y2jghj73eay

Open class determinacy is preserved by forcing [article]

Joel David Hamkins, W. Hugh Woodin
2018 arXiv   pre-print
The principle of open class determinacy is preserved by pre-tame class forcing, and after such forcing, every new class well-order is isomorphic to a ground-model class well-order.  ...  The full principle ETR itself is preserved by countably strategically closed pre-tame class forcing, and after such forcing, every new class well-order is isomorphic to a ground-model class well-order.  ...  Let T be the tree of partial plays of the game that accord with the strategy τ .  ... 
arXiv:1806.11180v1 fatcat:le6uzonscvbzvmj6g6uolwc53q
« Previous Showing results 1 — 15 out of 13,034 results