{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T05:12:36Z","timestamp":1772601156553,"version":"3.50.1"},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Logical and Algebraic Methods in Programming"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1016\/j.jlamp.2025.101097","type":"journal-article","created":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T03:02:48Z","timestamp":1762311768000},"page":"101097","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Computational modelling for combinatorial game strategies"],"prefix":"10.1016","volume":"149","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8178-9538","authenticated-orcid":false,"given":"R\u0103zvan","family":"Diaconescu","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jlamp.2025.101097_bib0001","series-title":"Proceedings of the Fifth Congress Mathematicians","article-title":"\u00dcber eine Anwendung der Mengenlehre auf die Theorie des Schachspiels","author":"Zermelo","year":"1913"},{"issue":"1","key":"10.1016\/j.jlamp.2025.101097_bib0002","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1006\/game.2000.0794","article-title":"Zermelo and the early history of game theory","volume":"34","author":"Schwalbe","year":"2001","journal-title":"Games Econ. Behav."},{"key":"10.1016\/j.jlamp.2025.101097_bib0003","article-title":"All About Maude \u2013 A High-Performance Logical Framework","volume":"4350","author":"Clavel","year":"2007"},{"key":"10.1016\/j.jlamp.2025.101097_bib0004","series-title":"Software Engineering with OBJ: Algebraic Specification in Action","article-title":"Introducing OBJ","author":"Goguen","year":"2000"},{"key":"10.1016\/j.jlamp.2025.101097_bib0005","article-title":"CafeOBJ Report: The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification","volume":"6","author":"Diaconescu","year":"1998"},{"key":"10.1016\/j.jlamp.2025.101097_bib0006","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0304-3975(01)00361-9","article-title":"Logical foundations of CafeOBJ","volume":"285","author":"Diaconescu","year":"2002","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jlamp.2025.101097_bib0007","series-title":"Foundations of Algebraic Specifications and Formal Software Development","author":"Sannella","year":"2012"},{"issue":"7","key":"10.1016\/j.jlamp.2025.101097_bib0008","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1145\/360248.360251","article-title":"Formal verification of parallel programs","volume":"19","author":"Keller","year":"1976","journal-title":"Commun. ACM"},{"key":"10.1016\/j.jlamp.2025.101097_bib0009","series-title":"Handbook of Game Theory with Economic Applications","doi-asserted-by":"crossref","DOI":"10.1016\/S1574-0005(05)80005-0","article-title":"Games in extensive and strategic forms","volume":"1","author":"Hart","year":"1992"},{"issue":"1","key":"10.1016\/j.jlamp.2025.101097_bib0010","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1093\/jigpal\/7.1.103","article-title":"Bisimulation, modal logic and model checking games","volume":"7","author":"Stirling","year":"1999","journal-title":"Logic J. IGPL"},{"key":"10.1016\/j.jlamp.2025.101097_bib0011","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/j.jlamp.2025.101097_bib0012","unstructured":"Terese, Term Rewriting Systems, Cambridge University Press, 2003."},{"key":"10.1016\/j.jlamp.2025.101097_bib0013","series-title":"Term Rewriting and All That","author":"Baader","year":"1998"},{"issue":"2","key":"10.1016\/j.jlamp.2025.101097_bib0014","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0304-3975(87)90123-X","article-title":"Algebraic specifications of computable and semicomputable data types","volume":"50","author":"Bergstra","year":"1987","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"10.1016\/j.jlamp.2025.101097_bib0015","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1017\/S0960129500000517","article-title":"An oxford survey of order sorted algebra","volume":"4","author":"Goguen","year":"1994","journal-title":"Math. Struct. Comput. Sci."},{"issue":"1","key":"10.1016\/j.jlamp.2025.101097_bib0016","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1145\/147508.147524","article-title":"Institutions: abstract model theory for specification and programming","volume":"39","author":"Goguen","year":"1992","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/j.jlamp.2025.101097_bib0017","series-title":"Institution-independent Model Theory","author":"Diaconescu","year":"2025"},{"key":"10.1016\/j.jlamp.2025.101097_bib0018","series-title":"Game theory","author":"Fudenberg","year":"1991"},{"key":"10.1016\/j.jlamp.2025.101097_bib0019","series-title":"Categories for the Working Mathematician","author":"Mac Lane","year":"1998"},{"key":"10.1016\/j.jlamp.2025.101097_bib0020","first-page":"165","article-title":"Specifications in an arbitrary institution","volume":"76","author":"Sannella","year":"1988","journal-title":"Inf. Control"},{"issue":"28","key":"10.1016\/j.jlamp.2025.101097_bib0021","doi-asserted-by":"crossref","first-page":"3145","DOI":"10.1016\/j.tcs.2011.04.008","article-title":"On the algebra of structured specifications","volume":"412","author":"Diaconescu","year":"2011","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jlamp.2025.101097_bib0022","series-title":"Logical Environments","first-page":"83","article-title":"Logical support for modularisation","author":"Diaconescu","year":"1993"},{"key":"10.1016\/j.jlamp.2025.101097_bib0023","unstructured":"R. Diaconescu, Repository for the Maude code for the heaps game, (https:\/\/imar.ro\/~diacon\/comp-model-comb-games\/heaps-game.maude)."},{"key":"10.1016\/j.jlamp.2025.101097_bib0024","unstructured":"R. Diaconescu, Repository for the Maude code for the board colouring game, (https:\/\/imar.ro\/~diacon\/comp-model-comb-games\/strategyboardgame.maude)."},{"key":"10.1016\/j.jlamp.2025.101097_bib0025","unstructured":"I. \u0162u\u0163u, Repository for the Maude code for the bisimilarity game, (https:\/\/gitlab.com\/ittutu\/bisimilarity-games)."},{"key":"10.1016\/j.jlamp.2025.101097_bib0026","unstructured":"The On-Line Encyclopedia of Integer Sequences (OEIS), (https:\/\/oeis.org)."},{"key":"10.1016\/j.jlamp.2025.101097_bib0027","unstructured":"R. Diaconescu, Repository for the Maude code for an alternative version of WINS with traces, (https:\/\/imar.ro\/~diacon\/comp-model-comb-games\/lib\/game-strategy-mod.maude)."},{"key":"10.1016\/j.jlamp.2025.101097_bib0028","series-title":"Recent Trends in Algebraic Development Techniques","first-page":"163","article-title":"SpeX: a rewriting-based formal specification environment","author":"\u0162u\u0163u","year":"2023"}],"container-title":["Journal of Logical and Algebraic Methods in Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S235222082500063X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S235222082500063X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T04:31:45Z","timestamp":1772598705000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S235222082500063X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":28,"alternative-id":["S235222082500063X"],"URL":"https:\/\/doi.org\/10.1016\/j.jlamp.2025.101097","relation":{},"ISSN":["2352-2208"],"issn-type":[{"value":"2352-2208","type":"print"}],"subject":[],"published":{"date-parts":[[2026,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Computational modelling for combinatorial game strategies","name":"articletitle","label":"Article Title"},{"value":"Journal of Logical and Algebraic Methods in Programming","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jlamp.2025.101097","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"101097"}}