Extended full computation-tree logics for paraconsistent model checking

It is known that the full computation-tree logic CTL * is an important base logic for model checking. The bisimulation theorem for CTL* is known to be useful for abstraction in model checking. In this paper, the bisimulation theorems for two paraconsistent four-valued extensions 4CTL* and 4LCTL* of CTL* are shown, and a translation from 4CTL* into CTL* is presented. By using 4CTL* and 4LCTL*, inconsistency-tolerant and spatiotemporal reasoning can be expressed as a model checking framework

Coherent Integration of Databases by Abductive Logic Programming

We introduce an abductive method for a coherent integration of independent data-sources. The idea is to compute a list of data-facts that should be inserted to the amalgamated database or retracted from it in order to restore its consistency. This method is implemented by an abductive solver, called Asystem, that applies SLDNFA-resolution on a meta-theory that relates different, possibly contradicting, input databases. We also give a pure model-theoretic analysis of the possible ways to `recover' consistent data from an inconsistent database in terms of those models of the database that exhibit as minimal inconsistent information as reasonably possible. This allows us to characterize the `recovered databases' in terms of the `preferred' (i.e., most consistent) models of the theory. The outcome is an abductive-based application that is sound and complete with respect to a corresponding model-based, preferential semantics, and -- to the best of our knowledge -- is more expressive (thus more general) than any other implementation of coherent integration of databases

Paraconsistência em lógica híbrida

Mestrado em Matemática e AplicaçõesThe use of hybrid logics allows the description of relational structures, at the same time that allows establishing accessibility relations between states and, furthermore, nominating and making mention to what happens at speci c states. However, the information we collect is subject to inconsistencies, namely, the search for di erent information sources can lead us to pick up contradictions. Nowadays, by having so many means of dissemination available, that happens frequently. The aim of this work is to develop tools capable of dealing with contradictory information that can be described as hybrid logics' formulas. To build models, to compare inconsistency in di erent databases, and to see the applicability of this method in day-to-day life are the basis for the development of this dissertation.O uso de lógicas híbridas permite a descrição de estruturas relacionais, ao mesmo tempo que permite estabelecer relações de acessibilidade entre estados, e, para além disso, nomear e fazer referência ao que acontece em estados específicos. No entanto, a informação que recolhemos está sujeita a inconsistências, isto é, a procura de diferentes fontes de informação pode levar a recolha de contradições. O que nos dias de hoje, com tantos meios de divulgação disponíveis, acontece frequentemente. O objetivo deste trabalho e desenvolver ferramentas capazes de lidar com informação contraditória que possa ser descrita através de fórmulas de lógicas híbridas. Construir modelos e comparar a inconsistência de diferentes bases de dados e ver a aplicabilidade deste método no dia-a-dia são a base para o desenvolvimento desta dissertação

On the Satisfiability of Quasi-Classical Description Logics

Though quasi-classical description logic (QCDL) can tolerate the inconsistency of description logic in reasoning, a knowledge base in QCDL possibly has no model. In this paper, we investigate the satisfiability of QCDL, namely, QC-coherency and QC-consistency and develop a tableau calculus, as a formal proof, to determine whether a knowledge base in QCDL is QC-consistent. To do so, we repair the standard tableau for DL by introducing several new expansion rules and defining a new closeness condition. Finally, we prove that this calculus is sound and complete. Based on this calculus, we implement an OWL paraconsistent reasoner called QC-OWL. Preliminary experiments show that QC-OWL is highly efficient in checking QC-consistency

Deductive Systems in Traditional and Modern Logic

The book provides a contemporary view on different aspects of the deductive systems in various types of logics including term logics, propositional logics, logics of refutation, non-Fregean logics, higher order logics and arithmetic