641 Hits in 2.0 sec

Page 3154 of Mathematical Reviews Vol. , Issue 90F [page]

1990 Mathematical Reviews  
We therefore investigate lim- ited but efficiently computable theories of default reasoning.  ...  Selman, Bart (3-TRNT-C); Kautz, Henry (1-BELL) The complexity of model-preference default theories. Nonmonotonic reasoning (Grassau, 1988), 115-130, Lecture Notes in Comput.  ... 

Paraconsistent Reasoning via Quantified Boolean Formulas,I: Axiomatising Signed Systems [article]

Philippe Besnard, Stefan Woltran Institut für Informationssysteme, Technische Universität Wien)
2002 arXiv   pre-print
Signed systems were introduced as a general, syntax-independent framework for paraconsistent reasoning, that is, non-trivialised reasoning from inconsistent information.  ...  First, it furnishes an axiomatic specification of paraconsistent reasoning within the framework of signed systems.  ...  Applying this method to our considered tasks, we obtain that credulous paraconsistent reasoning lies in Σ P 2 , whilst skeptical and prudent paraconsistent reasoning are in Π P 2 .  ... 
arXiv:cs/0207084v1 fatcat:guusmp2jmfekxnnua5pvscoeue

A paraconsistent semantics with contradiction support detection [chapter]

Carlos Viegas Damásio, Luís Moniz Pereira
1997 Lecture Notes in Computer Science  
We begin by motivating the use of paraconsistency and the detection of contradiction supported conclusions by recourse to examples. Next we overview WFSX p and present its embedding into WFS.  ...  Thus, paraconsistent reasoning is, at least implicitly, an intermediate step to attain belief revision. The idea of introducing paraconsistent reasoning in logic programming is fairly recent.  ...  These two kinds of reasoning have been proposed in 40]. This three-valued framework for paraconsistent logic programs includes a form of explicit negation, default negation, and disjunction.  ... 
doi:10.1007/3-540-63255-7_18 fatcat:sxakliqjwrdvxelmeoelp77nvu

Page 8876 of Mathematical Reviews Vol. , Issue 2000m [page]

2000 Mathematical Reviews  
Section 4 enriches the language of extended logic pro- grams with the default negation symbol, within a non-monotonic reasoning mechanism.  ...  The addition of inheritance enhances the knowledge modeling features of the lan- guage providing a natural representation of default reasoning with exceptions.  ... 

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

2001 Mathematical Reviews  
This is, among other reasons, due to its natural way of incorporating default reasoning into the framework of standard logic.  ...  It has since proved to be one of the most widely used formalizations of default reasoning.  ... 

An encompassing framework for Paraconsistent Logic Programs

João Alcântara, Carlos Viegas Damásio, Luís Moniz Pereira
2005 Journal of Applied Logic  
Thus, we have a powerful mathematical formalism for dealing simultaneously with default, paraconsistency, and uncertainty reasoning.  ...  , p. 102], according to which explicit negation entails default negation.  ...  Semi-normality itself is a designation borrowed from semi-normal defaults, the reason being that the semi-normal logic program rules add to the rule's body the default literal not ¬H , where H is a propositional  ... 
doi:10.1016/j.jal.2004.07.012 fatcat:e7rhbygxsrhpbgcibudexvo7li

Four-Valued Semantics for Default Logic [chapter]

Anbu Yue, Yue Ma, Zuoquan Lin
2006 Lecture Notes in Computer Science  
We define four-valued models for default theory such that the default logic has the ability of nonmonotonic paraconsistent reasoning.  ...  Reiter's default logic is remained.  ...  Our main contribution in this paper is to provide four-valued semantics for default logic whereby we gain a nonmonotonic paraconsistent logic, named four-valued default logic, in which we can reason under  ... 
doi:10.1007/11766247_17 fatcat:66lefrxokbbd3ij7o4hwjau6yy

Page 3407 of Mathematical Reviews Vol. , Issue 97F [page]

1997 Mathematical Reviews  
In this paper a paraconsistent default logic named QML (Ques- tion Marked Logic) is presented, which is a kind of generalisation of the logic IDL (Inconsistent Default Logic) of T. Pequeno and A.  ...  default logic.  ... 

Page 5450 of Mathematical Reviews Vol. , Issue 2002H [page]

2002 Mathematical Reviews  
In Section 4, we discuss applications to artificial intelligence (namely, multisource reasoning and knowledge fusion, default reasoning, and flexible decision).  ...  logics and for reasoning with uncertainty.”  ... 

Page 2576 of Mathematical Reviews Vol. , Issue 98D [page]

1998 Mathematical Reviews  
Summary: “Default logic is one of the principal formalisms for nonmonotonic reasoning.  ...  Frans Voorbraak (NL-AMST-CS; Amsterdam) 98d:68186 68T27 03B70 Cholewinski, Pawet (1-K Y-C; Lexington, KY) Reasoning with stratified default theories.  ... 

Paraconsistent Stable Semantics for Extended Disjunctive Programs

1995 Journal of Logic and Computation  
Applications of the paraconsistent semantics for reasoning in inconsistent programs are also presented.  ...  We introduce the paraconsistent minimal and stable model semantics for extended disjunctive programs, which can distinguish inconsistent information from others in a program.  ...  We have also discussed applications of the paraconsistent semantics for reasoning with inconsistency.  ... 
doi:10.1093/logcom/5.3.265 fatcat:anlwztenxndnracmqpj6zx3tdy

A model theory for paraconsistent logic programming [chapter]

Carlos Viegas Damásio, Luís Moniz Pereira
1995 Lecture Notes in Computer Science  
We provide a nine-valued logic to characterize the models of logic programs under a paraconsistent well-founded semantics with explicit negation WFSX p.  ...  Thus, paraconsistent reasoning is an, at least implicit, intermediate step to attain belief revision.  ...  Paraconsistent approach: Accept contradictory information and perform reasoning tasks that take it into account. This is the approach of [4, 19, 22] , and the one we will follow in this paper.  ... 
doi:10.1007/3-540-60428-6_32 fatcat:l37ikqbmmbcvbatsxbtjljwvye

A reasoning method for a paraconsistent logic

Arthur Buchsbaum, Tarcisio Pequeno
1993 Studia Logica: An International Journal for Symbolic Logic  
A proof method aiming to enable automation of reasoning in a paraconsistent logic, the calculus C * 1 of da Costa, is presented. The method is analytical, using a specially designed tableau system.  ...  An example of this kind of rule is default reasoning, a style of reasoning in which a conclusion is taken, when authorized by a "default rule", if its negation cannot be inferred (see Reiter [9] ).  ...  The recognition of the import of paraconsistency for the automatization of reasoning has been our main motivation for the study of proof methods for paraconsistent logics suitable to computer implementation  ... 
doi:10.1007/bf01058392 fatcat:ldd4nbt6vffcdlik4dsuaz4lpq

Page 2195 of Mathematical Reviews Vol. , Issue 2001D [page]

2001 Mathematical Reviews  
Default logic, the logic of McDermott For the web version of Mathematical Reviews, see http: //  ...  Reasoning with actual and potential contradictions, 11-36, Handb. Defeasible Reason. Uncertain. Manag. Syst., 2, Kluwer Acad. Publ., Dordrecht, 1998.  ... 

Incoherency Problems in a Combination of Description Logics and Rules

Shasha Huang, Jing Hao, Dang Luo
2014 Journal of Applied Mathematics  
At last, we investigate the relationship between suspicious semantics and paraconsistent semantics.  ...  A paraconsistent semantics has been presented for hybrid MKNF knowledge bases—a combination method for description logics and rules.  ...  For distinguishing the former reasoning with the later, we use term paracoherent reasoning to denote reasoning with incoherent knowledge bases.  ... 
doi:10.1155/2014/604753 fatcat:ftnv2iwnajefdpq3ff46axjvxu
« Previous Showing results 1 — 15 out of 641 results