Defeasible Laws, Parallel Actions, and Reasoning about Resources

Sandeep Chintabathina, Michael Gelfond, and Richard Watson

We introduce a new action language, CARD, which allows defeasible dynamic causal laws, default fluents, concurrent and non-deterministic actions, and actions which use resources. We give syntax and semantics of the language and several simple examples of its use. Comparison with some other languages is also given though limited by space requirements.

Submitted: Jan 27, 2007

This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.