1460 search results - page 90 / 292 » Preferential Description Logics |
135
click to vote
ACL
1993
15 years 7 months ago
1993
We show that feature logic extended by functional uncertainty is decidable, even if one admits cyclic descriptions. We present an algorithm, which solves feature descriptions cont...
161
click to vote
DATESO
2008
15 years 7 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...
189
click to vote
BIRTHDAY
2012
Springer
14 years 2 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. ...
178
click to vote
CADE
2000
Springer
15 years 10 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 ...
182
click to vote
INLG
2010
Springer
15 years 4 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...