Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
FSS
2006
88views more  FSS 2006»
10 years 12 months ago
T-norm-based logics with an independent involutive negation
In this paper we investigate the addition of arbitrary independent involutive negations to t-norm based logics. We deal with several extensions of MTL and establish general comple...
Tommaso Flaminio, Enrico Marchioni
IJAR
2008
108views more  IJAR 2008»
10 years 12 months ago
Extending uncertainty formalisms to linear constraints and other complex formalisms
Linear constraints occur naturally in many reasoning problems and the information that they represent is often uncertain. There is a difficulty in applying AI uncertainty formalis...
Nic Wilson
IANDC
2008
122views more  IANDC 2008»
11 years 12 hour ago
Automata can show PSpace results for description logics
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
Franz Baader, Jan Hladik, Rafael Peñaloza
AML
2006
87views more  AML 2006»
11 years 21 hour ago
On the rules of intermediate logics
If the Visser rules are admissible for an intermediate logic, they form a basis for the admissible rules of the logic. How to characterize the admissible rules of intermediate log...
Rosalie Iemhoff
AMAI
2006
Springer
11 years 23 hour ago
On a rule-based interpretation of default conditionals
In nonmonotonic reasoning, a default conditional has most often been informally interpreted as a defeasible version of a classical conditional, usually the material conditional...
James P. Delgrande
ENTCS
2010
96views more  ENTCS 2010»
11 years 1 days ago
Optimizing Conditional Logic Reasoning within CoLoSS
The generic modal reasoner CoLoSS covers a wide variety of logics ranging from graded and probabilistic modal logic to coalition logic and conditional logics, being based on a bro...
Daniel Hausmann, Lutz Schröder
CORR
2010
Springer
98views Education» more  CORR 2010»
11 years 1 days ago
Extended Computation Tree Logic
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
Roland Axelsson, Matthew Hague, Stephan Kreutzer, ...
APAL
2008
88views more  APAL 2008»
11 years 2 days ago
Stochastic coalgebraic logic: Bisimilarity and behavioral equivalence
Bisimulations, behavioral equivalence and logical equivalence are investigated for stochastic T-coalgebras that interpret coalgebraic logic which is defined in terms of predicate ...
Ernst-Erich Doberkat
APAL
2010
97views more  APAL 2010»
11 years 2 days ago
A modal logic framework for reasoning about comparative distances and topology
We propose and investigate a uniform modal logic framework for reasoning about topology and relative distance in metric and more general distance spaces, thus enabling the compari...
Mikhail Sheremet, Frank Wolter, Michael Zakharyasc...
AML
2010
96views more  AML 2010»
11 years 2 days ago
Implicational (semilinear) logics I: a new hierarchy
In Abstract Algebraic Logic, the general study of propositional non-classical logics has been traditionally based on the abstraction of the Lindenbaum-Tarski process. In this proce...
Petr Cintula, Carles Noguera
books