On simplification of formulas with unconstrained variables and quantifiers

DOI10.1007/978-3-319-66263-3_23zbMATH Open1496.68369OpenAlexW2742322653MaRDI QIDQ1680265FDOQ1680265

Martin Jonáš, Jan Strejček

Publication date: 15 November 2017

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

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cited In (4)

• Truncating abstraction of bit-vector operations for BDD-based SMT solvers
• Formula Simplification for Real Quantifier Elimination Using Geometric Invariance
• Simplifications of Uniform Expressions Specified by Systems
• Simplification of quantifier-free formulae over ordered fields

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Simplification of quantifier-free formulae over ordered fields 👍 👎
• On simplicity of formulas 👍 👎
• Quantifier simplification by unification in SMT 👍 👎
• Automated Reasoning with Analytic Tableaux and Related Methods 👍 👎
• On simplifying truth-functional formulas 👍 👎
• SAT-Based Formula Simplification 👍 👎
• Formula Simplification for Real Quantifier Elimination Using Geometric Invariance 👍 👎
• Simplifications of Uniform Expressions Specified by Systems 👍 👎

This page was built for publication: On simplification of formulas with unconstrained variables and quantifiers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1680265)