ABsolver: Difference between revisions
Jump to navigation
Jump to search
Created page with '{{missing}} {{task}}' |
No edit summary |
||
| Line 1: | Line 1: | ||
{{task}} | {{task}} | ||
'''[http://absolver.sourceforge.net/ ABSolver]''' is a 'SMT' or 'SAT modulo theories' solver written by [http://users.cecs.anu.edu.au/~baueran/ Andreas Bauer] that augments a conventional boolean satisfiability solver with a solver able to calculate non-linear equation systems. The result is a solver that can optimise difficult decision-making problems coupled with non-linear constraints. | |||
It appears that ABsolver, or a solver based on the same approach, might be an interesting, and possibly powerful, alternative to ASCEND's current [[CMSlv]] solver for [[conditional modelling]]. | |||
Revision as of 08:38, 2 August 2010
This article is about planned development or proposed functionality. Comments welcome.
ABSolver is a 'SMT' or 'SAT modulo theories' solver written by Andreas Bauer that augments a conventional boolean satisfiability solver with a solver able to calculate non-linear equation systems. The result is a solver that can optimise difficult decision-making problems coupled with non-linear constraints.
It appears that ABsolver, or a solver based on the same approach, might be an interesting, and possibly powerful, alternative to ASCEND's current CMSlv solver for conditional modelling.