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.
|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|
|Number of pages||5|
|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
|Name||Principles of Knowledge Representation and Reasoning: Proceedings of the 16th International Conference, KR 2018|
|Conference||16th International Conference on the Principles of Knowledge Representation and Reasoning, KR 2018|
|Period||10/30/18 → 11/2/18|
Bibliographical noteFunding Information:
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.
Copyright © 2018, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
ASJC Scopus subject areas