1582 search results - page 111 / 317 » On Higher-Order Description Logics |
CADE
2000
Springer
15 years 2 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 ...
INLG
2010
Springer
14 years 8 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...
RR
2010
Springer
14 years 8 months ago
2010
Springer
The development and use of ontologies may require users with no training in formal logic to handle complex concept descriptions. To aid such users, we propose a new visualization f...
AAAI
2007
15 years 9 days ago
2007
Forgetting irrelevant/problematic actions in a domain description can be useful in solving reasoning problems, such as query answering, planning, conflict resolution, prediction,...
AAAI
2008
15 years 9 days ago
2008
Many semantic web applications require support for mappings between roles (or properties) defined in multiple independently developed ontology modules. Distributed Description Log...