Reasoning about Actions with Sensing under Qualitative and Probabilistic Uncertainty

被引:15
|
作者
Iocchi, Luca [1 ]
Lukasiewicz, Thomas [2 ]
Nardi, Daniele [1 ]
Rosati, Riccardo [1 ]
机构
[1] Sapienza Univ Roma, DIS, I-00185 Rome, Italy
[2] Univ Oxford, Comp Lab, Oxford OX1 3QD, England
基金
奥地利科学基金会;
关键词
Algorithms; Languages; Reasoning about actions; sensing; qualitative and probabilistic uncertainty; action languages; description logics; imprecise probabilities; LOGIC; KNOWLEDGE; AGENTS;
D O I
10.1145/1459010.1459015
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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 ALCK(NF), 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 epsilon+ 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.
引用
收藏
页数:41
相关论文
共 50 条
  • [41] Reasoning about cooperation, actions and preferences
    Lena Kurzen
    Synthese, 2009, 169 : 223 - 240
  • [42] Reasoning algebraically about probabilistic loops
    Meinicke, Larissa
    Hayes, Ian J.
    FORMAL METHODS AND SOFTWARE ENGINEERING, PROCEEDINGS, 2006, 4260 : 380 - +
  • [43] REASONING ABOUT PROBABILISTIC PARALLEL PROGRAMS
    RAO, JR
    ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1994, 16 (03): : 798 - 842
  • [44] Reasoning about effects of concurrent actions
    Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968, United States
    Journal of Logic Programming, 31 (1-3):
  • [45] Reasoning about Recursive Probabilistic Programs
    Olmedo, Federico
    Kaminski, Benjamin Lucien
    Katoen, Joost-Pieter
    Matheja, Christoph
    PROCEEDINGS OF THE 31ST ANNUAL ACM-IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2016), 2016, : 672 - 681
  • [46] Reasoning about probabilistic sequential programs
    Chadha, R.
    Cruz-Filipe, L.
    Mateus, P.
    Sernadas, A.
    THEORETICAL COMPUTER SCIENCE, 2007, 379 (1-2) : 142 - 165
  • [47] Probabilistic qualitative spatial reasoning with applications to GeoQA
    Beydokhti, Mohammad Kazemi
    Duckham, Matt
    Griffin, Amy L.
    Tao, Yaguang
    Purves, Ross
    Vasardani, Maria
    INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE, 2025, 39 (04) : 817 - 846
  • [48] A proof theoretic approach to qualitative probabilistic reasoning
    Parsons, S
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 1998, 19 (3-4) : 265 - 297
  • [49] Probabilistic reasoning in distributed diagnosis for qualitative systems
    Su, R
    Wonham, WM
    PROCEEDINGS OF THE 41ST IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-4, 2002, : 429 - 434
  • [50] A Framework for Reasoning About Uncertainty in Ontologies
    Jabbour, Said
    Ma, Yue
    Raddaoui, Badran
    IEEE INTELLIGENT SYSTEMS, 2022, 37 (06) : 27 - 37