TY  - THES
A1  - Kaminski, Roland
T1  - Complex reasoning with answer set programming
N2  - Answer Set Programming (ASP) allows us to address knowledge-intensive search and optimization problems in a declarative way due to its integrated modeling, grounding, and solving workflow. A problem is modeled using a rule based language and then grounded and solved. Solving results in a set of stable models that correspond to solutions of the modeled problem. In this thesis, we present the design and implementation of the clingo system---perhaps, the most
widely used ASP system. It features a rich modeling language originating from the field of knowledge representation and reasoning, efficient grounding algorithms based on database evaluation techniques, and high performance solving algorithms based on Boolean satisfiability (SAT) solving technology.
The contributions of this thesis lie in the design of the modeling language, the design and implementation of the grounding algorithms, and the design and implementation of an Application Programmable Interface (API) facilitating the use of ASP in real world applications and the implementation of complex forms of reasoning beyond the traditional ASP workflow.
KW  - Answer Set Programming
KW  - Declarative Problem Solving
KW  - Grounding Theory
KW  - Preference Handling
KW  - Answer Set Solving modulo Theories
KW  - Temporal Answer Set Solving
Y1  - 2023
ER  -