Preprocessing for DQBF

For SAT and QBF formulas many techniques are applied in order to reduce/modify the number of variables and clauses of the formula, before the formula is passed to the actual solving algorithm. It is well known that these preprocessing techniques often reduce the computation time of the solver by ord...

Full description

Saved in:
Bibliographic Details
Published inTheory and Applications of Satisfiability Testing -- SAT 2015 Vol. 9340; pp. 173 - 190
Main Authors Wimmer, Ralf, Gitina, Karina, Nist, Jennifer, Scholl, Christoph, Becker, Bernd
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2015
Springer International Publishing
SeriesLecture Notes in Computer Science
Subjects
Artificial intelligence
Boolean Formula
Computer science
Conjunctive Normal Form
Conjunctive Normal Form Formula
Mathematical theory of computation
Universal Expansion
Universal Variable
Online AccessGet full text
ISBN3319243179
9783319243177
ISSN0302-9743
1611-3349
DOI10.1007/978-3-319-24318-4_13

Cover

Abstract For SAT and QBF formulas many techniques are applied in order to reduce/modify the number of variables and clauses of the formula, before the formula is passed to the actual solving algorithm. It is well known that these preprocessing techniques often reduce the computation time of the solver by orders of magnitude. In this paper we generalize different preprocessing techniques for SAT and QBF problems to dependency quantified Boolean formulas (DQBF) and describe how they need to be adapted to work with a DQBF solver core. We demonstrate their effectiveness both for CNF- and non-CNF-based DQBF algorithms.
AbstractList For SAT and QBF formulas many techniques are applied in order to reduce/modify the number of variables and clauses of the formula, before the formula is passed to the actual solving algorithm. It is well known that these preprocessing techniques often reduce the computation time of the solver by orders of magnitude. In this paper we generalize different preprocessing techniques for SAT and QBF problems to dependency quantified Boolean formulas (DQBF) and describe how they need to be adapted to work with a DQBF solver core. We demonstrate their effectiveness both for CNF- and non-CNF-based DQBF algorithms.
Author Nist, Jennifer
Gitina, Karina
Wimmer, Ralf
Scholl, Christoph
Becker, Bernd
Author_xml – sequence: 1
  givenname: Ralf
  surname: Wimmer
  fullname: Wimmer, Ralf
  email: wimmer@informatik.uni-freiburg.de
  organization: Albert-Ludwigs-Universität Freiburg, Freiburg im Breisgau, Germany
– sequence: 2
  givenname: Karina
  surname: Gitina
  fullname: Gitina, Karina
  email: gitina@informatik.uni-freiburg.de
  organization: Albert-Ludwigs-Universität Freiburg, Freiburg im Breisgau, Germany
– sequence: 3
  givenname: Jennifer
  surname: Nist
  fullname: Nist, Jennifer
  email: nistj@informatik.uni-freiburg.de
  organization: Albert-Ludwigs-Universität Freiburg, Freiburg im Breisgau, Germany
– sequence: 4
  givenname: Christoph
  surname: Scholl
  fullname: Scholl, Christoph
  email: scholl@informatik.uni-freiburg.de
  organization: Albert-Ludwigs-Universität Freiburg, Freiburg im Breisgau, Germany
– sequence: 5
  givenname: Bernd
  surname: Becker
  fullname: Becker, Bernd
  email: becker@informatik.uni-freiburg.de
  organization: Albert-Ludwigs-Universität Freiburg, Freiburg im Breisgau, Germany
BookMark eNpFUE1PwzAMDTAQ3diVE4f9gUBsJ0tyhMEAaRIgwTnK2pSvqS1J9_9JNyROtp793rPfmI2atgmMXYC4BCH0ldWGEyewHCWB4dIBHbAxZWQH6ENWwByAE0l79D_QdsQKQQK51ZJOWGERhRB585RNU_rKPSij5kIV7Pw5hi62ZUjps3mf1W2c3b7cLM_Yce03KUz_6oS9Le9eFw989XT_uLhe8S4b9ZwwoLYSqrU3oUYFSGirtfE1gtel8sZICrUqSVeismRwrg0pK0oZNGFNE4Z73dTF7B-iW7ftd3Ig3BCByxE4cvkvt_vYDRFkktyT8uE_25B6FwZWGZo--k354bs-xOSU0iaf5EBnMUv0C-FhWRI
ContentType Book Chapter
Copyright Springer International Publishing Switzerland 2015
Copyright_xml – notice: Springer International Publishing Switzerland 2015
DBID FFUUA
DEWEY 004.015181
DOI 10.1007/978-3-319-24318-4_13
DatabaseName ProQuest Ebook Central - Book Chapters - Demo use only
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 3319243187
9783319243184
EISSN 1611-3349
Editor Heule, Marijn
Weaver, Sean
Editor_xml – sequence: 1
  fullname: Weaver, Sean
– sequence: 2
  fullname: Heule, Marijn
EndPage 190
ExternalDocumentID EBC5578251_170_193
GroupedDBID 0D6
0DA
38.
AABBV
AAGZE
AAZAK
AAZUS
ABBVZ
ABFTD
ABMNI
ACKNT
ACRRC
AEDXK
AEJLV
AEKFX
AETDV
AEZAY
ALMA_UNASSIGNED_HOLDINGS
APFYR
AZZ
BBABE
CZZ
FFUUA
I4C
IEZ
IY-
LDH
SBO
SFQCF
TMQGW
TPJZQ
TSXQS
TWXRB
Z7R
Z7U
Z7X
Z7Z
Z81
Z83
Z84
Z85
Z88
-DT
-~X
29L
2HA
2HV
ACGFS
ADCXD
EJD
F5P
LAS
P2P
RSU
~02
ID FETCH-LOGICAL-p243t-32e27941dba8ef2512329db8af21a7c5a8843ef5c37d0d93826783590c4e732f3
ISBN 3319243179
9783319243177
ISSN 0302-9743
IngestDate Tue Jul 29 20:14:16 EDT 2025
Thu May 29 01:01:47 EDT 2025
IsPeerReviewed true
IsScholarly true
LCCallNum QA75.5-76.95
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-p243t-32e27941dba8ef2512329db8af21a7c5a8843ef5c37d0d93826783590c4e732f3
Notes This work was partly supported by the German Research Council (DFG) as part of the Transregional Collaborative Research Center AVACS (SFB/TR 14).
OCLC 922000611
PQID EBC5578251_170_193
PageCount 18
ParticipantIDs springer_books_10_1007_978_3_319_24318_4_13
proquest_ebookcentralchapters_5578251_170_193
PublicationCentury 2000
PublicationDate 2015
20151027
PublicationDateYYYYMMDD 2015-01-01
2015-10-27
PublicationDate_xml – year: 2015
  text: 2015
PublicationDecade 2010
PublicationPlace Switzerland
PublicationPlace_xml – name: Switzerland
– name: Cham
PublicationSeriesSubtitle Theoretical Computer Science and General Issues
PublicationSeriesTitle Lecture Notes in Computer Science
PublicationSeriesTitleAlternate Lect.Notes Computer
PublicationSubtitle 18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings
PublicationTitle Theory and Applications of Satisfiability Testing -- SAT 2015
PublicationYear 2015
Publisher Springer International Publishing AG
Springer International Publishing
Publisher_xml – name: Springer International Publishing AG
– name: Springer International Publishing
RelatedPersons Kleinberg, Jon M.
Mattern, Friedemann
Naor, Moni
Mitchell, John C.
Terzopoulos, Demetri
Steffen, Bernhard
Pandu Rangan, C.
Kanade, Takeo
Kittler, Josef
Weikum, Gerhard
Hutchison, David
Tygar, Doug
RelatedPersons_xml – sequence: 1
  givenname: David
  surname: Hutchison
  fullname: Hutchison, David
  organization: Lancaster University, Lancaster, United Kingdom
– sequence: 2
  givenname: Takeo
  surname: Kanade
  fullname: Kanade, Takeo
  organization: Carnegie Mellon University, Pittsburgh, USA
– sequence: 3
  givenname: Josef
  surname: Kittler
  fullname: Kittler, Josef
  organization: University of Surrey, Guildford, United Kingdom
– sequence: 4
  givenname: Jon M.
  surname: Kleinberg
  fullname: Kleinberg, Jon M.
  organization: Cornell University, Ithaca, USA
– sequence: 5
  givenname: Friedemann
  surname: Mattern
  fullname: Mattern, Friedemann
  organization: CNB H 104.2, ETH Zurich, Zürich, Switzerland
– sequence: 6
  givenname: John C.
  surname: Mitchell
  fullname: Mitchell, John C.
  organization: Stanford, USA
– sequence: 7
  givenname: Moni
  surname: Naor
  fullname: Naor, Moni
  organization: Weizmann Institute of Science, Rehovot, Israel
– sequence: 8
  givenname: C.
  surname: Pandu Rangan
  fullname: Pandu Rangan, C.
  organization: Madras, Indian Institute of Technology, Chennai, India
– sequence: 9
  givenname: Bernhard
  surname: Steffen
  fullname: Steffen, Bernhard
  organization: Fakultät Informatik, TU Dortmund, Dortmund, Germany
– sequence: 10
  givenname: Demetri
  surname: Terzopoulos
  fullname: Terzopoulos, Demetri
  organization: University of California, Los Angeles, USA
– sequence: 11
  givenname: Doug
  surname: Tygar
  fullname: Tygar, Doug
  organization: University of California, Berkeley, USA
– sequence: 12
  givenname: Gerhard
  surname: Weikum
  fullname: Weikum, Gerhard
  organization: Max Planck Institute for Informatics, Saarbrücken, Germany
SSID ssj0001585605
ssj0002792
Score 1.8933522
Snippet For SAT and QBF formulas many techniques are applied in order to reduce/modify the number of variables and clauses of the formula, before the formula is passed...
SourceID springer
proquest
SourceType Publisher
StartPage 173
SubjectTerms Artificial intelligence
Boolean Formula
Computer science
Conjunctive Normal Form
Conjunctive Normal Form Formula
Mathematical theory of computation
Universal Expansion
Universal Variable
Title Preprocessing for DQBF
URI http://ebookcentral.proquest.com/lib/SITE_ID/reader.action?docID=5578251&ppg=193
http://link.springer.com/10.1007/978-3-319-24318-4_13
Volume 9340
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1NT4MwGG50XowHv-P8CgdvpGa0dIXj1KlZ1GicxltDaTFe5nTzoL_e9y3gAHfRC1kaBm0fKO9Hn-cl5MhYY6TUHZppyWgYMkl1hozljPNQxNp0nJTS9U338iEcPImnWVVAxy6Z6uP0ay6v5D-oQhvgiizZPyD7c1FogN-ALxwBYTg2jN96mLUEGPPjGPjuVbLQjoXiKAsvuQT3pz9EJY3Rs0-pf98b-vAxFtUn5RaFLR1doNxVeXZ3cl4NBwSiEQ4ow4GNgGIlptW7qLmQnKMLBlaErK6JMc9FlH4tsNU9Fch_wr9GNFQ5obSuZx3EjUb32eyfnArU0BeBCiR4IHDS-I1iGTBMlxc1URbJInStRZZ6_cHV4yxoBs4N-F_I0Sm7HecqSrNhVPiR87pZ8yQayW9nUwzXyAryTDwkgEDH18mCHW2Q1bLKhlcsuptku4aPB_h4iM8WeTjvD08vaVHNgo7h7lPKmWWw-AVGJ5HN0KzkLDY6SjIWJDIVSRSF3GYi5dJ0TMzB78OoXNxJQys5y_g2aY1eR3aHeF3BtZCJgPcsDTXrJrHtRjaKUG2RmTRpE1qOUbmce7HRN81HNFENANrELydC4ekTVYpZwwwqrmAGlZtBhTO4-8er75Hl2YO6T1rT9w97AJbcVB8W-H4DwxVALw
linkProvider Library Specific Holdings
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.title=Theory+and+Applications+of+Satisfiability+Testing+--+SAT+2015&rft.atitle=Preprocessing+for+DQBF&rft.date=2015-01-01&rft.pub=Springer+International+Publishing+AG&rft.isbn=9783319243177&rft.volume=9340&rft_id=info:doi/10.1007%2F978-3-319-24318-4_13&rft.externalDBID=193&rft.externalDocID=EBC5578251_170_193
thumbnail_s http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Febookcentral.proquest.com%2Fcovers%2F5578251-l.jpg