Results 231 to 240 of about 4,114 (268)
Some of the next articles are maybe not open access.
Description Logics for Documentation
2016Much of the activity in a digital library revolves around collecting, organizing and publishing knowledge about the resources of the library, in the form of metadata records. In order to document such activity, digital librarians need to express knowledge about the metadata records they produce.
openaire +3 more sources
Learnability of description logics
Proceedings of the fifth annual workshop on Computational learning theory, 1992This paper considers the learnability of subsets of first-order logic. Piror work has established two boundaries of learnability: Haussler [1989] has shown that conjunctions in first-order logic cannot be learned in the Valiant model, even if the form of the conjunction is highly restricted; on the other hand, Valiant [1984] has shown that ...
William W. Cohen, Haym Hirsh
openaire +1 more source
2008
We introduce description logic (DL) rules as a new rule-based formalism for knowledge representation in DLs. As a fragment of the Semantic Web Rule Language SWRL, DL rules allow for a tight integration with DL knowledge bases. In contrast to SWRL, however, the combination of DL rules with expressive description logics remains decidable, and we show ...
Markus Krötzsch +2 more
openaire +3 more sources
We introduce description logic (DL) rules as a new rule-based formalism for knowledge representation in DLs. As a fragment of the Semantic Web Rule Language SWRL, DL rules allow for a tight integration with DL knowledge bases. In contrast to SWRL, however, the combination of DL rules with expressive description logics remains decidable, and we show ...
Markus Krötzsch +2 more
openaire +3 more sources
Parallelizing description logics
1995Description Logics (DL), one of the major paradigms in Knowledge Representation, face efficiency problems due to large-scale applications, expressive dialects, or complete inference algorithms. In this paper we investigate the potential of parallelizing DL algorithms to meet this challenge.
Frank W. Bergmann, J. Joachim Quantz
openaire +1 more source
2008
Description Logics (DLs) are knowledge representation languages, particularly suited to specify formal ontologies. DLs have been studied extensively over the last two decades. Fuzzy Description Logics (FDLs) incorporate vague concepts modeling them as fuzzy sets.
Àngel García-Cerdaña, Francesc Esteva
openaire +1 more source
Description Logics (DLs) are knowledge representation languages, particularly suited to specify formal ontologies. DLs have been studied extensively over the last two decades. Fuzzy Description Logics (FDLs) incorporate vague concepts modeling them as fuzzy sets.
Àngel García-Cerdaña, Francesc Esteva
openaire +1 more source
A logical calculus with descriptions
Journal of Philosophical Logic, 1974is well-formed but not derivable though it is an instance of the tertium non datur. This fact suggests to attempt a similar treatment of descriptions: formulas which contain terms like zx(A (x) A ~A (x)) are considered as wff but the tertium non datur does not hold generally for such formulas.
openaire +2 more sources
Pinpointing in the Description Logic EL. [PDF]
, 2007 Axiom pinpointing has been introduced in description logics (DLs) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base that have the consequence in question. Until now, the pinpointing approach has only been applied to the DL ALC and some of its extensions.
Baader, F +2 more
openaire +2 more sources
Autoepistemic Description Logics. [PDF]
, 1997 We present Autoepistemic Description Logics (ADLs), in which the language of Description Logics is augmented with modal operators interpreted according to the nonmonotonic logic MKNF. We provide decision procedures for query answering in two very expressive ADLs.
F. M. Donini +2 more
openaire +1 more source
A Logical Semantics for Description Logic Programs
2010We present a new semantics for Description Logic programs [1] (dl-programs) that combine reasoning about ontologies in description logics with non-monotonic rules interpreted under answer set semantics. Our semantics is equivalent to that of [1], but is more logical in style, being based on the logic QHT of quantified here-and-there that provides a ...
Michael Fink 0001, David Pearce 0001
openaire +1 more source
Autoepistemic Description Logics.
AI Commun., 1998A non-first-order extension of description logics (DL) which is able to both formalize the nonmonotonic features of knowledge representation (KR) systems, and to provide a computational characterization of reasoning in such a setting, is defined.
openaire +2 more sources