ACM Home Page
Please provide us with feedback. Feedback
Reasoning about actions with sensing under qualitative and probabilistic uncertainty
Full text PdfPdf (1.24 MB)
Source
ACM Transactions on Computational Logic (TOCL) archive
Volume 10 ,  Issue 1  (January 2009) table of contents
Article No. 5  
Year of Publication: 2009
ISSN:1529-3785
Authors
Luca Iocchi  Sapienza Università di Roma, Rome, Italy
Thomas Lukasiewicz  Sapienza Università di Roma, Rome, Italy
Daniele Nardi  Sapienza Università di Roma, Rome, Italy
Riccardo Rosati  Sapienza Università di Roma, Rome, Italy
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 123,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1459010.1459015
What is a DOI?

ABSTRACT

We focus on the aspect of sensing in reasoning about actions under qualitative and probabilistic uncertainty. We first define the action language E for reasoning about actions with sensing, which has a semantics based on the autoepistemic description logic ALCKNF, and which is given a formal semantics via a system of deterministic transitions between epistemic states. As an important feature, the main computational tasks in E can be done in linear and quadratic time. We then introduce the action language E+ for reasoning about actions with sensing under qualitative and probabilistic uncertainty, which is an extension of E by actions with nondeterministic and probabilistic effects, and which is given a formal semantics in a system of deterministic, nondeterministic, and probabilistic transitions between epistemic states. We also define the notion of a belief graph, which represents the belief state of an agent after a sequence of deterministic, nondeterministic, and probabilistic actions, and which compactly represents a set of unnormalized probability distributions. Using belief graphs, we then introduce the notion of a conditional plan and its goodness for reasoning about actions under qualitative and probabilistic uncertainty. We formulate the problems of optimal and threshold conditional planning under qualitative and probabilistic uncertainty, and show that they are both uncomputable in general. We then give two algorithms for conditional planning in our framework. The first one is always sound, and it is also complete for the special case in which the relevant transitions between epistemic states are cycle-free. The second algorithm is a sound and complete solution to the problem of finite-horizon conditional planning in our framework. Under suitable assumptions, it computes every optimal finite-horizon conditional plan in polynomial time. We also describe an application of our formalism in a robotic-soccer scenario, which underlines its usefulness in realistic applications.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Baader, F., Lutz, C., Milicic, M., Sattler, U., and Wolter, F. 2005. Integrating description logics and action formalisms: First results. In Proceedings of the 20th National Conference on Artificial Intelligence (AAAI-2005). AAAI Press/MIT Press, Cambridge, MA, 572--577.
 
2
Bacchus, F., Halpern, J. Y., and Levesque, H. J. 1995. Reasoning about noisy sensors and effectors in the situation calculus. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-1995). Morgan-Kaufmann, San Francisco, CA, 1933--1940.
 
3
 
4
 
5
Berners-Lee, T. 1999. Weaving the Web. Harper, San Francisco, CA.
 
6
Boutilier, C., Reiter, R., and Price, B. 2001. Symbolic dynamic programming for first-order MDPs. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-2001). Morgan-Kaufmann, San Francisco, CA, 690--700.
 
7
 
8
9
10
11
 
12
Draper, D., Hanks, S., and Weld, D. S. 1994. Probabilistic planning with information gathering and contingent execution. In Proceedings of the International Conference on Artificial Intelligence Planning Systems (AIPS-1994). AAAI Press, Menlo Park, CA, 31--36.
 
13
 
14
Eiter, T. and Lukasiewicz, T. 2003. Probabilistic reasoning about actions in nonmonotonic causal theories. In Proceedings of the 19th Conference on Uncertainty in Artificial Intelligence (UAI-2003). Morgan-Kaufmann, San Francisco, CA, 192--199.
 
15
 
16
 
17
Finzi, A. and Pirri, F. 2001. Combining probabilities, failures and safety in robot control. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-2001). Morgan-Kaufmann, San Francisco, CA, 1331--1336.
 
18
 
19
Gelfond, M. and Lifschitz, V. 1993. Representing action and change by logic programs. J. Logic Program. 17, 301--322.
 
20
 
21
22
 
23
Horrocks, I., Patel-Schneider, P. F., and van Harmelen, F. 2003. From SHIQ and RDF to OWL: The making of a web ontology language. J. Web Semantics 1, 1, 7--26.
 
24
Iocchi, L. 1999. Design and Development of Cognitive Robots. Ph.D. dissertation. University of Rome “La Sapienza”, Rome, Italy. Available at www.dis.uniroma1.it/~iocchi/publications.html.
 
25
Iocchi, L., Lukasiewicz, T., Nardi, D., and Rosati, R. 2006. Reasoning about actions with sensing under qualitative and probabilistic uncertainty. Tech. Rep. INFSYS RR-1843-03-05, Institut für Informationssysteme, Technische Universität Wien. March.
 
26
Iocchi, L., Nardi, D., and Rosati, R. 2000. Planning with sensing, concurrency, and exogenous events: Logical framework and implementation. In Proceedings KR-2000. Morgan-Kaufmann, San Francisco, CA, 678--689.
 
27
 
28
 
29
Lang, J., Lin, F., and Marquis, P. 2003. Causal theories of action: A computational core. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-2003). Morgan-Kaufmann, San Francisco, CA, 1073--1078.
 
30
Levesque, H. J. 1996. What is planning in presence of sensing? In Proceedings of the National Conference on Artificial Intelligence (AAAI-1996). AAAI Press/MIT Press, Cambridge, MA, 1139--1149.
 
31
 
32
Lobo, J., Mendez, G., and Taylor, S. R. 1997. Adding knowledge to the action description language A. In Proceedings of the National Conference on Artificial Intelligence (AAAI-1997). AAAI Press/MIT Press, Cambridge, MA, 454--459.
 
33
 
34
 
35
Motik, B., Horrocks, I., Rosati, R., and Sattler, U. 2006. Can OWL and logic programming live together happily ever after? In Proceedings of the 5th International Semantic Web Conference (ISWC-2006). Lecture Notes in Computer Science, vol. 4273, Springer-Verlag, Berlin, Germany, 501--514.
 
36
Motik, B. and Rosati, R. 2007. A faithful integration of description logics with logic programming. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-2007). 477--482.
 
37
 
38
39
 
40
 
41
 
42
 
43
 
44
Shapiro, S. 2005. Belief change with noisy sensing and introspection. In Proceedings on Nonmonotonic Reasoning, Action, and Change (NRAC-2005).
 
45
 
46
Son, T. C., Tu, P. H., and Baral, C. 2004. Planning with sensing actions and incomplete information using logic programming. In Proceedings LPNMR-2004. Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence, vol. 2923. Springer-Verlag, Berlin, Germany, 261--274.
 
47
 
48
W3C. 2004. OWL web ontology language overview. W3C Recommendation (10 February 2004). Available at www.w3.org/TR/2004/REC-owl-features-20040210/.
 
49

Collaborative Colleagues:
Luca Iocchi: colleagues
Thomas Lukasiewicz: colleagues
Daniele Nardi: colleagues
Riccardo Rosati: colleagues