Progression and verification of situation calculus agents with bounded beliefs
DOI10.1007/S11225-015-9626-ZzbMATH Open1397.68191DBLPjournals/sLogica/GiacomoLPV16OpenAlexW1763963671WikidataQ57549499 ScholiaQ57549499MaRDI QIDQ310089FDOQ310089
Stavros Vassos, Giuseppe De Giacomo, Fabio Patrizi, Yves Lespérance
Publication date: 7 September 2016
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11225-015-9626-z
mu-calculussituation calculusprogressiononline executionreasoning about actionsverification of agent behaviors
Cites Work
- GOLOG: A logic programming language for dynamic domains
- Modal and temporal properties of processes
- How to progress a database
- Verification on infinite structures.
- Bounded situation calculus action theories
- Verification of agent-based artifact systems
- The Cognitive Agents Specification Language and Verification Environment
- Progression and verification of situation calculus agents with bounded beliefs
- Some contributions to the metatheory of the situation calculus
- Knowledge, action, and the frame problem
- A computationally grounded logic of visibility, perception, and knowledge
- Reasoning about Agent Programs Using ATL-Like Logics
- Using the Maude Term Rewriting Language for Agent Development with Formal Foundations
- How to progress a database. III
- A semantic characterization of a useful fragment of the situation calculus with knowledge
- On the semantics of deliberation in IndiGolog -- from theory to implementation
- A description logic based situation calculus
- Conformant plans and beyond: principles and complexity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
- The computational complexity of scenario-based agent verification and design
- Bounded situation calculus action theories
- Progression and verification of situation calculus agents with bounded beliefs
- Knowledge-based programs as succinct policies for partially observable domains
- Non-terminating processes in the situation calculus
Uses Software
This page was built for publication: Progression and verification of situation calculus agents with bounded beliefs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q310089)
