Update Sequences in Logic Programming

From Simple Sci Wiki
Revision as of 02:48, 24 December 2023 by SatoshiNakamoto (talk | contribs) (Created page with "Title: Update Sequences in Logic Programming Abstract: This research article explores an approach to update non-monotonic knowledge bases represented as extended logic programs under the answer set semantics. The approach is based on a causal rejection principle, which enforces that, in case of conflicts between rules, more recent rules are preferred and older rules are overridden. The study investigates various properties of the current approach, aiming to gain a bett...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Title: Update Sequences in Logic Programming

Abstract: This research article explores an approach to update non-monotonic knowledge bases represented as extended logic programs under the answer set semantics. The approach is based on a causal rejection principle, which enforces that, in case of conflicts between rules, more recent rules are preferred and older rules are overridden.

The study investigates various properties of the current approach, aiming to gain a better understanding of the inherent causal rejection principle. It reviews postulates and principles for update and revision operators proposed in the area of theory change and non-monotonic reasoning. Additionally, it considers new properties for approaches to updating logic programs.

The research also discusses the computational issues, including a discussion on the computational complexity of the approach and an outline of how the update semantics and its refinements can be directly implemented on top of existing logic programming systems. The article concludes that most of the results about the properties of the causal rejection principle apply to each of the approaches considered, including inheritance programs and certain classes of dynamic logic programs.

Link to Article: https://arxiv.org/abs/0109006v1 Authors: arXiv ID: 0109006v1