#### Filter Results:

- Full text PDF available (242)

#### Publication Year

1991

2017

- This year (13)
- Last 5 years (94)
- Last 10 years (184)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn 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 set programming (ASP) as unit propagation on nogoods. This provides us with a uniform constraintbased framework for the different kinds of inferences in ASP. It… (More)

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

- 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 (ASP) as unit propagation on nogoods. This provides us with a uniform constraint-based framework capturing diverse inferences encountered in ASP solving.… (More)

- Martin Gebser, Torsten Schaub, Sven Thiele
- LPNMR
- 2007

We describe a new grounder system for logic programs under answer set semantics, called GrinGo. Our approach combines and extends techniques from the two primary grounding approaches of lparse and dlv. A major emphasis lies on an extensible design that allows for an easy incorporation of new language features in an efficient system environment. 1… (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 features, and provide a systematic empirical evaluation of its features.

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

Answer Set Programming (ASP) is a declarative problem solving approach, combining a rich yet simple modeling language with high-performance solving capacities. ASP is particularly suited for modeling problems in the area of Knowledge Representation and Reasoning involving incomplete, inconsistent, and changing information. From a formal perspective, ASP… (More)

- Martin Gebser, Max Ostrowski, Torsten Schaub
- ICLP
- 2009

We present a new approach to integrating Constraint Processing (CP) techniques into Answer Set Programming (ASP). Based on an alternative semantic approach, we develop an algorithmic framework for conflict-driven ASP solving that exploits CP solving capacities. A significant technical issue concerns the combination of conflict information from different… (More)

- Martin Gebser, Roland Kaminski, Arne König, Torsten Schaub
- LPNMR
- 2011

We describe the major new features emerging from a significant redesign of the grounder gringo, building upon a grounding algorithm based on semi-naive database evaluation. Unlike previous versions, rules only need to be safe rather than domain-restricted.

- 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 characterization of answer sets, we develop advanced solving algorithms, featuring backjumping and conflict-driven learning using the First-UIP scheme as well as sophisticated… (More)

- James P. Delgrande, Torsten Schaub, Hans Tompits
- TPLP
- 2003

We introduce a methodology and framework for expressing general preference information in logic programming under the answer set semantics. An ordered logic program is an extended logic program in which rules are named by unique terms, and in which preferences among rules are given by a set of atoms of the form s t where s and t are names. An ordered logic… (More)