M. Denecker and D. De Schreye. Representing Incomplete Knowledge in Abductive Logic Programming. Journal of Logic and Computation, 5(5):553{ 578, Sept. 1995.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....that the ideas sketched above can be used as a sound and complete implementation of the action description language of Gelfond and Lifschitz. This makes our approach to reason about actions and change comparable to various other approaches which were also related to this language recently, such as [8, 19, 7]. A problem arises when the SLDENF approach of Section 5 is used to pose queries as e.g. the negative part of (26) The problem is a consequence from the fact that negation as failure does not allow for solving negative non ground literals. In [17] we propose to use the concept of constructive ....

M. Denecker and D. de Schreye. Representing Incomplete Knowledge in Abductive Logic Programming. In D. Miller, editor, Proc. of ILPS. 1993.

.... related to A recently, such as Baker s method [5] based on circumscription [39] Pednault s [42] and Reiter s [43] approach based on classical logic (all three adequateness result regarding A were established in [33] or the application of abductive logic programming ( 16] and, independently, [15]) In addition, we have developed an extension of A to model non deterministic actions, and we have integrated this feature too into our equational logic programming based approach. Analogously, we have integrated another extension of the Action Description Language dealing with concurrent actions ....

M. Denecker and D. de Schreye. Representing Incomplete Knowledge in Abductive Logic Programming. In D. Miller, editor, Proceedings of the International Logic Programming Symposium (ILPS), pages 147--163, Vancouver, Oct. 1993. MIT Press.

....with the intuition, we obtain that rains is an explanation of go fishing, as it is entailed by T # rains . In the context of logic programming, abduction has been first proposed by Kakas and Mancarella [13] and, during the recent years, common interest in the subject has been growing rapidly [4, 15, 13, 12, 6, 5, 20], also for the observation that, compared to deduction, this kind of reasoning has some advantages for dealing with incomplete information [5, 1] In this paper we study abduction with penalization in logic programming. This form of abductive reasoning, well studied in the setting of classical ....

.... been first proposed by Kakas and Mancarella [13] and, during the recent years, common interest in the subject has been growing rapidly [4, 15, 13, 12, 6, 5, 20] also for the observation that, compared to deduction, this kind of reasoning has some advantages for dealing with incomplete information [5, 1]. In this paper we study abduction with penalization in logic programming. This form of abductive reasoning, well studied in the setting of classical logics [7] has not been previously analyzed in logic programming. We define a formal model for abduction with penalization from logic programs, ....

M. Denecker and D. De Schreye. Representing incomplete knowledge in abductive logic programming. In Proc. of the International Symposium on Logic Programming, pp. 147--163, 1993.

....observation to the theory, does not entail haswings(tweety) 2 We refer to the entailment of haswings(tweety) from the theory T and the observation ff ly(tweety)g as abductive entailment and reasoning with respect to this entailment relation as abductive reasoning. Such entailments were used in [DDS93,Dun93] while formalizing reasoning about actions using abductive logic programming and one such entailment was formally defined using generalized stable models [KM90,EK88] with respect to abductive logic programming in [BG94] Shanahan in Chapter 17 of his book [Sha97] refers to such ....

M. Denecker and D. De Schreye. Representing incomplete knowledge in abductive logic programming. In Proc. of ILPS 93, Vancouver, pages 147--164, 1993.

....various results enable a network of correspondences between formalisms to be built up. For example, Kartha [6] shows a correspondence between Baker s formalism and the Language A introduced in [5] Furthermore, Gelfond and Lifschitz [5] Dung [4] Baral and Gelfond [2] and Denecker and De Schreye [3] have each shown how the Language A can be used as a specification for various logic programming formulations. Like the work in this paper, most results are restricted to cases where theories are fluent independent . ....

Marc Denecker and Danny De Schreye, Representing Incomplete Knowledge in Abductive Logic Programming, Proceedings of the International Symposium on Logic Programming, 1993.

....inference from a program (resp. its completion) are described in Example 3 below and in Example 10 (Section 6) In the context of logic programming, abduction has been first proposed by Kakas and Mancarella [37] and, during the recent years, common interest in the subject has been growing rapidly [14, 41, 37, 34, 17, 16, 68], also for the observation that, compared to deduction, this kind of reasoning has some advantages for dealing with incomplete information [16, 4] A suggestive application of abduction from logic programs to data dictionary design is presented in [59] The logic programs from above enjoy the ....

.... first proposed by Kakas and Mancarella [37] and, during the recent years, common interest in the subject has been growing rapidly [14, 41, 37, 34, 17, 16, 68] also for the observation that, compared to deduction, this kind of reasoning has some advantages for dealing with incomplete information [16, 4]. A suggestive application of abduction from logic programs to data dictionary design is presented in [59] The logic programs from above enjoy the property of being stratifiable [2] and thus has a generally accepted clear semantics. However, the declarative semantics of a logic program with ....

[Article contains additional citation context not shown here]

M. Denecker and D. De Schreye. Representing Incomplete Knowledge in Abductive Logic Programming. In Proc. International Symposium on Logic Programming (ILPS '93), pp. 147--163. MIT Press, 1993.

....subset of A into a logic programming language, and the translation is proved to be sound relative to the semantics of A. The three translations discussed in this chapter were first reported in [Kartha, 1993] Translations from A into abductive logic programming in can be found in [Dung, 1993] and [Denecker and De Schreye, 1993] , and into equational logic programming in [Thielscher, 1994b] If a theorem prover, or a query evaluation procedure, is available for the target language of such a translation, then it becomes possible to use the translation for the automation of reasoning about action. For example, the logic ....

....the target language of such a translation, then it becomes possible to use the translation for the automation of reasoning about action. For example, the logic programming interpreter XOLDT [Chen and Warren, 1992] is put to such use in [Lifschitz et al. 1993] the abductive procedure SLDNFA in [Denecker and De Schreye, 1993] , and the theorem prover of [Boyer and Moore, 1988] in [Subramanian, 1993] In [Thielscher, 1994a] the language A is related to the ideas of [Sandewall, 1992] In many ways, the expressive possibilities of A are limited. For instance, in A, all the fluents are assumed to be independent. Thus ....

[Article contains additional citation context not shown here]

Mark Denecker and Danny De Schreye. Representing incomplete knowledge in abductive logic programming. In Dale Miller, editor, Logic Programming: Proceedings of the 1993 Int'l Symposium, pages 147--163, 1993.

....base: Tom has Money. The rest of this paper is organized as follows. First we review the action description language A of [8] for domain descriptions, then present a new transformation from domain descriptions in A to abductive logic programs, which is different from other translations of, e.g. [8, 6] in that a time dimension is incorporated so that one can represent and reason about narratives, next we use the translation to represent temporal knowledge bases and give the soundness and completeness theorems for the representation, then we discuss how to incorporate new knowledge into a ....

....is said to be complete iff, for every history H, KB(D;H) is complete with respect to H. Theorem 6 (Soundness) Assume that D is a domain description. For any history H, model I of D, fluent F , and time T , if KB(D;H) j= holds(F; T ) then F 2 GS I (H; T ) A domain description D is e consistent [6] iff for each pair of e propositions a causes f if p 1 ; pn and a causes :f if pn 1 ; pm in D, there exist i and j such that p i is the complement of p j . Theorem 7 (Completeness) Assume that D is an e consistent domain description. For any history H, fluent F , and time T , if F ....

Denecker, M. and de Schreye, D., Representing incomplete knowledge in abductive logic programming, Logic Programming: Proc. of the 1993 Int'l Symposium, 1993, 147--163

....individual answer sets for such a program. It only asserts that a literal which is a consequence of the program that is to say, which belongs to all its answer sets is true in the corresponding action domain. Alternative translations from action languages to logic programming proposed in [ Denecker and De Schreye, 1993 ] Dung, 1993 ] and [ Turner, 1997 ] show that there may exist a close relationship between possible histories of an action domain (paths in its transition diagram) on the one hand, and individual answer sets for a logic program on the other. This idea has led Subrahmanian and Zaniolo [1995] to ....

Mark Denecker and Danny De Schreye. Representing incomplete knowledge in abductive logic programming. In Dale Miller, editor, Logic Programming: Proceedings of the 1993 Int'l Symposium, pages 147--163, 1993.

....the soundness of a translation from A into the language of extended logic programs. Subsequently, Kartha [1993] proved the soundness and completeness of translations from A into the above mentioned approaches of Pednault, Reiter, and Baker. Sound and complete translations from A were also given by Denecker and De Schreye [1993] into the language of abductive logic programming and by Turner [1994] into the language of disjunctive logic programming. 16 Other high level action description languages have been defined as approximate extensions of A; for example, Baral and Gelfond, 1993 ] Kartha and Lifschitz, 1994 ] ....

Marc Denecker and Danny De Schreye. Representing incomplete knowledge in abductive logic programming. In Dale Miller, editor, Logic Programming: Proceedings of the 1993 Int'l Symposium, pages 147-- 163, 1993.

....the original translation in [GL93] of A into logic programming was partial it was sound only for a restricted subset of the A domain descriptions and incomplete. Later sound and complete translations of A utilized extensions or variants of logic programming: abductive logic programming [DD93, Dun93], equational logic programming [Thi94] or disjunctive logic programming [Tur94] For the portion of AC that corresponds to A, we specify in this paper a translation into logic programming that is arguably simpler than any of those previously published, and does not require abduction or ....

....translation in [GL93] of consistent A into logic programming was partial it was not sound for some consistent A domain descriptions and incomplete. Later sound and complete translations of consistent A utilized extensions or variants of logic programming: abductive logic programming [DD93, Dun93], equational logic programming [Thi94] or disjunctive logic programming [Tur94] For the portion of AC that corresponds to consistent A, our sound and complete translation 0 is arguably simpler than any of those previously published, and does not require abduction or disjunction. Furthermore, ....

Marc Denecker and Danny DeSchreye. Representing incomplete knowledge in abductive logic programming. In Logic Programming: Proc. of the 1993 Int'l Symposium, pages 147--163, 1993.

....(intuitively) correctly. They also specified a translation from A into nondisjunctive logic programming, and used properties of signed normal programs to prove the translation sound. Subsequently, several sound and complete translations from A into variants of logic programming have been proposed. Denecker [1993] and Dung [1993] each define a version of abductive logic programming into which they specify a translation from A. A translation into equational logic programming has also been proposed [ Holldobler and Thielscher, 1993 ] In the remainder of this section, we define a slight extension of A, ....

Marc Denecker and Danny DeSchreye. Representing incomplete knowledge in abductive logic programming. In Logic Programming: Proceedings of the 1993 International Symposium, pages 147--163, 1993.

No context found.

M. Denecker and D. De Schreye. Representing Incomplete Knowledge in Abductive Logic Programming. Journal of Logic and Computation, 5(5):553{ 578, Sept. 1995.

....logical level, the work evolved into a study of the role of ALP for knowledge representation and of SLDNFA for abductive and deductive reasoning. A number of subsequent experiments with ALP and SLDNFA demonstrated the role of ALP for knowledge representation of incomplete and temporal knowledge [19, 113, 114, 22]. To explain and clarify the representational and epistemological aspects of ALP, 16] proposed ID logic, an integration of classical logic with inductive definitions under well founded semantics. At the computational level, e#orts were done to improve the computational performance and ....

M. Denecker and D. De Schreye. Representing Incomplete Knowledge in Abductive Logic Programming. Journal of Logic and Computation, 5(5):553--578, September 1995.

.... In parallel to these studies of abduction as an inferential method, Eshghi and Kowalski [29] and later Kakas and Mancarella in [52, 54] and Dung in [25] used abduction as a semantical device to describe the non monotonic semantics of Logic Programming (in a way analogous to Poole in [81] In [18, 14], abductive logic programming was investigated from a knowledge representation point of view and its suitability for representing and reasoning on incomplete information and definitional and assertional knowledge was shown. For these reasons, Abductive Logic Programming (ALP) 50, 51] was ....

M. Denecker and D. De Schreye. Representing incomplete knowledge in abductive logic programming. In Proc. of the International Symposium on Logic Programming, pages 147--163. MIT Press, 1993.

....the non abducible predicates in terms of the open abducible predicates. In [11] I presented an embedding of ALP in ID logic which expresses this idea. This work re nes earlier work on 7 Here M j= F means that F is true in the interpretation M in the standard sense. 16 Open Logic Programming in [7, 5] which is based on the view of the ALP logic as a logic for rst order assertions and rst order de nitions (expressed through completion semantics) This embedding provides a solid knowledge theoretic foundation for the ALP logic. In this view, the area of ALP is involved in the study of ....

M. Denecker and D. De Schreye. Representing Incomplete Knowledge in Abductive Logic Programming. Journal of Logic and Computation, 5(5):553-578, September 1995.

....to implement AI planning using abductive reasoning in the event calculus. Early experiments with the procedure were in the context of temporal reasoning and planning [16] In a number of subsequent knowledge representation and reasoning experiments with abductive logic programming and SLDNFA [14, 17], the attention gradually shifted to the logical, semantical and representational aspects of the formalism rather than the abductive reasoning. SLDNFA was shown to be useful not only for abductive problems but also for deductive problems. To stress these aspects, 11] developed Open Logic ....

M. Denecker and D. De Schreye. Representing Incomplete Knowledge in Abductive Logic Programming. Journal of Logic and Computation, 5(5):553-578, September 1995.

.... In parallel to these studies of abduction as an inferential method, Eshghi and Kowalski [24] and later Kakas and Mancarella in [45, 47] and Dung in [20] used abduction as a semantical device to describe the non monotonic semantics of Logic Programming (in a way analogous to Poole in [70] In [13, 11], abductive logic programming was investigated from a knowledge representation point of view and its suitability for representing and reasoning on incomplete information and de nitional and assertional knowledge was shown. For these reasons, Abductive Logic Programming 1 (ALP) 43, 44] was ....

M. Denecker and D. De Schreye. Representing incomplete knowledge in abductive logic programming. In Proc. of the International Symposium on Logic Programming, pages 147-163. MIT Press, 1993.

....abductive procedures have been used for planning [21] 52] 46, 44] knowledge assimilation and belief revision [32] 30] database updating [31] 18] showed the role of an abductive system for forms of reasoning, different from planning, in the context of temporal domains with uncertainty. In [15, 17], the role of abductive logic programming for representing uncertainty in a logic programming formalism and the role of abductive procedures for abductive and deductive reasoning and satisfiability checking on incomplete knowledge has been shown in the context of a translation from a temporal ....

....logic programming was successfully applied for representing uncertainty, has to do with the fact that reasoning by 2 cases on abducible predicates is possible. An important illustration of this thesis is found in the recent experiments on the transformation of the language A to extensions. In [17], we compare the transformation of A to Extended Logic Programming (ELP) presented in [27] with a transformation to abductive logic programming. The latter transformation is in all respects superior to the first one. In [17] we show that the reason for the incompleteness of the transformation of ....

[Article contains additional citation context not shown here]

M. Denecker and D. De Schreye. Representing Incomplete Knowledge in Abductive Logic Programming. Journal of Logic and Computation, 5(5):553--578, September 1995.

....abductive procedures have been used for planning [21] 52] 46, 44] knowledge assimilation and belief revision [32] 30] database updating [31] 18] showed the role of an abductive system for forms of reasoning, different from planning, in the context of temporal domains with uncertainty. In [15, 17], the role of abductive logic programming for representing uncertainty in a logic programming formalism and the role of abductive procedures for abductive and deductive reasoning and satisfiability checking on incomplete knowledge has been shown in the context of a translation from a temporal ....

....is logically equivalent to T . More precisely, for any formula F based on the original alphabet, we have T j= Sigma F iff (P 0A ; f:violatedg) j= Sigma F iff P 0A j= Sigma :violated F . This shows that P 0A can be used for problem solving in T . In [16] and informally also in [15]) we have shown that using the above transformation technique, SLDNFA can be used not only for solving abductive problems with respect to T , but also for solving deductive and satisfiability checking problems. 11.4.1 Deduction The use of SLDNFA for deduction is based on theorem 9.1(c) which ....

M. Denecker and D. De Schreye. Representing incomplete knowledge in abductive logic programming. In Proc. of the International Symposium on Logic Programming, pages 147--163, 1993.

....deduction is illustrated. Section 5 gives a comparison between our transformation and the transformation in [17] Section 6 compares our work with another recent transformation from A proposed in [11] In section 7, we discuss other related work. A short paper on this subject has been published as [8]. 2 The temporal language A The language A [17] allows to describe relationships between fluents ( time dependent properties of the world) and actions. A is a propositional language: both fluents and actions are represented by propositional symbols. Two types of expressions occur. 2 A ....

M. Denecker and D. De Schreye. Representing incomplete knowledge in abductive logic programming. In Proc. of the International Symposium on Logic Programming, pages 147--163, 1993.

....logic programming and abductive (or open) logic programming. One of the original ideas on the declarative semantics of logic programs with negation as failure was to interpret a logic program as a definition of its predicates. This view is underlying Clark s completion semantics (Clark 1978) In (Denecker 1995; Denecker De Schreye 1995; Van Belleghem, Denecker, De Schreye 1997) this view was extended to abductive logic programs and open logic programs and the relation with description logics was shown. In the context of non monotonic reasoning, Reiter (Reiter 1996) and Amati et al. (Amati, ....

....and abductive (or open) logic programming. One of the original ideas on the declarative semantics of logic programs with negation as failure was to interpret a logic program as a definition of its predicates. This view is underlying Clark s completion semantics (Clark 1978) In (Denecker 1995; Denecker De Schreye 1995; Van Belleghem, Denecker, De Schreye 1997) this view was extended to abductive logic programs and open logic programs and the relation with description logics was shown. In the context of non monotonic reasoning, Reiter (Reiter 1996) and Amati et al. (Amati, Carlucci Aiello, Pirri 1997) ....

[Article contains additional citation context not shown here]

Denecker, M., and De Schreye, D. 1995. Representing Incomplete Knowledge in Abductive Logic Programming. Journal of Logic and Computation 5(5):553--578.

No context found.

M. Denecker and D. de Schreye. Representing Incomplete Knowledge in Abductive Logic Programming. In D. Miller, ed., Proc. of ILPS, p. 147--163, Vancouver, October 1993. MIT Press.

No context found.

M. Denecker and D. de Schreye. Representing Incomplete Knowledge in Abductive Logic Programming. In D. Miller, ed., Proc. of the ILPS, 147--163, Vancouver, 1993. MIT Press.

No context found.

M. Denecker and D. de Schreye. Representing Incomplete Knowledge in Abductive Logic Programming. In D. Miller, ed., Proc. of the ILPS, p. 147--163, 1993

First 50 documents  Next 50

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