What is answer set programming to propositional satisfiability

14Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Propositional satisfiability (or satisfiability) and answer set programming are two closely related subareas of Artificial Intelligence that are used to model and solve difficult combinatorial search problems. Satisfiability solvers and answer set solvers are the software systems that find satisfying interpretations and answer sets for given propositional formulas and logic programs, respectively. These systems are closely related in their common design patterns. In satisfiability, a propositional formula is used to encode problem specifications in a way that its satisfying interpretations correspond to the solutions of the problem. To find solutions to a problem it is then sufficient to use a satisfiability solver on a corresponding formula. Niemelä, Marek, and Truszczyński coined answer set programming paradigm in 1999: in this paradigm a logic program encodes problem specifications in a way that the answer sets of a logic program represent the solutions of the problem. As a result, to find solutions to a problem it is sufficient to use an answer set solver on a corresponding program. These parallels that we just draw between paradigms naturally bring up a question: what is a fundamental difference between the two? This paper takes a close look at this question.

References Powered by Scopus

A machine program for theorem-proving

2273Citations
N/AReaders
Get full text

GRASP: A search algorithm for propositional satisfiability

1119Citations
N/AReaders
Get full text

The DLV system for knowledge representation and reasoning

880Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Constraint Answer Set Programming: Integrational and Translational (or SMT-based) Approaches

8Citations
N/AReaders
Get full text

Block structured scheduling using constraint logic programming

4Citations
N/AReaders
Get full text

Logic programming-based Minimal Cut Sets reveal consortium-level therapeutic targets for chronic wound infections

2Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Lierler, Y. (2017). What is answer set programming to propositional satisfiability. Constraints, 22(3), 307–337. https://doi.org/10.1007/s10601-016-9257-7

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 6

75%

Professor / Associate Prof. 1

13%

Lecturer / Post doc 1

13%

Readers' Discipline

Tooltip

Computer Science 6

67%

Business, Management and Accounting 1

11%

Mathematics 1

11%

Chemistry 1

11%

Save time finding and organizing research with Mendeley

Sign up for free