scispace - formally typeset
Journal ArticleDOI

Potassco: The Potsdam Answer Set Solving Collection

TLDR
This paper gives an overview of the open source project Potassco, the Potsdam Answer Set Solving Collection, bundling tools for Answer Set Programming developed at the University ofPotsdam.
Abstract
This paper gives an overview of the open source project Potassco, the Potsdam Answer Set Solving Collection, bundling tools for Answer Set Programming developed at the University of Potsdam.

read more

Citations
More filters
Book

Answer Set Solving in Practice

TL;DR: This book presents a practical introduction to ASP, aiming at using ASP languages and systems for solving application problems, and introduces ASP's solving technology, modeling language and methodology.
Journal ArticleDOI

Conflict-driven answer set solving: From theory to practice

TL;DR: An approach to computing answer sets of logic programs, based on concepts successfully applied in Satisfiability (SAT) checking, to view inferences in Answer Set Programming (ASP) as unit propagation on nogoods, and presents the first full-fledged algorithmic framework for native conflict-driven ASP solving.
Book

Procedural Content Generation in Games

TL;DR: This book presents the most up-to-date coverage of procedural content generation (PCG) for games, specifically the procedural generation of levels, landscapes, items, rules, quests, or other types of content.
Posted Content

Clingo = ASP + Control: Preliminary Report

TL;DR: By strictly separating logic and control programs, clingo 4 also abolishes the need for dedicated systems for incremental and reactive reasoning, like iclingo and oclingo, respectively, and its flexibility goes well beyond the advanced yet still rigid solving processes of the latter.
Journal ArticleDOI

Formalizing Visualization Design Knowledge as Constraints: Actionable and Extensible Models in Draco

TL;DR: This work proposes modeling visualization design knowledge as a collection of constraints, in conjunction with a method to learn weights for soft constraints from experimental data, which can take theoretical design knowledge and express it in a concrete, extensible, and testable form.
References
More filters
Book

Foundations of databases

TL;DR: This book discusses Languages, Computability, and Complexity, and the Relational Model, which aims to clarify the role of Semantic Data Models in the development of Query Language Design.
Proceedings Article

The stable model semantics for logic programming

TL;DR: This paper introduces a succinct abstract representation of constraint atoms in which a constraint atom is represented compactly and shows that this representation provides a means to characterize dependencies of atoms in a program with constraint atoms, so that some standard characterizations and properties relying on these dependencies in the past for logic programs with ordinary atoms can be extended.
Book ChapterDOI

An Extensible SAT-solver

TL;DR: This article presents a small, complete, and efficient SAT-solver in the style of conflict-driven learning, as exemplified by Chaff, and includes among other things a mechanism for adding arbitrary boolean constraints.
Proceedings ArticleDOI

Chaff: engineering an efficient SAT solver

TL;DR: The development of a new complete solver, Chaff, is described which achieves significant performance gains through careful engineering of all aspects of the search-especially a particularly efficient implementation of Boolean constraint propagation (BCP) and a novel low overhead decision strategy.
Book ChapterDOI

Negation as failure

TL;DR: It is shown that when the clause data base and the queries satisfy certain constraints, which still leaves us with a data base more general than a conventional relational data base, the query evaluation process will find every answer that is a logical consequence of the completed data base.
Related Papers (5)