ASPQ: An ASP-Based 2QBF Solver

Giovanni Amendola; Carmine Dodaro; Francesco Ricca

ASPQ: An ASP-Based 2QBF Solver

Giovanni Amendola, Carmine Dodaro, Francesco Ricca

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Answer Set Programming (ASP) is an established logic-based programming paradigm which has been successfully applied for solving complex problems. Since ASP can model problems up to the second level of the polynomial hierarchy, it can be used to model and solve the 2QBF problem. In this paper we show how to obtain a fairly effective 2QBF solver by just resorting to state-of-the-art ASP solvers.

Original language	English
Title of host publication	Proceedings of the 4th International Workshop on Quantified Boolean Formulas (QBF 2016) co-located with 19th International Conference on Theory and Applications of Satisfiability Testing (SAT 2016)
Publisher	CEUR Workshop Proceedings (CEUR-WS.org)
Pages	49-54
Number of pages	6
Publication status	Published - 4 Jul 2016
Event	4th International Workshop on Quantified Boolean Formulas (QBF 2016) co-located with 19th International Conference on Theory and Applications of Satisfiability Testing - Bordeaux, France Duration: 4 Jul 2016 → 4 Jul 2016 http://ceur-ws.org/Vol-1719/

Publication series

Name	CEUR Workshop Proceedings
Publisher	CEUR-WS.org
Volume	1719
ISSN (Electronic)	1613-0073

Conference

Conference	4th International Workshop on Quantified Boolean Formulas (QBF 2016) co-located with 19th International Conference on Theory and Applications of Satisfiability Testing
Abbreviated title	QBF 2016
Country/Territory	France
City	Bordeaux
Period	4/07/16 → 4/07/16
Internet address	http://ceur-ws.org/Vol-1719/

Access to Document

paper4Final published version, 140 KB

http://ceur-ws.org/Vol-1719/

Cite this

Amendola, G., Dodaro, C., & Ricca, F. (2016). ASPQ: An ASP-Based 2QBF Solver. In Proceedings of the 4th International Workshop on Quantified Boolean Formulas (QBF 2016) co-located with 19th International Conference on Theory and Applications of Satisfiability Testing (SAT 2016) (pp. 49-54). (CEUR Workshop Proceedings; Vol. 1719). CEUR Workshop Proceedings (CEUR-WS.org). http://ceur-ws.org/Vol-1719/

Amendola, Giovanni ; Dodaro, Carmine ; Ricca, Francesco. / ASPQ: An ASP-Based 2QBF Solver. Proceedings of the 4th International Workshop on Quantified Boolean Formulas (QBF 2016) co-located with 19th International Conference on Theory and Applications of Satisfiability Testing (SAT 2016). CEUR Workshop Proceedings (CEUR-WS.org), 2016. pp. 49-54 (CEUR Workshop Proceedings).

@inproceedings{beb9e6ec21474f0aa05eb43c905bfd36,

title = "ASPQ: An ASP-Based 2QBF Solver",

abstract = "Answer Set Programming (ASP) is an established logic-based programming paradigm which has been successfully applied for solving complex problems. Since ASP can model problems up to the second level of the polynomial hierarchy, it can be used to model and solve the 2QBF problem. In this paper we show how to obtain a fairly effective 2QBF solver by just resorting to state-of-the-art ASP solvers. ",

author = "Giovanni Amendola and Carmine Dodaro and Francesco Ricca",

year = "2016",

month = jul,

day = "4",

language = "English",

series = "CEUR Workshop Proceedings",

publisher = "CEUR Workshop Proceedings (CEUR-WS.org)",

pages = "49--54",

booktitle = "Proceedings of the 4th International Workshop on Quantified Boolean Formulas (QBF 2016) co-located with 19th International Conference on Theory and Applications of Satisfiability Testing (SAT 2016)",

note = "4th International Workshop on Quantified Boolean Formulas (QBF 2016) co-located with 19th International Conference on Theory and Applications of Satisfiability Testing, QBF 2016 ; Conference date: 04-07-2016 Through 04-07-2016",

url = "http://ceur-ws.org/Vol-1719/",

}

Amendola, G, Dodaro, C & Ricca, F 2016, ASPQ: An ASP-Based 2QBF Solver. in Proceedings of the 4th International Workshop on Quantified Boolean Formulas (QBF 2016) co-located with 19th International Conference on Theory and Applications of Satisfiability Testing (SAT 2016). CEUR Workshop Proceedings, vol. 1719, CEUR Workshop Proceedings (CEUR-WS.org), pp. 49-54, 4th International Workshop on Quantified Boolean Formulas (QBF 2016) co-located with 19th International Conference on Theory and Applications of Satisfiability Testing, Bordeaux, France, 4/07/16. <http://ceur-ws.org/Vol-1719/>

ASPQ: An ASP-Based 2QBF Solver. / Amendola, Giovanni; Dodaro, Carmine; Ricca, Francesco.
Proceedings of the 4th International Workshop on Quantified Boolean Formulas (QBF 2016) co-located with 19th International Conference on Theory and Applications of Satisfiability Testing (SAT 2016). CEUR Workshop Proceedings (CEUR-WS.org), 2016. p. 49-54 (CEUR Workshop Proceedings; Vol. 1719).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - ASPQ: An ASP-Based 2QBF Solver

AU - Amendola, Giovanni

AU - Dodaro, Carmine

AU - Ricca, Francesco

PY - 2016/7/4

Y1 - 2016/7/4

N2 - Answer Set Programming (ASP) is an established logic-based programming paradigm which has been successfully applied for solving complex problems. Since ASP can model problems up to the second level of the polynomial hierarchy, it can be used to model and solve the 2QBF problem. In this paper we show how to obtain a fairly effective 2QBF solver by just resorting to state-of-the-art ASP solvers.

AB - Answer Set Programming (ASP) is an established logic-based programming paradigm which has been successfully applied for solving complex problems. Since ASP can model problems up to the second level of the polynomial hierarchy, it can be used to model and solve the 2QBF problem. In this paper we show how to obtain a fairly effective 2QBF solver by just resorting to state-of-the-art ASP solvers.

M3 - Conference contribution

T3 - CEUR Workshop Proceedings

SP - 49

EP - 54

BT - Proceedings of the 4th International Workshop on Quantified Boolean Formulas (QBF 2016) co-located with 19th International Conference on Theory and Applications of Satisfiability Testing (SAT 2016)

PB - CEUR Workshop Proceedings (CEUR-WS.org)

T2 - 4th International Workshop on Quantified Boolean Formulas (QBF 2016) co-located with 19th International Conference on Theory and Applications of Satisfiability Testing

Y2 - 4 July 2016 through 4 July 2016

ER -

ASPQ: An ASP-Based 2QBF Solver

Abstract

Publication series

Conference

Access to Document

Fingerprint

Cite this