On Simplification of Formulas with Unconstrained Variables and Quantifiers

Theory and Applications of Satisfiability Testing – SAT 2017 - Lecture Notes in Computer Science ◽

10.1007/978-3-319-66263-3_23 ◽

2017 ◽

pp. 364-379 ◽

Cited By ~ 1

Author(s):

Martin Jonáš ◽

Jan Strejček

Download Full-text