
TL;DR
This paper develops a formal framework for evolving and revising action domain descriptions in propositional dynamic logic, introducing robust contraction operators, algorithms, and postulates to ensure minimal change and correctness.
Contribution
It revisits and enhances the semantics of action theory contraction, providing new operators, algorithms, and postulates for more robust and correct theory evolution.
Findings
Introduces robust contraction operators based on Kripke-model distances.
Provides algorithms for syntactical contraction with proven correctness.
Establishes postulates and assesses operator behavior for theory evolution.
Abstract
Like any other logical theory, domain descriptions in reasoning about actions may evolve, and thus need revision methods to adequately accommodate new information about the behavior of actions. The present work is about changing action domain descriptions in propositional dynamic logic. Its contribution is threefold: first we revisit the semantics of action theory contraction that has been done in previous work, giving more robust operators that express minimal change based on a notion of distance between Kripke-models. Second we give algorithms for syntactical action theory contraction and establish their correctness w.r.t. our semantics. Finally we state postulates for action theory contraction and assess the behavior of our operators w.r.t. them. Moreover, we also address the revision counterpart of action theory change, showing that it benefits from our semantics for contraction.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Semantic Web and Ontologies · AI-based Problem Solving and Planning
