Login / Signup
Building Automated Theorem Provers for Infinitely-Valued Logics with Satisfiability Modulo Theory Solvers.
Carlos Ansótegui
Miquel Bofill
Felip Manyà
Mateu Villaret
Published in:
ISMVL (2012)
Keyphrases
</>
computer algebra
automated theorem provers
quantified boolean formulas
computational complexity
satisfiability problem
sat solving
artificial neural networks
sat solvers
machine learning
probability distribution
sat instances
valued logic
satisfiability modulo theories