Results 321 to 330 of about 3,682,520 (371)
Some of the next articles are maybe not open access.
Description Logic, Theory Combination, and All That
Lecture Notes in Computer Science, 2019One of the main reasons to employ a description logic such as EL or EL++ is the fact that it has efficient, polynomial-time algorithmic properties such as deciding consistency and inferring subsumption.
M. Finger
semanticscholar +1 more source
Descriptions in mathematical logic
Studia Logica, 1984If A(x) is a predicate satisfied by exactly one x, then we write Ix.A(x) for that object x. The operator I is called a descriptor. The author reviews the various treatments of descriptors in the literature, pointing out that the problem each treatment faces is ''what to do with Ix.A(x) when \(\exists !xA(x)\) is not (yet) known''. The obvious answer is
Gerard R. Renardel, null de Lavalette
openaire +2 more sources
Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey
RW, 2016The question whether an ontology can safely be replaced by another, possibly simpler, one is fundamental for many ontology engineering and maintenance tasks.
E. Botoeva +5 more
semanticscholar +1 more source
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
On Z39.50 wrapping and description logics
International Journal on Digital Libraries, 2000Z39.50 is a client/server protocol widely used in digital libraries and museums for searching and retrieving information spread over a number of heterogeneous sources. To overcome semantic and schematic discrepancies among the various data sources the protocol relies on a world view of information as a flat list of fields, called Access Points (AP ...
Velegrakis, Ioannis +2 more
openaire +1 more source
Bisimilarity for paraconsistent description logics
Journal of Intelligent & Fuzzy Systems, 2016We introduce comparisons w.r.t. information between interpretations in paraconsistent description logics and use them to define bisimilarity for such logics. This notion is useful for concept learning in description logics when inconsistencies occur. We give preservation results and the Hennessy-Milner property for comparisons w.r.t.
Nguyen, Linh Anh +3 more
openaire +2 more sources