Query Answering Over Ontologies in the Extended Allen’s Interval Logic
| Autor: | Gerald S. Plesniewicz |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES
Theoretical computer science Information retrieval Knowledge representation and reasoning Computer science Computer Science::Logic in Computer Science Interval temporal logic Interval (graph theory) Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing) Boolean combination Hardware_LOGICDESIGN |
| Zdroj: | Proceedings of the First International Scientific Conference “Intelligent Information Technologies for Industry” (IITI’16) ISBN: 9783319336084 |
| DOI: | 10.1007/978-3-319-33609-1_16 |
| Popis: | We introduce the extended Allen’s interval logic whose sentences are Boolean combinations of sentences of Allen’s interval logic with metrical information, and define, for this logic, the deduction method based on analytical tableaux. We applied the method to query answering over interval ontologies specified in the extended Allen’s logic. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|