<--- Back to Details
First PageDocument Content
Theoretical computer science / Mathematics / Formal methods / Mathematical logic / Logic in computer science / Electronic design automation / NP-complete problems / Boolean algebra / Satisfiability modulo theories / Coq / Solver / Proof assistant
Date: 2017-07-21 11:03:15
Theoretical computer science
Mathematics
Formal methods
Mathematical logic
Logic in computer science
Electronic design automation
NP-complete problems
Boolean algebra
Satisfiability modulo theories
Coq
Solver
Proof assistant

SMTCoq: A plug-in for integrating SMT solvers into Coq? Burak Ekici1 , Alain Mebsout1 , Cesare Tinelli1 , Chantal Keller2 , Guy Katz3 , Andrew Reynolds1 , and Clark Barrett3 t

Add to Reading List

Source URL: mebsout.github.io

Download Document from Source Website

File Size: 231,02 KB

Share Document on Facebook

Similar Documents

Algebra Universalis,  + 0.20/0 (~ 1995 BirkhS.user Verlag, Basel  Adjoining units to residuated Boolean algebras

Algebra Universalis, + 0.20/0 (~ 1995 BirkhS.user Verlag, Basel Adjoining units to residuated Boolean algebras

DocID: 1v8wA - View Document

American Computer Science League Flyer Solutions 1. Boolean Algebra ( A  B) ( AB  BC ) = A B ( AB  BC ) = AA B  A BB C  0  0  0

American Computer Science League Flyer Solutions 1. Boolean Algebra ( A  B) ( AB  BC ) = A B ( AB  BC ) = AA B  A BB C  0  0  0

DocID: 1uZJ8 - View Document

Visualising the Boolean Algebra IB4 in 3D Hans Smessaert & Lorenz Demey KU Leuven, Belgium Rhombic Dodecahedron (RDH)  LOGICAL GEOMETRY

Visualising the Boolean Algebra IB4 in 3D Hans Smessaert & Lorenz Demey KU Leuven, Belgium Rhombic Dodecahedron (RDH) LOGICAL GEOMETRY

DocID: 1up5i - View Document

BOO axioms BOO001-0.ax Ternary Boolean algebra (equality) axioms m(m(v, w, x), y, m(v, w, z)) = m(v, w, m(x, y, z)) cnf(associativity, axiom) m(y, x, x) = x cnf(ternary multiply1 , axiom)

BOO axioms BOO001-0.ax Ternary Boolean algebra (equality) axioms m(m(v, w, x), y, m(v, w, z)) = m(v, w, m(x, y, z)) cnf(associativity, axiom) m(y, x, x) = x cnf(ternary multiply1 , axiom)

DocID: 1u9q0 - View Document

On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon

On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon

DocID: 1rsZm - View Document