activity
20162026
most citedSatisfiability and Query Answering in Description Logics with Global and Local Cardinality Constraints

13 citations · 17 across the 16 of their papers we have counts for

collaborators
Showing 2019Show all

1 paper · 1 filter

cs.LO2019

Statistical EL is ExpTime-complete

Bartosz Bednarczyk

We show that the consistency problem for Statistical EL ontologies, defined by Pe{ñ}aloza and Potyka, is ExpTime-hard. Together with existing ExpTime upper bounds, we conclude ExpT…