@misc{SchaubWoltran2018,
  author    = {Schaub, Torsten H. and Woltran, Stefan},
  title     = {Special issue on answer set programming},
  series = {K{\"u}nstliche Intelligenz},
  volume    = {32},
  journal   = {K{\"u}nstliche Intelligenz},
  number    = {2-3},
  publisher = {Springer},
  address   = {Heidelberg},
  issn      = {0933-1875},
  doi       = {10.1007/s13218-018-0554-8},
  pages     = {101 -- 103},
  year      = {2018},
  language  = {en}
}
@misc{SchaepersNiemuellerLakemeyeretal.2018,
  author    = {Sch{\"a}pers, Bj{\"o}rn and Niemueller, Tim and Lakemeyer, Gerhard and Gebser, Martin and Schaub, Torsten H.},
  title     = {ASP-Based Time-Bounded Planning for Logistics Robots},
  series = {Twenty-Eighth International Conference on Automated Planning and Scheduling (ICAPS 2018)},
  journal   = {Twenty-Eighth International Conference on Automated Planning and Scheduling (ICAPS 2018)},
  publisher = {ASSOC Association for the Advancement of Artificial Intelligence},
  address   = {Palo Alto},
  issn      = {2334-0835},
  pages     = {509 -- 517},
  year      = {2018},
  abstract  = {Manufacturing industries are undergoing a major paradigm shift towards more autonomy. Automated planning and scheduling then becomes a necessity. The Planning and Execution Competition for Logistics Robots in Simulation held at ICAPS is based on this scenario and provides an interesting testbed. However, the posed problem is challenging as also demonstrated by the somewhat weak results in 2017. The domain requires temporal reasoning and dealing with uncertainty. We propose a novel planning system based on Answer Set Programming and the Clingo solver to tackle these problems and incentivize robot cooperation. Our results show a significant performance improvement, both, in terms of lowering computational requirements and better game metrics.},
  language  = {en}
}
@misc{LifschitzSchaubWoltran2018,
  author    = {Lifschitz, Vladimir and Schaub, Torsten H. and Woltran, Stefan},
  title     = {Interview with Vladimir Lifschitz},
  series = {K{\"u}nstliche Intelligenz},
  volume    = {32},
  journal   = {K{\"u}nstliche Intelligenz},
  number    = {2-3},
  publisher = {Springer},
  address   = {Heidelberg},
  issn      = {0933-1875},
  doi       = {10.1007/s13218-018-0552-x},
  pages     = {213 -- 218},
  year      = {2018},
  abstract  = {This interview with Vladimir Lifschitz was conducted by Torsten Schaub at the University of Texas at Austin in August 2017. The question set was compiled by Torsten Schaub and Stefan Woltran.},
  language  = {en}
}
@misc{BrewkaSchaubWoltran2018,
  author    = {Brewka, Gerhard and Schaub, Torsten H. and Woltran, Stefan},
  title     = {Interview with Gerhard Brewka},
  series = {K{\"u}nstliche Intelligenz},
  volume    = {32},
  journal   = {K{\"u}nstliche Intelligenz},
  number    = {2-3},
  publisher = {Springer},
  address   = {Heidelberg},
  issn      = {0933-1875},
  doi       = {10.1007/s13218-018-0549-5},
  pages     = {219 -- 221},
  year      = {2018},
  abstract  = {This interview with Gerhard Brewka was conducted by correspondance in May 2018. The question set was compiled by Torsten Schaub and Stefan Woltran.},
  language  = {en}
}
@misc{NeubauerHaubeltWankoetal.2018,
  author    = {Neubauer, Kai and Haubelt, Christian and Wanko, Philipp and Schaub, Torsten H.},
  title     = {Utilizing quad-trees for efficient design space exploration with partial assignment evaluation},
  series = {2018 23rd Asia and South Pacific Design Automation Conference (ASP-DAC)},
  journal   = {2018 23rd Asia and South Pacific Design Automation Conference (ASP-DAC)},
  publisher = {IEEE},
  address   = {New York},
  isbn      = {978-1-5090-0602-1},
  issn      = {2153-6961},
  doi       = {10.1109/ASPDAC.2018.8297362},
  pages     = {434 -- 439},
  year      = {2018},
  abstract  = {Recently, it has been shown that constraint-based symbolic solving techniques offer an efficient way for deciding binding and routing options in order to obtain a feasible system level implementation. In combination with various background theories, a feasibility analysis of the resulting system may already be performed on partial solutions. That is, infeasible subsets of mapping and routing options can be pruned early in the decision process, which fastens the solving accordingly. However, allowing a proper design space exploration including multi-objective optimization also requires an efficient structure for storing and managing non-dominated solutions. In this work, we propose and study the usage of the Quad-Tree data structure in the context of partial assignment evaluation during system synthesis. Out experiments show that unnecessary dominance checks can be avoided, which indicates a preference of Quad-Trees over a commonly used list-based implementation for large combinatorial optimization problems.},
  language  = {en}
}
@misc{BosserCabalarDieguezetal.2018,
  author    = {Bosser, Anne-Gwenn and Cabalar, Pedro and Dieguez, Martin and Schaub, Torsten H.},
  title     = {Introducing temporal stable models for linear dynamic logic},
  series = {16th International Conference on Principles of Knowledge Representation and Reasoning},
  journal   = {16th International Conference on Principles of Knowledge Representation and Reasoning},
  publisher = {ASSOC Association for the Advancement of Artificial Intelligence},
  address   = {Palo Alto},
  pages     = {12 -- 21},
  year      = {2018},
  abstract  = {We propose a new temporal extension of the logic of Here-and-There (HT) and its equilibria obtained by combining it with dynamic logic over (linear) traces. Unlike previous temporal extensions of HT based on linear temporal logic, the dynamic logic features allow us to reason about the composition of actions. For instance, this can be used to exercise fine grained control when planning in robotics, as exemplified by GOLOG. In this paper, we lay the foundations of our approach, and refer to it as Linear Dynamic Equilibrium Logic, or simply DEL. We start by developing the formal framework of DEL and provide relevant characteristic results. Among them, we elaborate upon the relationships to traditional linear dynamic logic and previous temporal extensions of HT.},
  language  = {en}
}
@misc{CabalarFandinnoSchaubetal.2019,
  author    = {Cabalar, Pedro and Fandinno, Jorge and Schaub, Torsten H. and Schellhorn, Sebastian},
  title     = {Lower Bound Founded Logic of Here-and-There},
  series = {Logics in Artificial Intelligence},
  volume    = {11468},
  journal   = {Logics in Artificial Intelligence},
  publisher = {Springer},
  address   = {Cham},
  isbn      = {978-3-030-19570-0},
  issn      = {0302-9743},
  doi       = {10.1007/978-3-030-19570-0_34},
  pages     = {509 -- 525},
  year      = {2019},
  abstract  = {A distinguishing feature of Answer Set Programming is that all atoms belonging to a stable model must be founded. That is, an atom must not only be true but provably true. This can be made precise by means of the constructive logic of Here-and-There, whose equilibrium models correspond to stable models. One way of looking at foundedness is to regard Boolean truth values as ordered by letting true be greater than false. Then, each Boolean variable takes the smallest truth value that can be proven for it. This idea was generalized by Aziz to ordered domains and applied to constraint satisfaction problems. As before, the idea is that a, say integer, variable gets only assigned to the smallest integer that can be justified. In this paper, we present a logical reconstruction of Aziz' idea in the setting of the logic of Here-and-There. More precisely, we start by defining the logic of Here-and-There with lower bound founded variables along with its equilibrium models and elaborate upon its formal properties. Finally, we compare our approach with related ones and sketch future work.},
  language  = {en}
}