KR
2010
Springer
13 years 9 months ago
2010
Springer
We propose a new family of probabilistic description logics (DLs) that, in contrast to most existing approaches, are derived in a principled way from Halpern’s probabilistic fi...
KR
2010
Springer
13 years 9 months ago
2010
Springer
KR
2010
Springer
13 years 9 months ago
2010
Springer
Abstract argumentation frameworks have received a lot of interest in recent years. Most computational problems in this area are intractable but several tractable fragments have be...
KR
2010
Springer
13 years 9 months ago
2010
Springer
We present a decidable class of first-order formulas in the general theory of stable models that can be instantiated even in the presence of function constants. The notion of an ...
KR
2010
Springer
13 years 9 months ago
2010
Springer
In this paper, I defend a multiplicative approach that distinguishes statues from amounts of matter, political entities from physical ones, qua entities (e.g. John qua Alitalia pa...
KR
2010
Springer
13 years 9 months ago
2010
Springer
In constraint or preference reasoning, a typical task is to compute a solution, or an optimal solution. However, when one has already a solution, it may be important to produce th...
KR
2010
Springer
13 years 9 months ago
2010
Springer
Of the common commutative binary logical connectives, only and and or may be used as operators that take arbitrary numbers of arguments with order and multiplicity being irrelevan...
KR
2010
Springer
13 years 9 months ago
2010
Springer
Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain from classical logic as much as p...
KR
2010
Springer
13 years 9 months ago
2010
Springer
KR
2010
Springer
13 years 9 months ago
2010
Springer
Recent years have seen the advent of large and complex ontologies, most notably in the medical domain. As a consequence, structuring mechanisms for ontologies are nowadays viewed ...