Sciweavers

1462 search results - page 6 / 293
» Autoepistemic Description Logics
Sort
View
AAAI
2008
15 years 7 days ago
Hyperequivalence of Logic Programs with Respect to Supported Models
Recent research in nonmonotonic logic programming has focused on program equivalence relevant for program optimization and modular programming. So far, most results concern the st...
Miroslaw Truszczynski, Stefan Woltran
KR
2000
Springer
15 years 1 months ago
Finding Admissible and Preferred Arguments Can be Very Hard
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
DLOG
2009
14 years 7 months ago
On Correspondences between Probabilistic First-Order and Description Logics
Abstract This paper analyzes the probabilistic description logic PSHIQ by looking at it as a fragment of probabilistic first-order logic with semantics based on possible worlds. We...
Pavel Klinov, Bijan Parsia, Ulrike Sattler
CORR
2010
Springer
162views Education» more  CORR 2010»
14 years 6 months ago
First steps in the logic-based assessment of post-composed phenotypic descriptions
In this paper we present a preliminary logic-based evaluation of the integration of post-composed phenotypic descriptions with domain ontologies. The evaluation has been performed ...
Ernesto Jiménez-Ruiz, Bernardo Cuenca Grau,...
DLOG
2009
14 years 7 months ago
A Tableaux-based Method for Computing Least Common Subsumers for Expressive Description Logics
Least Common Subsumers (LCS) have been proposed in Description Logics (DL) to capture the commonalities between two or more concepts.
Francesco M. Donini, Simona Colucci, Tommaso Di No...