Finding Minimum Locating Arrays Using a CSP Solver

DOI10.3233/FI-2020-1929zbMath1471.68070arXiv1904.07480MaRDI QIDQ5134287

Tatsuhiro Tsuchiya, Hideharu Kojima, Tatsuya Konishi, Hiroyuki Nakagawa

Publication date: 16 November 2020

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.07480

zbMATH Keywords

constraint satisfaction problemsoftware testinglocating arraycombinatorial interaction testing

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Combinatorial aspects of packing and covering (05B40) Computational aspects of satisfiability (68R07)

This page was built for publication: Finding Minimum Locating Arrays Using a CSP Solver