#### Filter Results:

- Full text PDF available (15)

#### Publication Year

2010

2017

- This year (0)
- Last 5 years (14)
- Last 10 years (20)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

Learn More

- Martin Gebser, Benjamin Kaufmann, Roland Kaminski, Max Ostrowski, Torsten Schaub, Marius Thomas Lindauer
- AI Commun.
- 2011

The basic idea of ASP is to represent a given computational problem by a logic program1 whose answer sets correspond to solutions, and then to use an ASP solver for finding answer sets of theâ€¦ (More)

We propose a portfolio-based solving approach to Answer Set Programming (ASP). Our approach is homogeneous in considering several configurations of the ASP solver clasp. The selection among theâ€¦ (More)

- Bernd Bischl, Pascal Kerschke, +8 authors Joaquin Vanschoren
- Artif. Intell.
- 2016

The task of algorithm selection involves choosing an algorithm from a set of algorithms on a per-instance basis in order to exploit the varying performance of algorithms over a set of instances. Theâ€¦ (More)

- Marius Thomas Lindauer, Holger H. Hoos, Frank Hutter, Torsten Schaub
- J. Artif. Intell. Res.
- 2015

Algorithm selection (AS) techniques â€“ which involve choosing from a set of algorithms the one expected to solve a given problem instance most efficiently â€“ have substantially improved the state ofâ€¦ (More)

Building on the award-winning, portfolio-based ASP solver claspfolio, we presentclaspfolio 2, a modular and open solver architecture that integrates sever al different portfolio-based algorithmâ€¦ (More)

- Maximilian MÃ¶ller, Marius Thomas Lindauer, Martin Wegner, Torsten Schaub
- KI - KÃ¼nstliche Intelligenz
- 2010

We present the General Game Playing system Centurio. Centurio is a Java-based player featuring different strategies based on Monte Carlo Tree Search extended by techniques borrowed from Upperâ€¦ (More)

- Frank Hutter, Marius Thomas Lindauer, Adrian Balint, Sam Bayless, Holger H. Hoos, Kevin Leyton-Brown
- Artif. Intell.
- 2017

It is well known that different solution strategies work well for different types of instances of hard combinatorial problems. As a consequence, most solvers for the propositional satisfiabilityâ€¦ (More)

Answer set programming (ASP) is a declarative programming formalism that allows a practitioner to specify a problem without describing an algorithm for solving it. In ASP, the tools for processingâ€¦ (More)

Although Boolean Constraint Technology has made tremendous progress over the last decade, it suffers from a great sensitivity to search configuration. This problem was impressively counterbalanced atâ€¦ (More)