TY - JOUR
T1 - Formalizing narratives using nested circumscription
AU - Baral, Chitta
AU - Gabaldon, Alfredo
AU - Provetti, Alessandro
N1 - Funding Information: The authors wish to thank Michael Gelfond and the anonymous referees for their suggestionsw hich greatly improved this paper.T he first two authorsw ere supportedb y the NSF grantsI RI-92 11662a nd IRI-9.501577.
PY - 1998/9
Y1 - 1998/9
N2 - Representing and reasoning about narratives together with the ability to do hypothetical reasoning is important for agents in a dynamic world. These agents need to record their observations and action executions as a narrative and at the same time, to achieve their goals against a changing environment, they need to make plans (or re-plan) from the current situation. The early action formalisms did one or the other. For example, while the original situation calculus was meant for hypothetical reasoning and planning, the event calculus was more appropriate for narratives. Recently, there have been some attempts at developing formalisms that do both. Independently, there has also been a lot of recent research in reasoning about actions using circumscription. Of particular interest to us is the research on using high-level languages and their logical representation using nested abnormality theories (NATs) - a form of circumscription with blocks that make knowledge representation modular. Starting from theories in the high-level language ℒ, which is extended to allow concurrent actions, we define a translation to NATs that preserves both narrative and hypothetical reasoning. We initially use the high level language ℒ, and then extend it to allow concurrent actions. In the process, we study several knowledge representation issues such as filtering, and restricted monotonicity with respect to NATs. Finally, we compare our formalization with other approaches, and discuss how our use of NATs makes it easier to incorporate other features of action theories, such as constraints, to our formalization.
AB - Representing and reasoning about narratives together with the ability to do hypothetical reasoning is important for agents in a dynamic world. These agents need to record their observations and action executions as a narrative and at the same time, to achieve their goals against a changing environment, they need to make plans (or re-plan) from the current situation. The early action formalisms did one or the other. For example, while the original situation calculus was meant for hypothetical reasoning and planning, the event calculus was more appropriate for narratives. Recently, there have been some attempts at developing formalisms that do both. Independently, there has also been a lot of recent research in reasoning about actions using circumscription. Of particular interest to us is the research on using high-level languages and their logical representation using nested abnormality theories (NATs) - a form of circumscription with blocks that make knowledge representation modular. Starting from theories in the high-level language ℒ, which is extended to allow concurrent actions, we define a translation to NATs that preserves both narrative and hypothetical reasoning. We initially use the high level language ℒ, and then extend it to allow concurrent actions. In the process, we study several knowledge representation issues such as filtering, and restricted monotonicity with respect to NATs. Finally, we compare our formalization with other approaches, and discuss how our use of NATs makes it easier to incorporate other features of action theories, such as constraints, to our formalization.
KW - Circumscription
KW - Narratives
KW - Nested abnormality theories
KW - Reasoning about actions
KW - Value minimization
UR - http://www.scopus.com/inward/record.url?scp=0032156243&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0032156243&partnerID=8YFLogxK
U2 - 10.1016/s0004-3702(98)00070-8
DO - 10.1016/s0004-3702(98)00070-8
M3 - Article
SN - 0004-3702
VL - 104
SP - 107
EP - 164
JO - Artificial Intelligence
JF - Artificial Intelligence
IS - 1-2
ER -