default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhilipp Wanko
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j11]Luise Müller
, Philipp Wanko, Christian Haubelt, Torsten Schaub:
Investigating Methods for ASPmT-Based Design Space Exploration in Evolutionary Product Design. Int. J. Parallel Program. 52(1-2): 59-92 (2024)- 2023
- [j10]Christian Haubelt, Luise Müller, Kai Neubauer, Torsten Schaub, Philipp Wanko:
Evolutionary System Design with Answer Set Programming. Algorithms 16(4): 179 (2023) - [j9]Pedro Cabalar, Jorge Fandinno, Torsten Schaub, Philipp Wanko:
On the Semantics of Hybrid ASP Systems Based on Clingo. Algorithms 16(4): 185 (2023) - [j8]David Rajaratnam, Torsten Schaub, Philipp Wanko, Kai Chen, Sirui Liu, Tran Cao Son:
Solving an Industrial-Scale Warehouse Delivery Problem with Answer Set Programming Modulo Difference Constraints. Algorithms 16(4): 216 (2023) - [j7]Roland Kaminski, Javier Romero, Torsten Schaub, Philipp Wanko:
How to Build Your Own ASP-based System?! Theory Pract. Log. Program. 23(1): 299-361 (2023) - 2021
- [j6]Dirk Abels, Julian Jordi, Max Ostrowski, Torsten Schaub, Ambra Toletti, Philipp Wanko:
Train Scheduling with Hybrid Answer Set Programming. Theory Pract. Log. Program. 21(3): 317-347 (2021) - 2019
- [j5]Mutsunori Banbara, Katsumi Inoue, Benjamin Kaufmann, Tenda Okimoto, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Philipp Wanko:
teaspoon : solving the curriculum-based course timetabling problems with answer set programming. Ann. Oper. Res. 275(1): 3-37 (2019) - [j4]Clémence Frioux, Torsten Schaub, Sebastian Schellhorn, Anne Siegel, Philipp Wanko:
Hybrid metabolic network completion. Theory Pract. Log. Program. 19(1): 83-108 (2019) - 2018
- [j3]Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Patrick Lühne, Philipp Obermeier, Max Ostrowski, Javier Romero, Torsten Schaub, Sebastian Schellhorn, Philipp Wanko:
The Potsdam Answer Set Solving Collection 5.0. Künstliche Intell. 32(2-3): 181-182 (2018) - [j2]Christian Haubelt, Kai Neubauer, Torsten Schaub, Philipp Wanko:
Design Space Exploration with Answer Set Programming. Künstliche Intell. 32(2-3): 205-206 (2018) - 2017
- [j1]Tomi Janhunen, Roland Kaminski, Max Ostrowski, Sebastian Schellhorn, Philipp Wanko, Torsten Schaub:
Clingo goes linear constraints over reals and integers. Theory Pract. Log. Program. 17(5-6): 872-888 (2017)
Conference and Workshop Papers
- 2024
- [c18]Joachim Baumeister, Konstantin Herud, Max Ostrowski, Jochen Reutelshöfer, Nicolas Rühling, Torsten Schaub, Philipp Wanko:
Towards Industrial-Scale Product Configuration. LPNMR 2024: 71-84 - 2023
- [c17]Jan Behrens, Roland Kaminski, Torsten Schaub, Tran Cao Son, Jiri Svancara, Philipp Wanko:
Routing and Scheduling in different ways: Abridged Preliminary Report. ICLP Workshops 2023 - [c16]Jirí Svancara, Etienne Tignon, Roman Barták, Torsten Schaub, Philipp Wanko, Roland Kaminski:
Multi-Agent Pathfinding with Predefined Paths: To Wait, or Not to Wait, That Is the Question [Extended Abstract]. SOCS 2023: 185-186 - 2020
- [c15]Pedro Cabalar, Jorge Fandinno, Torsten Schaub, Philipp Wanko:
An ASP Semantics for Constraints Involving Conditional Aggregates. ECAI 2020: 664-671 - [c14]Pedro Cabalar, Jorge Fandinno, Torsten Schaub, Philipp Wanko:
A Uniform Treatment of Aggregates and Constraints in Hybrid ASP. KR 2020: 193-202 - 2019
- [c13]Dirk Abels, Julian Jordi, Max Ostrowski, Torsten Schaub, Ambra Toletti, Philipp Wanko:
Train Scheduling with Hybrid ASP. LPNMR 2019: 3-17 - 2018
- [c12]Kai Neubauer, Christian Haubelt, Philipp Wanko, Torsten Schaub:
Utilizing quad-trees for efficient design space exploration with partial assignment evaluation. ASP-DAC 2018: 434-439 - [c11]Kai Neubauer, Christian Haubelt, Philipp Wanko, Torsten Schaub:
On leveraging approximations for exact system-level design space exploration: work-in-progress. CODES+ISSS 2018: 15 - [c10]Kai Neubauer, Philipp Wanko, Torsten Schaub, Christian Haubelt:
Exact multi-objective design space exploration using ASPmT. DATE 2018: 257-260 - [c9]Kai Neubauer, Christian Haubelt, Philipp Wanko, Torsten Schaub:
Systematic Test Case Instance Generation for the Assessment of System-level Design Space Exploration Approaches. MBMV 2018 - 2017
- [c8]Kai Neubauer, Philipp Wanko, Torsten Schaub, Christian Haubelt:
Enhancing symbolic system synthesis through ASPmT with partial assignment evaluation. DATE 2017: 306-309 - [c7]Clémence Frioux, Torsten Schaub, Sebastian Schellhorn, Anne Siegel, Philipp Wanko:
Hybrid Metabolic Network Completion. LPNMR 2017: 308-321 - [c6]Tomi Janhunen, Roland Kaminski, Max Ostrowski, Torsten Schaub, Sebastian Schellhorn, Philipp Wanko:
clingo goes Linear Constraints over Reals and Integers. ASPOCP@LPNMR 2017 - [c5]Roland Kaminski, Torsten Schaub, Philipp Wanko:
A Tutorial on Hybrid Answer Set Solving with clingo. RW 2017: 167-203 - 2016
- [c4]Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Max Ostrowski, Torsten Schaub, Philipp Wanko:
Theory Solving Made Easy with Clingo 5. ICLP (Technical Communications) 2016: 2:1-2:15 - [c3]Javier Romero, Torsten Schaub, Philipp Wanko:
Computing Diverse Optimal Stable Models. ICLP (Technical Communications) 2016: 3:1-3:14 - [c2]Philipp Wanko:
Scalable Design Space Exploration via Answer Set Programming. ICLP (Technical Communications) 2016: 23:1-23:11 - 2013
- [c1]Martin Gebser, Benjamin Kaufmann, Javier Romero, Ramón Otero, Torsten Schaub, Philipp Wanko:
Domain-Specific Heuristics in Answer Set Programming. AAAI 2013: 350-356
Informal and Other Publications
- 2024
- [i9]Roland Kaminski, Torsten Schaub, Tran Cao Son, Jirí Svancara, Philipp Wanko:
Routing and Scheduling in Answer Set Programming applied to Multi-Agent Path Finding: Preliminary Report. CoRR abs/2403.12153 (2024) - 2021
- [i8]Pedro Cabalar, Jorge Fandinno, Torsten Schaub, Philipp Wanko:
Towards a Semantics for Hybrid ASP systems. CoRR abs/2108.03061 (2021) - 2020
- [i7]Pedro Cabalar, Jorge Fandinno, Torsten Schaub, Philipp Wanko:
An ASP semantics for Constraints involving Conditional Aggregates. CoRR abs/2002.06911 (2020) - [i6]Pedro Cabalar, Jorge Fandinno, Torsten Schaub, Philipp Wanko:
A Uniform Treatment of Aggregates and Constraints in Hybrid ASP. CoRR abs/2003.04176 (2020) - [i5]Dirk Abels, Julian Jordi, Max Ostrowski, Torsten Schaub, Ambra Toletti, Philipp Wanko:
Train Scheduling with Hybrid Answer Set Programming. CoRR abs/2003.08598 (2020) - [i4]Roland Kaminski, Javier Romero, Torsten Schaub, Philipp Wanko:
How to build your own ASP-based system?! CoRR abs/2008.06692 (2020) - 2019
- [i3]Philipp Wanko:
Design Space Exploration via Answer Set Programming Modulo Theories. CoRR abs/1905.05248 (2019) - 2018
- [i2]Clémence Frioux, Torsten Schaub, Sebastian Schellhorn, Anne Siegel, Philipp Wanko:
Hybrid Metabolic Network Completion. CoRR abs/1808.04149 (2018) - 2017
- [i1]Tomi Janhunen, Roland Kaminski, Max Ostrowski, Torsten Schaub, Sebastian Schellhorn, Philipp Wanko:
Clingo goes Linear Constraints over Reals and Integers. CoRR abs/1707.04053 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
