Results 1 -
9 of
9
Many-valued non-deterministic semantics for first-order logics of formal inconsistency
- Algebraic and Proof-Theoretic Aspects of Non-classical Logics, LNCS 4460
, 2007
"... Abstract. A paraconsistent logic is a logic which allows non-trivial in-consistent theories. One of the oldest and best known approaches to the problem of designing useful paraconsistent logics is da Costa’s approach, which seeks to allow the use of classical logic whenever it is safe to do so, but ..."
Abstract
-
Cited by 8 (7 self)
- Add to MetaCart
(Show Context)
Abstract. A paraconsistent logic is a logic which allows non-trivial in-consistent theories. One of the oldest and best known approaches to the problem of designing useful paraconsistent logics is da Costa’s approach, which seeks to allow the use of classical logic whenever it is safe to do so, but behaves completely differently when contradictions are involved. da Costa’s approach has led to the family of Logics of Formal (In)consistency (LFIs). In this paper we provide non-deterministic semantics for a very large family of first-order LFIs (which includes da Costa’s original system C∗1, as well as thousands of other logics). We show that our semantics is effective and modular, and we use this effectiveness to derive some important properties of logics in this family. 1
Maximal and premaximal paraconsistency in the framework of three-valued semantics
- STUDIA LOGICA,
, 2011
"... Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain from classical logic as much as possible. In this paper we introduce the strongest possible notion of maximal paraconsistency, and investigate it in the c ..."
Abstract
-
Cited by 4 (2 self)
- Add to MetaCart
Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain from classical logic as much as possible. In this paper we introduce the strongest possible notion of maximal paraconsistency, and investigate it in the context of logics that are based on deterministic or non-deterministic three-valued matrices. We show that all reasonable paraconsistent logics based on three-valued deterministic matrices are maximal in our strong sense. This applies to practically all three-valued paraconsistent logics that have been considered in the literature, including a large family of logics which were developed by da Costa’s school. Then we show that in contrast, paraconsistent logics based on three-valued properly non-deterministic matrices are not maximal, except for a few special cases (which are fully characterized). However, these non-deterministic matrices are useful for representing in a clear and concise way the vast variety of the (deterministic) three-valued maximally paraconsistent matrices. The corresponding weaker notion of maximality, called premaximal paraconsistency, captures the “core ” of maximal paraconsistency of all possible paraconsistent determinizations of a nondeterministic matrix, thus representing what is really essential for their maximal paraconsistency.
Cut-free Sequent Calculi for C-systems with Generalized Finite-valued Semantics
"... In [5], a general method was developed for generating cut-free ordinary sequent calculi for logics that can be characterized by finite-valued semantics based on non-deterministic matrices (Nmatrices). In this paper, a substantial step towards automation of paraconsistent reasoning is made by applyin ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
(Show Context)
In [5], a general method was developed for generating cut-free ordinary sequent calculi for logics that can be characterized by finite-valued semantics based on non-deterministic matrices (Nmatrices). In this paper, a substantial step towards automation of paraconsistent reasoning is made by applying that method to a certain crucial family of thousands of paraconsistent logics, all belonging to the class of C-systems. For that family, the method produces in a modular way uniform Gentzen-type rules corresponding to a variety of axioms considered in the literature. 1
Checking Violation Tolerance of Approaches to Database Integrity
"... Abstract. A hitherto unquestioned assumption made by all methods for integrity checking has been that the database satisfies its constraints before each update. This consistency assumption has been exploited for improving the efficiency of determining whether integrity is satisfied or violated after ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract. A hitherto unquestioned assumption made by all methods for integrity checking has been that the database satisfies its constraints before each update. This consistency assumption has been exploited for improving the efficiency of determining whether integrity is satisfied or violated after the update. Based on a notion of violation tolerance, we present and discuss an abstract property which, for any given approach to integrity checking, is an easy, sufficient condition to check whether the consistency assumption can be abandoned without sacrificing usability and efficiency of the approach. We demonstrate the usefulness of our definitions by showing that the theorem-proving approach to database integrity by Sadri and Kowalski, as well as several other well-known methods, can indeed afford to abandon the consistency assumption without losing their efficiency, while their applicability is vastly increased. 1
Trying to Cater for Replication Consistency and Integrity of Highly Available Data ∗ J.E. Armendáriz-Iñigo, J.R. Juárez-Rodríguez
"... Availability of databases benefits from distributed replication. Each application and user require different degrees of data availability, consistency and integrity. The latter are perceived as competing objectives that need to be reconciled by appropriate replication strategies. We outline work in ..."
Abstract
- Add to MetaCart
(Show Context)
Availability of databases benefits from distributed replication. Each application and user require different degrees of data availability, consistency and integrity. The latter are perceived as competing objectives that need to be reconciled by appropriate replication strategies. We outline work in progress on a replication middleware architecture for distributed databases. It simultaneously maintains several protocols, so that it can be reconfigured on the fly to the actual needs of availability, consistency and integrity of possibly simultaneous applications and users. 1
A Semiotics Approach of Abduction Ontology Query
"... Abstract. Very important functionalities of ontology management system including ontology mapping, ontology learning, debugging reasoning with inconsistent ontologies, and (structured and unstructured) query answering are important research challenge. Our scenarios is based on semiotic fundamentals ..."
Abstract
- Add to MetaCart
Abstract. Very important functionalities of ontology management system including ontology mapping, ontology learning, debugging reasoning with inconsistent ontologies, and (structured and unstructured) query answering are important research challenge. Our scenarios is based on semiotic fundamentals of abduction and abduction as computation applied to ontology query.
Toward Reconciling Availability, Consistency and Integrity in Replicated Information Systems∗
"... The availability of information systems bene-fits from distributed replication. Different appli-cations and users require different degrees of data availability, consistency and integrity. The latter are perceived as competing objectives that need to be reconciled by appropriate replication strategi ..."
Abstract
- Add to MetaCart
(Show Context)
The availability of information systems bene-fits from distributed replication. Different appli-cations and users require different degrees of data availability, consistency and integrity. The latter are perceived as competing objectives that need to be reconciled by appropriate replication strategies. We outline work in progress on a replication ar-chitecture for distributed information systems. It simultaneously maintains several protocols, so that it can be re-configured on the fly to the actual needs of availability, consistency and integrity of possibly simultaneous applications and users. 1
Query Processing in Paraconsistent Databases in the Presence of Integrity Constraints
"... In this paper, we present an approach to query process-ing for paraconsistent databases in the presence of integrity constraints. Paraconsistent databases are capable of repre-senting positive as well as negative facts and typically oper-ate under the open world assumption. It is easily observed tha ..."
Abstract
- Add to MetaCart
(Show Context)
In this paper, we present an approach to query process-ing for paraconsistent databases in the presence of integrity constraints. Paraconsistent databases are capable of repre-senting positive as well as negative facts and typically oper-ate under the open world assumption. It is easily observed that integrity constraints are usually statements about nega-tive facts and as a result paraconsistent databases are suit-able as a representation mechanism for such information. We use set-valued attributes to code large number of reg-ular tuples into one extended tuple (with set-valued com-ponents). We define an extended relational model and al-gebra capable of representing and querying paraconsistent databases in the presence of integrity constraints. The ex-tended algebra is used as the basis for query processing in such databases. 1
An Erotetic Logic Approach of Ontology Query
"... Abstract. In this paper we develop a method for integration knowledge base and it’s query at the level of representation language. We mention that the answers are returned in same language. The query is obtained through erotetic component of the language. ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract. In this paper we develop a method for integration knowledge base and it’s query at the level of representation language. We mention that the answers are returned in same language. The query is obtained through erotetic component of the language.