#### Filter Results:

- Full text PDF available (25)

#### Publication Year

2007

2019

- This year (5)
- Last 5 years (20)
- Last 10 years (45)

#### Publication Type

#### Co-author

#### Journals and Conferences

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)

- Martin Gebser, Benjamin Kaufmann, André Neumann, Torsten Schaub
- IJCAI
- 2007

We introduce a new approach to computing answer sets of logic programs, based on concepts from constraint processing (CSP) and satisfiability checking (SAT). The idea is to view inferences in answer… (More)

- Martin Gebser, Benjamin Kaufmann, Torsten Schaub
- Artif. Intell.
- 2012

We introduce an approach to computing answer sets of logic programs, based on concepts successfully applied in Satisfiability (SAT) checking. The idea is to view inferences in Answer Set Programming… (More)

- Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub
- Answer Set Solving in Practice
- 2012

Answer set programming (ASP) is a declarative problem solving approach, initially tailored to modeling problems in the area of knowledge representation and reasoning (KRR). More recently, its… (More)

- Martin Gebser, Benjamin Kaufmann, André Neumann, Torsten Schaub
- LPNMR
- 2007

We describe the conflict-driven answer set solver clasp, which is based on concepts from constraint processing (CSP) and satisfiability checking (SAT). We detail its system architecture and major… (More)

- Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub
- ArXiv
- 2014

We present the new ASP system clingo 4. Unlike its predecessors, being mere monolithic combinat io s of the groundergringo with the solverclasp, the newclingo 4 series offers high-level constructs… (More)

Many real-world applications, like planning or model checking, comprise a parameter reflecting the size of a solution. In a propositional formalism like Answer Set Programming (ASP), such problems… (More)

- Christian Drescher, Martin Gebser, +4 authors Torsten Schaub
- KR
- 2008

We elaborate a uniform approach to computing answer sets of disjunctive logic programs based on state-of-theart Boolean constraint solving techniques. Starting from a constraint-based… (More)

- Martin Gebser, Benjamin Kaufmann, Torsten Schaub
- IJCAI
- 2013

We introduce a new approach to disjunctive ASP solving that aims at an equitable interplay between “generating” and “testing” solver units. To this end, we develop novel characterizations of answer… (More)

Answer Set Programming (ASP) is a model, ground, and solve paradigm. The integration of applicationor theory-specific reasoning into ASP systems thus impacts on many if not all elements of its… (More)