Filters








376 Hits in 4.8 sec

PROSE: A Plugin-Based Paraconsistent OWL Reasoner [chapter]

Wenrui Wu, Zhiyong Feng, Xiaowang Zhang, Xin Wang, Guozheng Rao
2016 Lecture Notes in Computer Science  
Quasi-classical semantics is proven to rationally draw more meaningful conclusions even from an inconsistent ontology with the stronger inference power of paraconsistent reasoning.  ...  The study of paraconsistent reasoning with ontologies is especially important for the Semantic Web since knowledge is not always perfect within it.  ...  We gratefully acknowledge Zuoquan Lin, Kewen Wang, Guilin Qi, Yue Ma, and Guohui Xiao for discussions and their critical comments on our previous work of quasi-classical desription logics.  ... 
doi:10.1007/978-3-319-31676-5_18 fatcat:xiqgjfliifdptoaeafm76fy5wq

A Comparison of Paraconsistent Description Logics

Norihiro Kamide
2013 International Journal of Intelligence Science  
It is shown that four existing paraconsistent semantics (i.e., four-valued semantics, quasi-classical semantics, single-interpretation semantics and dual-interpretation semantics) for PDLs are essentially  ...  Paraconsistent (or inconsistency-tolerant) description logics (PDLs) have been studied to cope with inconsistencies which may frequently occur in an open world.  ...  The quasi-classical DLs in [12, 13] , which are based on quasi-classical semantics, have the classical negation.  ... 
doi:10.4236/ijis.2013.32011 fatcat:iuymz6rr3bc7xbjgazglbgutxq

Paraconsistent Resolution for Four-valued Description Logics

Yue Ma, Pascal Hitzler, Zuoquan Lin
2007 International Workshop on Description Logics  
We achieve this in two steps: First we give a simple way to make any ALC based ontology 4-valued satisfiable, and then we study a sound and complete paraconsistent ordered-resolution decision procedure  ...  Our approach can be viewed as a paraconsistent version of KAON2 algorithm.  ...  Resolution-based Reasoning with ALC4 In this section, we basically follow [8, Chapter 4] to study a paraconsistent resolution for ALC4, and indeed we have to assume that the reader is familiar with the  ... 
dblp:conf/dlog/MaHL07 fatcat:lhzvk4fnjnhyxeynzdy2qvpgv4

A Tableau Algorithm for Paraconsistent and Nonmonotonic Reasoning in Description Logic-Based System [chapter]

Xiaowang Zhang, Zuoquan Lin, Kewen Wang
2011 Lecture Notes in Computer Science  
Finally, we develop a sound and complete tableau algorithm for instance checking with the minimally paradoxical semantics.  ...  Moreover, our paraconsistent and nonmonotonic extension not only preserves the syntax of description logic but also maintains the decidability of basic reasoning problems in description logics.  ...  in [17] and with quasi-classical semantics in [18] .  ... 
doi:10.1007/978-3-642-20291-9_36 fatcat:4gkmgkumzbas5cksqaberxbm2y

Page 3183 of Mathematical Reviews Vol. , Issue 2003e [page]

2003 Mathematical Reviews  
This enables us to (1) show that quasi-classical entailment for CNF formulas is ‘only’ coNP-complete, and (2) take advantage of all existing au- tomated reasoning techniques for classical entailment in  ...  Compared with several other paraconsistent logics, it has the nice feature that no special attention needs to be paid to a special form of premises (the connectives behave in a classical manner).  ... 

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

2001 Mathematical Reviews  
Reasoning with actual and potential contradictions, 11-36, Handb. Defeasible Reason. Uncertain. Manag. Syst., 2, Kluwer Acad. Publ., Dordrecht, 1998.  ...  Summary: “A survey of three-valued paraconsistent logics is given in connection with Jaskowski’s criterion for the construction of paraconsistent logics.  ... 

Paraconsistency and analyticity

Carlos A. Oller
2004 Logic and Logical Philosophy  
This paper introduces a system of analytic, paraconsistent and quasi-classical propositional logic that does not validate the paradoxes of Parry's analytic implication.  ...  The interpretation of the expressions of this logic will be given in terms of a four-valued semantics, and its proof theory will be provided by a system of signed semantic tableaux that incorporates the  ...  It shares with Besnard and Hunter's quasi-classical logic the property of keeping the usual interdefinition relations between connectives while achieving paraconsistency by a modification in the characterization  ... 
doi:10.12775/llp.1999.008 fatcat:gdl4fhwa6ncy7n7fkvuiu5ob5i

Model Checking Temporal Aspects of Inconsistent Concurrent Systems Based on Paraconsistent Logic

Donghuo Chen, Jinzhao Wu
2006 Electronical Notes in Theoretical Computer Science  
Classical logic cannot be used to effectively reason about concurrent systems with inconsistencies (inconsistencies often occur, especially in the early stage of the development, when large and complex  ...  In this paper, we propose the use of a paraconsistent temporal logic (QCTL) for supporting the verification of temporal properties of such systems even where the consistent model is not available.  ...  Unfortunately, inconsistency causes problems in reasoning with classical logic.  ... 
doi:10.1016/j.entcs.2006.01.021 fatcat:knv5friyxrdlvgmlr64pkgot7a

Negation-free definitions of paraconsistency [article]

Sankha S. Basu, Sayantan Roy
2021 arXiv   pre-print
In this article, we ask whether a negation operator is essential for describing paraconsistency.  ...  In other words, is it possible to describe a notion of paraconsistency that is independent of connectives?  ...  We end this subsection with a few properties of quasi-negation in case of CPC = L, ⊢ CPC , where ⊢ CPC is the usual classical consequence relation, using the kite of negations in [6] .  ... 
arXiv:2112.00357v1 fatcat:q3daoum6rfae3hyob2exrqdvmq

ForewordDOI: 10.5007/1808-1711.2011v15n1p1

Evandro Agazzi, Ítala M. Loffredo D'Ottaviano, Daniele Mundice
2011 Principia: An International Journal of Epistemology  
It can be shown that the logic of quasi-truth is paraconsistent and such a logic is reduced to classical logic when quasi-truth is identified with truth.  ...  logics, The Journal of Non-Classical Logic, that was merged in 1991 with the Journal of Applied Non-Classical Logics, edited by Hermès/Lavoisier -France.  ... 
doi:10.5007/1808-1711.2011v15n1p1 fatcat:ulzsucte6jaavmbyb5w35qx5kq

The Pac Logic in the properties of C(w) and C(min)

José Arrazola, Eduardo Ariza, Verónica Borja Macías
2008 Latin-American Workshop on Non-Monotonic Reasoning  
In this work we try to answer some questions related to the theory of paraconsistent logics. We study a chain of paraconsistent logics stronger than Cω.  ...  It is built with the same axioms of C n , except 12-n to 15-n. Let us denote by C 0 the classical propositional calculus. Then C n , with 0 ≤ n < ω, is finitely trivializable.  ...  In 1963, da Costa [1] proposed a whole hierarchy of paraconsistent propositional calculi, known as C n , with 1 ≤ n < ω: in this calculi, the principle of noncontradiction must not be a valid schema.  ... 
dblp:conf/lanmr/ArrazolaAM08 fatcat:kxzl5jb36jcnzjvft4gwmqvdxq

Minimally inconsistent reasoning in Semantic Web

Xiaowang Zhang, Georgios V. Gkoutos
2017 PLoS ONE  
Reasoning with inconsistencies is an important issue for Semantic Web as imperfect information is unavoidable in real applications.  ...  In fact, the tableaux algorithm is designed, as a framework for multi-valued DL, to allow for different underlying paraconsistent semantics, with the mere difference in the clash conditions.  ...  The quasi-classical DL in [26, 28, 30] is a major variant of paraconsistent DLs, in which two semantics, namely weak semantics and strong semantics, are introduced to characterize quasi-classical semantics  ... 
doi:10.1371/journal.pone.0181056 pmid:28750030 pmcid:PMC5531629 fatcat:6ayfpnn4g5avtipmlmkua7lyye

A Tableau Algorithm for Handling Inconsistency in OWL [chapter]

Xiaowang Zhang, Guohui Xiao, Zuoquan Lin
2009 Lecture Notes in Computer Science  
We propose a terminable, sound and complete tableau algorithm to implement paraconsistent reasoning in quasi-classical OWL.  ...  In comparison with other approaches to handle inconsistency in OWL, our approach enhances the ability of reasoning by integrating paraconsistent reasoning with important classical inference rules.  ...  T iff A ∪ {a : C T | a occurs in A} is consistent. Quasi-Classical Description Logic ALCN Q Quasi-classical description logic is a development of quasi-classical logic as defined in [15] .  ... 
doi:10.1007/978-3-642-02121-3_31 fatcat:djpwqwwaljcbrjpswomsksahi4

Paraconsistent Reasoning for Semantic Web Agents [chapter]

Linh Anh Nguyen, Andrzej Szałas
2012 Lecture Notes in Computer Science  
We also study the relationship between the semantics and paraconsistent reasoning in SROIQ through a translation into the traditional two-valued semantics.  ...  We introduce a number of paraconsistent semantics for SROIQ, including three-valued and four-valued semantics.  ...  Comparison with Existing Paraconsistent Semantics Here, we restrict only to many-valued semantics and quasi-classical semantics for DLs.  ... 
doi:10.1007/978-3-642-29356-6_2 fatcat:khzvqq4myndf3ga6idjwmsksqq

Three-Valued Paraconsistent Reasoning for Semantic Web Agents [chapter]

Linh Anh Nguyen, Andrzej Szałas
2010 Lecture Notes in Computer Science  
We also study the relationship between the semantics and paraconsistent reasoning in SROIQ through a translation into the traditional two-valued semantics.  ...  We introduce a number of paraconsistent semantics for SROIQ, including three-valued and four-valued semantics.  ...  Comparison with Existing Paraconsistent Semantics Here, we restrict only to many-valued semantics and quasi-classical semantics for DLs.  ... 
doi:10.1007/978-3-642-13480-7_17 fatcat:katq7sbs5be2rne3dsmznasxn4
« Previous Showing results 1 — 15 out of 376 results