Filters








68,646 Hits in 5.1 sec

Nonmonotonic reasoning

1997 Computers and Mathematics with Applications  
As a result there now more research effort in logics for computer science than there ever was in traditional logics. Some of the needed logics are extensions of classical logic by new operators.  ...  An outstanding feature of classical logics and their extensions and restrictions is that once the premises of an argument have been accepted and an inference of a conclusion from these premises has been  ...  There are many algorithms for computing extensions of default theories.  ... 
doi:10.1016/s0898-1221(97)90195-4 fatcat:xf5mjfcihzcjfk6dm7nmwgw4la

An overview of nonmonotonic reasoning and logic programming

Jack Minker
1993 The Journal of Logic Programming  
A theory consisting of general default rules does not always have an extension. A subclass consisting of default rules called normal defaults, and of the form y always has an extension.  ...  They provide the first attempt at a semantics for such hierarchies, a provably correct inference algorithm for acyclic networks, a guarantee that the acyclic network has extensions, and a provably correct  ... 
doi:10.1016/0743-1066(93)90028-f fatcat:zs5h4ximffdfvapevyr6rvs4fm

Page 5772 of Mathematical Reviews Vol. , Issue 97I [page]

1997 Mathematical Reviews  
computation of default logic extensions.  ...  ., SLDNF-resolution) computes answer substitutions that correspond exactly to the extensions of the represented default theory. This means that we give a correct implementation of default logic.  ... 

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

1998 Mathematical Reviews  
(English summary) Extensions of logic programming ( Leipzig, 1996), 237-254, Lecture Notes in Comput. Sci., 1050, Springer, Berlin, 1996.  ...  (English summary) Extensions of logic programming (Leipzig, 1996), 255-271, Lecture Notes in Comput. Sci., 1050, Springer, Berlin, 1996.  ... 

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).  ...  Acknowledgments The work of the second author was partially supported by the Academy of Finland (project 122399). The work of the third author was partially supported by the NSF grant IIS-0913459.  ... 
arXiv:1108.3281v1 fatcat:kioh3cangrchbnkk5heilbhloi

Nonmonotonic Inheritance in Object-Oriented Deductive Database Languages

W. May
2001 Journal of Logic and Computation  
By restricting the problem to Horn programs and a special type of defaults tailored to the semantics of inheritance, a forwardchaining construction of extensions is possible.  ...  From this point o f v i e w , w e i n vestigate the application of the extension semantics of Default Logic to deductive object-oriented database languages.  ...  Normal defaults guarantee the following: Proposition 9 For an F-Logic program P, every in ationary extension of P is also an extension of P . 2 Theorem 2 Given an F-Logic program P, there is a mapping  ... 
doi:10.1093/logcom/11.4.499 fatcat:cadwxzgaane23e7xev6qnq6dta

Page 3618 of Mathematical Reviews Vol. , Issue 95f [page]

1995 Mathematical Reviews  
Then we pre- sent a correct transformation of disjunctive logic programs into default theories and show a one-to-one correspondence between the stable models of a program and the extensions of its associated  ...  (English summary) Extensions of logic programming (St. Andrews, 1993), 301-321, Lecture Notes in Comput.  ... 

Page 4358 of Mathematical Reviews Vol. , Issue 96g [page]

1996 Mathematical Reviews  
This results in a new context-based approach to default logic, called contex- tual default logic. The approach extends the notion of a default rule and supplies each default extension with a context.  ...  Summary: “My purpose in this paper is to show the evolution of the relationship between nonmonotonic logic and logic program- ’ 68 COMPUTER SCIENCE 4358 ming.  ... 

Page 3222 of Mathematical Reviews Vol. , Issue 98E [page]

1998 Mathematical Reviews  
In this paper we study a class of propositional default theories for which computation of extensions can be simplified. We introduce the notions of stratification and strong stratifica- tion.  ...  We present algorithms for computing extensions for stratified default theories and analyze their complexity.”  ... 

dl2asp: Implementing Default Logic via Answer Set Programming [chapter]

Yin Chen, Hai Wan, Yan Zhang, Yi Zhou
2010 Lecture Notes in Computer Science  
In this paper, we show that Reiter's default logic in the propositional case can be translated into answer set programming by identifying the internal relationships among formulas in a default theory.  ...  Based on this idea, we implement a new default logic solver -dl2asp.  ...  The first author is partially supported by Natural Science Foundation of China under dl2asp: Implementing Default Logic via Answer Set Programming  ... 
doi:10.1007/978-3-642-15675-5_11 fatcat:5ilhtzhw3bhnha4e2joaobvfly

Epistemology and artificial intelligence

Gregory R. Wheeler, Luís Moniz Pereira
2004 Journal of Applied Logic  
We illustrate this point by discussing how to represent a class of inference forms found in standard inferential statistics.  ...  Our modeling of standard inferential statistical arguments exploits results from both logical artificial intelligence and analytical epistemology.  ...  Logical Updates".  ... 
doi:10.1016/j.jal.2004.07.007 fatcat:kd3xnghcmvgitgd5u4j6zhxyce

Default Rules for Curry [chapter]

Sergio Antoy, Michael Hanus
2016 Lecture Notes in Computer Science  
In this paper we propose a new concept of default rules for Curry that supports a programming style similar to functional programming while preserving the core properties of functional logic programming  ...  Although default rules are often used in functional programs, the non-deterministic nature of functional logic programs does not allow to directly transfer this concept from functional to functional logic  ...  logic computations even in the presence of default rules.  ... 
doi:10.1007/978-3-319-28228-2_5 fatcat:hpiewwmztrbz5crekzqd65x7qe

Page 6846 of Mathematical Reviews Vol. , Issue 91M [page]

1991 Mathematical Reviews  
Exis- 68 COMPUTER SCIENCE 6846 tence of such a set of default rules turns out to be equivalent to the existence of an extension.  ...  Besides Reiter’s extensions, which are based on a proof-theoretic paradigm (similar to logic programming), other structures for default theories, based on weaker or different meth- ods of constructing  ... 

Default rules for Curry

SERGIO ANTOY, MICHAEL HANUS
2016 Theory and Practice of Logic Programming  
In this paper, we propose a new concept of default rules for Curry that supports a programming style similar to functional programming while preserving the core properties of functional logic programming  ...  Although default rules are often used in functional programs, the non-deterministic nature of functional logic programs does not allow to directly transfer this concept from functional to functional logic  ...  logic computations even in the presence of default rules.  ... 
doi:10.1017/s1471068416000168 fatcat:kua7w5ergzag3j6fxqefskswo4

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

1995 Mathematical Reviews  
(English summary) Extensions of logic programming (St. Andrews, 1993), 255-267, Lecture Notes in Comput. Sci., 798, Springer, Berlin, 1994.  ...  It is also pointed out that due to the mutual relationship between stable semantics of logic programs and extensions of default theories another important problem in nonmonotonic reasoning can be solved  ... 
« Previous Showing results 1 — 15 out of 68,646 results