A graph-theoretic approach to efficiently reason about partially ordered events in (Modal) Event Calculus

DOI10.1023/A:1016655210024MaRDI QIDQ1601877zbMATH OpenFDO

Authors Angelo Montanari, Massimo Franceschet

Publication date 27 June 2002

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1016655210024

zbMATH Keywords

event calculus

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1444722
• scientific article; zbMATH DE number 1538060
• scientific article; zbMATH DE number 4049019
• Model checking for event graphs and an event temporal logic
• Event Calculus Reasoning Through Satisfiability
• On the generality of event-graph models
• On a graph approach to modal logics
• On graph calculi for multi-modal logics
• scientific article; zbMATH DE number 969069
• Modeling and Reasoning in Event Calculus using Goal-Directed Constraint Answer Set Programming

Cited in

(4)

• A general modal framework for the event calculus and its skeptical and credulous variants
• scientific article; zbMATH DE number 1538060 (Why is no real title available?)
• scientific article; zbMATH DE number 804606 (Why is no real title available?)
• scientific article; zbMATH DE number 1444722 (Why is no real title available?)

This page was built for publication: A graph-theoretic approach to efficiently reason about partially ordered events in (Modal) Event Calculus

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