Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | refactor(upperbound): improve choice function | Federico Igne | 2022-06-01 | 1 | -14/+6 |
| | |||||
* | feat: implicitly propagate configs to approximations | Federico Igne | 2022-06-01 | 1 | -6/+6 |
| | |||||
* | fix(lowerbound): cycle detection in approximation algorithm | Federico Igne | 2022-05-19 | 1 | -11/+99 |
| | |||||
* | refactor: move RSAOntology class under ontology package | Federico Igne | 2022-05-19 | 1 | -1/+1 |
| | |||||
* | Fix bug in normalisation | Federico Igne | 2021-11-29 | 1 | -8/+4 |
| | | | | This would not produce a completely normalised ontology. | ||||
* | Fix issue where not all roles where considered for top axiomatisation | Federico Igne | 2021-10-04 | 2 | -1/+8 |
| | |||||
* | Add new fresh data factory | Federico Igne | 2021-08-06 | 2 | -15/+17 |
| | | | | This will help write more significant test. | ||||
* | Extend converter to RDFox rules to handle property chain axioms | Federico Igne | 2021-08-03 | 1 | -38/+0 |
| | | | | | | | | | The converter to RDFox datalog rules shouldn't worry about which axiom is supported or not (it should be a job of the approximation algorithm or of a previous step). Now the converter tries its best to convert anything that makes sense in datalog. Also upperbound is ready for testing. | ||||
* | Implement fine-grained constant skolemization in upperbound | Federico Igne | 2021-07-29 | 1 | -100/+128 |
| | |||||
* | Change spelling: LowerBound to Lowerbound | Federico Igne | 2021-07-29 | 1 | -9/+9 |
| | |||||
* | Add skeleton for upperbound computation | Federico Igne | 2021-07-27 | 1 | -0/+183 |
| | |||||
* | Rework class structure to match more general workflow | Federico Igne | 2021-07-27 | 1 | -1/+1 |
| | | | | | | | | The major change is the introduction of a new class Ontology (superclass of RSAOntology) that contains all those operation that we would like to perform on *any* OWL 2 ontology. Approximation is also generic on the return type, allowing for example intermediate steps (or chaining of approximations). | ||||
* | Fix file naming | Federico Igne | 2021-07-22 | 2 | -2/+2 |
| | |||||
* | Remove normalization step from lowerbound computation | Federico Igne | 2021-07-22 | 1 | -17/+10 |
| | |||||
* | Make approximation generic over returned type | Federico Igne | 2021-07-22 | 2 | -33/+30 |
| | |||||
* | Move some generic commands from RSAOntology to Ontology | Federico Igne | 2021-07-22 | 1 | -2/+2 |
| | |||||
* | Generalize dependency graph generation | Federico Igne | 2021-07-20 | 1 | -2/+2 |
| | | | | | | | | | | The code to generate the dependency graph has been moved in the companion object of the generic OWL 2 ontology wrapper Ontology. This signals that we could potentially build a dependency graph for any ontology (and not only RSA ontology). Moreover, a dependency graph can be build for an Ontology object or an arbitrary TBox and Abox. | ||||
* | Fix minor compilation errors | Federico Igne | 2021-06-01 | 1 | -6/+25 |
| | |||||
* | Multiple fixes | Federico Igne | 2021-05-31 | 2 | -12/+30 |
| | |||||
* | Add scafolding for generic approximation support | Federico Igne | 2021-05-31 | 2 | -0/+223 |