Results 271 to 280 of about 93,434 (314)

Matching in description logics

Journal of Logic and Computation, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Franz Baader, Ralf Küsters, Alexander Borgida, Deborah L. McGuinness   +3 more
openaire   +2 more sources

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
openaire   +2 more sources

The Logic Description Generator

[1990] Proceedings of the International Conference on Application Specific Array Processors, 2002
The authors describe the Logic Description Generator (LDG), a design tool specifically geared to aid in the implementation of systolic algorithms on reconfigurable logic arrays. It is used to specify designs for Splash, a linear array of Xilinx chips. LDG supports the notion of a logical systolic cell, which may be repetitively layed out across a chip,
Maya B. Gokhale, Andrew Kopser, Sara P. Lucas, Ronald G. Minnich   +3 more
openaire   +1 more source

A Description Logic for InferenceNet.Br

2012
The InferenceNet.Br is a new linguistic resource for Portuguese language knowledge bases, which follows some principles of the WordNet, ConceptNet and FrameNet. Unlike these other linguistic resources, InferenceNet.Br allows representation of more expressive relationships between concepts, permitting to characterize premises or conclusions of these ...
Wellington Franco, Thiago Alves Rocha, Henrique Viana, João F. L. Alcântara   +3 more
openaire   +1 more source

Descriptions in mathematical logic

Studia Logica, 1984
If 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

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   +3 more sources

Learnability of description logics

Proceedings of the fifth annual workshop on Computational learning theory, 1992
This 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

Description Logic Rules

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, Sebastian Rudolph, Pascal Hitzler   +2 more
openaire   +3 more sources

Parallelizing description logics

1995
Description 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

On Fuzzy Description Logics

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