C. Sakama and K. Inoue. Updating extended logic programs through abduction. In M. Gelfond, N. Leone, and G. Pfeifer, editors, LPNMR-99, 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....but also anti explanations, by allowing solutions in which rules from the program are deleted and by allowing general rules to be abduced or deleted. Several implementation methods have been proposed for computing extended abduction. 45] proposed a model generation method with term rewriting. In [99, 41], transformation methods are proposed that reduce the problem of computing extended abduction to a standard abductive problem. Extended abduction has several potential applications such as abductive theory revision and abduction in non monotonic theories, view update in deductive databases, theory ....

....problem. Extended abduction has several potential applications such as abductive theory revision and abduction in non monotonic theories, view update in deductive databases, theory update, contradiction removal, system repair problems with model checking, and inductive logic programming (see [43, 99, 41]) A framework for preference abduction is an abductive logic program augmented with a set # of possible priorities between di#erent literals of the program. For a given goal G, preferred abduction computes a set of abducible atoms I and a subset # of # representing some priority relation, ....

C. Sakama and K. Inoue. Updating extended logic programs through abduction. In: Proceedings of LPNMR '99, Lecture Notes in Artificial Intelligence, 1730, pages 147--161, Springer, 1999.

.... di erent sources of information or preferring certain data over another [4, 9] and approaches that are based on rewriting rules for representing the information in a speci c form [25] As in our case, abduction is used for database updating in [28] and an extended form of abduction is used in [26, 39] to explain modi cations in a theory. The use of three valued logics is also a well known technique for maintaining incomplete or inconsistent information; such logics are often used for de ning xpoint semantics of incomplete logic programs [19, 42] and so in principle they can be applied on ....

C.Sakama, K.Inoue. Updating extended logic programs through abduction. Proc. LPNMR'99 , pp.147-161, 1999.

....is more recent. Various approaches to evaluating logic programs in the light of new information have been presented. The proposals range from basic methods to incorporate an update U , given by a set of rules, or a sequence of such updates U 1 ; U n , into a (nonmonotonic) logic program P [2, 18, 21, 12], to more general methods which use an update policy to specify, by means of update actions, how the updates U 1 ; U n should be incorporated into the current state of knowledge [27, 3, 14] Using these approaches, queries to the knowledge base, like is a fact f true in P after updates U ....

.... EF (s) The belief set Bel(s) is then given by the belief set of the compiled knowledge state, and is obtained by applying the belief operator Bel( for (sequences of) logics programs to comp EF (s) Suitable choices of EF allow one to model different settings of logic program updates, such as [2, 27, 21, 12]. 2) We define the syntax and, based on evolution frames, the semantics of a logical language for reasoning about evolving knowledge bases, which employs linear and branching time operators familiar from Computational Tree Logic (CTL) 16] Using this language, properties of an evolving ....

[Article contains additional citation context not shown here]

K. Inoue and C. Sakama. Updating Extended Logic Programs through Abduction. In M. Gelfond, N. Leone, and G. Pfeifer, editors, Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 1999.

....extended this system with an optimizing component that will allow us to compute preferred coherent solutions to restore the consistency of the database. Our approach is related to other work on the use of abduction in the context of databases. 16] proposed to use abduction for database updating. [15, 27] developed a framework for explaining or unexplaining observations by an extended form of abduction in which arbitrary formulas may be added or formulas of the theory may be removed. In this paper, the focus is on a di erent application of abduction, namely composition and integrity restoration of ....

C.Sakama, K.Inoue. Updating extended logic programs through abduction. Proc LPNMR'99 , 147-161, 1999.

....knowledge states, it s only fit that logic programs describe transitions of knowledge states as well. It is natural to associate with each state a set of transition rules to obtain the next state. Recent developments have opened Logic Programming to these otherwise unreachable dynamic worlds [1, 4, 6, 17, 19]. In [1] the authors, with others, introduced Dynamic Logic Programming. There, they studied and defined the declarative and operational semantics of sequences of logic programs (or dynamic logic programs) Each program in the sequence contains knowledge about some given state, where different ....

C. Sakama and K. Inoue. Updating extended logic programs through abduction. In Procs. of LPNMR-99. Springer, 1999.

.... have been developed (cf. 18, 33] and [16] for accounts of early methods) While the early approaches were devised for classical monotonic knowledge bases, methods for updating nonmonotonic knowledge bases, and in particular for nonmonotonic logic programs, have been proposed only much later, cf. [1, 2, 11, 15, 35, 30, 24]. These methods were concerned with how to incorporate a change request, given by a rule or a set of rules, or a sequence of update requests into the knowledge base, and proposed solutions based on different grounds. Only more recently, the issue of how to specify change requests for knowledge ....

....of ELPs and update programs, given as a mapping Bel, which associates with every sequence P a set Bel(P) LA of rules; intuitively, Bel(P) are the consequences of P. Different instantiations of Bel are possible, according to various proposals for update semantics in the literature (e.g. [2, 11, 35, 30, 27]) We only assume that Bel has some elementary properties which these or any other reasonable semantics satisfy. In particular, the following properties must hold: 1. Priority of updates: P n Bel(P) for P = P 1 ; P n ) as it is common in most knowledge base update approaches (e.g. ....

[Article contains additional citation context not shown here]

C. Sakama and K. Inoue. Updating extended logic programs through abduction. In Proc. LPNMR'99, LNCS/LNAI 1730, pp. 147--161. Springer, 1999.

.... the rule :a stating that a is false, then the union KB [ U is not consistent under predominant semantics such as the answer set semantics [29] or the well founded semantics [58] To address this problem, some approaches for updating logic programs with (sets of) rules have been proposed recently [4, 5, 32, 61]. In this paper, we consider an approach which is based on a causal rejection principle. According to this principle, a rule r is only discarded providing there is a reason for doing so, in terms of another, more recent rule r which contradicts r. That is, if both r and r are applicable ....

....come at the cost of higher computational complexity, and increase the complexity of update answer sets for propositional programs by one level, namely from the first to the second level in the polynomial hierarchy. This parallels similar results for the update semantics by Sakama and Inoue [32], which employs a notion of minimality in the basic definition. 3) We conduct a comparison between update programs and alternative approaches for updating logic programs [4, 6, 61, 32, 43, 41, 47] and related approaches [13, 17] We find that for some of these for INFSYS RR 1843 00 08 3 ....

[Article contains additional citation context not shown here]

K. Inoue and C. Sakama. Updating Extended Logic Programs through Abduction. In M. Gelfond, N. Leone, and G. Pfeifer, editors, Proc. Fifth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'99), volume 1730 in Lecture Notes in AI (LNAI), pages 147-- 161. Springer, 1999.

....is used to inherit, as much as possible, rules from objects higher in the hierarchy into the objects lower down, i.e. as long as they do not con ict with the rules of the more speci c objects. Other approaches to updates of logic programs by logic programs are presented in [25] and in [38]. Based on an abductive framework for (non monotonic) auto epistemic theories, that make use of the notion of negative explanation and anti explanation, in [25] the authors de ne autoepistemic updates . Based on this work, in [38] they employ this new abduction framework (in this case rewritten ....

....of logic programs by logic programs are presented in [25] and in [38] Based on an abductive framework for (non monotonic) auto epistemic theories, that make use of the notion of negative explanation and anti explanation, in [25] the authors de ne autoepistemic updates . Based on this work, in [38] they employ this new abduction framework (in this case rewritten for logic programming instead) to compute minimal programs which result from updating one logic program by another. In their framework, several updates are possible because non deterministic contradiction removal is used to revise ....

C. Sakama and K. Inoue. Updating extended logic programs through abduction. In M. Gelfond, N. Leone, and G. Pfeifer, editors, LPNMR'99. Springer, 1999.

....recent. Various approaches to evaluating logic programs in the light of new information have been presented, cf. 1] The proposals range from basic methods to incorporate an update U , given by a set of rules, or a sequence U 1 ; Un of such updates into a (nonmonotonic) logic program P [1, 21, 13, 6], to more general methods which use an update policy to specify, by means of update actions, how the updates U 1 ; Un should be incorporated into the current state of knowledge [17, 2, 8] Using these approaches, queries to the knowledge base, like is a fact f true in P after updates U 1 ....

.... state s, its belief set, Bel(s) is given by the belief set of the compiled knowledge state, and is obtained by applying a belief operator Bel( for (sequences of) logic programs to comp EF (s) Suitable choices of EF allow one to model different settings of logic program updates, such as [1, 17, 13, 6]. 2) We define the syntax and, based on evolution frames, the semantics of a logical language for reasoning about evolving knowledge bases (Section 4) which employs linear and branching time operators familiar from Computational Tree Logic (CTL) 9] Using this language, properties of an ....

[Article contains additional citation context not shown here]

K. Inoue and C. Sakama. Updating Extended Logic Programs through Abduction. In Proc. LPNMR'99, LNAI 1730, pp. 147--161. Springer, 1999.

....is an extension of an abductive inference method that does not only infer new abductive atoms but may also remove abductive atoms given in the abductive program. Several methods were proposed for computing extended abduction. 39] proposed a model generation method with term rewriting. In [86, 35], transformation methods are proposed that reduce the problem of computing extended abduction to a standard abductive problem. Extended abduction has several potential applications such as abductive theory revision and abduction in nonmonotonic theories, view update in deductive databases, theory ....

....problem. Extended abduction has several potential applications such as abductive theory revision and abduction in nonmonotonic theories, view update in deductive databases, theory update, contradiction removal, system repair problems with model checking, and inductive logic programming (see [37, 86, 35]) In preference abduction, priorities between di erent literals of the program are given. These priorities induce a preference order on the models of the abductive program and on the abductive solutions to queries. The goal of preference abduction is to compute most preferred solutions. A ....

C. Sakama and K. Inoue. Updating extended logic programs through abduction. In: Proceedings of LPNMR '99, Lecture Notes in Articial Intelligence, 1730, pages 147-161, Springer, 1999.

....and must adjust its knowledge base when new information is available. While for classical knowledge bases this issue has been well studied, approaches to update nonmonotonic knowledge bases, like, e.g. updates of logic programs [Alferes et al. 2000; Eiter et al. 2000; Zhang and Foo, 1998; Inoue and Sakama, 1999] or of default theories [Williams and Antoniou, 1998] are more recent. The problem of updating logic programs, on which we focus here, deals with the incorporation of an update P , given by a rule or a set of rules, into the current knowledge base KB . Accordingly, sequences P 1 ; Pn ....

K. Inoue and C. Sakama. Updating extended logic programs through abduction. In Proc. LPNMR'99, LNAI 1730, pp. 147-161. Springer, 1999.

....Revision and update. The knowledge base of the agent can be subject to change on the basis of information from the environment (the application domain itself, other agents inside or outside the system, etc. in order to incorporate changes in the outside world or changes in the knowledge about it [34, 112, 100, 88, 134, 90, 69, 70, 9, 10, 11, 12, 13]. The epistemic state and the intended belief set of the agent have thus to be continuously revised, depending on some specified update policy, which could be in turn explicitly described in the knowledge base and maybe dynamically updated too. Inconsistency removal. The agent should in the ....

....provided for ensuring that the agent s behavior is appropriate, e.g. that some undesired status cannot be reached [64, 47] Learning. Based on the history of the agent (sequence of changes in its knowledge base, or sequence of observations) some form of inductive learning could be implemented [134, 90, 55]. We do not further address this topic in the rest of this paper. In the following sections, we will address declarative formalisms, mainly based on declarative logic programming, which offer partial or tentative solutions for the implementation of such capabilities. We shall point out in which ....

[Article contains additional citation context not shown here]

K. Inoue and C. Sakama. Updating Extended Logic Programs through Abduction. In M. Gelfond, N. Leone, and G. Pfeifer, editors, Proceedings of the Fifth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'99), volume 1730 in Lecture Notes in AI (LNAI), pages 147--161. Springer Verlag, Dec. 1999.

.... the rule :a stating that a is false, then the union KB [ U is not consistent under predominant semantics such as the answer set semantics [29] or the well founded semantics [55] To address this problem, some approaches for updating logic programs with (sets of) rules have been proposed recently [4, 5, 31, 57]. In this paper, we consider an approach which is based on a causal rejection principle. According to this principle, a rule r is only discarded providing there is a reason for doing so, in terms of another, more recent rule r 0 which contradicts r. That is, if both r and r 0 are applicable ....

....come at the cost of higher computational complexity, and increase the complexity of update answer sets for propositional programs by one level, namely from the first to the second level in the polynomial hierarchy. This parallels similar results for the update semantics by Sakama and Inoue [31], which employs a notion of minimality in the basic definition. 4) We conduct a comparison between update programs and alternative approaches for updating logic programs [4, 6, 57, 31] and related approaches [13, 17] First, we show that update programs are, on the language we consider, ....

[Article contains additional citation context not shown here]

K. Inoue and C. Sakama. Updating Extended Logic Programs through Abduction. In M. Gelfond, N. Leone, and G. Pfeifer, editors, Proc. Fifth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'99), volume 1730 in Lecture Notes in AI (LNAI), pages 147-- 161. Springer, 1999.

....each object. Inheritance is used to inherit, as much as possible, rules from objects higher in the hierarchy into the objects lower down, i.e. as long as they do not con ict with the rules of the more speci c objects. Another approach to updates of logic programs by logic programs is presented in [35]. They use abduction to compute minimal programs which result from updating one logic program by another. In their framework, several updates are possible because non deterministic contradiction removal is used to revise inconsistencies (through abduction) between an initial program and the one ....

C. Sakama and K. Inoue. Updating extended logic programs through abduction. In M. Gelfond, N. Leone, and G. Pfeifer, editors, LPNMR'99. Springer, 1999.

No context found.

C. Sakama and K. Inoue. Updating extended logic programs through abduction. In: Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning, Lecture Notes in Artificial Intelligence, 1730, pages 147161, Springer, 1999. 15

No context found.

C. Sakama and K. Inoue. Updating extended logic programs through abduction. In: Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning, Lecture Notes in Artificial Intelligence, 1730, pages 147-161, Springer, 1999. 21

No context found.

C. Sakama and K. Inoue. Updating extended logic programs through abduction. In M. Gelfond, N. Leone, and G. Pfeifer, editors, LPNMR-99, 1999.

No context found.

C. Sakama and K. Inoue. Updating extended logic programs through abduction. In M. Gelfond, N. Leone, and G. Pfeifer, editors, LPNMR-99, volume 1730 of LNAI, pages 147--161. Springer, 1999.

No context found.

Sakama, C., and K. Inoue, `Updating extended logic programs through abduction', in M. Gelfond, N. Leone, and G. Pfeifer, (eds.), Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-99), volume 1730 of LNAI, Springer, 1999, pp. 147--161.

No context found.

C. Sakama and K. Inoue. Updating Extended Logic Programs through Abduction. In LPNMR. Springer Verlag, 1999.

No context found.

C. Sakama and K. Inoue. Updating extended logic programs through abduction. In Procs. of LPNMR'99, volume 1730 of LNAI. Springer.

No context found.

C. Sakama and K. Inoue. Updating extended logic programs through abduction. In M. Gelfond, N. Leone, and G. Pfeifer, editors, Proc. 5th Int. Conf. on Logic Programming and Nonmonotonic Reasoning (LPNMR'99), volume 1730 of Lecture Notes in Artificial Intelligence, pages 147--161. Springer, 1999.

No context found.

Sakama, C., Inoue, K. Updating extended logic programs through abduction. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.), LPNMR' 99, Springer 1999, 147-161 17.  Sefranek, J. Dynamic Kripke Structures. CAEPIA'97. Actas de la VII conferencia de la Associacion Espa~nola para la inteligencia arti cial. Univesidad de Malaga, 1997, 271-283

No context found.

C. Sakama and K. Inoue. Updating extended logic programs through abduction. In Michael Gelfond, Nicola Leone, and Gerald Pfeifer, editors, Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-99), volume 1730 of LNAI, pages 147--161, Berlin, 1999. Springer.

No context found.

C. Sakama and K. Inoue, Updating extended logic programs through abduction. In Proceedings of LPNMR-99, pp 147-161, 1999.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC