1582 search results - page 39 / 317 » On Higher-Order Description Logics |
ITP
2010
14 years 12 days ago
2010
Abstract. We present a new scheme to translate mathematical developments from HOL Light to Coq, where they can be re-used and rechecked. By relying on a carefully chosen embedding ...
JAPLL
2006
13 years 8 months ago
2006
This paper presents Automath encodings (which also are valid in LF/P) of various kinds of foundations of mathematics. Then it compares these encodings according to their size, to f...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Abstract. We consider a simple model of higher order, functional computations over the booleans. Then, we enrich the model in order to encompass non-termination and unrecoverable e...
IADIS
2004
13 years 10 months ago
2004
OWL DL, being established by W3C, is a Knowledge Representation Markup Language for the Semantic Web. OWL DL is a new synthesis of research on KRML for the Semantic Web, which nee...
DLOG
2009
13 years 6 months ago
2009
Least Common Subsumers (LCS) have been proposed in Description Logics (DL) to capture the commonalities between two or more concepts.