@proceedings {770,
	title = {Completion Reasoning Emulation for the Description Logic EL+},
	journal = {Proceedings of the AAAI 2020 Spring Symposium on Combining Machine Learning and Knowledge Engineering in Practice},
	volume = {2600},
	year = {2020},
	month = {03/2020},
	publisher = {CEUR-WS.org},
	address = {Stanford University, Palo Alto, California, USA},
	abstract = {<p>We present a new approach to integrating deep learning with knowledge-based systems that we believe shows promise. Our approach seeks to emulate reasoning structure, which can be inspected part-way through, rather than simply learning reasoner answers, which is typical in many of the black-box systems currently in use. We demonstrate that this idea is feasible by training a long short-term memory (LSTM) artificial neural network to learn EL+ reasoning patterns with two different data sets. We also show that this trained system is resistant to noise by corrupting a percentage of the test data and comparing the reasoner{\textquoteright}s and LSTM{\textquoteright}s predictions on corrupt data with correct answers.</p>
},
	keywords = {Deep Learning, Description Logic, EL+, LSTM, NeSy, Reasoning},
	url = {http://ceur-ws.org/Vol-2600/paper5.pdf},
	author = {Aaron Eberhart and Monireh Ebrahimi and Lu Zhou and Cogan Shimizu and Pascal Hitzler}
}
@conference {748,
	title = {Pseudo-Random ALC Syntax Generation},
	booktitle = {The Semantic Web: ESWC 2018 Satellite Events - ESWC 2018 Satellite Events, Heraklion, Crete, Greece, June 3-7, 2018, Revised Selected Papers},
	volume = {11155},
	year = {2018},
	pages = {19{\textendash}22},
	publisher = {Springer},
	organization = {Springer},
	address = {Heraklion, Crete, Greece},
	abstract = {We discuss a tool capable of rapidly generating pseudo-random syntactically valid ALC expression trees. The program is meant to allow a researcher to create large sets of independently valid expressions with a minimum of personal bias for experimentation.},
	keywords = {ALC, Description Logic, DL, random generation, synthetic data},
	isbn = {978-3-319-98191-8},
	doi = {10.1007/978-3-319-98192-5\_4},
	url = {https://doi.org/10.1007/978-3-319-98192-5\_4},
	author = {Aaron Eberhart and Michelle Cheatham and Pascal Hitzler}
}
@article {61,
	title = {Paraconsistent OWL and Related Logics},
	journal = {Semantic Web},
	volume = {4},
	year = {2013},
	pages = {395{\textendash}427},
	abstract = {The Web Ontology Language OWL is currently the most prominent formalism for representing ontologies in Semantic Web applications. OWL is based on description logics, and automated reasoners are used to infer knowledge implicitly present in OWL ontologies. However, because typical description logics obey the classical principle of explosion, reasoning over inconsistent ontologies is impossible in OWL. This is so despite the fact that inconsistencies are bound to occur in many realistic cases, e.g., when multiple ontologies are merged or when ontologies are created by machine learning or data mining tools. In this paper, we present four-valued paraconsistent description logics which can reason over inconsistencies. We focus on logics corresponding to OWL DL and its profiles. We present the logic SROIQ4, showing that it is both sound relative to classical SROIQ and that its embedding into SROIQ is consequence preserving. We also examine paraconsistent varieties of EL++, DL-Lite, and Horn-DLs. The general framework described here has the distinct advantage of allowing classical reasoners to draw sound but nontrivial conclusions from even inconsistent knowledge bases. Truth-value gaps and gluts can also be selectively eliminated from models (by inserting additional axioms into knowledge bases). If gaps but not gluts are eliminated, additional classical conclusions can be drawn without affecting paraconsistency.},
	keywords = {Automated Deduction, Complexity, Description Logic, OWL, Paraconsistency, Semantic Web, Web Ontology Language},
	doi = {10.3233/SW-2012-0066},
	url = {http://dx.doi.org/10.3233/SW-2012-0066},
	author = {Frederick Maier and Yue Ma and Pascal Hitzler}
}
@conference {139,
	title = {A Better Uncle for {OWL}: Nominal Schemas for Integrating Rules and Ontologies},
	booktitle = {Proceedings of the 20th International Conference on World Wide Web, WWW 2011, Hyderabad, India, March 28 - April 1, 2011},
	year = {2011},
	month = {03/2011},
	pages = {645-654},
	publisher = {ACM},
	organization = {ACM},
	abstract = {We propose a description-logic style extension of OWL 2 with nominal schemas which can be used like "variable nominal classes" within axioms. This feature allows ontology languages to express arbitrary DL-safe rules (as expressible in SWRL or RIF) in their native syntax. We show that adding nominal schemas to OWL 2 does not increase the worst-case reasoning complexity, and we identify a novel tractable language SROELV3(\cap, x) that is versatile enough to capture the lightweight languages OWL EL and OWL RL.},
	keywords = {datalog, Description Logic, Semantic Web Rule Language, SROIQ, tractability, Web Ontology Language},
	isbn = {978-1-4503-0632-4},
	doi = {10.1145/1963405.1963496},
	url = {http://doi.acm.org/10.1145/1963405.1963496},
	author = {Markus Kr{\"o}tzsch and Frederick Maier and Adila Krisnadhi and Pascal Hitzler},
	editor = {Sadagopan Srinivasan and Krithi Ramamritham and Arun Kumar and M. P. Ravindra and Elisa Bertino and Ravi Kumar}
}
@article {74,
	title = {Local Closed World Reasoning with Description Logics under the Well-Founded Semantics},
	journal = {Artificial Intelligence},
	volume = {175},
	year = {2011},
	pages = {1528{\textendash}1554},
	abstract = {<p class="rtejustify">An important question for the upcoming Semantic Web is how to best combine open world ontology languages, such as the OWL-based ones, with closed world rule-based languages. One of the most mature proposals for this combination is known as hybrid MKNF knowledge bases [52], and it is based on an adaptation of the Stable Model Semantics to knowledge bases consisting of ontology axioms and rules. In this paper we propose a well-founded semantics for nondisjunctive hybrid MKNF knowledge bases that promises to provide better efficiency of reasoning, and that is compatible with both the OWL-based semantics and the traditional Well-Founded Semantics for logic programs. Moreover, our proposal allows for the detection of inconsistencies, possibly occurring in tightly integrated ontology axioms and rules, with only little additional effort. We also identify tractable fragments of the resulting language.</p>
},
	keywords = {Description Logic, Knowledge representation, Logic Programming, Non-monotonic reasoning, Ontologies, Semantic Web},
	doi = {10.1016/j.artint.2011.01.007},
	url = {http://dx.doi.org/10.1016/j.artint.2011.01.007},
	author = {Matthias Knorr and Jos{\'e} J{\'u}lio Alferes and Pascal Hitzler}
}
@conference {143,
	title = {Local Closed World Semantics: Keep it simple, stupid!},
	booktitle = {Proceedings of the 24th International Workshop on Description Logics (DL 2011), Barcelona, Spain, July 13-16, 2011},
	volume = {745},
	year = {2011},
	month = {07/2011},
	publisher = {CEUR-WS.org},
	organization = {CEUR-WS.org},
	abstract = {A combination of open and closed-world reasoning (usually called local closed world reasoning) is a desirable capability of knowledge representation formalisms for Semantic Web applications. However, none of the proposals made to date for extending description logics with local closed world capabilities has had any significant impact on applications. We believe that one of the key reasons for this is that current proposals fail to provide approaches which are intuitively accessible for application developers and at the same time are applicable, as extensions, to expressive description logics such as SROIQ, which underlies the Web Ontology Language OWL. In this paper we propose a new approach which overcomes key limitations of other major proposals made to date. It is based on an adaptation of circumscriptive description logics which, in contrast to previously reported circumscription proposals, is applicable to SROIQ without rendering reasoning over the resulting language undecidable.},
	keywords = {circumscription, closed world, decidability, Description Logic},
	url = {http://ceur-ws.org/Vol-745/paper_12.pdf},
	author = {Adila Krisnadhi and Kunal Sengupta and Pascal Hitzler},
	editor = {Riccardo Rosati and Sebastian Rudolph and Michael Zakharyaschev}
}
