预处理技术文献

1. 

Norbert Manthey, Marijn Heule, Armin Biere:
Automated Reencoding of Boolean Formulas. Haifa Verification Conference 2012: 102-117

 

2.

A. Haberlandt, H. Green, and M. J. Heule, “Effective auxiliary variables via structured reencoding,” in-review at SAT 2023

 

3.

 

%SBVA-CADICAL and SBVA-KISSAT: Structured Bounded Variable Addition
Andrew Haberlandt∗
and Harrison Green∗
Carnegie Mellon University
Pittsburgh, Pennsylvania, USA
{ahaberla, harrisog}@cmu.edu
∗Authors contributed equally
page 18

 

%kissat cadical

%Andrew Haberlandt, Harrison Green, “SBVA-CADICAL and SBVA-KISSAT: Structured Bounded Variable Addition,” in Proc. of SAT Competition 2023 – Solver and Benchmark
Descriptions, ser. Department of Computer Science Series of Publications B,
T. Balyo, N. Froleyks, M. Heule, M. Iser, M. Jarvisalo, and M. Suda, ¨
Eds., vol. B-2023-1. University of Helsinki, 2023, pp. 18.

 

@book{248aee38a46f47c5aa5f52b004dfedb8,
title = "Proceedings of SAT Competition 2023: Solver, Benchmark and Proof Checker Descriptions",
keywords = "113 Computer and information sciences",
editor = "Tomas Balyo and Marijn Heule and Markus Iser and Matti J{\"a}rvisalo and Martin Suda",
year = "2023",
language = "English",
series = "Department of Computer Science Series of Publications B",
publisher = "Department of Computer Science, University of Helsinki",
address = "Finland",

}

 

 

%kissat cadical
%A. Biere, K. Fazekas, M. Fleury, and M. Heisinger, “CaDiCaL, Kissat,
Paracooba, Plingeling and Treengeling entering the SAT Competition
2020,” in Proc. of SAT Competition 2020 – Solver and Benchmark
Descriptions, ser. Department of Computer Science Report Series B,
T. Balyo, N. Froleyks, M. Heule, M. Iser, M. Jarvisalo, and M. Suda, ¨
Eds., vol. B-2020-1. University of Helsinki, 2020, pp. 51–53.

%SBVA-CADICAL and SBVA-KISSAT: Structured
Bounded Variable Addition
Andrew Haberlandt∗
and Harrison Green∗
Carnegie Mellon University
Pittsburgh, Pennsylvania, USA
{ahaberla, harrisog}@cmu.edu
∗Authors contributed equally
page 18

%Andrew Haberlandt, Harrison Green, “SBVA-CADICAL and SBVA-KISSAT: Structured Bounded Variable Addition,” in Proc. of SAT Competition 2023 – Solver and Benchmark
Descriptions, ser. Department of Computer Science Series of Publications B,
T. Balyo, N. Froleyks, M. Heule, M. Iser, M. Jarvisalo, and M. Suda, ¨
Eds., vol. B-2023-1. University of Helsinki, 2023, pp. 18.

 

 

4. vivify   inprocessing

 

 

   

Cédric Piette, Youssef Hamadi, Lakhdar Sais:
Vivifying Propositional Clausal Formulae. ECAI 2008: 525-529

 

@inproceedings{DBLP:conf/ecai/PietteHS08,
  author       = {C{\'{e}}dric Piette and
                  Youssef Hamadi and
                  Lakhdar Sais},
  editor       = {Malik Ghallab and
                  Constantine D. Spyropoulos and
                  Nikos Fakotakis and
                  Nikolaos M. Avouris},
  title        = {Vivifying Propositional Clausal Formulae},
  booktitle    = {{ECAI} 2008 - 18th European Conference on Artificial Intelligence,
                  Patras, Greece, July 21-25, 2008, Proceedings},
  series       = {Frontiers in Artificial Intelligence and Applications},
  volume       = {178},
  pages        = {525--529},
  publisher    = {{IOS} Press},
  year         = {2008},
  url          = {https://doi.org/10.3233/978-1-58603-891-5-525},
  doi          = {10.3233/978-1-58603-891-5-525},
  timestamp    = {Wed, 24 May 2017 08:27:20 +0200},
  biburl       = {https://dblp.org/rec/conf/ecai/PietteHS08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
   
 

//cadical求解器代码文件vivify.cpp中的注释

/*------------------------------------------------------------------------*/

// Vivification is a special case of asymmetric tautology elimination (ATE)
// and asymmetric literal elimination (ALE). It strengthens and removes
// clauses proven redundant through unit propagation.
//
// The original algorithm is due to a paper by Piette, Hamadi and Sais
// published at ECAI'08. We have an inprocessing version, e.g., it does not
// necessarily run-to-completion. Our version also performs conflict
// analysis and uses a new heuristic for selecting clauses to vivify.

// Our idea is to focus on clauses with many occurrences of its literals in
// other clauses first. This both complements nicely our implementation of
// subsume, which is bounded, e.g., subsumption attempts are skipped for
// very long clauses with literals with many occurrences and also is
// stronger in the sense that it enables to remove more clauses due to unit
// propagation (AT checks).

// While first focusing on irredundant clause we then added a separate phase
// upfront which focuses on strengthening also redundant clauses in spirit
// of the ideas presented in the IJCAI'17 paper by M. Luo, C.-M. Li, F.
// Xiao, F. Manya, and Z. Lu.

// There is another very similar approach called 'distilliation' published
// by Han and Somenzi in DAC'07, which reorganizes the CNF in a trie data
// structure to reuse decisions and propagations along the trie. We used
// that as an inspiration but instead of building a trie we simple sort
// clauses and literals in such a way that we get the same effect. If a new
// clause is 'distilled' or 'vivified' we first check how many of the
// decisions (which are only lazily undone) can be reused for that clause.
// Reusing can be improved by picking a global literal order and sorting the
// literals in all clauses with respect to that order. We favor literals
// with more occurrences first. Then we sort clauses lexicographically with
// respect to that literal order.

/*------------------------------------------------------------------------*/

// For vivification we have a separate dedicated propagation routine, which
// prefers to propagate binary clauses first. It also uses its own
// assignment procedure 'vivify_assign', which does not mess with phase
// saving during search nor the conflict and other statistics and further
// can be inlined separately here. The propagation routine needs to ignore
// (large) clauses which are currently vivified.
   
 
   

 

posted on 2024-04-01 07:10  海阔凭鱼跃越  阅读(8)  评论(0)  编辑  收藏  举报