Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
  Oliveras, Albert Add to Alert Profile  
Date Reviewed  
  1 - 2 of 2 reviews    
  Incomplete SMT techniques for solving non-linear formulas over the integers
Borralleras C., Larraz D., Rodríguez-Carbonell E., Oliveras A., Rubio A.  ACM Transactions on Computational Logic 20(4): 1-36, 2019. Type: Article

It is well known that nonlinear integer arithmetic is undecidable due to a negative answer to Hilbert’s tenth problem. Still, constraint solving over nonlinear integer polynomials has attracted considerable attention because of the wide rang...
May 27 2021  
  Practical algorithms for unsatisfiability proof and core generation in SAT solvers
Asín Achá R., Nieuwenhuis R., Oliveras A., Rodríguez-Carbonell E.  AI Communications 23(2-3): 145-157, 2010. Type: Article

Boolean satisfiability (SAT), a nondeterministic polynomial-time (NP) complete problem, deals with determining whether a given set of Boolean propositions can evaluate to a true value, by choosing an appropriate assignment to their constituent var...
Aug 11 2010  

Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2021 ThinkLoud, Inc.
Terms of Use
| Privacy Policy