Techreport3053: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Dörthe Arndt (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
Stephan Mennicke (Diskussion | Beiträge) (updated) |
||
| Zeile 2: | Zeile 2: | ||
|ErsterAutorVorname=Dörthe | |ErsterAutorVorname=Dörthe | ||
|ErsterAutorNachname=Arndt | |ErsterAutorNachname=Arndt | ||
|FurtherAuthors=Stephan | |FurtherAuthors=Stephan Mennicke | ||
}} | }} | ||
{{Techreport | {{Techreport | ||
| Zeile 8: | Zeile 8: | ||
|Year=2024 | |Year=2024 | ||
|Month=April | |Month=April | ||
|Institution= | |Institution=arXiv.org | ||
|Type= | |Type=Under consideration in Theory and Practice of Logic Programming (TPLP) | ||
}} | }} | ||
{{Publikation Details | {{Publikation Details | ||
|Forschungsgruppe=Computational Logic | |Abstract=In this paper, we delve into Notation3 Logic (N3), an extension of RDF, which empowers users to craft rules introducing fresh blank nodes to RDF graphs. This capability is pivotal in various applications such as ontology mapping, given the ubiquitous presence of blank nodes directly or in auxiliary constructs across the Web. However, the availability of fast N3 reasoners fully supporting blank node introduction remains limited. Conversely, engines like VLog or Nemo, though not explicitly designed for Semantic Web rule formats, cater to analogous constructs, namely existential rules. | ||
We investigate the correlation between N3 rules featuring blank nodes in their heads and existential rules. We pinpoint a subset of N3 that seamlessly translates to existential rules and establish a mapping preserving the equivalence of N3 formulae. To showcase the potential benefits of this translation in N3 reasoning, we implement this mapping and compare the performance of N3 reasoners like EYE and cwm against VLog and Nemo, both on native N3 rules and their translated counterparts. Our findings reveal that existential rule reasoners excel in scenarios with abundant facts, while the EYE reasoner demonstrates exceptional speed in managing a high volume of dependent rules. | |||
Additionally to the original conference version of this paper, we include all proofs of the theorems and introduce a new section dedicated to N3 lists featuring built-in functions and how they are implemented in existential rules. Adding lists to our translation/framework gives interesting insights on related design decisions influencing the standardization of N3. | |||
|Link=https://arxiv.org/abs/2308.07332 | |||
|DOI Name=10.48550/arXiv.2308.07332 | |||
|Projekt=CPEC, KIMEDS, SECAI, ScaDS.AI | |||
|Forschungsgruppe=Computational Logic, Wissensbasierte Systeme | |||
}} | }} | ||
Aktuelle Version vom 27. März 2025, 10:38 Uhr
Existential Notation3 Logic
Dörthe ArndtDörthe Arndt, Stephan MennickeStephan Mennicke
Dörthe Arndt, Stephan Mennicke
Existential Notation3 Logic
Technical Report, arXiv.org, April 2024. Under consideration in Theory and Practice of Logic Programming (TPLP)
Existential Notation3 Logic
Technical Report, arXiv.org, April 2024. Under consideration in Theory and Practice of Logic Programming (TPLP)
- KurzfassungAbstract
In this paper, we delve into Notation3 Logic (N3), an extension of RDF, which empowers users to craft rules introducing fresh blank nodes to RDF graphs. This capability is pivotal in various applications such as ontology mapping, given the ubiquitous presence of blank nodes directly or in auxiliary constructs across the Web. However, the availability of fast N3 reasoners fully supporting blank node introduction remains limited. Conversely, engines like VLog or Nemo, though not explicitly designed for Semantic Web rule formats, cater to analogous constructs, namely existential rules.We investigate the correlation between N3 rules featuring blank nodes in their heads and existential rules. We pinpoint a subset of N3 that seamlessly translates to existential rules and establish a mapping preserving the equivalence of N3 formulae. To showcase the potential benefits of this translation in N3 reasoning, we implement this mapping and compare the performance of N3 reasoners like EYE and cwm against VLog and Nemo, both on native N3 rules and their translated counterparts. Our findings reveal that existential rule reasoners excel in scenarios with abundant facts, while the EYE reasoner demonstrates exceptional speed in managing a high volume of dependent rules.
Additionally to the original conference version of this paper, we include all proofs of the theorems and introduce a new section dedicated to N3 lists featuring built-in functions and how they are implemented in existential rules. Adding lists to our translation/framework gives interesting insights on related design decisions influencing the standardization of N3. - Weitere Informationen unter:Further Information: Link
- Projekt:Project: CPEC, KIMEDS, SECAI, ScaDS.AI
- Forschungsgruppe:Research Group: Computational LogicComputational Logic, Wissensbasierte SystemeKnowledge-Based Systems
@techreport{AM2024,
author = {D{\"{o}}rthe Arndt and Stephan Mennicke},
title = {Existential Notation3 Logic},
institution = {arXiv.org},
year = {2024},
month = {April},
doi = {10.48550/arXiv.2308.07332}
}
