Model-checking memory requirements of resource-bounded reasoners

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2006, Pages 213-218

  Albore, A ^a   Alechina, N ^b   Bertoli, P ^c   Ghidini, C ^c   Logan, B ^b   Serafini, L ^c  

^a UNIVERSITAT POMPEU FABRA   (Spain)

^b UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^c ITC IRST   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BOUNDARY CONDITIONS; COMPUTATIONAL METHODS; PROBLEM SOLVING;

BACKTRACKING; MEMORY BOUNDED REASONERS; MODEL CHECKING; RESOURCE BOUNDED REASONERS;

STORAGE ALLOCATION (COMPUTER);

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

References (10)

1. Ågotnes, T., and Alechina, N. 2006. Knowing minimum/maximum n formulae. In Proc. of ECAI-06. (To appear).
2. Alekhnovich, M.; Ben-Sasson, E.; Razborov, A. A.; and Wigderson, A. 2002. Space complexity in prepositional calculus. SIAM J. Comput. 31(4):1 184-1211.
3. Benerecetti, M.; Giunchiglia, F.; and Serafini, L. 1998. Model Checking Multiagent Systems. Journal of Logic and Computation, Special Issue on Computational & Logical Aspects of Multi-Agent Systems 8(3):401-423.
4. Bibel, W. 1986. A deductive solution for plan generation. New Generation Computing 4:115-132.
5. Cimatti, A.; Pistore, M.; Roveri, M.; and Traverso, P. 2003. Weak, Strong, and Strong Cyclic Planning via Symbolic Model Checking. Artificial Intelligence 147(1,2):35-84.
6. Elgot-Drapkin, J.; Miller, M.; and Perlis, D. 1991. Memory, reason and time: the Step-Logic approach. In Philosophy and AI: Essays at the Interface. Cambridge, Mass.: MIT Press. 79-103.
7. Fagin, R.; Halpern, J. Y.; Moses, Y.; and Vardi, M. Y. 1995. Reasoning about Knowledge. Cambridge, Mass.: MIT Press.
8. Jacopin, E. 1993. Classical AI planning as theorem proving: The case of a fragment of linear logic. In AAAI Fall Symposium on Automated Deduction in Nonstandard Logics. AAAI Press.
9. Kacprzak, M.; Lomuscio, A.; and Penczek, W. 2004. Verification of multiagent systems via unbounded model checking. In Proc. of AAMAS'04, 638-645. New York: ACM.
10. Kautz, H., and Selman, B. 1996. Pushing the envelope: Planning, prepositional logic, and stochastic search. In Proc. of AAAI'96, 1194-1201. AAAI Press.