An Algorithmic Account of Ehrenfeucht Games on Labeled Successor Structures

DOI10.1007/11591191_11MaRDI QIDQ5387835zbMATH OpenOpenAlexFDO

Authors Angelo Montanari, Alberto Policriti, Nicola Vitacolonna

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

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Automata and formal grammars in connection with logical questions (03D05) 2-person games (91A05) Combinatorial games (91A46) Applications of game theory (91A80) Protein sequences, DNA sequences (92D20)

Recommendations

• Games on Strings with a Limited Order Relation
• On complexity of Ehrenfeucht-Fraïssé games
• On Complexity of Ehrenfeucht-Fraïssé Games
• scientific article; zbMATH DE number 1342211
• On winning strategies in Ehrenfeucht-Fraïssé games

Cited in

(10)

• On winning Ehrenfeucht games and monadic NP
• Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT
• 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
• On finding a first-order sentence consistent with a sample of strings
• Games on Strings with a Limited Order Relation
• Comparing the Power of Games on Graphs
• On Complexity of Ehrenfeucht-Fraïssé Games
• On complexity of Ehrenfeucht-Fraïssé games
• An Ehrenfeucht-Fraïssé game approach to collapse results in database theory

This page was built for publication: An Algorithmic Account of Ehrenfeucht Games on Labeled Successor Structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387835)