TY - JOUR
T1 - A modal extension of logic programming
T2 - Modularity, beliefs and hypothetical reasoning
AU - Baldoni, Matteo
AU - Giordano, Laura
AU - Martelli, Alberto
PY - 1998/10
Y1 - 1998/10
N2 - 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 [ai] to represent agent beliefs, and a modality □ 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.
AB - 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 [ai] to represent agent beliefs, and a modality □ 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.
KW - Hypothetical reasoning
KW - Knowledge and beliefs
KW - Logic programming
KW - Modal logic
KW - Modularity
UR - http://www.scopus.com/inward/record.url?scp=0032182055&partnerID=8YFLogxK
U2 - 10.1093/logcom/8.5.597
DO - 10.1093/logcom/8.5.597
M3 - Article
SN - 0955-792X
VL - 8
SP - 597
EP - 635
JO - Journal of Logic and Computation
JF - Journal of Logic and Computation
IS - 5
ER -