Sciweavers

KR
2010
Springer
14 years 4 months ago
Probabilistic Description Logics for Subjective Uncertainty
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...
Carsten Lutz, Lutz Schröder
KR
2010
Springer
14 years 4 months ago
Towards Fixed-Parameter Tractable Algorithms for Argumentation
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...
Wolfgang Dvorák, Reinhard Pichler, Stefan W...
KR
2010
Springer
14 years 4 months ago
A Decidable Class of Groundable Formulas in the General Theory of Stable Models
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 ...
Michael Bartholomew, Joohyung Lee
KR
2010
Springer
14 years 4 months ago
Understanding Ontological Levels
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...
Claudio Masolo
KR
2010
Springer
14 years 4 months ago
Finding the Next Solution in Constraint- and Preference-Based Knowledge Representation Formalisms
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...
Ronen I. Brafman, Francesca Rossi, Domenico Salvag...
KR
2010
Springer
14 years 4 months ago
Set-Oriented Logical Connectives: Syntax and Semantics
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...
Stuart C. Shapiro
KR
2010
Springer
14 years 4 months ago
Maximally Paraconsistent Three-Valued Logics
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...
Ofer Arieli, Arnon Avron, Anna Zamansky
KR
2010
Springer
14 years 4 months ago
Generalized Planning with Loops under Strong Fairness Constraints
Giuseppe De Giacomo, Fabio Patrizi, Sebastian Sard...
KR
2010
Springer
14 years 4 months ago
Decomposing Description Logic Ontologies
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 ...
Boris Konev, Carsten Lutz, Denis Ponomaryov, Frank...