Massimo Franceschet, Angelo Montanari  Home/Search
Context
Related
Links: ACM DBLP | staff.science.uva.nl/~fran...time99.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: staff.science.uva.nl/~f...pub1999 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper, we exploit graph-theoretic techniques to efficiently reason about partially ordered events in the Event Calculus. We replace the traditional generate-and-test reasoning strategy by a more efficient generate-only one that operates on the underlying directed acyclic graph of events representing ordering information by pairing breadth-first and depth-first visits in a suitable way. We prove the soundness and completeness of the proposed strategy, and thoroughly analyze its... (Update)
Similar documents (at the sentence level):
25.0%: A Graph-Theoretic Approach to Efficiently Reason about.. - Franceschet, Montanari (2002) (Correct)
5.0%: Pairing Transitive Closure and Reduction to Efficiently.. - Franceschet, Montanari (Correct)
Active bibliography (related documents): More All
0.4: Modal Event Calculi with Preconditions - Cervesato, Franceschet, Montanari (1997) (Correct)
0.3: The Complexity of Model Checking in Modal Event Calculi with.. - Cervesato (1997) (Correct)
0.3: Temporal Representation and Reasoning in Artificial.. - Chittaro, Montanari (2002) (Correct)
Similar documents based on text: More All
1.5: A General Modal Framework for the Event Calculus and its.. - Cervesato, Montanari (1996) (Correct)
1.2: Ordered Events in a Logic Programming Framework - Cervesato, Chittaro, Montanari (1995) (Correct)
1.1: Reasoning about Partially Ordered Events in the Event.. - Chittaro, Montanari.. (1994) (Correct)
BibTeX entry: (Update)
@article{ franceschet00graphtheoretic,
author = "Massimo Franceschet and Angelo Montanari",
title = "A graph-theoretic approach to efficiently reason about partially ordered events in (Modal) Event Calculus",
journal = "Annals of Mathematics and Artificial Intelligence",
volume = "30",
number = "1-4",
pages = "93-118",
year = "2000",
url = "citeseer.ist.psu.edu/548917.html" }
Citations (may not include all citations):3972 Introduction to algorithms (context) - Cormen, Leiserson et al. - 1990 ACM
324 A logic-based calculus of events (context) - Kowalski, Sergot - 1986 ACM DBLP
82 Reasoning about partially ordered events (context) - Dean, Boddy - 1988 ACM DBLP
62 The transitive reduction of a directed graph (context) - Aho, Garey et al. - 1972 DBLP
37 Graph algorithms - van Leeuwen - 1990 ACM DBLP
27 Skeptical and credulous event calculi for supporting modal q.. (context) - Chittaro, Montanari et al. - 1994 DBLP
25 A general modal framework for the event calculus and its ske.. - Cervesato, Montanari - 1999 DBLP
22 the nonmonotonic behavior of the event calculus for deriving.. - Cervesato, Montanari et al. - 1993
21 A modal calculus of partially ordered events in a logic prog.. (context) - Cervesato, Chittaro et al. - 1995 DBLP
14 Speeding up temporal reasoning by exploiting the notion of k.. - Chittaro, Montanari et al. - 1995
6 A hierarchy of modal event calculi: Expressiveness and compl.. - Cervesato, Franceschet et al. - 1997
1 Uso di algoritmi su grafi per ragionare in modo efficiente s.. (context) - Fracas - 1997
Documents on the same site (http://staff.science.uva.nl/~francesc/pub1999):
Pairing Transitive Closure and Reduction to Efficiently.. - Franceschet, Montanari (Correct)
Indexing by Shape of Image Databases Based on.. - Combi, Foresti.. (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC