Colors Make Theories Hard

DOI10.1007/978-3-319-40229-1_11zbMath1475.68451OpenAlexW2501420161MaRDI QIDQ2817916

Roberto Sebastiani

Publication date: 5 September 2016

Published in: Automated Reasoning (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11572/168325

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (1)

Colors Make Theories Hard

Uses Software

• bv2epr

Cites Work

• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures
• Complexity, convexity and combinations of theories
• The complexity of logical theories
• Decision procedures. An algorithmic point of view. With foreword by Randal E. Bryant
• Colors Make Theories Hard
• Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
• Fast Decision Procedures Based on Congruence Closure
• Simplification by Cooperating Decision Procedures
• Reasoning About Recursively Defined Data Structures
• A Practical Decision Procedure for Arithmetic with Function Symbols
• More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding
• Splitting on Demand in SAT Modulo Theories
• Frontiers of Combining Systems
• Computer Aided Verification

This page was built for publication: Colors Make Theories Hard