Forgetting in logic programs with ordered disjunction

Authors:
Wu Chen;Norman Foo;Mingyi Zhang
Affiliations:
School of Computer Science and Engineering, Guizhou University, Guizhou, China and School of Computer and Information Science, Southwest University, Chongqing, China;School of Computer Science and Engineering, UNSW, NSW, Australia;Guizhou Academy of Sciences, Guizhou, China
Venue:
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Year:
2007

Citing 7
Cited 0

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming

Principles of knowledge representation
Forgetting and conflict resolving in disjunctive logic programming

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
A theory of forgetting in logic programming

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Propositional independence: formula-variable independence and forgetting

Journal of Artificial Intelligence Research
Solving logic program conflict through strong and weak forgettings

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
LPOD answer sets and nash equilibria

ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new forgetting method in logic programs with ordered disjunction (LPODs). To forget a literal means to give it up from the answer sets of the program. There is a known method for doing this in an extended logic program (ELP) by transforming it into another such program whose answer sets have only lost the forgotten literal. However, a naive application of it to an LPOD can produce undesirable results. Our new method avoids these, and ensures that the answer sets of the LPOD, as specified by its so-called split programs, only lose as few literals as are necessary. To achieve this we introduce two new literals "⊤" and "⊥" into the syntax of LPODs and extend the definition of an answer set accordingly.