PRBOT-its: Building High Strength Mixed Covering Arrays with ConstraintsΒΆ

PRBOT-its is a greedy SAT-based algorithm for building high strength Mixed Covering Arrays with Constraints (MCACS).

Note

Accepted in CP2021. If you use PRBOT-its in one of your research projects, please cite us:

@article{DBLP:abs-2105-12552,
   author    = {Carlos Ans{\'{o}}tegui and
                  Felip Many{\`{a}} and
                  Jesus Ojeda and
                  Josep M. Salvia and
                  Eduard Torres},
   title     = {Incomplete MaxSAT Approaches for Combinatorial Testing},
   journal   = {arXiv},
   volume    = {abs/2105.12552},
   year      = {2021},
   url       = {https://arxiv.org/abs/2105.12552},
   archivePrefix = {arXiv},
   eprint    = {2105.12552},
   timestamp = {Tue, 01 Jun 2021 18:07:59 +0200},
   biburl    = {https://dblp.org/rec/journals/corr/abs-2105-12552.bib},
   bibsource = {dblp computer science bibliography, https://dblp.org}
}