Undoing the effects of action sequences
DOI10.1016/J.JAL.2007.05.002zbMATH Open1158.68042OpenAlexW1964059186MaRDI QIDQ946576FDOQ946576
Esra Erdem, Thomas Eiter, Wolfgang Faber
Publication date: 23 September 2008
Published in: Journal of Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jal.2007.05.002
computational complexityreasoning about actionsexecution monitoringexecution reversallogic-based planningreverse plansundo actions
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Knowledge representation (68T30)
Cites Work
- 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?)
- Nonmonotonic causal theories
- A structural approach to reversible computation
- A formal approach to undo operations in programming languages
- A logic programming approach to knowledge-state planning
- A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system
- Computational complexity of planning and approximate planning in the presence of incompleteness
- Formalizing sensing actions -- a transition function based approach
- Business process management. International conference, BPM 2003, Eindhoven, The Netherlands, June 26--27, 2003. Proceedings.
- Computational Logic in Multi-Agent Systems
- Undoing the effects of action sequences
Cited In (3)
Uses Software
This page was built for publication: Undoing the effects of action sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q946576)
