2021
DOI: 10.1007/978-3-030-91167-6_13
|View full text |Cite
|
Sign up to set email alerts
|

Practical Rule-Based Qualitative Temporal Reasoning for the Semantic Web

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
3
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(3 citation statements)
references
References 23 publications
0
3
0
Order By: Relevance
“…In Allen's interval algebra (IA), reasoning is manageable only for specific subalgebras and is executed through path consistency, a constraint propagation algorithm. Its rule-based implementation necessitates O(n 2 ) rules for a subalgebra with n relations [14].…”
Section: From Ontologies To Relation Calculusmentioning
confidence: 99%
See 2 more Smart Citations
“…In Allen's interval algebra (IA), reasoning is manageable only for specific subalgebras and is executed through path consistency, a constraint propagation algorithm. Its rule-based implementation necessitates O(n 2 ) rules for a subalgebra with n relations [14].…”
Section: From Ontologies To Relation Calculusmentioning
confidence: 99%
“…Lastly, it is worth noting that qualitative calculus-based techniques have applications beyond foundational studies. For example, in [14], a practical approach to rule-based temporal reasoning over RDF/OWL using Allen's interval algebra (IA) is outlined, showcasing the versatility of the methodology. This example provides an idea of both the utility of hav-ing foundational ontologies and the need to adapt these ontologies to different applications through revision to a greater or lesser extent.…”
Section: From Ontologies To Relation Calculusmentioning
confidence: 99%
See 1 more Smart Citation