no code implementations • 13 Feb 2025 • Alexander Beiser, Susana Hahn, Torsten Schaub
We present clinguin, a system for ASP-driven user interface design.
no code implementations • 6 Feb 2025 • Pedro Cabalar, Jorge Fandinno, Torsten Schaub, Philipp Wanko
We investigate the concept of strong equivalence within the extended framework of Answer Set Programming with constraints.
1 code implementation • 14 Aug 2024 • Masato Kato, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Mutsunori Banbara
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 certain adjacency relation.
no code implementations • 8 Aug 2024 • Susana Hahn, Cedric Martens, Amade Nemes, Henry Otunuya, Javier Romero, Torsten Schaub, Sebastian Schellhorn
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.
1 code implementation • 18 May 2024 • Irumi Sugimori, Katsumi Inoue, Hidetomo Nabeshima, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Mutsunori Banbara
We propose Large Neighborhood Prioritized Search (LNPS) for solving combinatorial optimization problems in Answer Set Programming (ASP).
no code implementations • 18 Mar 2024 • Roland Kaminski, Torsten Schaub, Tran Cao Son, Jiří Švancara, Philipp Wanko
We present alternative approaches to routing and scheduling in Answer Set Programming (ASP), and explore them in the context of Multi-agent Path Finding.
no code implementations • 29 Jan 2024 • Javier Romero, Torsten Schaub, Klaus Strauch
Our question is now whether a constraint learned for particular time steps can be generalized and reused at other time stamps, and ultimately whether this enhances the overall solver performance on temporal problems.
no code implementations • 19 Jan 2024 • Arvid Becker, Pedro Cabalar, Martín Diéguez, Luis Fariñas, Torsten Schaub, Anna Schuhmann
In temporal extensions of Answer Set Programming (ASP) based on linear-time, the behavior of dynamic systems is captured by sequences of states.
no code implementations • 24 Jul 2023 • Pedro Cabalar, Martín Diéguez, François Laferrière, Torsten Schaub
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.
no code implementations • 20 Jul 2023 • Yuya Yamada, Mutsunori Banbara, Katsumi Inoue, Torsten Schaub
The resulting recongo solver covers all metrics of the solver track in the most recent international competition on combinatorial reconfiguration (CoRe Challenge 2022).
no code implementations • 28 Apr 2023 • Arvid Becker, Pedro Cabalar, Martín Diéguez, Torsten Schaub, Anna Schuhmann
We address this by developing a metric extension of linear-time temporal equilibrium logic, in which temporal operators are constrained by intervals over natural numbers.
1 code implementation • 17 Mar 2023 • Susana Hahn, Orkunt Sabuncu, Torsten Schaub, Tobias Stolzmann
We present the ASP-based visualization tool $\textit{clingraph}$ which aims at visualizing various concepts of ASP by means of ASP itself.
1 code implementation • 23 Jun 2022 • Susana Hahn, Tomi Janhunen, Roland Kaminski, Javier Romero, Nicolas Rühling, Torsten Schaub
We present plingo, an extension of the ASP system clingo with various probabilistic reasoning modes.
no code implementations • 11 Feb 2022 • Tran Cao Son, Enrico Pontelli, Marcello Balduccini, Torsten Schaub
Answer Set Planning refers to the use of Answer Set Programming (ASP) to compute plans, i. e., solutions to planning problems, that transform a given state of the world to another state.
no code implementations • 11 Nov 2021 • Jorge Fandinno, Seemran Mishra, Javier Romero, Torsten Schaub
We take up an idea from the folklore of Answer Set Programming, namely that choices, integrity constraints along with a restricted rule format is sufficient for Answer Set Programming.
1 code implementation • 4 Sep 2021 • Pedro Cabalar, Martín Diéguez, Susana Hahn, Torsten Schaub
On the one hand, we elaborate upon a transformation of dynamic formulas into alternating automata that relies on meta-programming in ASP.
1 code implementation • 13 Aug 2021 • Jorge Fandinno, François Laferrière, Javier Romero, Torsten Schaub, Tran Cao Son
We present a general approach to planning with incomplete information in Answer Set Programming (ASP).
no code implementations • 10 Aug 2021 • Roland Kaminski, Torsten Schaub
We provide a comprehensive elaboration of the theoretical foundations of variable instantiation, or grounding, in Answer Set Programming (ASP).
no code implementations • 6 Aug 2021 • Pedro Cabalar, Jorge Fandinno, Torsten Schaub, Philipp Wanko
Over the last decades the development of ASP has brought about an expressive modeling language powered by highly performant systems.
no code implementations • 14 Sep 2020 • Felicidad Aguado, Pedro Cabalar, Martin Dieguez, Gilberto Perez, Torsten Schaub, Anna Schuhmann, Concepcion Vidal
We present an overview on Temporal Logic Programming under the perspective of its application for Knowledge Representation and declarative problem solving.
1 code implementation • 15 Aug 2020 • Roland Kaminski, Javier Romero, Torsten Schaub, Philipp Wanko
This is arguably due to its attractive modeling-grounding-solving workflow that provides an easy approach to problem solving, even for laypersons outside computer science.
no code implementations • 5 Aug 2020 • Pedro Cabalar, Martin Dieguez, Torsten Schaub, Anna Schuhmann
We elaborate upon the theoretical foundations of a metric temporal extension of Answer Set Programming.
1 code implementation • 5 Aug 2020 • Pedro Cabalar, Jorge Fandinno, Javier Garea, Javier Romero, Torsten Schaub
The input language of eclingo uses the syntax extension capabilities of clingo to define subjective literals that, as usual in epistemic logic programs, allow for checking the truth of a regular literal in all or in some of the answer sets of a program.
no code implementations • 5 Aug 2020 • Jorge Fandinno, Vladimir Lifschitz, Patrick Lühne, Torsten Schaub
This paper continues the line of research aimed at investigating the relationship between logic programs and first-order theories.
1 code implementation • 19 Mar 2020 • Dirk Abels, Julian Jordi, Max Ostrowski, Torsten Schaub, Ambra Toletti, Philipp Wanko
We present a solution to real-world train scheduling problems, involving routing, scheduling, and optimization, based on Answer Set Programming (ASP).
no code implementations • 9 Mar 2020 • Pedro Cabalar, Jorge Fandinno, Torsten Schaub, Philipp Wanko
Characterizing hybrid ASP solving in a generic way is difficult since one needs to abstract from specific theories.
no code implementations • 17 Feb 2020 • Pedro Cabalar, Martín Diéguez, Torsten Schaub, François Laferrière
We introduce an implementation of an extension of Answer Set Programming (ASP) with language constructs from dynamic (and temporal) logic that provides an expressive computational framework for modeling dynamic applications.
no code implementations • 17 Feb 2020 • Pedro Cabalar, Jorge Fandinno, Torsten Schaub, Philipp Wanko
We elaborate upon the formal foundations of hybrid Answer Set Programming (ASP) and extend its underlying logical framework with aggregate functions over constraint values and variables.
1 code implementation • 11 Nov 2019 • Francesco Calimeri, Wolfgang Faber, Martin Gebser, Giovambattista Ianni, Roland Kaminski, Thomas Krennwallner, Nicola Leone, Marco Maratea, Francesco Ricca, Torsten Schaub
Standardization of solver input languages has been a main driver for the growth of several areas within knowledge representation and reasoning, fostering the exploitation in actual applications.
no code implementations • 27 Apr 2018 • Martin Gebser, Philipp Obermeier, Michel Ratsch-Heitmann, Mario Runge, Torsten Schaub
We address this prevalent problem in the context of car assembly at Mercedes-Benz Ludwigsfelde GmbH, a large-scale producer of commercial vehicles, where routes for automated guided vehicles used in the production process have traditionally been hand-coded by human engineers.
no code implementations • 26 Apr 2018 • Martin Gebser, Philipp Obermeier, Thomas Otto, Torsten Schaub, Orkunt Sabuncu, Van Nguyen, Tran Cao Son
More precisely, asprilo consists of a versatile benchmark generator, solution checker and visualizer as well as a bunch of reference encodings featuring various ASP techniques.
no code implementations • 26 Apr 2018 • Pedro Cabalar, Roland Kaminski, Torsten Schaub, Anna Schuhmann
In this paper, we introduce an alternative approach to Temporal Answer Set Programming that relies on a variation of Temporal Equilibrium Logic (TEL) for finite traces.
no code implementations • 14 Nov 2017 • Thomas Guyet, Yves Moinard, René Quiniou, Torsten Schaub
We propose encodings of the classical sequential pattern mining tasks within two representations of embeddings (fill-gaps vs skip-gaps) and for various kinds of patterns: frequent, constrained and condensed.
no code implementations • 13 Jul 2017 • Tomi Janhunen, Roland Kaminski, Max Ostrowski, Torsten Schaub, Sebastian Schellhorn, Philipp Wanko
The recent series 5 of the ASP system clingo provides generic means to enhance basic Answer Set Programming (ASP) with theory reasoning capabilities.
no code implementations • 27 May 2017 • Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub
We introduce a new flexible paradigm of grounding and solving in Answer Set Programming (ASP), which we refer to as multi-shot ASP solving, and present its implementation in the ASP system clingo.
no code implementations • 12 May 2017 • Mutsunori Banbara, Benjamin Kaufmann, Max Ostrowski, Torsten Schaub
While its predecessors rely on a black-box approach to hybrid solving by integrating the CP solver gecode, the new clingcon system pursues a lazy approach using dedicated constraint propagators to extend propagation in the underlying ASP solver clasp.
no code implementations • 12 Mar 2016 • Martin Gebser, Roland Kaminski, Torsten Schaub
In particular, we provide a series of algorithms detailing the treatment of recursive aggregates and illustrate this by a running example.
no code implementations • 7 May 2014 • Holger Hoos, Marius Lindauer, Torsten Schaub
The claspfolio 2 solver framework supports various feature generators, solver selection approaches, solver portfolios, as well as solver-schedule-based pre-solving techniques.
no code implementations • 6 Jan 2014 • Holger Hoos, Roland Kaminski, Marius Lindauer, Torsten Schaub
Although Boolean Constraint Technology has made tremendous progress over the last decade, the efficacy of state-of-the-art solvers is known to vary considerably across different types of problem instances and is known to depend strongly on algorithm parameters.
no code implementations • 20 Dec 2013 • Martin Gebser, Philipp Obermeier, Torsten Schaub
Reactive answer set programming has paved the way for incorporating online information into operative solving processes.
no code implementations • 20 Dec 2013 • Mutsunori Banbara, Martin Gebser, Katsumi Inoue, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Matthias Weise
We here develop an alternative approach based on ASP.
no code implementations • 28 Jul 2013 • Benjamin Andres, Philipp Obermeier, Orkunt Sabuncu, Torsten Schaub, David Rajaratnam
Knowledge representation and reasoning capacities are vital to cognitive robotics because they provide higher level cognitive functions for reasoning about actions, environments, goals, perception, etc.