User talk:LeonKwek
Meeting 18 Mar 2011
It was decided to work on a proposal for a way to modify LRSlv and the logical relation evaluation code. It is our understanding that:
- currently, LRSlv evaluates real-valued boundary relation residuals, because we believe that such relations are not touched by QRSlv under control of CMSlv.
- Boundary expressions (within CONDITIONAL..END CONDITIONAL tags), are just relations in the instance hierarchy, but we're not sure how they are indentified and boundaries.
- Being that boundary expressions are RelationInstance objects, there is nowhere we can store a logical truth value for them.
- SATISFIED terms are stored as LogRelTerm objects pointed to from LogRelInstance objects.
- SATISFIED terms contain a flag which we could use to store truth values
Hence, we proposed to proceed roughly as follows:
- Aim to fork LRSlv to a new logical solver that does NOT evaluate boundary relations, but instead seeks to look up their value, which we will inject as an output from IDA.
- We will need to have a way of evaluating the initial value of the boundary relations, which would be called after the initial valuation calculation is completed.
- Investigate the idea of writing a function that would set these truth values by looking up the bnd, then linking through to the boundary relation, and thence to the LogRelInstance objects and the SATISFIED terms therein.
- Discuss with Ben!
In addition, I now suggest that we
- document our findings on the LRSlv and/or CMSlv wiki pages.
- Instead of adding data/flags to the instance tree, is there any way we can do this purely within the solver layer?
Jpye 05:01, 18 March 2011 (UTC)