• Non-deterministic semantics fo...

Treffer: Non-deterministic semantics for logics with a consistency operator

Title:
Non-deterministic semantics for logics with a consistency operator
Authors:
AVRON, Arnon
Source:
Eighth European conference on symbolic and quantitative approaches to reasoning with uncertainty (ECSQARU 2005)International journal of approximate reasoning. 45(2):271-287
Publisher Information:
Amsterdam: Elsevier, 2007.
Publication Year:
2007
Physical Description:
print, 18 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Intelligence artificielle, Artificial intelligence, Apprentissage et systèmes adaptatifs, Learning and adaptive systems, Approche probabiliste, Probabilistic approach, Enfoque probabilista, Intelligence artificielle, Artificial intelligence, Inteligencia artificial, Logique formelle, Formal logic, Lógica formal, Logique paraconsistante, Paraconsistent logic, Lógica paraconsistente, Non déterminisme, Non determinism, No determinismo, Prise décision, Decision making, Toma decision, Système infini, Infinite system, Sistema infinito, Système non déterministe, Non deterministic system, Sistema no determinista, Sémantique, Semantics, Semántica
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
School of Computer Science, Tel-Aviv University, 69978 Tel-Aviv, Israel
ISSN:
0888-613X
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=18923638
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.18923638
Database:
PASCAL Archive

Weitere Informationen

In order to handle inconsistent knowledge bases in a reasonable way, one needs a logic which allows nontrivial inconsistent theories. Logics of this sort are called paraconsistent. 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 in a modular way simple non-deterministic semantics for 64 of the most important logics from this family. Our semantics is three-valued for some of the systems, and infinite-valued for the others. We prove that these results cannot be improved: neither of the systems with a three-valued non-deterministic semantics has either a finite characteristic ordinary matrix or a two-valued characteristic non-deterministic matrix, and neither of the other systems we investigate has a finite characteristic non-deterministic matrix. Still, our semantics provides decision procedures for all the systems investigated, as well as easy proofs of important proof-theoretical properties of them.