Switch to: References

Add citations

You must login to add citations.
  1. Progression and Verification of Situation Calculus Agents with Bounded Beliefs.Giuseppe De Giacomo, Yves Lespérance, Fabio Patrizi & Stavros Vassos - 2016 - Studia Logica 104 (4):705-739.
    We investigate agents that have incomplete information and make decisions based on their beliefs expressed as situation calculus bounded action theories. Such theories have an infinite object domain, but the number of objects that belong to fluents at each time point is bounded by a given constant. Recently, it has been shown that verifying temporal properties over such theories is decidable. We take a first-person view and use the theory to capture what the agent believes about the domain of interest (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • A logic of situated resource-bounded agents.Natasha Alechina & Brian Logan - 2009 - Journal of Logic, Language and Information 18 (1):79-95.
    We propose a framework for modelling situated resource-bounded agents. The framework is based on an objective ascription of intentional modalities and can be easily tailored to the system we want to model and the properties we wish to specify. As an elaboration of the framework, we introduce a logic, OBA, for describing the observations, beliefs, goals and actions of simple agents, and show that OBA is complete, decidable and has an efficient model checking procedure, allowing properties of agents specified in (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Logical-Epistemic Foundations of General Game Descriptions.Ji Ruan & Michael Thielscher - 2014 - 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 (...)
    Download  
     
    Export citation  
     
    Bookmark