| Commit message (Collapse) | Author | Age |
|---|
| | |
|
| |
|
|
|
|
|
|
|
|
|
|
| |
For permissive licenses like MIT and BSD, OR EPL doesn't make sense, because the
copyright original permission notice must be retained at all times.
For code simply copied with minimal modifications that are unrelated to
Refinery, we can just use the plain MIT license or BSD-3-clause license.
For code with complex modifications related to Refinery, we can instead use the
MIT AND EPL-2.0 SPDX expression, which forces downstream users to retain the
original MIT notices as required by the MIT license, but also extends Refinery's
copyleft to our modifications.
|
| |
|
|
|
| |
Also makes model seeds cancellable to reduce server load during semantic
analysis.
|
| | |
|
| |
|
|
|
|
|
|
| |
* DuplicateDnfRewriter replaces DNF with their canonical
representatives
* ClauseInputParameterResolver removes input parameters by demand set
transformation
* CompositeRewriter for rewriter stacks
|
| |
|
|
|
|
| |
This is needed for demand set transformation of DNFs with input data parameters,
where the result of the transformation has an out data parameter that has to be
unified with the variable in the parent clause.
|
| | |
|
| |
|
|
|
|
|
| |
Allow computing hash codes up to the renaming of variables.
Also introduces CheckLiteral instead of AssumeLiteral for more straightforward
naming.
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
| |
Enable deterministic state-space exploration by ordering activations in
lexicographic order.
This preliminary implementation adds oredering as a wrapper for ResultSet
instances, but more sophisticated support could be built directly into query
engine adapters if a query engine supports deterministic output by default.
* Implements Comparable for tuples with loops unrolled for small tuples by hand.
* Cleans up the contents of the (root of the) tools.refinery.query package.
* Adds ResultSetListener to notify clients about ResultSet changes.
* Adds OrderStatisticTree data structure for determinisitc ordering of keys.
|
| | |
|
| |
|
|
| |
Shorthad syntax for the most commonly used symbol types.
|
| | |
|
| |
|
|
|
| |
Add the ability to create assertions without pre-processing Dnf clauses (raw
matchin mode). Also fix tests broken by Dnf pre-processing.
|
| | |
|
| |
|
|
|
|
|
| |
* Introduce parameter directions for constraints and DNF
* Introduce variable directions for literals
* Infer and check variable directions in DNF and topologically sort literals by
their input variables
|
| |
|
|
|
|
|
| |
* Separate different operators into different classes to make it easier to add
functionality (e.g., simplification) later.
* Add UpperCardinality terms.
* Move UpperCardinality aggregator and tests into refinery-store-query.
|
| |
|
|
|
| |
* Add NodeFunctionView for symbols that hold function-like (single
associated object for each key) relations as integer values for performance.
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
| |
Make sure we obey the REUSE (https://reuse.software) specification and the
origin, copyright owner, and license of all files are clearly marked.
The whole project is under the EPL-2.0, except for trivial files where copyright
is not applicable that are marked with the CC0-1.0 license. Moreover, code
included from third parties is also available under the respective license.
chore: add CONTRIBUTORS.md
List all authors and supporting organizations in accordance with the REUSE
specification.
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
* 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
|
| |
|
Kristóf Marussy