A formal study on the dualities in temporal projection problems

Authors:
Xing Tan
Affiliations:
Center for Technology in Government, University at Albany/SUNY
Venue:
Canadian AI'12 Proceedings of the 25th Canadian conference on Advances in Artificial Intelligence
Year:
2012

Citing 6
Cited 0

Reasoning about partially ordered events

Artificial Intelligence
On the computational complexity of temporal projection, planning, and plan validation

Artificial Intelligence
On the nature and role of modal truth criteria in planning

Artificial Intelligence
Knowlege in action: logical foundations for specifying and implementing dynamical systems

Knowlege in action: logical foundations for specifying and implementing dynamical systems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Monitoring the execution of partial-order plans via regression

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using Situation Calculus, this paper provides a formal account of the relationship between the possible truth problem and the necessary truth problem in dynamical systems. In addition, advantages of applying this formal method to the domain are demonstrated through examples.