default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenjamin Kaufmann
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j9]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)- [j8]Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub:
Multi-shot ASP solving with clingo. Theory Pract. Log. Program. 19(1): 27-82 (2019) - 2018
- [j7]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) - 2017
- [j6]Mutsunori Banbara, Benjamin Kaufmann, Max Ostrowski, Torsten Schaub:
Clingcon: The next generation. Theory Pract. Log. Program. 17(4): 408-461 (2017) - [i5]Mutsunori Banbara, Benjamin Kaufmann, Max Ostrowski, Torsten Schaub:
Clingcon: The Next Generation. CoRR abs/1705.04569 (2017) - [i4]Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub:
Multi-shot ASP solving with clingo. CoRR abs/1705.09811 (2017) - 2016
- [j5]Benjamin Kaufmann, Nicola Leone, Simona Perri, Torsten Schaub:
Grounding and Solving in Answer Set Programming. AI Mag. 37(3): 25-32 (2016) - [j4]Jori Bomanson, Martin Gebser, Tomi Janhunen, Benjamin Kaufmann, Torsten Schaub:
Answer Set Programming Modulo Acyclicity. Fundam. Informaticae 147(1): 63-91 (2016) - [c24]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 - [c23]Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Patrick Lühne, Javier Romero, Torsten Schaub:
Answer Set Solving with Generalized Learned Constraints. ICLP (Technical Communications) 2016: 9:1-9:15 - [c22]Bernhard Bliem, Benjamin Kaufmann, Torsten Schaub, Stefan Woltran:
ASP for Anytime Dynamic Programming on Tree Decompositions. IJCAI 2016: 979-986 - 2015
- [b2]Benjamin Kaufmann:
High performance answer set solving. University of Potsdam, 2015, pp. 1-182 - [c21]Jori Bomanson, Martin Gebser, Tomi Janhunen, Benjamin Kaufmann, Torsten Schaub:
Answer Set Programming Modulo Acyclicity. LPNMR 2015: 143-150 - [c20]Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Javier Romero, Torsten Schaub:
Progress in clasp Series 3. LPNMR 2015: 368-383 - 2014
- [i3]Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub:
Clingo = ASP + Control: Preliminary Report. CoRR abs/1405.3694 (2014) - 2013
- [c19]Martin Gebser, Benjamin Kaufmann, Javier Romero, Ramón Otero, Torsten Schaub, Philipp Wanko:
Domain-Specific Heuristics in Answer Set Programming. AAAI 2013: 350-356 - [c18]Martin Gebser, Benjamin Kaufmann, Torsten Schaub:
Advanced Conflict-Driven Disjunctive Answer Set Solving. IJCAI 2013: 912-918 - [c17]Holger H. Hoos, Benjamin Kaufmann, Torsten Schaub, Marius Schneider:
Robust Benchmark Set Selection for Boolean Constraint Solvers. LION 2013: 138-152 - 2012
- [b1]Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub:
Answer Set Solving in Practice. Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan & Claypool Publishers 2012, ISBN 978-3-031-00433-9 - [j3]Martin Gebser, Benjamin Kaufmann, Torsten Schaub:
Conflict-driven answer set solving: From theory to practice. Artif. Intell. 187: 52-89 (2012) - [j2]Martin Gebser, Benjamin Kaufmann, Torsten Schaub:
Multi-threaded ASP solving with clasp. Theory Pract. Log. Program. 12(4-5): 525-545 (2012) - [c16]Benjamin Andres, Benjamin Kaufmann, Oliver Matheis, Torsten Schaub:
Unsatisfiability-based optimization in clasp. ICLP (Technical Communications) 2012: 211-221 - [i2]Martin Gebser, Benjamin Kaufmann, Torsten Schaub:
Multi-threaded ASP Solving with clasp. CoRR abs/1210.3265 (2012) - 2011
- [j1]Martin Gebser, Benjamin Kaufmann, Roland Kaminski, Max Ostrowski, Torsten Schaub, Marius Schneider:
Potassco: The Potsdam Answer Set Solving Collection. AI Commun. 24(2): 107-124 (2011) - [c15]Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub:
Challenges in Answer Set Solving. Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning 2011: 74-90 - [c14]Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub:
Multi-Criteria Optimization in Answer Set Programming. ICLP (Technical Communications) 2011: 1-10 - [c13]Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub, Marius Thomas Schneider, Stefan Ziller:
A Portfolio Solver for Answer Set Programming: Preliminary Report. LPNMR 2011: 352-357 - [c12]Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub, Bettina Schnor:
Cluster-Based ASP Solving with claspar. LPNMR 2011: 364-369 - 2010
- [i1]Christian Drescher, Martin Gebser, Benjamin Kaufmann, Torsten Schaub:
Heuristics in Conflict Resolution. CoRR abs/1005.1716 (2010)
2000 – 2009
- 2009
- [c11]Martin Gebser, Benjamin Kaufmann, Torsten Schaub:
Solution Enumeration for Projected Boolean Search Problems. CPAIOR 2009: 71-86 - [c10]Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub:
On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers. ICLP 2009: 250-264 - [c9]Enrico Ellguth, Martin Gebser, Markus Gusowski, Benjamin Kaufmann, Roland Kaminski, Stefan Liske, Torsten Schaub, Lars Schneidenbach, Bettina Schnor:
A Simple Distributed Conflict-Driven Answer Set Solver. LPNMR 2009: 490-495 - [c8]Martin Gebser, Benjamin Kaufmann, Torsten Schaub:
The Conflict-Driven Answer Set Solver clasp: Progress Report. LPNMR 2009: 509-514 - [c7]Lars Schneidenbach, Bettina Schnor, Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub:
Experiences Running a Parallel Answer Set Solver on Blue Gene. PVM/MPI 2009: 64-72 - 2008
- [c6]Martin Gebser, Benjamin Kaufmann, André Neumann, Torsten Schaub:
Advanced Preprocessing for Answer Set Solving. ECAI 2008: 15-19 - [c5]Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Max Ostrowski, Torsten Schaub, Sven Thiele:
Engineering an Incremental ASP Solver. ICLP 2008: 190-205 - [c4]Christian Drescher, Martin Gebser, Torsten Grote, Benjamin Kaufmann, Arne König, Max Ostrowski, Torsten Schaub:
Conflict-Driven Disjunctive Answer Set Solving. KR 2008: 422-432 - 2007
- [c3]Martin Gebser, Benjamin Kaufmann, André Neumann, Torsten Schaub:
Conflict-Driven Answer Set Solving. IJCAI 2007: 386- - [c2]Martin Gebser, Benjamin Kaufmann, André Neumann, Torsten Schaub:
Conflict-Driven Answer Set Enumeration. LPNMR 2007: 136-148 - [c1]Martin Gebser, Benjamin Kaufmann, André Neumann, Torsten Schaub:
clasp : A Conflict-Driven Answer Set Solver. LPNMR 2007: 260-265
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-04-24 23:09 CEST 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:
