Filters








2,083 Hits in 4.1 sec

An overview of nonmonotonic reasoning and logic programming

Jack Minker
1993 The Journal of Logic Programming  
Work in logic programming and nonmonotonic reasoning deals with the handling of negation. We consider two types of negation in logic programs: negation by rules of default and logical negation.  ...  I then provide a summary which includes an assessment of the field and what must be done to further research in nonmonotonic reasoning and logic programming. a INTRODUCTION Classical logic has played  ... 
doi:10.1016/0743-1066(93)90028-f fatcat:zs5h4ximffdfvapevyr6rvs4fm

Guest editor's introduction

Teodor Przymusinski
1993 The Journal of Logic Programming  
Logic programs, however, do not use classical logical negation, but instead rely on a nonmonotonic operator, often referred to as negation by failure or negation by default.  ...  nonmonotonic reasoning, and hopefully, towards the eventual discovery of deeper underlying principles of nonmonotonic reasoning and logic programming.  ... 
doi:10.1016/0743-1066(93)90027-e fatcat:462wwnsv3vb4bbwdofceogtvvi

Answer Set Programming and S4 [chapter]

Mauricio Osorio, Juan Antonio Navarro
2004 Lecture Notes in Computer Science  
We even consider the use of multimodal logics in order to model a scenario where several agents can reason about the knowledge and beliefs of each other.  ...  We present a proposal on how to develop nonmonotonic reasoning based on the modal logic S4.  ...  Restoring Classical Negation We will now show how to restore the use of classical negation in our logic programs.  ... 
doi:10.1007/978-3-540-30498-2_36 fatcat:nhebklhqrzdnjbfppy6jj6uz7q

Page 5538 of Mathematical Reviews Vol. , Issue 95i [page]

1995 Mathematical Reviews  
Shvarts [in Logic programming and nonmonotonic reasoning (Lisbon, 1993 ), 101-114, MIT Press, Cambridge, MA, 1993; MR 95i:68022] and V. Marek and M.  ...  When Gelfond and Lifs- chitz extended this work to programs with classical negation, they used default logic, because it was not clear whether autoepistemic logic could be applied in that wider domain.  ... 

Page 2750 of Mathematical Reviews Vol. , Issue 99d [page]

1991 Mathematical Reviews  
negation in nonmonotonic reasoning and logic programming.  ...  Summary: “Gelfond and Lifschitz were the first to point out the need for a symmetric negation in logic programming and they also proposed a specific semantics for such negation for logic programs with  ... 

Page 448 of Mathematical Reviews Vol. , Issue 92a [page]

1992 Mathematical Reviews  
Logic programming handles negation through the so-called ‘negation as failure’ inference principle, which is rather unconventional from the viewpoint of classical logic.  ...  {For the entire collection see MR 91k:68012.} 92a:68136 68T27 68Q55 Marek, Wiktor (1-K Y-C); Subrahmanian, V.S. (1-SRCS-C) The relationship between logic program semantics and nonmonotonic reasoning.  ... 

Stable inference as intuitionistic validity

David Pearce
1999 The Journal of Logic Programming  
The paper characterises the nonmonotonic inference relation associated with the stable model semantics for logic programs as follows: a formula is entailed by a program in the stable model semantics if  ...  and only if it belongs to every intuitionisticaily complete and consistent extension of the program formed by adding only negated atoms.  ...  It has been shown to be closely related to Reiter's default logic [8] , to Moore's autoepistemic logic and to other systems of nonmonotonic reasoning (see e.g.  ... 
doi:10.1016/s0743-1066(98)10015-8 fatcat:yn4usv7conburpzrwgni7ta5si

Page 1471 of Mathematical Reviews Vol. , Issue 2001C [page]

2001 Mathematical Reviews  
Makinson, in Hand- book of logic in artificial intelligence and logic programming, Vol. 3, 35-110, Oxford Univ. Press, New York, 1994; MR 95i:68124] and classical default logic in particular [D. L.  ...  “This work extends and complements other handbook articles on nonmonotonic reasoning in general [D.  ... 

Page 6975 of Mathematical Reviews Vol. , Issue 96k [page]

1996 Mathematical Reviews  
Extended logic programs and related nonmonotonic formalisms. (English summary) Logic programming and nonmonotonic reasoning (Lisbon, 1993), 457-475, MIT Press, Cambridge, MA, 1993.  ...  In addition, we use this result to relate answer sets to two of the best-known nonmonotonic formalisms developed in AI, namely default theory and nonmonotonic modal logic.  ... 

Belief, provability, and logic programs

José Júlio Alferes, Luís Moniz Pereira
1995 Journal of Applied Non-Classical Logics  
In particular we present here, for the first time, embeddings into epistemic logic of logic programs extended with a second kind of negation under the wellfounded semantics, and contrast them to the recent  ...  The main goal of this paper is to establish a nonmonotonic epistemic logic with two modalities -provability and belief -capable of expressing and comparing a variety of known semantics for extended logic  ...  Acknowledgments We acknowledge Esprit BRA Compulog 2 (no. 6810), and JNICT -Portugal for their support. Thanks to Carlos Damásio and Teodor Przymusinski for helpful discussions.  ... 
doi:10.1080/11663081.1995.10510842 fatcat:y2s4fqionjg6fnkbmysl7p5ixe

Page 3856 of Mathematical Reviews Vol. , Issue 98F [page]

1998 Mathematical Reviews  
The example program uses negation as failure and backtracking in a non-trivial way and is therefore a typical Prolog program.”  ...  Such an observation is signifi- cant for nonmonotonic reasoning, but none of the major current semantics for disjunctive logic programs is able to support it be- cause they are all based on classical first-order  ... 

Origins of Answer-Set Programming - Some Background And Two Personal Accounts [article]

Victor W. Marek, Ilkka Niemela, Miroslaw Truszczynski
2011 arXiv   pre-print
logic programming.  ...  We discuss the evolution of aspects of nonmonotonic reasoning towards the computational paradigm of answer-set programming (ASP).  ...  This nonmonotonic aspect of the negation operator in logic programming was also a complicating factor in the effort to find a single intended model of logic programs with negation.  ... 
arXiv:1108.3281v1 fatcat:kioh3cangrchbnkk5heilbhloi

Nonmonotonic Reasoning in FLORA-2 [chapter]

Michael Kifer
2005 Lecture Notes in Computer Science  
In this paper we give an overview of the theoretical foundations of the system and of some of the aspects of nonmonotonic reasoning in FLORA-2.  ...  F-logic comes in two flavors: the firstorder flavor and the logic programming flavor. The first-order flavor of F-logic can be viewed as a syntactic variant of classical logic [20] .  ...  Database Dynamics and Nonmonotonicity In [5] , a generalization of the perfect-model semantics was defined for Transaction Logic programs with negation in the rule body.  ... 
doi:10.1007/11546207_1 fatcat:zyshs2f7mzabnb4zlfe34zlnz4

Page 401 of Mathematical Reviews Vol. , Issue 93a [page]

1993 Mathematical Reviews  
It is shown that the principle not only enables us to represent classical negation in the spirit of Minker’s disjunctive logic programming paradigm, but it also allows us to represent and reason directly  ...  “Classical logic programs with negation by failure are special cases of OL theories.  ... 

Page 6223 of Mathematical Reviews Vol. , Issue 95j [page]

1995 Mathematical Reviews  
M. (4-LNDIC; London) Classical vs. non-classical logics (the universality of classical logic). Handbook of logic in artificial intelligence and logic programming, Vol. 2, 359-500, Oxford Sci.  ...  Handbook of logic in artificial intelligence and logic programming, Vol. 3, 111-187, Oxford Sci. Publ., Oxford Univ. Press, New York, 1994.  ... 
« Previous Showing results 1 — 15 out of 2,083 results