63 search results - page 4 / 13 » Distance-based paraconsistent logics |
LOGCOM
2010
13 years 23 days ago
2010
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
EPIA
1995
Springer
13 years 9 months ago
1995
Springer
We provide a nine-valued logic to characterize the models of logic programs under a paraconsistent well-founded semantics with explicit negation WFSX p. We define a truth-function...
DLOG
2007
13 years 8 months ago
2007
Abstract. In this paper, we propose an approach to translating any ALC ontology (possible inconsistent) into a logically consistent set of disjunctive datalog rules. We achieve thi...
CORR
2011
Springer
13 years 29 days ago
2011
Springer
In [1], systems of weakening of intuitionistic negation logic called Zn and CZn were developed in the spirit of da Costa’s approach(c.f. [2]) by preserving, differently from da C...
JOLLI
2008
13 years 6 months ago
2008
In this paper, consistency is understood in the standard way, i.e. as the absence of a contradiction. The basic constructive logic BK c4 , which is adequate to this sense of consis...