Benjamin Kaufmann - Academia.edu (original) (raw)
Uploads
Papers by Benjamin Kaufmann
Corr, May 11, 2010
Modern solvers for Boolean Satisfiability (SAT) and Answer Set Programming (ASP) are based on sop... more Modern solvers for Boolean Satisfiability (SAT) and Answer Set Programming (ASP) are based on sophisticated Boolean constraint solving techniques. In both areas, conflict-driven learning and related techniques constitute key features whose application is enabled by conflict analysis. Although various conflict analysis schemes have been proposed, implemented, and studied both theoretically and practically in the SAT area, the heuristic aspects involved in conflict analysis have not yet received much attention. Assuming a fixed conflict analysis scheme, we address the open question of how to identify "good'' reasons for conflicts, and we investigate several heuristics for conflict analysis in ASP solving. To our knowledge, a systematic study like ours has not yet been performed in the SAT area, thus, it might be beneficial for both the field of ASP as well as the one of SAT solving.
We present the new ASP system clingo 4. Unlike its predecessors, being mere monolithic combinatio... more We present the new ASP system clingo 4. Unlike its predecessors, being mere monolithic combinations of the grounder gringo with the solver clasp, the new clingo 4 series offers high-level constructs for realizing complex reasoning processes. Among others, such processes feature advanced forms of search, as in optimization or theory solving, or even interact with an environment, as in robotics or query-answering. Common to them is that the problem specification evolves during the reasoning process, either because data or constraints are added, deleted, or replaced. In fact, clingo 4 carries out such complex reasoning within a single integrated ASP grounding and solving process. This avoids redundancies in relaunching grounder and solver programs and benefits from the solver's learning capacities. clingo 4 accomplishes this by complementing ASP's declarative input language by control capacities expressed via the embedded scripting languages lua and python. On the declarative s...
We introduce a new approach to disjunctive ASP solving that aims at an equitable interplay betwee... more 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 sets and unfounded sets allowing for a bidirectional dynamic information exchange between solver units for orthogonal tasks. This results in the new multithreaded disjunctive ASP solver claspD-2, greatly improving the performance of existing systems.
Lecture Notes in Computer Science, 2009
Lecture Notes in Computer Science, 2009
Synthesis Lectures on Artificial Intelligence and Machine Learning, 2012
Lecture Notes in Computer Science, 2009
Lecture Notes in Computer Science, 2011
Lecture Notes in Computer Science, 2011
Lecture Notes in Computer Science, 2009
Theory and Practice of Logic Programming, 2012
Artificial Intelligence, 2012
This document provides an introduction to the Answer Set Programming (ASP) tools gringo, clasp, c... more This document provides an introduction to the Answer Set Programming (ASP) tools gringo, clasp, clingo, and iclingo, developed at the University of Potsdam. The first tool, gringo, is a grounder capable of translating logic pro- grams provided by users into equivalent propositional logic programs. The answer sets of such programs can be computed by clasp, which is a solver. The
Lecture Notes in Computer Science, 2015
Lecture Notes in Computer Science, 2015
Corr, May 11, 2010
Modern solvers for Boolean Satisfiability (SAT) and Answer Set Programming (ASP) are based on sop... more Modern solvers for Boolean Satisfiability (SAT) and Answer Set Programming (ASP) are based on sophisticated Boolean constraint solving techniques. In both areas, conflict-driven learning and related techniques constitute key features whose application is enabled by conflict analysis. Although various conflict analysis schemes have been proposed, implemented, and studied both theoretically and practically in the SAT area, the heuristic aspects involved in conflict analysis have not yet received much attention. Assuming a fixed conflict analysis scheme, we address the open question of how to identify "good'' reasons for conflicts, and we investigate several heuristics for conflict analysis in ASP solving. To our knowledge, a systematic study like ours has not yet been performed in the SAT area, thus, it might be beneficial for both the field of ASP as well as the one of SAT solving.
We present the new ASP system clingo 4. Unlike its predecessors, being mere monolithic combinatio... more We present the new ASP system clingo 4. Unlike its predecessors, being mere monolithic combinations of the grounder gringo with the solver clasp, the new clingo 4 series offers high-level constructs for realizing complex reasoning processes. Among others, such processes feature advanced forms of search, as in optimization or theory solving, or even interact with an environment, as in robotics or query-answering. Common to them is that the problem specification evolves during the reasoning process, either because data or constraints are added, deleted, or replaced. In fact, clingo 4 carries out such complex reasoning within a single integrated ASP grounding and solving process. This avoids redundancies in relaunching grounder and solver programs and benefits from the solver's learning capacities. clingo 4 accomplishes this by complementing ASP's declarative input language by control capacities expressed via the embedded scripting languages lua and python. On the declarative s...
We introduce a new approach to disjunctive ASP solving that aims at an equitable interplay betwee... more 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 sets and unfounded sets allowing for a bidirectional dynamic information exchange between solver units for orthogonal tasks. This results in the new multithreaded disjunctive ASP solver claspD-2, greatly improving the performance of existing systems.
Lecture Notes in Computer Science, 2009
Lecture Notes in Computer Science, 2009
Synthesis Lectures on Artificial Intelligence and Machine Learning, 2012
Lecture Notes in Computer Science, 2009
Lecture Notes in Computer Science, 2011
Lecture Notes in Computer Science, 2011
Lecture Notes in Computer Science, 2009
Theory and Practice of Logic Programming, 2012
Artificial Intelligence, 2012
This document provides an introduction to the Answer Set Programming (ASP) tools gringo, clasp, c... more This document provides an introduction to the Answer Set Programming (ASP) tools gringo, clasp, clingo, and iclingo, developed at the University of Potsdam. The first tool, gringo, is a grounder capable of translating logic pro- grams provided by users into equivalent propositional logic programs. The answer sets of such programs can be computed by clasp, which is a solver. The
Lecture Notes in Computer Science, 2015
Lecture Notes in Computer Science, 2015