Switch to: References

Add citations

You must login to add citations.
  1. A Modal Loosely Guarded Fragment of Second-Order Propositional Modal Logic.Gennady Shtakser - 2023 - Journal of Logic, Language and Information 32 (3):511-538.
    In this paper, we introduce a variant of second-order propositional modal logic interpreted on general (or Henkin) frames, \(SOPML^{\mathcal {H}}\), and present a decidable fragment of this logic, \(SOPML^{\mathcal {H}}_{dec}\), that preserves important expressive capabilities of \(SOPML^{\mathcal {H}}\). \(SOPML^{\mathcal {H}}_{dec}\) is defined as a _modal loosely guarded fragment_ of \(SOPML^{\mathcal {H}}\). We demonstrate the expressive power of \(SOPML^{\mathcal {H}}_{dec}\) using examples in which modal operators obtain (a) the epistemic interpretation, (b) the dynamic interpretation. \(SOPML^{\mathcal {H}}_{dec}\) partially satisfies the principle of (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Knowledge, action, and the frame problem.Richard B. Scherl & Hector J. Levesque - 2003 - Artificial Intelligence 144 (1-2):1-39.
  • Existential assertions and quantum levels on the tree of the situation calculus.Francesco Savelli - 2006 - Artificial Intelligence 170 (6-7):643-652.
  • Reasoning with protocols under imperfect information.Eric Pacuit & Sunil Simon - 2011 - Review of Symbolic Logic 4 (3):412-444.
    We introduce and study a PDL-style logic for reasoning about protocols, or plans, under imperfect information. Our paper touches on a number of issues surrounding the relationship between an agent’s abilities, available choices, and information in an interactive situation. The main question we address is under what circumstances can the agent commit to a protocol or plan, and what can she achieve by doing so?
    No categories
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • On the Epistemic Feasibility of Plans in Multiagent Systems Specifications.Yves Lesperance - 2003 - Logic Journal of the IGPL 11 (2):161-178.
    This paper addresses the problem of ensuring that agents' plans are epistemically feasible in multiagent systems specifications. We propose some solutions within the Cognitive Agents Specification Language . We define a subjective execution construct Subj that causes the plan to be executed in terms of the agent's knowledge state, rather than in terms of the world state. The definition assumes that the agent does not do planning or lookahead, and chooses arbitrarily among the actions allowed by the plan. We also (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Asynchronous knowledge with hidden actions in the situation calculus.Ryan F. Kelly & Adrian R. Pearce - 2015 - Artificial Intelligence 221 (C):1-35.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Resolving distributed knowledge.Thomas Ågotnes & Yì N. Wáng - 2017 - Artificial Intelligence 252 (C):1-21.
  • Analyzing generalized planning under nondeterminism.Vaishak Belle - 2022 - Artificial Intelligence 307 (C):103696.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Knowledge-based programs as building blocks for planning.Jorge A. Baier & Sheila A. McIlraith - 2022 - Artificial Intelligence 303 (C):103634.