# A New Description Logic with Set Constraints and Cardinality Constraints on Role Successors

@inproceedings{Baader2017AND,
title={A New Description Logic with Set Constraints and Cardinality Constraints on Role Successors},
booktitle={FroCoS},
year={2017}
}
• Published in FroCoS 27 September 2017
• Mathematics
We introduce a new description logic that extends the well-known logic $$\mathcal {A}\mathcal {L}\mathcal {C}\mathcal {Q}$$ by allowing the statement of constraints on role successors that are more general than the qualified number restrictions of $$\mathcal {A}\mathcal {L}\mathcal {C}\mathcal {Q}$$. 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…
On the Expressive Power of Description Logics with Cardinality Constraints on Finite and Infinite Sets
• Computer Science, Mathematics
FroCos
• 2019
The main contribution of this paper is to give a characterization of the first-order fragment of $$\mathcal {ALCSCC} ^\infty$$, a notion of bisimulation that characterizes this fragment.
Expressive cardinality restrictions on concepts in a description logic with expressive number restrictions
This work combines the two extensions of description logic ALCQ by considering extended cardinality constraints on ALCSCC concepts, and shows that this does not increase the complexity of reasoning, which is NExpTime-complete both for extended Cardinality constraints in the DL ALC and in its extension A LCSCC.
Extending the Description Logic ALC with More Expressive Cardinality Constraints on Concepts
• Computer Science
GCAI
• 2017
This work extends the terminological formalism of the well-known description logic ALC to more general constraints expressed in the quantifier-free fragment of Boolean Algebra with Presburger Arithmetic (QFBAPA), and introduces a restricted version of the formalism for which the complexity is ExpTime.
Expressive cardinality constraints on ALCSCC concepts
This work combines the two extensions of description logic ALC by considering extended cardinality constraints on ALCSCC concepts, and shows that this does not increase the complexity of reasoning, which is NExpTime-complete both for extended Cardinality constraints in ALC and A LCSCC.
On the Complexity and Expressiveness of Description Logics with Counting
• Computer Science
• 2019
This paper investigates the expressive power of the DLs obtained in this way, using appropriate bisimulation characterizations and 0–1 laws as tools to differentiate between the expressiveness of different logics.
Description Logics That Count, and What They Can and Cannot Count (Extended Abstract)
• Computer Science
Description Logics
• 2020
This work extended ALCQ by enabling the statement of restrictions on role successors using the quantifier-free fragment of Boolean Algebra with Presburger Arithmetic (QFBAPA), in which one can express Boolean combinations of set constraints and numerical constraints comparing the cardinalities of finite sets.
Satisfiability and Query Answering in Description Logics with Global and Local Cardinality Constraints
• Computer Science
ECAI
• 2020
It is proved that decidability of querying can be regained if global and local constraints are not mixed and the global constraints are appropriately restricted, and conjunctive query entailment in this expressive description logic ALCSCC++ turns out to be undecidable.
Satisfiability Checking and Conjunctive Query Answering in Description Logics with Global and Local Cardinality Constraints
• Computer Science
Description Logics
• 2019
It is proved that decidability of querying can be regained if global and local constraints are not mixed and the global constraints are appropriately restricted, and that conjunctive query entailment in this expressive description logic ALCSCC turns out to be undecidable.
Presburger Concept Cardinality Constraints in Very Expressive Description Logics - Allegro sexagenarioso ma non ritardando
• Johannes Rudolph
• Computer Science
Description Logic, Theory Combination, and All That
• 2019
The proposed extension of the description logic by axioms which express correspondences between the cardinalities of concepts by means of Presburger arithmetics is extended, enhancing the expressivity of the underlying logic as well as the constraints while preserving complexities.
Integrating Reasoning Services for Description Logics with Cardinality Constraints with Numerical Optimization Techniques
Well-established techniques from the eld of numerical optimization, such as column generation, in order to obtain more practical algorithms are used for dealing with counting quanti ers over unary predicates based on SAT-based column generation.

## References

SHOWING 1-10 OF 20 REFERENCES
Chair for Automata Theory LTCS – Report Concept Descriptions with Set Constraints and Cardinality Constraints
We introduce a new description logic that extends the well-known logic ALCQ by allowing the statement of constraints on role successors that are more general than the qualified number restrictions of
Automated Reasoning in ALCQ\mathcal{ALCQ} via SMT
• Computer Science
• 2011
A novel approach to encoding an ALCQ ontology into a formula in Satisfiability Modulo the Theory of Costs (SMT(C), which is a specific and computationally much cheaper subcase of Linear Arithmetic under the Integers, and to exploit the power of modern SMT solvers to compute every conceptsatisfiability query on a given ontology.
Expressive Number Restrictions in Description Logics
• Mathematics
J. Log. Comput.
• 1999
This paper increases the expressive power of Description Logics by allowing for more complex roles in number restrictions, and shows that concept satisfiability is decidable for a restricted logic.
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
• Computer Science, Mathematics
• 2007
This paper presents an algorithm for checking satisfiability of QFBAPA formulas by reducing them to formulas of quantifier-free PA, with only O(n log(n) increase in formula size, and proves the correctness of the algorithm using a theorem about sparse solutions of integer linear programming problems.
A Correspondence Theory for Terminological Logics: Preliminary Report
It is proved that universal implications can be expressed within TSC, and it is shown that features correspond to deterministic programs in dynamic logic preserves decidability, although violates its finite model property.
Qualifying Number Restrictions in Concept Languages
• Computer Science
KR
• 1991
This paper presents a subsumption algorithm for this language, which is sound and complete, and discusses why the subsumption problem in this language is rather hard from a computational point of view, which leads to an idea of how to recognize concepts which cause tractable problems.
Computers and Intractability: A Guide to the Theory of NP-Completeness
• Computer Science
• 1978
Horn formulae play a prominent role in artificial intelligence and logic programming. In this paper we investigate the problem of optimal compression of propositional Horn production rule knowledge
A PSpace Algorithm for Graded Modal Logic
A PSpace algorithm that decides satisfiability of the graded modal logic Gr(KR) is presented, which is the first known algorithm which meets the lower bound for the complexity of the problem and refute a EXPTIME-hardness conjecture.