ResearchSpace

A Modal Logic for the Decision-Theoretic Projection Problem

Show simple item record

dc.contributor.author Rens, GB
dc.contributor.author Meyer, TA
dc.contributor.author Lakemeyer, G
dc.date.accessioned 2016-06-27T08:37:29Z
dc.date.available 2016-06-27T08:37:29Z
dc.date.issued 2015-01
dc.identifier.citation 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 en_US
dc.identifier.isbn 978-989-758-074-1
dc.identifier.uri http://www.scitepress.org/DigitalLibrary/Link.aspx?doi=10.5220/0005168200050016
dc.identifier.uri http://hdl.handle.net/10204/8573
dc.description 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 en_US
dc.description.abstract 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. en_US
dc.language.iso en en_US
dc.publisher Science and Technology Publications, Lda en_US
dc.relation.ispartofseries Workflow;15637
dc.subject Modal logic en_US
dc.subject Partially Observable Markov Decision Process en_US
dc.subject POMDP en_US
dc.subject Decision-theory en_US
dc.title A Modal Logic for the Decision-Theoretic Projection Problem en_US
dc.type Conference Presentation en_US
dc.identifier.apacitation 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 en_ZA
dc.identifier.chicagocitation Rens, GB, TA Meyer, and G Lakemeyer. "A Modal Logic for the Decision-Theoretic Projection Problem." (2015): http://hdl.handle.net/10204/8573 en_ZA
dc.identifier.vancouvercitation 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 . en_ZA
dc.identifier.ris TY - Conference Presentation AU - Rens, GB AU - Meyer, TA AU - Lakemeyer, G AB - 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. DA - 2015-01 DB - ResearchSpace DP - CSIR KW - Modal logic KW - Partially Observable Markov Decision Process KW - POMDP KW - Decision-theory LK - https://researchspace.csir.co.za PY - 2015 SM - 978-989-758-074-1 T1 - A Modal Logic for the Decision-Theoretic Projection Problem TI - A Modal Logic for the Decision-Theoretic Projection Problem UR - http://hdl.handle.net/10204/8573 ER - en_ZA


Files in this item

This item appears in the following Collection(s)

Show simple item record