A history based approximate epistemic action theory for efficient postdictive reasoning
From MaRDI portal
Publication:893597
DOI10.1016/J.JAL.2015.08.001zbMath1457.68256OpenAlexW1271310336WikidataQ62623657 ScholiaQ62623657MaRDI QIDQ893597
Publication date: 19 November 2015
Published in: Journal of Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jal.2015.08.001
Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Knowledge representation (68T30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A logic-based calculus of events
- On the semantics of deliberation in IndiGolog -- from theory to implementation
- Knowledge, action, and the frame problem
- Weak, strong, and strong cyclic planning via symbolic model checking
- Approximate postdictive reasoning with answer set programming
- A new deductive approach to planning
- Nonmonotonic logic and temporal projection
- Computational complexity of planning and approximate planning in the presence of incompleteness
- All I know: A study in autoepistemic logic
- STRIPS: A new approach to the application of theorem proving to problem solving
- Approximate Epistemic Planning with Postdiction as Answer-Set Programming
- Dynamic Epistemic Logic and Knowledge Puzzles
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming
- FLUX: A logic programming method for reasoning agents
- KI 2003: Advances in Artificial Intelligence
- Formalizing sensing actions -- a transition function based approach
- The concurrent, continuous fluent calculus
This page was built for publication: A history based approximate epistemic action theory for efficient postdictive reasoning
