Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where inconsistency does not lead to such an explosion, and since in practice consistency is difficult to achieve there are many potential applications of paraconsistent logics in query answering systems. We compare the paraconsistent and the non-monotonic solution...

Annotated Logics are a category of non-classical logics that have recently appeared from historical point view. They type paraconsistent, paracomplete and non-alethic logic. With the rapid development AI Automation Robotics, more theory techniques were coined to support various issues themes presenting. This expository work explores how deal directly with conflicts (contradictions) paracomplete...

At the beginning of section 2, there is a conflation of different concepts of possibility. If we grant that imaginability is conceivability (in the sense of being describable without any logical contradictions), if we pass over “practical” possibility as a non-defined term, and grant that by “physically” possible Zahavi very likely means “nomologically” possible, it still would present a major ...

The problem of revising an ontology consistently is closely related to the problem of belief revision which has been widely discussed in the literature. Some syntax-based belief revision operators have been adapted to revise ontologies in Description Logics (DLs). However, these operators remove the whole axioms to resolve logical contradictions and thus are not fine-grained. In this paper, we ...

In spite of sequent calculus being an appealing tool for describing logical systems, its use along with nonmonotonic logics has been largely neglected. Reasons may be the hardness in implementing a context sensitive mechanism able to detect changes in the theory. This seems to brake the locality of context of sequent rules. Nevertheless, a nonmo-notonic sequent calculus may be helpful if result...

In most expert systems, efforts are made to keep the rules in the knowledge base free from contradictions., because a logical system that generates even a single contradiction may collapse. We argue that not only can contradictions be tolerated, but in fact they are useful. An excellent test of an argument is to compare it with the best argument for the opposing view. Accordingly, we propose a ...

A classical system of mathematics is homogenous without contradictions. But it is a little ambiguous for modern mathematics, for instance, the Smarandache geometry. Let F be a family of things such as those of particles or organizations. Then, how to hold its global behaviors or true face? Generally, F is not a mathematical system in usual unless a set, i.e., a system with contradictions. There...

the revival of aquinas's philosophical and theological thought in modern age has been one of the mental disturbances of thinkers that found aquinas's ideas the best guide for resolving the modern philosophical and theological problems. this attitude to aquinas's ideas, that known as thomism, in 20th century by raising the analytical thomism resulted in a new age of thomism. analy...

Abstract. When implementing the DSmT, a difficulty may arise from the possible huge dimension of hyperpower sets, which are indeed free structures. However, it is possible to reduce the dimension of these structures by involving logical constraints. In this paper, the logical constraints will be related to a predefined order over the logical propositions. The use of such orders and their result...