<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">de Amo, Sandra</style></author><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%">Eiter, Thomas</style></author><author><style face="normal" font="default" size="100%">Schewe, Klaus-Dieter</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A Logical Framework for Integrating Inconsistent Information in Multiple Databases</style></title><secondary-title><style face="normal" font="default" size="100%">Foundations of Information and Knowledge Systems</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/3-540-45758-5_5</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer Berlin Heidelberg</style></publisher><volume><style face="normal" font="default" size="100%">2284</style></volume><pages><style face="normal" font="default" size="100%">67-84</style></pages><isbn><style face="normal" font="default" size="100%">978-3-540-43220-3</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;When integrating data coming from multiple different sources we are faced with the possibility of inconsistency in databases. In this paper, we use one of the paraconsistent logics introduced in [9,7] (&lt;strong&gt;LFI1&lt;/strong&gt;) as a logical framework to model possibly inconsistent database instances obtained by integrating different sources.We propose a method based on the sound and complete tableau proof system of &lt;strong&gt;LFI1&lt;/strong&gt; to treat both the integration process and the evolution of the integrated database submitted to users updates. In order to treat the integrated database evolution, we introduce a kind of generalized database context, the evolutionary databases, which are databases having the capability of storing and manipulating inconsistent information and, at the same time, allowing integrity constraints to change in time. We argue that our approach is sufficiently general and can be applied in most circumstances where inconsistency may arise in databases.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</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></contributors><titles><title><style face="normal" font="default" size="100%">Ex contradictione non sequitur quodlibet</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 2000 Advanced Reasoning Forum Conference</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2001</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;We summarize here the main arguments, basic research lines, and results on the foundations of the logics of formal inconsistency. These involve, in particular, some classes of well-known paraconsistent systems. We also present their semantical interpretations by way of possible-translations semantics and their applications to human reasoning and machine reasoning.&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%">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><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</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><author><style face="normal" font="default" size="100%">Loffredo D'Ottaviano, Itala M.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Carnielli, Walter A.</style></author><author><style face="normal" font="default" size="100%">Coniglio, Marcelo E.</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A taxonomy of C-systems</style></title><secondary-title><style face="normal" font="default" size="100%">Paraconsistency. The Logical Way to the Inconsistent</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%">Marcel Dekker</style></publisher><pub-location><style face="normal" font="default" size="100%">New York</style></pub-location><pages><style face="normal" font="default" size="100%">1-94</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;A thorough investigation of the foundations of paraconsistent logics. Relations between logical principles are formally studied, a novel notion of consistency is introduced, the logics of formal inconsistency, and the subclasses of C-systems and dC-systems are defined and studied. An enormous variety of paraconsistent logics in the literature is shown to constitute C-systems.&lt;/p&gt;</style></abstract></record></records></xml>