1835 search results - page 94 / 367 » Classifying Description Logics |
133
Voted
DATESO
2008
15 years 5 months ago
2008
Presently, there is no specialized language for complex integrity constraints description in XML documents. In this paper we present a language that combines first-order logic toge...
151
Voted
BIRTHDAY
2012
Springer
13 years 11 months ago
2012
Springer
We introduce the use of asynchronous logic automata (ALA) for cryptography. ALA aligns the descriptions of hardware and software for portability, programmability, and scalability. ...
138
click to vote
CADE
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...
145
click to vote
INLG
2010
Springer
15 years 1 months ago
2010
Springer
Ontologies and datasets for the Semantic Web are encoded in OWL formalisms that are not easily comprehended by people. To make ontologies accessible to human domain experts, sever...
123
Voted
ESWS
2008
Springer
15 years 5 months ago
2008
Springer
: The mathematical nature of description logics has meant that domain experts find them hard to understand. This forms a significant impediment to the creation and adoption of onto...