A fast untestability proof for SAT-based ATPG.

Daniel Tille Rolf Drechsler

Published in: DDECS (2009)

Keyphrases

answer set programming
bounded model checking
ai planning
theorem proving
sat solvers
theorem prover
planning domains
linear logic
planning problems
neural network
information retrieval
expert systems
proof theory
mathematical proofs