A New Description Logic with Set Constraints and Cardinality Constraints on Role Successors [chapter]

Franz Baader
2017 Lecture Notes in Computer Science  
We introduce a new description logic that extends the wellknown logic ALCQ by allowing the statement of constraints on role successors that are more general than the qualified number restrictions of ALCQ. To formulate these constraints, we use the quantifier-free fragment of Boolean Algebra with Presburger Arithmetic (QFBAPA), in which one can express Boolean combinations of set constraints and numerical constraints on the cardinalities of sets. Though our new logic is considerably more
more » ... ve than ALCQ, we are able to show that the complexity of reasoning in it is the same as in ALCQ, both without and with TBoxes.
doi:10.1007/978-3-319-66167-4_3 fatcat:qp76wgneobbe7ls77um4j3aslm