Abstract. This paper reports on the recent development of ELK, a consequence-based reasoner for EL+ ⊥ ontologies. It covers novel reasoning techniques which aim at improving efficiency and providing foundation for new reasoning services. On the former front we present a simple optimization for handling of role com-position axioms, such as transitivity, which substantially reduces the number of rule applications. For the latter, we describe a new rule application strategy that takes advantage of concept definitions to avoid many redundant inferences with-out making rules dependent on derived conclusions. This improvement is not vis-ible to the end user but considerably simplifies implementation for incremental reasoning and proof generation....
Abstract. Extensions of the description logic EL have recently been proposed as lightweight ontology...
Consequence-based (CB) reasoners combine ideas from resolution and (hyper)tableau calculi for solvin...
Description logics (DLs) are knowledge representation formalisms with numerous applications and well...
Abstract. ELK is a specialized reasoner for the lightweight ontology language OWL EL. The practical ...
Abstract. ELK is a specialized reasoner for the lightweight ontology language OWL EL. The practical ...
Description logics (DLs) are knowledge representation languages that provide the theoretical underpi...
Abstract. EL is a family of tractable Description Logics (DLs) that is the basis of the OWL 2 EL pro...
Description logics (DLs) are a family of knowledge representation formalisms that provide the logica...
Abstract: Ontology driven architecture has revolutionized the inference system by allowing interope...
Developing and maintaining ontologies is an expensive and error-prone task. After an error is detect...
International audienceNominal schemas have been proposed as an extension to Description Logics (DL),...
Consequence-based (CB) reasoners combine ideas from resolution and (hyper)tableau calculi to solve t...
The EL family of description logics (DLs) has been designed to provide a restricted syntax for commo...
We present a novel reasoning procedure for Horn SHIQ ontologies—SHIQ ontologies that can be translat...
We present a novel reasoning procedure for Horn SHIQ ontologies–SHIQ ontologies that can be translat...
Abstract. Extensions of the description logic EL have recently been proposed as lightweight ontology...
Consequence-based (CB) reasoners combine ideas from resolution and (hyper)tableau calculi for solvin...
Description logics (DLs) are knowledge representation formalisms with numerous applications and well...
Abstract. ELK is a specialized reasoner for the lightweight ontology language OWL EL. The practical ...
Abstract. ELK is a specialized reasoner for the lightweight ontology language OWL EL. The practical ...
Description logics (DLs) are knowledge representation languages that provide the theoretical underpi...
Abstract. EL is a family of tractable Description Logics (DLs) that is the basis of the OWL 2 EL pro...
Description logics (DLs) are a family of knowledge representation formalisms that provide the logica...
Abstract: Ontology driven architecture has revolutionized the inference system by allowing interope...
Developing and maintaining ontologies is an expensive and error-prone task. After an error is detect...
International audienceNominal schemas have been proposed as an extension to Description Logics (DL),...
Consequence-based (CB) reasoners combine ideas from resolution and (hyper)tableau calculi to solve t...
The EL family of description logics (DLs) has been designed to provide a restricted syntax for commo...
We present a novel reasoning procedure for Horn SHIQ ontologies—SHIQ ontologies that can be translat...
We present a novel reasoning procedure for Horn SHIQ ontologies–SHIQ ontologies that can be translat...
Abstract. Extensions of the description logic EL have recently been proposed as lightweight ontology...
Consequence-based (CB) reasoners combine ideas from resolution and (hyper)tableau calculi for solvin...
Description logics (DLs) are knowledge representation formalisms with numerous applications and well...