Using SMT for Solving Fragments of Parameterised Boolean Equation Systems
DOI10.1007/978-3-319-24953-7_3zbMath1471.68314OpenAlexW2295571705MaRDI QIDQ3460542
Ruud P. J. Koolen, Tim A. C. Willemse, Hans Zantema
Publication date: 8 January 2016
Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-24953-7_3
Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
This page was built for publication: Using SMT for Solving Fragments of Parameterised Boolean Equation Systems
