<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Caleiro, Carlos</style></author><author><style face="normal" font="default" size="100%">Marcos, João</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Arabnia, Hamid R.</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Non-truth-functional fibred semantics</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the International Conference on Artificial Intelligence (IC-AI'2001)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2001</style></year></dates><publisher><style face="normal" font="default" size="100%">CSREA Press</style></publisher><volume><style face="normal" font="default" size="100%">2</style></volume><pages><style face="normal" font="default" size="100%">841–847</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Until recently, truth-functionality has been considered essential to the mechanism for combining logics known as fibring. Following the first efforts towards extending fibred semantics to logics with nontruth- functional operators, this paper aims to clarify the subject at the light of ideas borrowed from the theory of general logics as institutions and the novel notion of non-truth-functional room. Besides introducing the relevant concepts and constructions, the paper presents a detailed worked example combining classical first-order logic with the paraconsistent propositional system C&lt;sub&gt;1&lt;/sub&gt;, for which a meaningful semantics is obtained. The possibility of extending this technique to build rst-order versions of further logics of formal inconsistency is also discussed.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Carnielli, Walter A.</style></author><author><style face="normal" font="default" size="100%">Marcos, João</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Arabnia, Hamid R.</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Tableau systems for logics of formal inconsistency</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the International Conference on Artificial Intelligence (IC-AI'2001)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2001</style></year></dates><publisher><style face="normal" font="default" size="100%">{CSREA} Press, Athens {GA}, {USA}</style></publisher><pages><style face="normal" font="default" size="100%">848-852</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The logics of formal inconsistency (&lt;strong&gt;LFI&lt;/strong&gt;s) are logics that allow to explicitly formalize the concepts of consistency and inconsistency by means of formulas of their language. Contradictoriness, on the other hand, can always be expressed in any logic, provided its language includes a symbol for negation. Besides being able to represent the distinction between contradiction and inconsistency, &lt;strong&gt;LFI&lt;/strong&gt;s are non-explosive logics, in the sense that a contradiction does not entail arbitrary statements, but yet are gently explosive, in the sense that, adjoining the additional requirement of consistency, then contradictoriness do cause explosion. Several logics can be seen as &lt;strong&gt;LFI&lt;/strong&gt;s, among them the great majority of paraconsistent systems developed under the Brazilian and Polish tradition. We present here tableau systems for some important LFIs: &lt;strong&gt;bC, Ci&lt;/strong&gt; and &lt;strong&gt;LFI1&lt;/strong&gt;.&lt;/p&gt;</style></abstract></record></records></xml>