Efficient Query Rewriting in the Description Logic EL and Beyond
Authors: Peter Hansen, Carsten Lutz, İnanç Seylan, Frank Wolter
IJCAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | We carry out experiments with realworld ontologies which demonstrate excellent performance in practice and show that TBoxes originating from applications admit FO-rewritings of reasonable size in almost all cases, even when in theory such rewritings are not guaranteed to exist. |
| Researcher Affiliation | Academia | Peter Hansen and Carsten Lutz and Inanc Seylan University of Bremen, Germany {hansen, clu, seylan}@informatik.uni-bremen.de Frank Wolter University of Liverpool, UK frank@csc.liv.ac.uk |
| Pseudocode | Yes | Figure 1: The backwards chaining algorithm |
| Open Source Code | Yes | We have implemented the decomposed algorithm in the Grind system and conducted a number of experiments. The system can be downloaded from http://www.informatik.uni-bremen.de/ hansen/grind, and is released under GPL. |
| Open Datasets | Yes | We have identified seven TBoxes that do not fall into this class, listed in Table 1... All TBoxes together with information about their origin are available at http://www.informatik.uni-bremen.de/ hansen/grind. |
| Dataset Splits | No | The paper discusses the use of different TBoxes as inputs but does not specify explicit training, validation, or test dataset splits in terms of percentages, sample counts, or predefined partition references, which are typical for machine learning model training. |
| Hardware Specification | Yes | The experiments were carried out on a Linux (3.2.0) machine with a 3.5 GHz quad-core processor and 8 GB of RAM. |
| Software Dependencies | No | The paper mentions the operating system 'Linux (3.2.0)' and that the algorithm is implemented in 'Grind system', which is their own developed system. However, it does not specify any third-party software libraries, frameworks, or solvers with their version numbers that would be necessary to replicate the environment. |
| Experiment Setup | Yes | We have thus established a 30 second timeout which results in termination in almost all cases |