Andre Thevapalan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Andre Thevapalan has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Gabriele Kern-Isberner
TU Dortmund University
6 shared publications - Marco Wilhelm
TU Dortmund University
3 shared publications - Konstantin Haupt
Technische Universität Dortmund
1 shared publication - Moritz Roidl
TU Dortmund University
1 shared publication - Pascal Kaiser
Technische Universität Dortmund
1 shared publication
Latest Publications
- Open Access
- 14 May 2025
- Published by University of Florida George A Smathers Libraries in Pediatrics in Review
- Vol. 38
Integrated Use of System Z for Preferred Answer Set Programming
Answer set programming (ASP) and conditional reasoning are powerful KR formalisms capable of expressing default statements that usually hold but also allow for exceptions. While ASP excels with an intuitive rule-based syntax, fast solvers, and is suited to solve complex combinatorial search problems, conditionals provide a sophisticated preference-based semantics and yield principled inferences. In this paper, we investigate and compare different computational approaches on utilizing conditional background knowledge in order to prioritize the solutions of ASP programs. For this, we compile the specification of the System Z ranking model of conditionals into ASP constraints and, therewith, integrate the guidelines for prioritization according to System Z directly into the ASP programs.
- 14 May 2025
- Published by University of Florida George A Smathers Libraries in Pediatrics in Review
- Vol. 38
Open AccessIntegrated Use of System Z for Preferred Answer Set Programming
Answer set programming (ASP) and conditional reasoning are powerful KR formalisms capable of expressing default statements that usually hold but also allow for exceptions. While ASP excels with an intuitive rule-based syntax, fast solvers, and is suited to solve complex combinatorial search problems, conditionals provide a sophisticated preference-based semantics and yield principled inferences. In this paper, we investigate and compare different computational approaches on utilizing conditional background knowledge in order to prioritize the solutions of ASP programs. For this, we compile the specification of the System Z ranking model of conditionals into ASP constraints and, therewith, integrate the guidelines for prioritization according to System Z directly into the ASP programs.
- Open Access
- 29 August 2023
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 385, 116-128
Sorting Strategies for Interactive Conflict Resolution in ASP
- 29 August 2023
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 385, 116-128
Open AccessSorting Strategies for Interactive Conflict Resolution in ASP
- Open Access
- 8 May 2023
- Published by University of Florida George A Smathers Libraries in The International FLAIRS Conference Proceedings
- Vol. 36
An Interactive Modelling Environment for Designing Warehouse Layouts Based on ASP
In this paper, we apply answer set programming (ASP) to the task of planning warehouse layouts within the logistical domain. Warehouse layout planners have to take into account a vast number of aspects to come up with feasible layouts, especially the placement of logistical elements under specific conditions like the accessibility of warehouse elements. Also optimization criteria, e. g., minimizing the pathways, have to be considered. Out of a generally large number of feasible layouts, the layout planner has to decide which layout fits best. As this can be quite difficult and time-consuming, we propose an interactive modelling environment which creates all feasible layouts for a given planning problem by exploiting a logistical knowledge base as well as specific case data provided by the user, who can interactively review all optimal layouts and look for the most suited one. It allows for taking soft constraints and vague expert knowledge into account while leaving room for proposing novel ideas for layouts.
- 8 May 2023
- Published by University of Florida George A Smathers Libraries in The International FLAIRS Conference Proceedings
- Vol. 36
Open AccessAn Interactive Modelling Environment for Designing Warehouse Layouts Based on ASP
In this paper, we apply answer set programming (ASP) to the task of planning warehouse layouts within the logistical domain. Warehouse layout planners have to take into account a vast number of aspects to come up with feasible layouts, especially the placement of logistical elements under specific conditions like the accessibility of warehouse elements. Also optimization criteria, e. g., minimizing the pathways, have to be considered. Out of a generally large number of feasible layouts, the layout planner has to decide which layout fits best. As this can be quite difficult and time-consuming, we propose an interactive modelling environment which creates all feasible layouts for a given planning problem by exploiting a logistical knowledge base as well as specific case data provided by the user, who can interactively review all optimal layouts and look for the most suited one. It allows for taking soft constraints and vague expert knowledge into account while leaving room for proposing novel ideas for layouts.
- Open Access
- 8 May 2023
- Published by University of Florida George A Smathers Libraries in The International FLAIRS Conference Proceedings
- Vol. 36
Prioritizing Answer Sets Based on Conditional Expert Knowledge
Answer set programming (ASP) and conditional reasoning both are powerful and widely used methodologies from the field of knowledge representation and reasoning (KR) which are capable of formalizing default statements that usually hold but also leave room for exceptions. While ASP convinces with an intuitive rule-based syntax and fast solvers, conditionals come along with a sophisticated preference-based semantics. Here, we combine both approaches by calculating answer sets which we then prioritize based on conditional expert knowledge. We apply our hybrid approach to the task of planning warehouse layouts from the logistics domain which is predestinated for our approach because it involves, on the low-level, many variables and technical framework conditions (like rack positions) and, on the high-level, expert knowledge of the layout designer.
- 8 May 2023
- Published by University of Florida George A Smathers Libraries in The International FLAIRS Conference Proceedings
- Vol. 36
Open AccessPrioritizing Answer Sets Based on Conditional Expert Knowledge
Answer set programming (ASP) and conditional reasoning both are powerful and widely used methodologies from the field of knowledge representation and reasoning (KR) which are capable of formalizing default statements that usually hold but also leave room for exceptions. While ASP convinces with an intuitive rule-based syntax and fast solvers, conditionals come along with a sophisticated preference-based semantics. Here, we combine both approaches by calculating answer sets which we then prioritize based on conditional expert knowledge. We apply our hybrid approach to the task of planning warehouse layouts from the logistics domain which is predestinated for our approach because it involves, on the low-level, many variables and technical framework conditions (like rack positions) and, on the high-level, expert knowledge of the layout designer.
- Open Access
- 19 September 2022
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 23 (5) , 1094-1127
On Establishing Robust Consistency in Answer Set Programs
Answer set programs used in real-world applications often require that the program is usable with different input data. This, however, can often lead to contradictory statements and consequently to an inconsistent program. Causes for potential contradictions in a program are conflicting rules. In this paper, we show how to ensure that a program $\mathcal{P}$ remains non-contradictory given any allowed set of such input data. For that, we introduce the notion of conflict-resolving ${\lambda}$ -extensions. A conflict-resolving ${\lambda}$ -extension for a conflicting rule r is a set ${\lambda}$ of (default) literals such that extending the body of r by ${\lambda}$ resolves all conflicts of r at once. We investigate the properties that suitable ${\lambda}$ -extensions should possess and building on that, we develop a strategy to compute all such conflict-resolving ${\lambda}$ -extensions for each conflicting rule in $\mathcal{P}$ . We show that by implementing a conflict resolution process that successively resolves conflicts using ${\lambda}$ -extensions eventually yields a program that remains non-contradictory given any allowed set of input data.- 19 September 2022
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 23 (5) , 1094-1127
Open AccessOn Establishing Robust Consistency in Answer Set Programs
Answer set programs used in real-world applications often require that the program is usable with different input data. This, however, can often lead to contradictory statements and consequently to an inconsistent program. Causes for potential contradictions in a program are conflicting rules. In this paper, we show how to ensure that a program $\mathcal{P}$ remains non-contradictory given any allowed set of such input data. For that, we introduce the notion of conflict-resolving ${\lambda}$ -extensions. A conflict-resolving ${\lambda}$ -extension for a conflicting rule r is a set ${\lambda}$ of (default) literals such that extending the body of r by ${\lambda}$ resolves all conflicts of r at once. We investigate the properties that suitable ${\lambda}$ -extensions should possess and building on that, we develop a strategy to compute all such conflict-resolving ${\lambda}$ -extensions for each conflicting rule in $\mathcal{P}$ . We show that by implementing a conflict resolution process that successively resolves conflicts using ${\lambda}$ -extensions eventually yields a program that remains non-contradictory given any allowed set of input data. - 29 August 2022
- Published by Springer Nature
- p. 350-362
Towards Causality-Based Conflict Resolution in Answer Set Programs
- 29 August 2022
- Published by Springer Nature
- p. 350-362
Towards Causality-Based Conflict Resolution in Answer Set Programs