Logic for Programming, Artificial Intelligence, and Reasoning
From MaRDI portal
Publication:5705940
DOI10.1007/b106931zbMath1109.68097OpenAlexW4206255911MaRDI QIDQ5705940
Cesare Tinelli, Albert Oliveras, Robert Nieuwenhuis
Publication date: 10 November 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106931
Related Items
Combining SAT solvers with computer algebra systems to verify combinatorial conjectures ⋮ Satisfiability Modulo Theories ⋮ MathCheck: A Math Assistant via a Combination of Computer Algebra Systems and SAT Solvers ⋮ Integer feasibility and refutations in UTVPI constraints using bit-scaling ⋮ Bounded Model Checking of Analog and Mixed-Signal Circuits Using an SMT Solver ⋮ NRCL - A Model Building Approach to the Bernays-Schönfinkel Fragment ⋮ A certifying algorithm for lattice point feasibility in a system of UTVPI constraints ⋮ Propagation = Lazy Clause Generation ⋮ Propagation via lazy clause generation ⋮ Ground Interpolation for Combined Theories ⋮ On integer closure in a system of unit two variable per inequality constraints ⋮ A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints ⋮ Quo Vadis Answer Set Programming? ⋮ Deduction, Strategies, and Rewriting
Uses Software