J. Minker. An Overview of Nonmonotonic Reasoning and Logic Programming. Journal of Logic Programming, Special Issue 17, 1993.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... assumptions of minimality (see, e.g. 17] On the other hand, the adaption of nonmonotonic reasoning principles has inspired various new semantics for logic programs, which show a wider range of applicability than the original so called completion semantics [3] for an overview see, e.g. [16, 1, 6]. Moreover, formal properties characterizing nonmonotonic logics have been transferred to the logic programming paradigm in order to assess and compare di#erent semantics [4, 5] In this paper, we pursue the latter line of research by investigating the applicability of an abstract, ....

J. Minker. An overview of nonmonotonic reasoning and logic programming. J. of Logic Programming, 17:95--126, 1993.

....the class of disjunc 1 It su#ces just to mention several recent workshops on Extensions of Logic Programming specifically devoted to this subject ( DPP95, DPP97, DHSH96] 2 The book by Minker et al. LMR92] provides a detailed account of the extensive research e#ort in this area. See also [Dix95, Min93, Prz95a, Prz95b]. 2 tive logic programs as well as the class of logic programs with strong (or classical ) negation; the proposed semantics of such programs constitutes an intuitively natural extension of the semantics of normal logic programs, which, when restricted to normal logic programs, coincides ....

Jack Minker. An Overview of Nonmonotonic Reasoning and Logic Programming. Journal of Logic Programming, Special Issue, 17, 1993.

....programmingand non monotonicreasoning in general. Nevertheless, to make this paper self contained and also readable to the non specialist, we have added some remarks and references about classical notions in this field. For more detailed investigations and overview articles we refer the reader to [1, 27, 59, 60, 41, 17, 45, 16, 37, 50, 51]. 2. Normal Programs Although our aim is to create a disjunctive logic programming system, many problems already occur for negation with respect to non disjunctive programs. There are two main competing approaches to provide semantics for negation in logic programming, namely the stable model ....

Jack Minker. An Overview of Nonmonotonic Reasoning and Logic Programming. Journal of Logic Programming, Special Issue, 17, 1993.

....AELB, introduced earlier in [Przymusinski 1994; Przymusinski 1998] The logic AELB isomorphically includes the well known non monotonic formalisms 2 The book by Minker et al. Lobo et al. 1992] provides a detailed account of the extensive research effort in this area. See also [Dix 1995b; Minker 1993; Przymusinski 1995a; Przymusinski 1995b; Minker 1996] 3 Observe that while such a mechanism cannot even in principle be efficient, due to the inherent NP completeness of the problem of computing answers just to positive disjunctive programs, it can be efficient when restricted to ....

Minker, J. 1993. An Overview of Nonmonotonic Reasoning and Logic Programming. Journal of Logic Programming, Special Issue 17, 2/3/4, 95--126.

....logic programs and semantics as well as the modal framework of the autoepistemic logic of beliefs (AELB) In Section 3 we recapitulate shortly the 1 The book by Minker et al. LMR92] provides a detailed and well organized account of the extensive research effort in this area. See also [Dix95, Min93]. 2 semantics D WFS and STATIC. While we extend in Section 4 the semantics D WFS by introducing a transformation P 7 P cp to show that D WFS(P cp ) STATIC(P ) we introduce in Section 5 the restricted language LDBL with non nested beliefs, database logic, and characterize the least static ....

Jack Minker. An Overview of Nonmonotonic Reasoning and Logic Programming. Journal of Logic Programming, Special Issue, 17, 1993.

....which 1 It suffices just to mention several recent workshops on Extensions of Logic Programming specifically devoted to this subject ( DPP95,DHSH96] 2 The book by Minker et al. LMR92] provides a detailed and well organized account of the extensive research effort in this area. See also [Dix95,Min93]. 2 includes the class of disjunctive logic programs as well as the class of logic programs with classical (or strong) negation; ffl the proposed semantics of such programs constitutes an intuitively natural extension of the semantics of normal logic programs, which, when restricted to normal ....

Jack Minker. An Overview of Nonmonotonic Reasoning and Logic Programming. Journal of Logic Programming, Special Issue, 17, 1993.

....2 Stefan Brass and Jurgen Dix forms of negation as failure from non disjunctive to disjunctive semantics. Many interrelationships of non monotonic logics (Default Logic DL, Circumscription CIRC, Autoepistemic Logic AEL) with semantics of logic programs have been discovered during the last years [1, 20, 28, 14]. Eiter and Gottlob have shown in [23, 24] that disjunctive semantics are strictly more expressive than non disjunctive semantics and therefore may be better suited for many knowledge representation tasks (see also [2, 15] for using such semantics in KR) One of the main problems today is that ....

Jack Minker. An Overview of Nonmonotonic Reasoning and Logic Programming. Journal of Logic Programming, Special Issue, 17, 1993.

....to compute the semantics 5 ; 3 It su#ces just to mention several recent workshops on Extensions of Logic Programming specifically devoted to this subject ( 24, 25, 28, 21] 4 The book by Minker et al. 46] provides a detailed account of the extensive research e#ort in this area. See also [23, 50, 57, 59, 51]. 5 Observe that while such a mechanism cannot even in principle be e#cient, due to the inherent NP completeness of the problem of computing answers just to positive disjunctive programs, it can be e#cient when restricted to specific subclasses of programs and queries and it can allow ....

Jack Minker. An Overview of Nonmonotonic Reasoning and Logic Programming. Journal of Logic Programming, Special Issue, 17(2/3/4):95-- 126, 1993.

....Although firstorder logic is proof theoretically monotonic, nevertheless, it is non persistent at the semantical level. The monotonic inference of first order logic is not suitable for book on the subject is Nonmonotonic Logic by Marek and Truszczynski [67] For a survey of nonmonotonic logic, see [72]. 1. Introduction 11 the retrieval of negative information even in the context of relational databases. Instead it is the semantic notion of classical negation that is used in relational databases. These arguments will be used in Chapter 4 to facilitate understanding of the relationships among ....

....on their relevance to our proposed semantics in the next chapter. So it is by no means intended to be a comprehensive overview of the area, and does not imply any prejudice to other theories either. Readers are invited to refer to [64] for an elementary introduction to logic programming, and [15] [72], 33] and [34] for detailed surveys on negation in logic programming. The semantics reviewed here include the semantics of definite logic programs mainly by van Emden and Kowalski [103] Clark s program completion semantics and the associated SLDNF[25] Reiter s closed world assumption [90] ....

J. Minker. An overview of non-monotonic reasoning and logic programming. Journal of Logic Programming, 17:95--126, 1993.

.... e.g. Pereira et al. 1993 ] On the other hand, the adaption of nonmonotonic reasoning principles has inspired various new semantics for logic programs, which show a wider range of applicability than the original so called completion semantics [ Clark, 1978 ] for an overview see, e.g. Minker, 1993; Apt and Bol, 1994; Dix, 1995c ] Moreover, formal properties characterizing nonmonotonic logics have been transferred to the logic programming paradigm in order to assess and compare different semantics [ Dix, 1995a; Dix, 1995b ] In this paper, we pursue the latter line of research by ....

Jack Minker. An overview of nonmonotonic reasoning and logic programming. Journal of Logic Programming, 17:95--126, 1993. 16

....[NMS91, PN93] Collection of important papers can also be found in the forthcoming special issue of Journal of Logic Programming devoted to logic programming and nonmonotonic reasoning . This issue includes a recent overview on the relations between logic programming and nonmonotonic reasoning [Min93] and an article on performing nonmonotonic reasoning with logic programming [PAA] This direction of research proved to be fruitful for logic programming as well as for artificial intelligence. The results uncovered deep similarities between various, seemingly different, approaches to ....

J. Minker. An overview of nonmonotonic reasoning and logic programming. Journal of Logic Programming, 17(2,3,4):95--126, 1993.

....of certain operators, were used successfully to define NMR semantics. The most important NMR semantics are the stable semantics STABLE ( BF91, GL88] and the well founded semantics WFS ( vGRS88] First attempts to extend WFS by allowing reasoning by cases are due to Minker and his group ( Min93, LMR92] and to Schlipf ( Sch92] While all NMR semantics coincide on the class of stratified programs (which is a proper subclass of all programs) with the single two valued model M supp P (defined by Apt, Blair and Walker in [ABW88] they behave quite differently on non stratified programs. ....

....and that the optimal (or best suited) semantics depends on the area of application. Recently three interesting overviews about negation in logic programming have appeared: Minker s article in the Special Issue of the Journal of Logic Programming on Non Monotonic Reasoning and Logic Programming ( Min93] Apt and Bol s article in the jubileum (10th anniversary) issue of the Journal of Logic Programming ( AB94] and the author s article in the Proceedings of the Konstanz Colloquium in Logic and Information ( Dix95] While Minker s article gives an almost complete description of all the ....

Jack Minker. An Overview of Nonmonotonic Reasoning and Logic Programming. Journal of Logic Programming, Special Issue, 17, 1993.

....and basic properties of disjunctive logic programs and semantics as well as the modal framework of the autoepistemic logic of beliefs (AELB) In Section 3 1 The book by Minker et al. LMR92] provides a detailed and well organized account of the extensive research effort in this area. See also [Dix95,Min93]. we recapitulate shortly the semantics D WFS and STATIC. We introduce in Section 4 the restricted language LDBL with non nested beliefs, database logic, and characterize the least static expansion in this language this defines the semantics STATICDBL . We then show, using our ....

Jack Minker. An Overview of Nonmonotonic Reasoning and Logic Programming. Journal of Logic Programming, Special Issue, 17, 1993.

.... programs (the upper half of the diagram) As already done in the preceding article, we refer the reader to three interesting overviews about negation in logic programming: Minker s article in the Special Issue of the Journal of Logic Programming on Non Monotonic Reasoning and Logic Programming ([Min93] ) Apt and Bol s article in the jubileum (10th anniversary) issue of the Journal of Logic Programming ( AB94] and the author s article in the Proceedings of the Konstanz Colloquium in Logic and Information ( Dix95] While Minker s article gives an almost complete description of all the ....

Jack Minker. An Overview of Nonmonotonic Reasoning and Logic Programming. Journal of Logic Programming, Special Issue, 17, 1993.

....[NMS91, PN93] Collection of important papers can also be found in the forthcoming special issue of Journal of Logic Programming devoted to logic programming and nonmonotonic reasoning . This issue includes a recent overview on the relations between logic programming and nonmonotonic reasoning [Min93] and an article on performing nonmonotonic reasoning with logic programming [PAA] This direction of research proved to be fruitful for logic programming as well as for artificial intelligence. The results uncovered deep similarities between various, seemingly different, approaches to ....

J. Minker. An overview of nonmonotonic reasoning and logic programming. Journal of Logic Programming, 17(2,3,4):95--126, 1993.

....work was going on in Logic Programming to extend semantics based on different forms of negation as failure from non disjunctive to disjunctive semantics. Many interrelationships of non monotonic logics (DL, CIRC, AEL) with semantics of logic programs have been discovered during the last years ([1, 9, 12]) Eiter and Gottlob have shown that disjunctive semantics are strictly more expressive than non disjunctive semantics and therefore may be better suited for many knowledge representation tasks. One of the main problems today is that although we have a quite good understanding of non disjunctive ....

Jack Minker, `An Overview of Nonmonotonic Reasoning and Logic Programming', Journal of Logic Programming, Special Issue, 17, (1993).

....non monotonic reasoning in general. Nevertheless, to make this paper self contained and also readable to the non specialist, we have added some remarks and references about classical notions in this field. For more detailed investigations and overview articles we refer the reader to [AB94, BG94, Min93, Min96, Dix95c, BDK97, DPP97b, BD98c, DFN98, Dun95a, Dun95b] 2 Normal Programs Although our aim is to create a disjunctive logic programming system, many problems already occur for negation with respect to non disjunctive programs. There are two main competing approaches to provide semantics ....

Jack Minker. An Overview of Nonmonotonic Reasoning and Logic Programming. Journal of Logic Programming, Special Issue, 17, 1993.

....suffices just to mention several recent workshops on Extensions of Logic Programming specifically devoted to this subject ( DPP95,DHSH96,Wol94,DLMW96] 10 The book by Minker et al. LMR92] provides a detailed and well organized account of the extensive research effort in this area. See also [Dix95c,Min93]. the proposed syntax of such programs resembles the syntax of logic programs but it applies to a significantly broader class of programs, which includes the class of disjunctive logic programs as well as the class of logic programs with classical (or symmetric) negation; the proposed ....

Jack Minker. An Overview of Nonmonotonic Reasoning and Logic Programming. Journal of Logic Programming, Special Issue, 17, 1993.

....in a syntactically correct way, which means that one must restrict oneself to a sublanguage (such as Datalog) if one wants to use a Logic Programming approach for KR. An overview of extended Logic Programs with declarative semantics and their application to representing knowledge can be found in [32, 82, 13, 2]. Description Logics The attempt to provide for a structured representation of information was one of the main motivations for introducing early KR formalisms such as Semantic Networks and Frames. Frames have been introduced by Minsky [83] as record like data structures for representing ....

J. Minker. An overview of nonmonotonic reasoning and logic programming. Journal of Logic Programming, 17:95--126, 1993.

....1 It suffices just to mention several recent workshops on Extensions of Logic Programming specifically devoted to this subject ( DPP95, DHSH96] 2 The book by Minker et al. LMR92] provides a detailed and well organized account of the extensive research effort in this area. See also [Dix95, Min93] represented most naturally by multiple intended models; ffl Conflicts in multiple inheritance: if we want to keep as much information as possible, we should assume disjunction of the inherited values [BL93] Formalisms promoting disjunctive reasoning are more expressive and natural to use ....

Jack Minker. An Overview of Nonmonotonic Reasoning and Logic Programming. Journal of Logic Programming, Special Issue, 17, 1993.

....from (past) data, should be stabilised and less prone to change. However, the situation is far from clear cut, as is shown by some of the problems with non monotonic logics and default reasoning where the notion of consequences due to updates in deductive databases have been extensively studied [55]. We also note that the formal semantics of both DDBs and ESs provide the mathematics for rigorous verification, whereas, much DB technology lacks a formal semantics. Early work on VV I of rule bases originating at the commencement of the 1980s and now well established, sought to establish the ....

Minker, J. (1993). An Overview of Nonmonotonic Reasoning and Logic Programming. Journal of Logic Programming, 17(2-4), pp 95-126.

No context found.

J. Minker. An overview of nonmonotonic reasoning and logic programming. Journal of Logic Programming, 17(2, 3 and 4): pp. 95-126, 1993.

....main.html) Based upon the above analysis, there is reason to believe that disjunctive databases will become practical tools. As many theories in non monotonic reasoning can be represented as DDDBs, such theories will be able to take advantage of DDDB technology ([Min93]) Acknowledgements This work was supported by the National Science Foundation under grant number IRI 9300691. We also express our appreciation to Parke Godfrey and Carolina Ruiz for their assistance with the paper. ....

J. Minker. An overview of nonmonotonic reasoning and logic programming. Journal of Logic Programming, 17(2, 3 and 4):95--126, November 1993.

....observed may be one of several possibilities. Current relational and deductive database technologies do not adequately handle such data. In addition, it has been shown that many problems that deal with nonmonotonic and commonsense reasoning can be translated into disjunctive deductive databases [15]. It will be necessary to be able to understand the meaning of disjunctive databases and how to respond to queries posed to them. A great deal is known, however, about the semantics of disjunctive deductive databases [12, 5] In this paper we address alternative possible representations of such ....

J. Minker. An overview of nonmonotonic reasoning and logic programming. Journal of Logic Programming, 17(2, 3, and 4):95--126, November 1993.

No context found.

J. Minker. An Overview of Nonmonotonic Reasoning and Logic Programming. Journal of Logic Programming, Special Issue 17, 1993.

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