Sciweavers

TOCL
2008
128views more  TOCL 2008»
13 years 4 months ago
A comprehensive combination framework
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...
Silvio Ghilardi, Enrica Nicolini, Daniele Zucchell...
JANCL
2007
74views more  JANCL 2007»
13 years 4 months ago
Operations on proofs and labels
Logic of proofs LP introduced by S. Artemov in 1995 describes properties of proof predicate “t is a proof of F” in the propositional language extended by atoms of the form [[t...
Tatiana Yavorskaya, Natalia Rubtsova
JANCL
2007
86views more  JANCL 2007»
13 years 4 months ago
Dynamic logics of the region-based theory of discrete spaces
The aim of this paper is to give new kinds of modal logics suitable for reasoning about regions in discrete spaces. We call them dynamic logics of the region-based theory of discr...
Philippe Balbiani, Tinko Tinchev, Dimiter Vakarelo...
AML
2005
91views more  AML 2005»
13 years 4 months ago
A proof-theoretical investigation of global intuitionistic (fuzzy) logic
We perform a proof-theoretical investigation of two modal predicate logics: global intuitionistic logic GI and global intuitionistic fuzzy logic GIF. These logics were introduced b...
Agata Ciabattoni
SLOGICA
2008
116views more  SLOGICA 2008»
13 years 4 months ago
Rough Sets and 3-Valued Logics
In the paper we explore the idea of describing Pawlak's rough sets using three-valued logic, whereby the value t corresponds to the positive region of a set, the value f -- to...
Arnon Avron, Beata Konikowska
AI
2005
Springer
13 years 4 months ago
On the logic of cooperation and propositional control
Cooperation logics have recently begun to attract attention within the multi-agent systems community. Using a cooperation logic, it is possible to represent and reason about the s...
Wiebe van der Hoek, Michael Wooldridge
IJAR
2007
86views more  IJAR 2007»
13 years 4 months ago
Non-deterministic semantics for logics with a consistency operator
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...
Arnon Avron
IGPL
2007
75views more  IGPL 2007»
13 years 4 months ago
Fibring in the Leibniz Hierarchy
This article studies preservation of certain algebraic properties of propositional logics when combined by fibring. The logics analyzed here are classified in protoalgebraic, eq...
Víctor L. Fernández, Marcelo E. Coni...
IANDC
2007
132views more  IANDC 2007»
13 years 4 months ago
An automata-theoretic approach to constraint LTL
We consider an extension of linear-time temporal logic (LTL) with constraints interpreted over a concrete domain. We use a new automata-theoretic technique to show pspace decidabi...
Stéphane Demri, Deepak D'Souza
IANDC
2007
111views more  IANDC 2007»
13 years 4 months ago
Expressiveness and complexity of graph logic
We investigate the complexity and expressive power of a spatial logic for reasoning about graphs. This logic was previously introduced by Cardelli, Gardner and Ghelli, and provide...
Anuj Dawar, Philippa Gardner, Giorgio Ghelli