A generator of hard 2QBF formulas and ASP programs

Giovanni Amendola; Francesco Ricca; Miroslaw Truszczynski

A generator of hard 2QBF formulas and ASP programs

Giovanni Amendola
, Francesco Ricca
, Miroslaw Truszczynski

Computer Science

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

8 Scopus citations

Abstract

The availability of generators of random instances of boolean formulas has had a major impact on solver technology for KR formalisms such as SAT, QBF and ASP. Recently, we proposed new models of random QSAT formulas in non-clausal form, as well as the first model of random disjunctive logic programs. Our models support generating instances of substantial hardness. Here, we present a tool that generates formulas/programs from the new models in a variety of output formats including (Q)DIMACS, QCIR, and ASPCore 2.0.

Original language	English
Title of host publication	Principles of Knowledge Representation and Reasoning
Subtitle of host publication	Proceedings of the 16th International Conference, KR 2018
Editors	Michael Thielscher, Francesca Toni, Frank Wolter
Pages	52-56
Number of pages	5
ISBN (Electronic)	9781577358039
State	Published - 2018
Event	16th International Conference on the Principles of Knowledge Representation and Reasoning, KR 2018 - Tempe, United States Duration: Oct 30 2018 → Nov 2 2018

Publication series

Name	Principles of Knowledge Representation and Reasoning: Proceedings of the 16th International Conference, KR 2018

Conference

Conference	16th International Conference on the Principles of Knowledge Representation and Reasoning, KR 2018
Country/Territory	United States
City	Tempe
Period	10/30/18 → 11/2/18

Bibliographical note

Publisher Copyright:
Copyright © 2018, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

Funding

The third author was partially supported by the NSF grant IIS-1707371; the first two were partially supported by MISE under project S2BDW n. F/050389/01-02-03/X32.

Funders	Funder number
National Science Foundation (NSF)	IIS-1707371
Ministero dello Sviluppo Economico	F/050389/01-02-03/X32

ASJC Scopus subject areas

Software
Logic

Cite this

Amendola, G., Ricca, F., & Truszczynski, M. (2018). A generator of hard 2QBF formulas and ASP programs. In M. Thielscher, F. Toni, & F. Wolter (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the 16th International Conference, KR 2018 (pp. 52-56). (Principles of Knowledge Representation and Reasoning: Proceedings of the 16th International Conference, KR 2018).

Amendola, Giovanni ; Ricca, Francesco ; Truszczynski, Miroslaw. / A generator of hard 2QBF formulas and ASP programs. Principles of Knowledge Representation and Reasoning: Proceedings of the 16th International Conference, KR 2018. editor / Michael Thielscher ; Francesca Toni ; Frank Wolter. 2018. pp. 52-56 (Principles of Knowledge Representation and Reasoning: Proceedings of the 16th International Conference, KR 2018).

@inproceedings{8320b0fa5f9e47bf962e627f00735504,

title = "A generator of hard 2QBF formulas and ASP programs",

abstract = "The availability of generators of random instances of boolean formulas has had a major impact on solver technology for KR formalisms such as SAT, QBF and ASP. Recently, we proposed new models of random QSAT formulas in non-clausal form, as well as the first model of random disjunctive logic programs. Our models support generating instances of substantial hardness. Here, we present a tool that generates formulas/programs from the new models in a variety of output formats including (Q)DIMACS, QCIR, and ASPCore 2.0.",

author = "Giovanni Amendola and Francesco Ricca and Miroslaw Truszczynski",

note = "Publisher Copyright: Copyright {\textcopyright} 2018, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 16th International Conference on the Principles of Knowledge Representation and Reasoning, KR 2018 ; Conference date: 30-10-2018 Through 02-11-2018",

year = "2018",

language = "English",

series = "Principles of Knowledge Representation and Reasoning: Proceedings of the 16th International Conference, KR 2018",

pages = "52--56",

editor = "Michael Thielscher and Francesca Toni and Frank Wolter",

booktitle = "Principles of Knowledge Representation and Reasoning",

}

Amendola, G, Ricca, F & Truszczynski, M 2018, A generator of hard 2QBF formulas and ASP programs. in M Thielscher, F Toni & F Wolter (eds), Principles of Knowledge Representation and Reasoning: Proceedings of the 16th International Conference, KR 2018. Principles of Knowledge Representation and Reasoning: Proceedings of the 16th International Conference, KR 2018, pp. 52-56, 16th International Conference on the Principles of Knowledge Representation and Reasoning, KR 2018, Tempe, United States, 10/30/18.

A generator of hard 2QBF formulas and ASP programs. / Amendola, Giovanni; Ricca, Francesco; Truszczynski, Miroslaw.
Principles of Knowledge Representation and Reasoning: Proceedings of the 16th International Conference, KR 2018. ed. / Michael Thielscher; Francesca Toni; Frank Wolter. 2018. p. 52-56 (Principles of Knowledge Representation and Reasoning: Proceedings of the 16th International Conference, KR 2018).

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

TY - GEN

T1 - A generator of hard 2QBF formulas and ASP programs

AU - Amendola, Giovanni

AU - Ricca, Francesco

AU - Truszczynski, Miroslaw

PY - 2018

Y1 - 2018

N2 - The availability of generators of random instances of boolean formulas has had a major impact on solver technology for KR formalisms such as SAT, QBF and ASP. Recently, we proposed new models of random QSAT formulas in non-clausal form, as well as the first model of random disjunctive logic programs. Our models support generating instances of substantial hardness. Here, we present a tool that generates formulas/programs from the new models in a variety of output formats including (Q)DIMACS, QCIR, and ASPCore 2.0.

AB - The availability of generators of random instances of boolean formulas has had a major impact on solver technology for KR formalisms such as SAT, QBF and ASP. Recently, we proposed new models of random QSAT formulas in non-clausal form, as well as the first model of random disjunctive logic programs. Our models support generating instances of substantial hardness. Here, we present a tool that generates formulas/programs from the new models in a variety of output formats including (Q)DIMACS, QCIR, and ASPCore 2.0.

UR - https://www.scopus.com/pages/publications/85088244527

UR - https://www.scopus.com/pages/publications/85088244527#tab=citedBy

M3 - Conference contribution

AN - SCOPUS:85088244527

T3 - Principles of Knowledge Representation and Reasoning: Proceedings of the 16th International Conference, KR 2018

SP - 52

EP - 56

BT - Principles of Knowledge Representation and Reasoning

A2 - Thielscher, Michael

A2 - Toni, Francesca

A2 - Wolter, Frank

T2 - 16th International Conference on the Principles of Knowledge Representation and Reasoning, KR 2018

Y2 - 30 October 2018 through 2 November 2018

ER -

Amendola G, Ricca F, Truszczynski M. A generator of hard 2QBF formulas and ASP programs. In Thielscher M, Toni F, Wolter F, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the 16th International Conference, KR 2018. 2018. p. 52-56. (Principles of Knowledge Representation and Reasoning: Proceedings of the 16th International Conference, KR 2018).

A generator of hard 2QBF formulas and ASP programs

Abstract

Publication series

Conference

Bibliographical note

Funding

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this