|
|
| (One intermediate revision by the same user not shown) |
| Line 1: |
Line 1: |
| {| class="wikitable"
| | #REDIRECT [[:Category:Logic Solvers]] |
| |-
| |
| ! '''[[NLA]]'''
| |
| |-
| |
| | '''[[QRSlv]]'''
| |
| |-
| |
| | '''[[CMSlv]]'''
| |
| |-
| |
| | '''[[IPSlv]]'''
| |
| |-
| |
| | '''[[Opt]]'''
| |
| |-
| |
| ! '''[[NLP]]'''
| |
| |-
| |
| | '''[[CONOPT]]'''
| |
| |-
| |
| | '''[[IPOPT]]'''
| |
| |-
| |
| | '''[[TRON]]'''
| |
| |-
| |
| | '''[[MINOS]]'''
| |
| |-
| |
| | '''[[NGSlv]]'''
| |
| |-
| |
| | '''[[OptSQP]]'''
| |
| |-
| |
| ! '''[[DAE]]/[[ODE]]'''
| |
| |-
| |
| | '''[[IDA]]'''
| |
| |-
| |
| | '''[[LSODE]]'''
| |
| |-
| |
| | '''[[DOPRI5]]'''
| |
| |-
| |
| ! '''[[LA]]'''
| |
| |-
| |
| | '''[[linsolqr]]'''
| |
| |-
| |
| | '''[[linsol]]'''
| |
| |-
| |
| ! '''[[LP]]'''
| |
| |-
| |
| | '''[[MakeMPS]]'''
| |
| |-
| |
| ! '''<strong class="selflink">Logic</strong>'''
| |
| |-
| |
| | '''[[LRSlv]]'''
| |
| |}
| |
| <div class="notice metadata" id="stub">''This article is a '''stub'''. You can help out by <span class="plainlinks">[http://ascendwiki.cheme.cmu.edu/index.php?title=Logic_Solvers&action=edit expanding it]</span>. ''</div>
| |
| | |
| Logic solvers allow the precedence order of a series of boolean relations to be determines, so that they can be evaluated in the correct order. [[LRSlv]] is presently the only solver that provides this functionality.
| |
| | |
| [[LRSlv]] can only solve a boolean system if there are no blocks of equations with more than one '''relation'''. This could be implemented but would require a more advanced logic solver.
| |
| | |
| | |
| We propose to examine options in connecting a SAT solver to ASCEND, to see if that's likely to be a useful development.
| |
| | |
| See also [[ABsolver]].
| |
| | |
| | |
| | |
| | |
| [[Category:Solvers]]
| |
| [[Category:Stubs]]
| |