A generator of hard 2QBF formulas and ASP programs

Giovanni Amendola, Francesco Ricca, Miroslaw Truszczynski

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 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 languageEnglish
Title of host publicationPrinciples of Knowledge Representation and Reasoning
Subtitle of host publicationProceedings of the 16th International Conference, KR 2018
EditorsMichael Thielscher, Francesca Toni, Frank Wolter
Pages52-56
Number of pages5
ISBN (Electronic)9781577358039
StatePublished - 2018
Event16th International Conference on the Principles of Knowledge Representation and Reasoning, KR 2018 - Tempe, United States
Duration: Oct 30 2018Nov 2 2018

Publication series

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

Conference

Conference16th International Conference on the Principles of Knowledge Representation and Reasoning, KR 2018
Country/TerritoryUnited States
CityTempe
Period10/30/1811/2/18

Bibliographical note

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

ASJC Scopus subject areas

  • Software
  • Logic

Fingerprint

Dive into the research topics of 'A generator of hard 2QBF formulas and ASP programs'. Together they form a unique fingerprint.

Cite this