Walter A. Carnielli

Prof. Walter A. Carnielli

University of Campinas
+1

Research Focus & Metrics

Academic Career Length

36Years (1991-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 September 2011 in Journal of Logic and Computation
Verified
Journal Article
Closed access
PDF file
MCMartin W. A. Caminada
Martin W. A. Caminada
Walter A. CarnielliWalter A. Carnielli
Walter A. Carnielli
PDPaul E. Dunne
Paul E. Dunne
In this article, we examine an argument-based semantics called semi-stable semantics. Semi-stable semantics is quite close to traditional stable semantics in the sense that every stable extension is also a semi-stable extension. One of the advantages of semi-stable semantics is that for finite argumentation frameworks there always exists at least one semi-stable extension. Furthermore, if there also exists at least one stable extension, then the semi-stable extensions coincide with the stable extensions. Semi-stable semantics can be seen as a general approach that can be applied to abstract argumentation, as well as to fields like default logic and answer set programming, yielding an interpretation with properties very similar to those of paraconsistent logic, including the properties of crash resistance and backward compatibility.

23 November 2017 in Synthese
Verified
Journal Article
Closed access
PDF file
Walter A. CarnielliWalter A. Carnielli
Walter A. Carnielli
Abilio Rodrigues FilhoAbilio Rodrigues Filho
Abilio Rodrigues Filho

6 March 2020 in Synthese
Verified
Journal Article
Closed access
PDF file
Abilio Rodrigues FilhoAbilio Rodrigues Filho
Abilio Rodrigues Filho
JBJuliana Bueno-Soler
Juliana Bueno-Soler
Walter A. CarnielliWalter A. Carnielli
Walter A. Carnielli

1 December 2002 in The Journal of Symbolic Logic
Verified
Journal Article
Closed access
PDF file
Cristina SernadasCristina Sernadas
Cristina Sernadas
João RasgaJoão Rasga
João Rasga
Walter A. CarnielliWalter A. Carnielli
Walter A. Carnielli
Fibring is recognized as one of the main mechanisms in combining logics, with great significance in the theory and applications of mathematical logic. However, an open challenge to fibring is posed by the collapsing problem: even when no symbols are shared, certain combinations of logics simply collapse to one of them, indicating that fibring imposes unwanted interconnections between the given logics. Modulated fibring allows a finer control of the combination, solving the collapsing problem both at the semantic and deductive levels. Main properties like soundness and completeness are shown to be preserved, comparison with fibring is discussed, and some important classes of examples are analyzed with respect to the collapsing problem.

21 April 2009 in Logica Universalis
Verified
Journal Article
Closed access
PDF file
Walter A. CarnielliWalter A. Carnielli
Walter A. Carnielli
Marcelo Esteban ConiglioMarcelo Esteban Coniglio
Marcelo Esteban Coniglio
IDItala M. L. D’oTtaviano
Itala M. L. D’oTtaviano

7 September 2016 in Entropy
Verified
Journal Article
Open access
PDF file
JBJuliana Bueno-Soler
Juliana Bueno-Soler
Walter A. CarnielliWalter A. Carnielli
Walter A. Carnielli
This paper represents the first steps towards constructing a paraconsistent theory of probability based on the Logics of Formal Inconsistency (LFIs). We show that LFIs encode very naturally an extension of the notion of probability able to express sophisticated probabilistic reasoning under contradictions employing appropriate notions of conditional probability and paraconsistent updating, via a version of Bayes’ theorem for conditionalization. We argue that the dissimilarity between the notions of inconsistency and contradiction, one of the pillars of LFIs, plays a central role in our extended notion of probability. Some critical historical and conceptual points about probability theory are also reviewed.