We investigate two types of logic program based updates: simple fact updates and program updates. In the simple fact update, a knowledge base is specified as a set of facts and can be updated by a logic program, while in the program update, a knowledge base is specified as a logic program and can be updated by another logic program. The former is usually viewed as a special case of the latter. It is observed that the conflict resolution is a key issue in these logic program based updates. Our approach to the logic program based update has the following features: (1) a prioritized logic programming is developed for providing a formal basis of formalizing logic program based updates; (2) conflicts occurring in updates are explicitly solvable in our framework; and (3) splitting theorems on extended logic programs and prioritized logic programs are provided for simplifying the computation and inference of logic program based updates. We also investigate various properties embedded in the logic program based update. In addition, we analyze the computational complexity for both simple fact and
|
1588
|
Computational Complexity
– Papadimitriou
- 1994
|
|
1126
|
The Stable Model Semantics for Logic Programming
– Gelfond, Lifschitz
- 1988
|
|
554
|
Classical negation in logic programs and disjunctive databases. New Generation Computing 9:365–385
– Gelfond, Lifschitz
- 1991
|
|
239
|
Reasoning about action using a possible models approach
– Winslett
- 1988
|
|
218
|
Logic programming and negation: A survey
– Apt, Bol
- 1994
|
|
200
|
Word problems requiring exponential time: Preliminary report
– Stockmeyer, Meyer
- 1973
|
|
197
|
Foundations of logic programming
– Lifschitz
- 1996
|
|
182
|
Autoepistemic logic
– Marek, Truszczynski
- 1991
|
|
171
|
Computers and Intractability
– Garey, Johnson
- 1979
|
|
166
|
Complexity and Expressive Power of Logic Programming
– Dantsin, Eiter, et al.
- 2001
|
|
141
|
Efficient implementation of the well-founded and stable model semantics
– Niemela, Simons
- 1996
|
|
134
|
Database Updates Through Abduction
– Kakas, Mancarella
- 1990
|
|
133
|
Propositional Semantics for Disjunctive Logic Programs
– Ben-Eliyahu, Dechter
- 1994
|
|
122
|
Well founded semantics for logic programs with explicit negation. in ECAI'92
– Pereira, Alferes
- 1992
|
|
101
|
Preferred answer sets for ex-tended logic programs
– Brewka, Eiter
- 1999
|
|
87
|
A deductive system for non-monotonic reasoning
– Eiter, Leone, et al.
- 1997
|
|
73
|
Well-founded semantics for extended logic programs with dynamic preferences
– Brewka
- 1996
|
|
73
|
On the computational cost of disjunctive logic programming: Propositional case
– EITER, GOTTLOB
- 1995
|
|
69
|
Reprenting Actions in Logic Programs and Default Theories: A Situation Calculus Approach
– Turner
- 1997
|
|
66
|
Dynamic logic programming
– Alferes, Leite, et al.
- 1998
|
|
64
|
Lups—a language for updating logic programs
– Alferes, Pereira, et al.
|
|
59
|
Update by Means of Inference Rules
– Przymusinski, Turner
- 1995
|
|
50
|
Updating extended logic programs through abduction
– INOUE, C
- 1999
|
|
47
|
Adding knowledge to the action description language
– Lobo, Taylor, et al.
- 1997
|
|
39
|
Updating logic programs
– ZHANG, Y
- 1998
|
|
39
|
Updates plus Preferences
– Alferes, Pereira
- 2000
|
|
38
|
On properties of update sequences based on causal rejection. Theory and Practice of Logic Programming
– Eiter, Fink, et al.
- 2002
|
|
37
|
On the Difference between Updating a Knowledge Database and Revising It
– Katsuno, Mendelzon
- 1991
|
|
30
|
Updating knowledge bases II
– Guessoum, Lloyd
- 1991
|
|
28
|
Update-programs can update programs
– Alferes, Pereira
- 1997
|
|
28
|
Answer sets for prioritized logicprograms
– Zhang, Foo
- 1997
|
|
28
|
Logic Programs with Compiled Preferences
– Delgrande, Schaub, et al.
- 2000
|
|
26
|
Revision programming
– Marek, Truszczy'nski
- 1998
|
|
23
|
Abduction from logic programs: Semantics and complexity
– Eiter, Gottlob, et al.
- 1997
|
|
22
|
Propositional belief base update and minimal change
– Herzig, Rifi
- 1999
|
|
21
|
A comparative study of logic programs with preference
– Schaub, Wang
- 2001
|
|
16
|
Towards Generalized Rule-based Updates
– Zhang, Foo
- 1997
|
|
10
|
Abduction to plausible causes: an event-based model of belief update
– Boutilier
- 1996
|
|
10
|
XSB: A system for efficiently computing WFS
– Rao, Sagonas, et al.
- 1997
|
|
9
|
Rule based updates on simple knowledge bases
– Baral
- 1994
|
|
9
|
A Logic for Modelling Decision Making with Dynamic Preferences
– Vos, Vermeir
- 2000
|
|
5
|
Specifying transactions for extended abduction
– Inoue, Sakama
- 1998
|
|
5
|
Coherence approach to logic program revision
– Yuan, You
- 1998
|
|
4
|
Update rules in Datalog programs
– Alves, Laurent, et al.
- 1995
|
|
4
|
Update by means of inference rules
– Marek, Truszczy'nski
- 1994
|
|
4
|
Implementing prioritized logic programming
– Wu, Zhang
- 1999
|
|
4
|
Minimal change and maximal coherence for epistemic logic program updates
– Zhang
- 2003
|
|
3
|
and et al, Dynamic logic programming
– Alferes
- 1998
|
|
3
|
Dynamic Deductive Data Bases with Steady Behavior
– Dekhtyar, Dikovsky
- 1995
|
|
3
|
On logically justified updates
– Dekhtyar, Dikovsky, et al.
- 1998
|
|
