Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
JELIA
2010
Springer
10 years 9 months ago
Rational Closure for Defeasible Description Logics
In the field of non-monotonic logics, the notion of rational closure is acknowledged as a landmark, and we are going to see that such a construction can be characterised by means o...
Giovanni Casini, Umberto Straccia
DLOG
2010
10 years 9 months ago
Structure Preserving TBox Repair using Defaults
Unsatisfiable concepts are a major cause for inconsistencies in Description Logics knowledge bases. Popular methods for repairing such concepts aim to remove or rewrite axioms to r...
Thomas Scharrenbach, Rolf Grütter, Bettina Wa...
LICS
2010
IEEE
10 years 10 months ago
On Strong Maximality of Paraconsistent Finite-Valued Logics
Abstract—Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain as much as possible fro...
Arnon Avron, Ofer Arieli, Anna Zamansky
JCSS
2010
69views more  JCSS 2010»
10 years 10 months ago
On the formal semantics of IF-like logics
In classical logics, the meaning of a formula is invariant with respect to the renaming of bound variables. This property, normally taken for granted, has been shown not to hold in...
Santiago Figueira, Daniel Gorín, Rafael Gri...
JACM
2010
137views more  JACM 2010»
10 years 10 months ago
Reconciling description logics and rules
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
Boris Motik, Riccardo Rosati
IANDC
2010
102views more  IANDC 2010»
10 years 10 months ago
Presenting functors on many-sorted varieties and applications
This paper studies several applications of the notion of a presentation of a functor by operations and equations. We show that the technically straightforward generalisation of th...
Alexander Kurz, Daniela Petrisan
IANDC
2010
119views more  IANDC 2010»
10 years 10 months ago
Cut elimination in coalgebraic logics
We give two generic proofs for cut elimination in propositional modal logics, interpreted over coalgebras. We first investigate semantic coherence conditions between the axiomati...
Dirk Pattinson, Lutz Schröder
FSS
2010
119views more  FSS 2010»
10 years 10 months ago
Algebraic and proof-theoretic characterizations of truth stressers for MTL and its extensions
Extensions of monoidal t-norm logic MTL and related fuzzy logics with truth stresser modalities such as globalization and “very true” are presented here both algebraically in ...
Agata Ciabattoni, George Metcalfe, Franco Montagna
SLOGICA
2002
74views more  SLOGICA 2002»
10 years 11 months ago
Transfers between Logics and their Applications
In this paper, logics are conceived as two-sorted first-order structures, and we argue that this broad definition encompasses a wide class of logics with theoretical interest as w...
Marcelo E. Coniglio, Walter Alexandre Carnielli
JSYML
2002
81views more  JSYML 2002»
10 years 11 months ago
Modulated Fibring and The Collapsing Problem
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 t...
Cristina Sernadas, João Rasga, Walter Alexa...
books