aboutsummaryrefslogtreecommitdiffstats
path: root/subprojects/store-reasoning
Commit message (Collapse)AuthorAge
* feat: terms and improved query evaluationLibravatar Kristóf Marussy2023-03-31
| | | | | | | | | | | | | | | | | * Implement data terms for computations in queries. * Function-like queries with computed results. * Improved query evaluation, including positive and negative diagonal cosntraints. * Preliminary local search support. * Changes to the DNF representation for count and aggregation support. feat: terms wip feat: query terms wip feat: query evaluation, diagonal constraints, local search wip fix reasoning compilation wip
* refactor: more direct access to VIATRA result setLibravatar Kristóf Marussy2023-03-01
| | | | | | | | | | | | | | | | | | | | | Accessing VIATRA result sets through IQueryResultProvider requires a lot of indirection, allocations, and locking. We use reflection instead to have direct access to the underlying Indexer instead. Unfortunately, projection to arbitrary tuple masks (with wildcard entries in a tuple) is completely broken in VIATRA when RETE update propagation is delayed. While a new, ad-hoc projection indexer gets added to the RETE net immediately, it is not populated with the projection results until updates are flushed in the query engine. Therefore, when encountering an ad-hoc projection for the first time, the projection results will always be empty (thus usually out of date). While declaring the desired projections ahead of time would be a possible solution, for now, we completely remove ad-hoc projection support. If projections are needed on the ModelQuery level, we should create an API for declaring projections for each registered Dnf.
* refactor: rename PartialInterpretation adapterLibravatar Kristóf Marussy2023-02-25