Torsten Schaub
YOU?
Author Swipe
View article: Towards Constraint Temporal Answer Set Programming
Towards Constraint Temporal Answer Set Programming Open
Reasoning about dynamic systems with a fine-grained temporal and numeric resolution presents significant challenges for logic-based approaches like Answer Set Programming (ASP). To address this, we introduce and elaborate upon a novel temp…
View article: ANTHEM 2.0: Automated Reasoning for Answer Set Programming
ANTHEM 2.0: Automated Reasoning for Answer Set Programming Open
ANTHEM 2.0 is a tool to aid in the verification of logic programs written in an expressive fragment of CLINGO ’s input language named MINI-GRINGO, which includes arithmetic operations and simple choice rules but not aggregates. It can tran…
View article: The ASP-based Nurse Scheduling System at the University of Yamanashi Hospital
The ASP-based Nurse Scheduling System at the University of Yamanashi Hospital Open
We present the design principles of a nurse scheduling system built using Answer Set Programming (ASP) and successfully deployed at the University of Yamanashi Hospital. Nurse scheduling is a complex optimization problem requiring the reco…
View article: Compiling Metric Temporal Answer Set Programming
Compiling Metric Temporal Answer Set Programming Open
We develop a computational approach to Metric Answer Set Programming (ASP) to allow for expressing quantitative temporal constrains, like durations and deadlines. A central challenge is to maintain scalability when dealing with fine-graine…
View article: Towards Industrial-scale Product Configuration
Towards Industrial-scale Product Configuration Open
We address the challenge of product configuration in the context of increasing customer demand for diverse and complex products. We propose a solution through a curated selection of product model benchmarks formulated in the COOM language,…
View article: ASP-driven User-interaction with Clinguin
ASP-driven User-interaction with Clinguin Open
We present clinguin, a system for ASP-driven user interface design. Clinguin streamlines the development of user interfaces for ASP developers by letting them build interactive prototypes directly in ASP, eliminating the need for separate …
View article: On the Generalization of Learned Constraints for ASP Solving in Temporal Domains
On the Generalization of Learned Constraints for ASP Solving in Temporal Domains Open
The representation of a temporal problem in answer set programming (ASP) usually boils down to using copies of variables and constraints, one for each time stamp, no matter whether it is directly encoded or expressed via an action or tempo…
View article: Strong Equivalence in Answer Set Programming with Constraints
Strong Equivalence in Answer Set Programming with Constraints Open
We investigate the concept of strong equivalence within the extended framework of Answer Set Programming with constraints. Two groups of rules are considered strongly equivalent if, informally speaking, they have the same meaning in any co…
View article: Plingo: A System for Probabilistic Reasoning in Answer Set Programming
Plingo: A System for Probabilistic Reasoning in Answer Set Programming Open
We present plingo , an extension of the answer set programming (ASP) system clingo that incorporates various probabilistic reasoning modes. Plingo is based on $\textit{Lpmln}^{\pm }$ , a simple variant of the probabilistic language Lpmln ,…
View article: Large Neighborhood Prioritized Search for Combinatorial Optimization with Answer Set Programming
Large Neighborhood Prioritized Search for Combinatorial Optimization with Answer Set Programming Open
We propose Large Neighborhood Prioritized Search (LNPS) for solving combinatorial optimization problems in Answer Set Programming (ASP). LNPS is a metaheuristic that starts with an initial solution and then iteratively tries to find better…
View article: Explaining artificial neural networks using answer set programming
Explaining artificial neural networks using answer set programming Open
International audience
View article: Dominating Set Reconfiguration with Answer Set Programming
Dominating Set Reconfiguration with Answer Set Programming Open
The dominating set reconfiguration problem is defined as determining, for a given dominating set problem and two among its feasible solutions, whether one is reachable from the other via a sequence of feasible solutions subject to a certai…
View article: Reasoning about Study Regulations in Answer Set Programming
Reasoning about Study Regulations in Answer Set Programming Open
We are interested in automating reasoning with and about study regulations, catering to various stakeholders, ranging from administrators, over faculty, to students at different stages. Our work builds on an extensive analysis of various s…
View article: Reasoning About Study Regulations in Answer Set Programming
Reasoning About Study Regulations in Answer Set Programming Open
We are interested in automating reasoning with and about study regulations, catering to various stakeholders, ranging from administrators, over faculty, to students at different stages. Our work builds on an extensive analysis of various s…
View article: Dominating Set Reconfiguration with Answer Set Programming
Dominating Set Reconfiguration with Answer Set Programming Open
The dominating set reconfiguration problem is defined as determining, for a given dominating set problem and two among its feasible solutions, whether one is reachable from the other via a sequence of feasible solutions subject to a certai…
View article: Large Neighborhood Prioritized Search for Combinatorial Optimization with Answer Set Programming
Large Neighborhood Prioritized Search for Combinatorial Optimization with Answer Set Programming Open
We propose Large Neighborhood Prioritized Search (LNPS) for solving combinatorial optimization problems in Answer Set Programming (ASP). LNPS is a metaheuristic that starts with an initial solution and then iteratively tries to find better…
View article: Metric Temporal Equilibrium Logic over Timed Traces
Metric Temporal Equilibrium Logic over Timed Traces Open
In temporal extensions of answer set programming (ASP) based on linear time, the behavior of dynamic systems is captured by sequences of states. While this representation reflects their relative order, it abstracts away the specific times …
View article: Routing and Scheduling in Answer Set Programming applied to Multi-Agent Path Finding: Preliminary Report
Routing and Scheduling in Answer Set Programming applied to Multi-Agent Path Finding: Preliminary Report Open
We present alternative approaches to routing and scheduling in Answer Set Programming (ASP), and explore them in the context of Multi-agent Path Finding. The idea is to capture the flow of time in terms of partial orders rather than time s…
View article: Investigating Methods for ASPmT-Based Design Space Exploration in Evolutionary Product Design
Investigating Methods for ASPmT-Based Design Space Exploration in Evolutionary Product Design Open
Nowadays, product development is challenged by increasing system complexity and stringent time-to-market. To handle the demanding market requirements, knowledge from prior product generations is used to derive new, but partially similar pr…
View article: <i>Clingraph</i>: A System for ASP-based Visualization
<i>Clingraph</i>: A System for ASP-based Visualization Open
We present the Answer Set Programming (ASP)-based visualization tool clingraph , which aims at visualizing various concepts of ASP by means of ASP itself. This idea traces back to the aspviz tool and clingraph redevelops and extends it in …
View article: On the generalization of learned constraints for ASP solving in temporal domains
On the generalization of learned constraints for ASP solving in temporal domains Open
The representation of a dynamic problem in ASP usually boils down to using copies of variables and constraints, one for each time stamp, no matter whether it is directly encoded or via an action or temporal language. The multiplication of …
View article: Metric Dynamic Equilibrium Logic
Metric Dynamic Equilibrium Logic Open
In temporal extensions of Answer Set Programming (ASP) based on linear-time, the behavior of dynamic systems is captured by sequences of states. While this representation reflects their relative order, it abstracts away the specific times …
View article: Metric dynamic equilibrium logic
Metric dynamic equilibrium logic Open
[Abstract]: In temporal extensions of Answer Set Programming (ASP) based on linear-time, the behaviour of dynamic systems is captured by sequences of states. While this representation reflects their relative order, it abstracts away the sp…
View article: Past-present temporal programs over finite traces
Past-present temporal programs over finite traces Open
Extensions of Answer Set Programming with language constructs from temporal logics, such as temporal equilibrium logic over finite traces (TELf), provide an expressive computational framework for modeling dynamic applications. In this pape…
View article: Bounded Combinatorial Reconfiguration with Answer Set Programming
Bounded Combinatorial Reconfiguration with Answer Set Programming Open
We develop an approach called bounded combinatorial reconfiguration for solving combinatorial reconfiguration problems based on Answer Set Programming (ASP). The general task is to study the solution spaces of source combinatorial problems…
View article: Multi-Agent Pathfinding with Predefined Paths: To Wait, or Not to Wait, That Is the Question [Extended Abstract]
Multi-Agent Pathfinding with Predefined Paths: To Wait, or Not to Wait, That Is the Question [Extended Abstract] Open
Multi-agent pathfinding is the task of navigating a set of agents in a shared environment without collisions. Finding an optimal plan is a computationally hard problem, therefore, one may want to sacrifice optimality for faster computation…
View article: Metric Temporal Equilibrium Logic over Timed Traces
Metric Temporal Equilibrium Logic over Timed Traces Open
In temporal extensions of Answer Set Programming (ASP) based on linear-time, the behavior of dynamic systems is captured by sequences of states. While this representation reflects their relative order, it abstracts away the specific times …
View article: Solving an Industrial-Scale Warehouse Delivery Problem with Answer Set Programming Modulo Difference Constraints
Solving an Industrial-Scale Warehouse Delivery Problem with Answer Set Programming Modulo Difference Constraints Open
A warehouse delivery problem consists of a set of robots that undertake delivery jobs within a warehouse. Items are moved around the warehouse in response to events. A solution to a warehouse delivery problem is a collision-free schedule o…