Combining interval-based temporal reasoning with general TBoxes

DOI10.1016/j.artint.2003.08.001zbMath1082.68106OpenAlexW2046015030MaRDI QIDQ814545

Carsten Lutz

Publication date: 7 February 2006

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2003.08.001

zbMATH Keywords

ComplexityTree automataTemporal reasoningDescription logic

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Temporal logic (03B44)

Related Items (3)

Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints ⋮ A tableau algorithm for description logics with concrete domains and general TBoxes ⋮ An algebraic view on p-admissible concrete domains for lightweight description logics

Uses Software

• Racer

Cites Work

• Maintaining knowledge about temporal intervals
• Attributive concept descriptions with complements
• Automata-theoretic techniques for modal logics of programs
• Consistency checking reduced to satisfiability of concepts in terminological systems
• A survey of temporal extensions of description logics
• A Correspondence between Temporal Description Logics
• A propositional modal logic of time intervals
• Deduction in Concept Languages: from Subsumption to Instance Checking
• Reasoning about temporal relations
• Time-dependent concepts: representation and reasoning using temporal description logics
• PSpace Reasoning with the Description Logic ALCF(D)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Combining interval-based temporal reasoning with general TBoxes