Dominant Controllability Check Using QBF-Solver and Netlist Optimizer

DOI10.1007/978-3-319-09284-3_18zbMath1423.68450OpenAlexW95027819MaRDI QIDQ3192072

Tamir Heyman, Husam abu-Haimed, Dan Smith, Lance Leong, Yogesh Mahajan

Publication date: 26 September 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09284-3_18

zbMATH Keywords

controllabilityQBFnetlist optimizerQBF preprocessor

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Conformant planning as a case study of incremental QBF solving ⋮ Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations

Uses Software

• sQueezeBF

This page was built for publication: Dominant Controllability Check Using QBF-Solver and Netlist Optimizer