The authors present a decidable logic in which queries can be posed about (i) the degree of belief in a propositional sentence after an arbitrary finite number of actions and observations and (ii) the utility of a finite sequence of actions after a number of actions and observations. Another contribution of this work is that a POMDP model specification is allowed to be partial or incomplete with no restriction on the lack of information specified for the model. The model may even contain information about non-initial beliefs. Essentially, entailment of arbitrary queries (expressible in the language) can be answered. A sound, complete and terminating decision procedure is provided.
Reference:
Rens, GB, Meyer, TA and Lakemeyer, G. 2015. A Modal Logic for the Decision-Theoretic Projection Problem.In 7th Proceedings of the International Conference on Agents and Artificial Intelligence (ICAART), 10 - 12 January 2015, Lisbon, Portugal
Rens, G., Meyer, T., & Lakemeyer, G. (2015). A Modal Logic for the Decision-Theoretic Projection Problem. Science and Technology Publications, Lda. http://hdl.handle.net/10204/8573
Rens, GB, TA Meyer, and G Lakemeyer. "A Modal Logic for the Decision-Theoretic Projection Problem." (2015): http://hdl.handle.net/10204/8573
Rens G, Meyer T, Lakemeyer G, A Modal Logic for the Decision-Theoretic Projection Problem; Science and Technology Publications, Lda; 2015. http://hdl.handle.net/10204/8573 .
ICAART 2015: 7th International Conference on Agents and Artificial Intelligence, 10 - 12 January 2015, Lisbon, Portugal. Due to copyright restrictions, the attached PDF file only contains the abstract of the full text item. For access to the full text item, please consult the publisher's website
