2000 character limit reached
Statistical EL is ExpTime-complete
Published 2 Nov 2019 in cs.LO and cs.AI | (1911.00696v5)
Abstract: We show that the consistency problem for Statistical EL ontologies, defined by Pe{~{n}}aloza and Potyka, is ExpTime-hard. Together with existing ExpTime upper bounds, we conclude ExpTime-completeness of the logic. Our proof goes via a reduction from the consistency problem for EL extended with negation of atomic concepts.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.