Expressive reasoning about action in nondeterministic polynomial time

IJCAI International Joint Conference on Artificial Intelligence

Volumn 1, Issue , 1999, Pages 166-171

  Drakengren, Thomas ^a   Bjareland, Marcus ^b  

^a not available   (Sweden)

^b LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; POLYNOMIAL APPROXIMATION;

LOGIC-OF-ACTION; NON-TRIVIAL POLYNOMIAL; NONDETERMINISTIC POLYNOMIAL; NP COMPLETE; PARALLEL COMPOSITION; PROPOSITIONAL LOGIC; REASONING ABOUT ACTIONS; SATISFIABILITY;

COMPUTER CIRCUITS;

EID: 0141686318     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. R. Alur and T.A. Henzinger. A really temporal logic. In Proceedings of the 30th Annual IEEE Symposium on the Foundations of Computer Science, pages 164-169. IEEE Computer Society, 1989.
2. Chitta Baral and Michael Gelfond. Reasoning about effects of concurrent actions. Journal of Logic Programming, 31:85 118, 1997.
3. Patrick Donerty. Reasoning about action and change using occlusion. In EC AI '94-
4. Thomas Drakengren and Marcus Bjareland. Reasoning about action in polynomial time. In IJCAI '97.
5. Michael Gelfond and Vladimir Lifschitz. Representing action and change by logic programs. Journal of Logic Programming, 17:301-321, 1993.
6. Enrico Giunchiglia, G. Neelakantan Kartha, and Vladimir Lifschitz. Representing action: indeterminacy and ramifications. Artificial Intelligence, 95:409-438, 1997.
7. J. Gustafsson and P. Doherty. Embracing occlusion in specifying the indirect effects of actions. In KR '96.
8. P. Liberatore. The complexity of the language A. Linkoping Electronic Articles in Computer and Information Science, 2(2), July 1997. URL: http://www.ep.liu.se/ea/cis/1997/006.
9. Norman McCain and Hudson Turner. A causal theorv of ramifications and qualifications. In IJCAI '95.
10. J. McCarthy and P.J. Hayes. Some philosophical problems from the standpoint of Artificial Intelligence. Machine Intelligence, 4:463 502, 1969.
11. Erik Sandewall. Features and Fluents. Oxford University Press, 1994.
12. Bart Selman, Hector Levesque, and David Mitchell. A new method for solving hard satisfiability problems. In AAA! '92.