DE eng

Search in the Catalogues and Directories

Hits 1 – 11 of 11

1
Franz von Baader's sämtliche Werke
Baader, Franz [Verfasser]. - Norderstedt : Hansebooks GmbH, 2016
DNB Subject Category Language
Show details
2
Matching trace patterns with regular policies
Baader, Franz; Bauer, Andreas; Tiu, Alwen. - : Springer, 2015
BASE
Show details
3
The description logic handbook: theory, implementation and applications
Baader, Franz; Calvanese, Diego; MacGuinness, Deborah L.. - Cambridge [u.a.] : Cambridge Univ. Press, 2010
Leibniz-Zentrum Allgemeine Sprachwissenschaft
Show details
4
Automata-Based Axiom Pinpointing
In: Journal of automated reasoning. - Dordrecht [u.a.] : Springer 45 (2010) 2, 91-129
OLC Linguistik
Show details
5
Preface to Special Issue on Reasoning in Description Logics
In: Journal of automated reasoning. - Dordrecht [u.a.] : Springer 39 (2007) 3, 245
OLC Linguistik
Show details
6
The description logic handbook : theory, implementation, and applications
Baader, Franz (Hrsg.); Nardi, Daniele (Hrsg.); Calvanese, Diego (Hrsg.). - Cambridge : Cambridge U.P., 2003
BLLDB
UB Frankfurt Linguistik
Show details
7
Embedding Defaults into Terminological Knowledge Representation Formalisms
In: Journal of automated reasoning. - Dordrecht [u.a.] : Springer 14 (1995) 1, 149-180
OLC Linguistik
Show details
8
Priorities on Defaults with Prerequisites, and Their Application in Treating Specificity in Terminological Default Logic
In: Journal of automated reasoning. - Dordrecht [u.a.] : Springer 15 (1995) 1, 41-68
OLC Linguistik
Show details
9
Extensions of concept languages for a mechanical engineering application ...
Baader, Franz; Hanschke, Philipp. - : Universität des Saarlandes, 1992
BASE
Show details
10
Extensions of concept languages for a mechanical engineering application
Abstract: We shall consider an application in mechanical engineering, and shall show that the adequate modeling of the terminology of this problem domain in a conventional concept language poses two main representation problems. The first requires access to concrete domains, such as real numbers, while the second asks for a construct which can be used to represent sequences of varying length. As shown in recent papers by the authors there exist extended concept languages--equipped with sound and complete reasoning algorithms--that satisfy the respective representation demands separately. The main result presented in this paper is that the combination of both extensions leads to undecidable terminological inference problems. In particular, the important subsumption problem is undecidable. It should be noted that the need for these extensions is not particular to the considered problem domain; similar representation demands are likely to occur in other non-toy applications.
Keyword: Computerlinguistik; ddc:004; Künstliche Intelligenz; Terminologische Sprache
URL: http://nbn-resolving.org/urn:nbn:de:bsz:291-scidok-36079
https://doi.org/10.22028/D291-24854
BASE
Hide details
11
On the expressivity of feature logics with negation, functional uncertainty, and sort equations
BASE
Show details

Catalogues
1
0
4
0
1
0
1
Bibliographies
1
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
4
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern