Results 311 to 320 of about 1,045,924 (344)
Some of the next articles are maybe not open access.

Defeasible Description Logics

KI - Künstliche Intelligenz, 2020
The present paper is a summary of a habilitation (Habilitation a Diriger des Recherches, in French), which has been perused and evaluated by a committee composed by the following members: Franz Baader, Stephane Demri, Hans van Ditmarsch, Sebastien Konieczny, Pierre Marquis, Marie-Laure Mugnier, Odile Papini and Leon van der Torre. It was defended on 26
Ivan Varzinczak, Ivan Varzinczak
openaire   +3 more sources

Matching in description logics

Journal of Logic and Computation, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Franz Baader   +3 more
openaire   +3 more sources

Description Logics

2009
Description Logics (DLs) are a well-investigated family of logic-based knowledge representation formalisms, which can be used to represent the conceptual knowledge of an application domain in a structured and formally well-understood way. They are employed in various application domains, such as natural language processing, configuration, and databases,
openaire   +3 more sources

Expressive Description Logics

2007
This chapter covers extensions of the basic Description Logics introduced in Chapter 2 by very expressive constructs that require advanced reasoning techniques. In particular, we study reasoning in Description Logics that include general inclusion axioms, inverse roles, number restrictions, reflexive-transitive closure of roles, fixpoint constructs for
DIEGO CALVANESE, DE GIACOMO, Giuseppe
openaire   +3 more sources

Description Logics for Documentation

2016
Much 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   +4 more sources

A logical calculus with descriptions

Journal of Philosophical Logic, 1974
is 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   +3 more sources

Description Logics for Databases

2007
In contrast to the relatively complex information that can be expressed in DL ABoxes (which we might call knowledge or information), databases and other sources such as files, semistructured data, and the World Wide Web provide rather simpler data, which must however be managed effectively.
Alexander Borgida   +2 more
openaire   +3 more sources

A Decidable Constructive Description Logic

2010
Recently, there has been a growing interest in constructive reinterpretations of description logics. This has been motivated by the need to model in the DLs setting problems that have a consolidate tradition in constructive logics. In this paper we introduce a constructive description logic for the language of ALC based on the Kripke semantics for ...
Bozzato L.   +3 more
openaire   +3 more sources

Towards Service Description Logics

2002
Semantic service description and matchmaking are needed in embedded and disappearing computing, cooperative multiagent systems, and the semantic web. Standard program semantics formalizations are not suited to modeling service semantics, because they are generic w.r.t.
openaire   +3 more sources

Description Logics

2004
Franz Baader   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy