Prior validation prevents the execution of erroneous queries, reduces processing time, and maintains negligible overhead for correct queries, demonstrating a favorable trade-off between computational efficiency and reduced manual intervention.
Abstract
The Semantic Web enables data exchange and knowledge exploitation through SPARQL queries; however, users often encounter difficulties when formulating such queries, leading to unexpected results and iterative trial-and-error processes. These issues are aggravated by incomplete knowledge of the application domain and the underlying ontological schema, frequently causing unnecessary query executions and increased computational load on RDF repositories. This work proposes a method for the prior syntactic and semantic validation of SPARQL queries, based on an ontology and independent of its instances. The method operates before query execution and detects inconsistencies arising from literal writing errors and violations of object property axioms, providing explicit feedback to users. The development of the proposed approach follows a classical methodological framework grounded in the software engineering process. Experimental results show that the additional computational overhead introduced by validation is minimal, while the benefits are significant in scenarios involving incorrect queries. In particular, prior validation prevents the execution of erroneous queries, reduces processing time, and maintains negligible overhead for correct queries, demonstrating a favorable trade-off between computational efficiency and reduced manual intervention. Overall, the results indicate that prior validation improves SPARQL query quality and enhances developer productivity in semantic data–driven applications.
OntoExpand is introduced, a new methodology for ontology expansion that uses SPARQL CONSTRUCT queries as an efficient alternative to conventional reasoning techniques that improves performance, reduces computational overhead, is pattern driven allowing a more granular expansion control and seamlessly integrates with SPARQL endpoints.
Vitor Lelis, N. Leite, José Carlos et al.· 0 citations
The results support the feasibility of ontology-driven generation for static-classification systems, whereas arithmetic risk computation and temporal event processing remain better suited to complementary procedural technologies.
Borivoj Bogdanović, S. Nikolić· Computers· 0 citations
This work proposes a domain-independent text annotation schema that maps directly to OWL DL syntax, enabling the algorithmic generation of expressive axioms from the annotations, and demonstrates the applicability and scalability of the approach through two distinct use cases: building requirements and scientific claims.
The results suggest that OntoExtend is useful as a drafting assistant for requirement-driven ontology extension in real world scenarios, while remaining sensitive to CQ specificity and modelling profile.
Anna Sofia Lippolis, Mohammad Javad Saeedizade, Stefan Schmid et al.· arXiv.org· 1 citation