An Algorithmic Account of Ehrenfeucht Games on Labeled Successor Structures
From MaRDI portal
Publication:5387835
DOI10.1007/11591191_11zbMath1143.03353OpenAlexW1498619332MaRDI QIDQ5387835
Alberto Policriti, Nicola Vitacolonna, Angelo Montanari
Publication date: 27 May 2008
Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11591191_11
2-person games (91A05) Applications of game theory (91A80) Protein sequences, DNA sequences (92D20) Automata and formal grammars in connection with logical questions (03D05) Model theory of finite structures (03C13) Combinatorial games (91A46)
Related Items (5)
Unnamed Item ⋮ Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT ⋮ Games on Strings with a Limited Order Relation ⋮ Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games ⋮ On distinguishing sets of structures by first-order sentences of minimal quantifier rank
This page was built for publication: An Algorithmic Account of Ehrenfeucht Games on Labeled Successor Structures