Integrating Reasoning Services for Description Logics with Cardinality Constraints with Numerical Optimization Techniques

Filippo De BortoliFilippo De Bortoli

Filippo De Bortoli
Integrating Reasoning Services for Description Logics with Cardinality Constraints with Numerical Optimization Techniques
Master's Thesis, April 2019

Details
Bibtex

KurzfassungAbstract
Recent research in the field of Description Logic (DL) investigated the complexity of the satisfiability problem for description logics that are obtained by enriching the well-known DL with more complex set and cardinality constraints over role successors. The algorithms that have been proposed so far, despite providing worst-case optimal decision procedures for the concept satisfiability problem (both without and with a terminology) lack the efficiency needed to obtain usable implementations. In particular, the algorithm for the case without terminology is non-deterministic and the one for the case with a terminology is also best-case exponential. The goal of this thesis is to use well-established techniques from the field of numerical optimization, such as column generation, in order to obtain more practical algorithms. As a starting point, efficient approaches for dealing with counting quantifiers over unary predicates based on SAT-based column generation should be considered.
Weitere Informationen unter:Further Information: Link
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@thesis{ DeBo-Mas-19,
      address = {Dresden, Germany},
      author = {Filippo {De Bortoli}},
      school = {Technische Universit\"{a}t Dresden},
      title = {Integrating Reasoning Services for Description Logics with Cardinality Constraints with Numerical Optimization Techniques},
      type = {Master's Thesis},
      year = {2019},
    }