A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Filters
Implementing Completion-Based Inferences for the EL-family
2011
International Workshop on Description Logics
Preserved Fulltext
Completion algorithms for subsumption are investigated for many extensions of the description logic EL. ...
In this paper we present an optimized version of the completion algorithm for ELHIf R + [11] , which is implemented in jCel. ...
Completion based generalization The classification and the realization algorithm of jCel can be employed to compute generalizations. We define these inferences now. ...
dblp:conf/dlog/MendezET11
fatcat:2n6jovme5jcbfkdlqdmrc5obju
A Practical Approach for Computing Generalization Inferences in $\mathcal{EL}$
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper we present a practical approach for computing the lcs and msc with a bounded depth, based on the polynomial-time completion algorithm for EL and describe its implementation. ...
Similarly, the most specific concept (msc) generalizes an individual into a concept description. For EL with general EL-TBoxes, the lcs and the msc may not exist. ...
We would like to thank Andreas Ecke and Julian Mendez for their implementation effort. ...
doi:10.1007/978-3-642-21034-1_28
fatcat:4h7tfrikg5b5tbijn6xredsd5q
A short ode to jackknife empirical likelihood procedures
2018
Biometrics & Biostatistics International Journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
By using EL method, researchers can determine the shape of confidence re gions without having to pick a parametric family for the data. ...
Based on the idea, Owen 2 developed the empirical likelihood (EL) method. ...
doi:10.15406/bbij.2018.07.00185
fatcat:35adosqxjnhj3fhwxu7joplm7a
Normalization by Evaluation for λ →2
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We show that the set-theoretic semantics for λ →2 is complete by inverting evaluation using decision trees. ...
We show the correctness of our implementation using logical relations. ...
Evaluation of types − ∈ Ty → is again an inductive family, which we cannot implement in Haskell, and the workaround is to have all σ coalesced into one metalanguage type el (of untyped elements) much the ...
doi:10.1007/978-3-540-24754-8_19
fatcat:57ivz3rqg5ce5k7osfhp7hbpqq
Small is Again Beautiful in Description Logics
2010
Künstliche Intelligenz
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
OWL DL, the standard ontology language for the Semantic Web, is based on such an expressive DL for which reasoning is highly intractable. ...
This and other reasons have led to the development of two new families of light-weight DLs, EL and DL-Lite, which recently have been proposed as profiles of OWL 2, the new version of the OWL standard. ...
In fact, OWL DL is based on the expressive DL SHOIN (D), for which reasoning is NExpTime-complete, and its sublanguage OWL Lite is based on SHIF (D), for which reasoning is still ExpTime-complete [32] ...
doi:10.1007/s13218-010-0004-8
fatcat:mqdsof4hcnfibgouuai35ibda4
Comparison of reasoners for large ontologies in the OWL 2 EL profile
2011
Semantic Web Journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
For the very large ontology SNOMED CT, which is released both in stated and inferred form, we test whether the computed concept hierarchies are correct by comparing them to the inferred form of the official ...
This paper provides a survey to and a comparison of state-of-the-art Semantic Web reasoners that succeed in classifying large ontologies expressed in the tractable OWL 2 EL profile. ...
We also like to thank the reviewers for their constructive feedback. ...
doi:10.3233/sw-2011-0034
fatcat:sobiilzlw5hqfe5yb3jlqtv64i
Description logic reasoning for semantic web ontologies
2011
Proceedings of the International Conference on Web Intelligence, Mining and Semantics - WIMS '11
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
By the completion method a TBox can be classified in polynomial time. This method is implemented in the EL-reasoner jCEL [35] . ...
Based on these definitions, implicitly captured knowledge can be inferred from the given descriptions of concepts and roles. These inferences are defined based on the formal semantics of DLs. ...
doi:10.1145/1988688.1988696
dblp:conf/wims/Turhan11
fatcat:iemskztbeneb3gn3tct4qkigxm
Improving ESTA and Implementing the Expert System of Substation Direct Current System Condition Evaluation
2019
DEStech Transactions on Environment Energy and Earth Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
It makes possible that it can do basic uncertain inference and directly read/write some table contents of MySQL database with improved ESTA 4.5 (Expert System Shell for Text Animation) based on Visual ...
It put forward also an uncertain inference method in the ESTA 4.5 based on Visual Prolog 5.2 and Web. ...
For example, the knowledge base for the evaluation of family defect state variables is shown in the ⑤ part of section 5. ...
doi:10.12783/dteees/icepe2019/28918
fatcat:nezkkklrpnhtjfiructukzofey
Identifying Missing Hierarchical Relations in SNOMED CT from Logical Definitions Based on the Lexical Features of Concept Names
2016
International Conference on Biomedical Ontology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We first create logical definitions from the lexical features of concept names, which we represent in OWL EL. We infer hierarchical (subClassOf) relations among these concepts using the ELK reasoner. ...
Finally, we compare the hierarchy obtained from lexical features to the original SNOMED CT hierarchy. We review the differences manually for evaluation purposes. Results. ...
GQ Zhang for providing motivation and encouragement for this investigation. ...
dblp:conf/icbo/Bodenreider16
fatcat:5sxkmbewbzhqld7cpk4kvyxkt4
Mary, What's Like All Cats?
2014
International Workshop on Description Logics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
ABoxes, knowledge bases, the semantics via interpretations I, and common inferences, are defined as usual [1] . Let C(EL) be the set of all EL-concept descriptions. ...
The family of CSMs ∼ c for EL inherits several formal properties from ∼ i , in particular symmetry and equivalence invariance. ...
dblp:conf/dlog/EckePT14
fatcat:smm5v4zumnenjhrrajj4hyzoqe
The Incredible ELK
2013
Journal of automated reasoning
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This paper describes ELK-a high performance reasoner for OWL EL ontologiesand details various aspects from theory to implementation that make ELK one of the most competitive reasoning systems for EL ontologies ...
of the OWL EL profile of the Web ontology language OWL. ...
We also thank the International Health Terminology Standards Development Organisation (IHTSDO), and in particular Kent Spackman, for providing us with the experimental version of the ANATOMY ontology. ...
doi:10.1007/s10817-013-9296-3
fatcat:vgk47zats5dqjfy6rcgihwb3ue
A survey of large-scale reasoning on the Web of data
2018
Knowledge engineering review (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
These systems differ significantly; for instance in terms of reasoning expressivity, computational properties such as completeness, or reasoning objectives. ...
In this large and uncoordinated environment, reasoning can be used to check the consistency of the data and of associated ontologies, or to infer logical consequences which, in turn, can be used to obtain ...
Part of this work was done by Raghava Mutharaju when he was a PhD student at Wright State University during which time he acknowledges the support of the National Science Foundation under award 1017225 ...
doi:10.1017/s0269888918000255
fatcat:bergc5uphbceznigppektgvzrm
Automata-Based Abduction for Tractable Diagnosis
2010
International Workshop on Description Logics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
This paper presents a novel, tractable abduction procedure for the lightweight description logic EL. ...
Abductive reasoning has been recognized as a valuable complement to deductive inference for tasks such as diagnosis and integration of incomplete information despite its inherent computational complexity ...
For the complete EL family, normalization of an axiom set is linear in the number of axioms both concerning the time required and the number of new axioms generated [11] . ...
dblp:conf/dlog/HubauerLP10
fatcat:n2qnlfuiebbazmiksvymybf5pa
Soundness Preserving Approximation for TBox Reasoning in R
2009
International Workshop on Description Logics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
For example, reasoning in SROIQ (i.e. OWL2-DL) is N2ET-complete; even with R, a fragment of SROIQ supporting ALC GCIs and role chains, the complexity of reasoning is 2ET-hard. ...
The main idea is to convert R ontologies to EL + with an additional complement table maintaining the complementary relations between named concepts. ...
Acknowledgements This work has been partially supported by the European Project Marrying Ontologies and Software Technologies (MOST ICT 2008-216691). ...
dblp:conf/dlog/RenPZ09
fatcat:ybbpuqg22bdrng7gzv3ikblqky
jcel: A Modular Rule-based Reasoner
2012
International Workshop on OWL Reasoner Evaluation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
jcel is a reasoner for the description logic EL + that uses a rule-based completion algorithm. ...
These ontologies can be encoded using the Web Ontology Language (OWL), and through the OWL API, edited using the popular ontology editor Protégé. jcel implements a subset of the OWL 2 EL profile, and can ...
Reasoning Algorithm Implemented The algorithm is rule-based, and there is a set of rules that are successively applied to saturate data structures. These rules are called completion rules. ...
dblp:conf/ore/Mendez12
fatcat:723nrz6uzjgz3mn7eev7ojoxsm
« Previous
Showing results 1 — 15 out of 42,193 results