A modal extension of logic programming: Modularity, beliefs and hypothetical reasoning

被引:15
作者
Baldoni, M [1 ]
Giordano, L [1 ]
Martelli, A [1 ]
机构
[1] Univ Turin, Dipartimento Informat, I-10149 Turin, Italy
关键词
logic programming; modal logic; modularity; knowledge and beliefs; hypothetical reasoning;
D O I
10.1093/logcom/8.5.597
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper we present a modal extension of logic programming, which allows both multiple universal modal operators and embedded implications. We show that this extension is well suited for structuring knowledge and, more specifically, for defining module constructs within programs, for representing agents beliefs, and also for hypothetical reasoning. The language contains modalities [a(i)] to represent agent beliefs, and a modality square which is a kind of common knowledge operator. It allows sequences of modalities to occur in front of clauses, goals and clause heads, and hypothetical implications to occur in goals and in clause bodies. We present a goal directed proof procedure for the language, and several examples of its use for defining modules are given. In particular, the language allows different proposals to be captured for module definition and composition presented in the literature. The modal logic, of which our programming language is a clausal fragment, is introduced through its Kripke semantics. This has strong similarities with the possible world semantics for the (propositional) logics of knowledge and belief proposed by Halpern & Moses. A cut-free sequent calculus is also given for this logic, which proves the soundness and completeness of the goal-directed proof procedure by showing that goal directed proofs correspond to some sequent proofs.
引用
收藏
页码:597 / 635
页数:39
相关论文
共 53 条
  • [1] TEMPORAL LOGIC PROGRAMMING
    ABADI, M
    MANNA, Z
    [J]. JOURNAL OF SYMBOLIC COMPUTATION, 1989, 8 (03) : 277 - 295
  • [2] ABDALLAH MAN, 1986, LECT NOTES COMPUT SC, V210, P60
  • [3] AKAMA S, 1986, P 6 CAN C ART INT, P99
  • [4] [Anonymous], 1990, AUTOMATED DEDUCTION
  • [5] [Anonymous], 1983, SMALLTALK 80 LANGUAG
  • [6] [Anonymous], J LOGIC PROGRAM
  • [7] [Anonymous], 1995, HDB LOGIC ARTIFICIAL
  • [8] Auffray Y., 1992, Journal of Logic and Computation, V2, P247, DOI 10.1093/logcom/2.3.247
  • [9] BALBIANI P, 1991, LECT NOTES ARTIF INT, V567, P366
  • [10] Balbiani P., 1988, P 1988 INT C 5 GEN C, P507