@article{BrainGebserPuehreretal.2007, author = {Brain, Martin and Gebser, Martin and P{\"u}hrer, J{\"o}rg and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan}, title = {"That is illogical, Captain!" : the debugging support tool spock for answer-set programs ; system description}, year = {2007}, language = {en} } @article{BrainGebserPuehreretal.2007, author = {Brain, Martin and Gebser, Martin and P{\"u}hrer, J{\"o}rg and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan}, title = {Debugging ASP programs by means of ASP}, isbn = {978-3-540- 72199-4}, year = {2007}, language = {en} } @article{GebserSchaubTompitsetal.2007, author = {Gebser, Martin and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan}, title = {Alternative characterizations for program equivalence under aswer-set semantics : a preliminary report}, year = {2007}, 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} } @article{AngerGebserSchaub2006, author = {Anger, Christian and Gebser, Martin and Schaub, Torsten H.}, title = {Approaching the core of unfounded sets}, year = {2006}, language = {en} } @article{AngerGebserJanhunenetal.2006, author = {Anger, Christian and Gebser, Martin and Janhunen, Tomi and Schaub, Torsten H.}, title = {What's a head without a body?}, year = {2006}, language = {en} } @article{GebserSchaubThiele2007, author = {Gebser, Martin and Schaub, Torsten H. and Thiele, Sven}, title = {GrinGo : a new grounder for answer set programming}, isbn = {978-3-540- 72199-4}, year = {2007}, language = {en} } @article{AngerGebserLinkeetal.2005, author = {Anger, Christian and Gebser, Martin and Linke, Thomas and Neumann, Andre and Schaub, Torsten H.}, title = {The nomore++ approach to answer set solving}, year = {2005}, language = {en} } @article{AngerGebserLinkeetal.2005, author = {Anger, Christian and Gebser, Martin and Linke, Thomas and Neumann, Andre and Schaub, Torsten H.}, title = {The nomore++ approach to answer set solving}, year = {2005}, language = {en} } @article{GebserLiuNamasivayametal.2007, author = {Gebser, Martin and Liu, Lengning and Namasivayam, Gayathri and Neumann, Andr{\´e} and Schaub, Torsten H. and Truszczynski, Miroslaw}, title = {The first answer set programming system competition}, isbn = {978-3-540- 72199-4}, year = {2007}, language = {en} } @article{GebserObermeierSchaubetal.2018, author = {Gebser, Martin and Obermeier, Philipp and Schaub, Torsten H. and Ratsch-Heitmann, Michel and Runge, Mario}, title = {Routing driverless transport vehicles in car assembly with answer set programming}, series = {Theory and practice of logic programming}, volume = {18}, journal = {Theory and practice of logic programming}, number = {3-4}, publisher = {Cambridge Univ. Press}, address = {New York}, issn = {1471-0684}, doi = {10.1017/S1471068418000182}, pages = {520 -- 534}, year = {2018}, abstract = {Automated storage and retrieval systems are principal components of modern production and warehouse facilities. In particular, automated guided vehicles nowadays substitute human-operated pallet trucks in transporting production materials between storage locations and assembly stations. While low-level control systems take care of navigating such driverless vehicles along programmed routes and avoid collisions even under unforeseen circumstances, in the common case of multiple vehicles sharing the same operation area, the problem remains how to set up routes such that a collection of transport tasks is accomplished most effectively. 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. Such adhoc methods may suffice as long as a running production process remains in place, while any change in the factory layout or production targets necessitates tedious manual reconfiguration, not to mention the missing portability between different production plants. Unlike this, we propose a declarative approach based on Answer Set Programming to optimize the routes taken by automated guided vehicles for accomplishing transport tasks. The advantages include a transparent and executable problem formalization, provable optimality of routes relative to objective criteria, as well as elaboration tolerance towards particular factory layouts and production targets. Moreover, we demonstrate that our approach is efficient enough to deal with the transport tasks evolving in realistic production processes at the car factory of Mercedes-Benz Ludwigsfelde GmbH.}, language = {en} } @article{GebserKaminskiKaufmannetal.2018, author = {Gebser, Martin and Kaminski, Roland and Kaufmann, Benjamin and L{\"u}hne, Patrick and Obermeier, Philipp and Ostrowski, Max and Romero Davila, Javier and Schaub, Torsten H. and Schellhorn, Sebastian and Wanko, Philipp}, title = {The Potsdam Answer Set Solving Collection 5.0}, 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-0528-x}, pages = {181 -- 182}, year = {2018}, abstract = {The Potsdam answer set solving collection, or Potassco for short, bundles various tools implementing and/or applying answer set programming. The article at hand succeeds an earlier description of the Potassco project published in Gebser et al. (AI Commun 24(2):107-124, 2011). Hence, we concentrate in what follows on the major features of the most recent, fifth generation of the ASP system clingo and highlight some recent resulting application systems.}, language = {en} } @article{DimopoulosGebserLuehneetal.2019, author = {Dimopoulos, Yannis and Gebser, Martin and L{\"u}hne, Patrick and Romero Davila, Javier and Schaub, Torsten H.}, title = {plasp 3}, series = {Theory and practice of logic programming}, volume = {19}, journal = {Theory and practice of logic programming}, number = {3}, publisher = {Cambridge Univ. Press}, address = {New York}, issn = {1471-0684}, doi = {10.1017/S1471068418000583}, pages = {477 -- 504}, year = {2019}, abstract = {We describe the new version of the Planning Domain Definition Language (PDDL)-to-Answer Set Programming (ASP) translator plasp. First, it widens the range of accepted PDDL features. Second, it contains novel planning encodings, some inspired by Satisfiability Testing (SAT) planning and others exploiting ASP features such as well-foundedness. All of them are designed for handling multivalued fluents in order to capture both PDDL as well as SAS planning formats. Third, enabled by multishot ASP solving, it offers advanced planning algorithms also borrowed from SAT planning. As a result, plasp provides us with an ASP-based framework for studying a variety of planning techniques in a uniform setting. Finally, we demonstrate in an empirical analysis that these techniques have a significant impact on the performance of ASP planning.}, language = {en} } @article{GebserKaufmannNeumannetal.2007, author = {Gebser, Martin and Kaufmann, Benjamin and Neumann, Andr{\´e} and Schaub, Torsten H.}, title = {Conflict-driven answer set enumeration}, isbn = {978-3-540- 72199-4}, year = {2007}, language = {en} } @article{GebserLeeLierler2007, author = {Gebser, Martin and Lee, Joohyung and Lierler, Yuliya}, title = {Head-elementary-set-free logic programs}, isbn = {978-3-540- 72199-4}, year = {2007}, language = {en} } @article{GebserKaufmannNeumannetal.2007, author = {Gebser, Martin and Kaufmann, Benjamin and Neumann, Andr{\´e} and Schaub, Torsten H.}, title = {Conflict-driven answer set solving}, isbn = {978-1-57735-323-2}, year = {2007}, language = {en} } @article{GebserGharibSchaub2007, author = {Gebser, Martin and Gharib, Mona and Schaub, Torsten H.}, title = {Incremental answer sets and their computation}, year = {2007}, language = {en} } @article{GebserSchaub2007, author = {Gebser, Martin and Schaub, Torsten H.}, title = {Generic tableaux for answer set programming}, year = {2007}, language = {en} } @article{GebserKaufmannNeumannetal.2007, author = {Gebser, Martin and Kaufmann, Benjamin and Neumann, Andr{\´e} and Schaub, Torsten H.}, title = {Clasp : a conflict-driven answer set solver}, isbn = {978-3-540- 72199-4}, year = {2007}, language = {en} } @article{GebserSchaub2013, author = {Gebser, Martin and Schaub, Torsten H.}, title = {Tableau calculi for logic programs under answer set semantics}, series = {ACM transactions on computational logic}, volume = {14}, journal = {ACM transactions on computational logic}, number = {2}, publisher = {Association for Computing Machinery}, address = {New York}, issn = {1529-3785}, doi = {10.1145/2480759.2480767}, pages = {40}, year = {2013}, abstract = {We introduce formal proof systems based on tableau methods for analyzing computations in Answer Set Programming (ASP). Our approach furnishes fine-grained instruments for characterizing operations as well as strategies of ASP solvers. The granularity is detailed enough to capture a variety of propagation and choice methods of algorithms used for ASP solving, also incorporating SAT-based and conflict-driven learning approaches to some extent. This provides us with a uniform setting for identifying and comparing fundamental properties of ASP solving approaches. In particular, we investigate their proof complexities and show that the run-times of best-case computations can vary exponentially between different existing ASP solvers. Apart from providing a framework for comparing ASP solving approaches, our characterizations also contribute to their understanding by pinning down the constitutive atomic operations. Furthermore, our framework is flexible enough to integrate new inference patterns, and so to study their relation to existing ones. To this end, we generalize our approach and provide an extensible basis aiming at a modular incorporation of additional language constructs. This is exemplified by augmenting our basic tableau methods with cardinality constraints and disjunctions.}, language = {en} }