Bounded situation calculus action theories
From MaRDI portal
Publication:286407
DOI10.1016/j.artint.2016.04.006zbMath1357.68227arXiv1509.02012OpenAlexW2228999052MaRDI QIDQ286407
Yves Lespérance, Fabio Patrizi, Giuseppe De Giacomo
Publication date: 20 May 2016
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.02012
Logic in artificial intelligence (68T27) Knowledge representation (68T30) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (11)
The delay and window size problems in rule-based stream reasoning ⋮ Progression and verification of situation calculus agents with bounded beliefs ⋮ Verification of agent navigation in partially-known environments ⋮ Action Theories over Generalized Databases with Equality Constraints ⋮ Non-terminating processes in the situation calculus ⋮ First-order \(\mu\)-calculus over generic transition systems and applications to the situation calculus ⋮ Propositional epistemic logics with quantification over agents of knowledge ⋮ Knowledge-based programs as succinct policies for partially observable domains ⋮ Situation calculus for controller synthesis in manufacturing systems with first-order state representation ⋮ A Three-Value Abstraction Technique for the Verification of Epistemic Properties in Multi-agent Systems ⋮ Lifted model checking for relational MDPs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A logic-based calculus of events
- Iterated belief change in the situation calculus
- Elements of finite model theory.
- Knowledge, action, and the frame problem
- Nonmonotonic causal theories
- Dynamic epistemic logic
- Property persistence in the situation calculus
- Propositional dynamic logic of regular programs
- Planning for temporally extended goals.
- How to progress a database
- ConGolog, a concurrent programming language based on the situation calculus
- TALplanner: A temporal logic based forward chaining planner
- From situation calculus to fluent calculus: State update axioms as a solution to the inferential frame problem
- MetateM: An introduction
- A verification framework for agent programming with declarative goals
- Intention is choice with commitment
- A lattice-theoretical fixpoint theorem and its applications
- Verification of Agent-Based Artifact Systems
- Using Theorem Proving to Verify Properties of Agent Programs
- The Cognitive Agents Specification Language and Verification Environment
- Some contributions to the metatheory of the situation calculus
- Alternation
- Representing action and change by logic programs
- GOLOG: A logic programming language for dynamic domains
- Programming Multi-Agent Systems in AgentSpeak usingJason
This page was built for publication: Bounded situation calculus action theories
