Tomi Janhunen

Writing Declarative Specifications for Clauses

VCLA and Wolfgang Pauli Institute hosted a talk by Tomi Janhunen

DATE:Friday, October 5, 2018
TIME:14:00 s.t.
VENUE:Seminar Room Gödel, Favoritenstrasse 9-11, Ground Floor, (HB EG 10)


Modern satisfiability (SAT) solvers provide an efficient implementation of classical propositional logic. Their input language, however, is based on the conjunctive normal form (CNF) of propositional formulas. To use SAT solver technology in practice, a user must create the input clauses in one way or another. A typical approach is to write a procedural program that generates formulas on the basis of some input data relevant for the problem domain and translates them into CNF. In this paper, we propose a declarative approach where the intended clauses are specified in terms of rules in analogy to answer set programming (ASP). This allows the user to write first-order specifications for intended clauses in a schematic way by exploiting term variables. We develop a formal framework required to define the semantics of such specifications. Moreover, we provide an implementation harnessing state-of-the-art ASP grounders to accomplish the grounding step of clauses. As a result, we obtain a general-purpose clause-level grounding approach for SAT solvers. Finally, we illustrate the capabilities of our specification methodology in terms of combinatorial and application problems.

Tomi Janhunen, Aalto University

Comments are closed.