taasp 2022

-->

Contact: taasp2022<at>easychair.org

Tools: Print page


Programme


Schedule 28.11.2022 in Seminarraum Gödel

Time Title
12:30 Welcome
12:40-13:40 Invited talk by Franz Wotawa
13:45-14:05 Ramsha Ali, Mohammed El-Kholany and Martin Gebser: Flexible Job-shop Scheduling for Semiconductor Manufacturing with Hybrid ASP: Extended Abstract
14:05-14:25 Mohammed El-Kholany: Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling (invited)
14:25-14:45 Susana Hahn, Tomi Janhunen, Roland Kaminski, Javier Romero, Nicolas Rühling and Torsten Schaub: plingo: A system for probabilistic reasoning in clingo based on lpmln
14:45-15:20 Coffee break
15:20-15:40 Alice Tarzariol, Martin Gebser, Mark Law and Konstantin Schekotihin: Efficient lifting of symmetry breaking constraints for complex combinatorial problems: Extended Abstract
15:40-16:00 Zeynep G. Saribatur and Stefan Woltran: Characterizations for Simplifying ASP Programs under Abstraction: Working Abstract
16:05-17:05 Invited talk by Axel Polleres
17:10-17:20 Spotlight session
  • Benjamin Kovács: Solving Industrial Scheduling Problems using Hybrid Algorithms
  • Javier Romero
  • Henry Otunuya
  • Arvid Becker: Equivalences in MTL
  • Tobias Geibinger: Towards Explanations for Logic Programs with Abstract Constraint Atoms
17:20 End of day 1
19:00-23:00 Social Program: Stöckl im Park

Schedule 29.11.2022 in Seminarraum Gödel

Time Title
09:00-09:20 Richard Comploi-Taupe, Susana Hahn, Gottfried Schenner and Torsten Schaub: Challenges of Developing an API for Interactive Configuration using ASP
09:20-09:40 Viktor Besin, Markus Hecher, Kaan Unalan and Stefan Woltran: Body-Decoupled Grounding via Solving: A Novel Approach on the ASP Bottleneck
09:40-10:00 Thomas Eiter, Tobias Geibinger, Nelson Higuera, Nysret Musliu, Johannes Oetsch and Daria Stepanova: ALASPO: An Adaptive Large-Neighbourhood ASP Optimiser (Extended Abstract)
10:00-10:20 Jan Behrens, Philipp Obermeier, Torsten Schaub, Klaus Strauch and Etienne Tignon: A Survey of ASP and SAT Encodings for Multi-Agent Pathfinding: Working Abstract
10:20-11:00 Coffee break
11:00-11:20 Nelson Higuera and Thomas Eiter: Elaboration for Neurosymbolic Computation
11:20-11:40 Richard Comploi-Taupe: Towards Inductive Learning of Domain-Specific Heuristics for ASP
11:40-12:00 François Laferrière, Torsten Schaub, Martín Diéguez and Pedro Cabalar: Formal Foundations of Incremental Dynamic Answer Set Programming (Extended Abstract)
12:00-12:20 Arvid Becker, Pedro Cabalar, Martín Diéguez, Luis Farinas, Anna Schuhmann and Torsten Schaub: Metric Dynamic Equilibrium Logic
12:20-13:40 Lunch break
13:40-14:00 Christian Hatschka, Agata Ciabattoni and Thomas Eiter: Representing Normative Reasoning in Answer Set Programming Using Weak Constraints
14:00-14:20 Yisong Wang, Thomas Eiter, Yuanlin Zhang and Fangzhen Lin: Witnesses for Answer Sets of Logic Programs (Extended Abstract)
14:20-14:40 Masood Feyzbakhsh Rankooh: Efficient Computation of Answer Sets via SAT Modulo Acyclicity and Vertex Elimination (invited)
14:40-15:00 Tomi Janhunen: Applying Answer Set Optimization to Preventive Maintenance Scheduling for Rotating Machinery (invited)
15:00 End of workshop


Invited Speakers


Franz Wotawa


TU Graz

Title: Using ASP for Model-based Diagnosis

Abstract: In my talk, I will outline the use of answer set programming for diagnosis, i.e., the localization of faults. In particular, I will show how diagnosis can be coded in ASP utilizing a small example. Furthermore, I will show the basic principles behind modeling using ASP and present experimental results obtained when computing diagnoses for various systems. I will also compare the results with the ones obtained using specialized diagnosis algorithms.

[paper]

Axel Polleres


WU Wien

Title: Build a Better Life by Translating Problems to Datalog and ASP

Abstract:TBA