Transforming Quantified Boolean Formulas Using Biclique Covers

Oliver Kullmann, Ankit Shukla

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

Abstract

We introduce the global conflict graph of DQCNFs (dependency quantified conjunctive normal forms), recording clashes between clauses on such universal variables on which all existential variables depend (called “global variables”). The biclique covers of this graph correspond to the eligible clause-slices of the DQCNF which consider only the global variables. We show that all such slices yield satisfiability-equivalent variations. This opens the possibility to realise this slice using as few global variables as possible. We give basic theoretical results and first supporting experimental data.
Original languageEnglish
Title of host publicationTools and Algorithms for the Construction and Analysis of Systems - 29th International Conference, {TACAS} 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, {ETAPS
Editors Sriram Sankaranarayanan, Natasha Sharygina
PublisherSpringer
Pages372–390
Number of pages14
Volume13994
Publication statusPublished - Apr 2023

Publication series

NameLecture Notes in Computer Science (LNCS)

Fields of science

  • 102 Computer Sciences
  • 102001 Artificial intelligence
  • 102011 Formal languages
  • 102022 Software development
  • 102031 Theoretical computer science
  • 603109 Logic
  • 202006 Computer hardware

Cite this