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

ISSN： 1012-2443

Source： Annals of Mathematics and Artificial Intelligence, Vol.30, Iss.1-4, 2000-01, pp. : 93-118

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Reasoning about Commitments in the Event Calculus: An Approach for Specifying and Executing Protocols

By Yolum Pınar

Annals of Mathematics and Artificial Intelligence, Vol. 42, Iss. 1-3, 2004-09 ,pp. : 227-253

Springer Publishing Company

Access to resources Recommend Favorite

Temporal Granularity and Indeterminacy in Reasoning About Actions and Change: An Approach Based on the Event Calculus

By Chittaro L.

Annals of Mathematics and Artificial Intelligence, Vol. 36, Iss. 1-2, 2002-09 ,pp. : 81-119

Springer Publishing Company

Access to resources Recommend Favorite

The logic of totally and partially ordered plans: a deductive database approach

By Brogi A. Subrahmanian V.S. Zaniolo C.

Annals of Mathematics and Artificial Intelligence, Vol. 19, Iss. 1-2, 1997-01 ,pp. : 27-58

Springer Publishing Company

Access to resources Recommend Favorite

Estimating modes of a complex dynamical network from impulse response data: Structural and graph‐theoretic characterizations

INTERNATIONAL JOURNAL OF ROBUST AND NONLINEAR CONTROL, Vol. 25, Iss. 10, 2015-07 ,pp. : 1438-1453

John Wiley & Sons Inc

Access to resources Recommend Favorite

Matroids on Partially Ordered Sets

By Barnabei M. Nicoletti G. Pezzoli L.

Advances in Applied Mathematics, Vol. 21, Iss. 1, 1998-07 ,pp. : 78-112

Academic Press

Access to resources Recommend Favorite