4 found
Sort by:
  1. Dongmo Zhang & Michael Thielscher (forthcoming). Representing and Reasoning About Game Strategies. Journal of Philosophical Logic:1-34.
    As a contribution to the challenge of building game-playing AI systems, we develop and analyse a formal language for representing and reasoning about strategies. Our logical language builds on the existing general Game Description Language (GDL) and extends it by a standard modality for linear time along with two dual connectives to express preferences when combining strategies. The semantics of the language is provided by a standard state-transition model. As such, problems that require reasoning about games can be solved by (...)
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  2. Ji Ruan & Michael Thielscher (2014). Logical-Epistemic Foundations of General Game Descriptions. Studia Logica 102 (2):321-338.
    A general game player automatically learns to play arbitrary new games solely by being told their rules. For this purpose games are specified in the general Game Description Language (GDL), a variant of Datalog with function symbols that uses a few game-specific keywords. A recent extension of basic GDL allows the description of nondeterministic games with any number of players who may have incomplete, asymmetric information. In this paper, we analyse the epistemic structure and expressiveness of this language in terms (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  3. Michael Thielscher (2004). Logic-Based Agents and the Frame Problem: A Case for Progression. In Vincent F. Hendricks (ed.), First-Order Logic Revisited. Logos. 75--323.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  4. Michael Thielscher (2001). The Concurrent, Continuous Fluent Calculus. Studia Logica 67 (3):315-331.
    The Fluent Calculus belongs to the established predicate calculus formalisms for reasoning about actions. Its underlying concept of state update axioms provides a solution to the basic representational and inferential Frame Problems in pure first-order logic. Extending a recent research result, we present a Fluent Calculus to reason about domains involving continuous change and where actions occur concurrently.
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation