Runtime verification using a temporal description logic

DOI10.1007/978-3-642-04222-5_9MaRDI QIDQ3655197zbMATH OpenOpenAlexFDO

Authors Franz Baader, Andreas Bauer, Marcel Lippmann

Publication date 7 January 2010

Published in Frontiers of Combining Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04222-5_9

Mathematics Subject Classification ID

Temporal logic (03B44) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in artificial intelligence (68T27)

Recommendations

• Runtime verification using the temporal description logic \(\mathcal{ALC}\)-LTL revisited
• Comparing LTL semantics for runtime verification
• An LTL proof system for runtime verification
• scientific article; zbMATH DE number 6930545
• Runtime verification monitor construction for three-valued PPTL

Cites work

• A survey of temporal extensions of description logics
• Attributive concept descriptions with complements
• Comparing LTL semantics for runtime verification
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• LTL over description logic axioms
• Monitoring of Real-Time Properties
• Reasoning about infinite computations

Cited in

(5)

• Comparing trace expressions and linear temporal logic for runtime verification
• Monitoring metric first-order temporal properties
• Data repair of inconsistent nonmonotonic description logic programs
• Runtime verification using the temporal description logic \(\mathcal{ALC}\)-LTL revisited
• First-order temporal logic on finite traces: semantic properties, decidable fragments, and applications

This page was built for publication: Runtime verification using a temporal description logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3655197)