Fast Compliance Checking in an OWL2 Fragment
Authors: Piero A. Bonatti
IJCAI 2018 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We provide a complete and tractable structural subsumption algorithm for compliance checking and prove the intractability of a natural generalization of the policy language. We prove correctness and completeness of these algorithms and their tractability. Moreover, we prove the intractability of a slight generalization of the policy fragment. |
| Researcher Affiliation | Academia | Piero A. Bonatti Universit a degli Studi di Napoli Federico II piero.bonatti@unina.it |
| Pseudocode | Yes | Algorithm 1: STS(K, C D) |
| Open Source Code | No | We are planning as part of the activities of the SPECIAL project to implement and optimize the structural subsumption algorithm and perform scalability tests. |
| Open Datasets | No | The paper describes a theoretical framework and algorithm, but does not use or provide access information for any publicly available datasets for experimental training. |
| Dataset Splits | No | The paper focuses on theoretical contributions and does not describe any experimental validation with dataset splits. |
| Hardware Specification | No | The paper primarily presents theoretical work and does not specify any hardware used for running experiments. |
| Software Dependencies | No | The paper mentions related technologies like OWL2-EL and ELK, but does not provide specific software names with version numbers for experimental replication. |
| Experiment Setup | No | The paper describes a theoretical algorithm and its properties but does not detail any experimental setup, hyperparameters, or training configurations. |