Skip Navigation

Journal of Logic and Computation 1998 8(5):597-635; doi:10.1093/logcom/8.5.597
© 1998 by Oxford University Press
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by BALDONI, M.
Right arrow Articles by MARTELLI, A.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?


Original Articles

A Modal Extension of Logic Programming: Modularity, Beliefs and Hypothetical Reasoning

MATTEO BALDONI, LAURA GIORDANO and ALBERTO MARTELLI

Dipartimento di Informatica, Universitaà degli Studi di Torno C.so Svizzera 185, I-10149 Torino, Italy E-mail: baldonilauramrt{at}di.unito.it

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 [a1] 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.

Keywords: Logic programming; modal logic; modularity; knowledge and beliefs; hypothetical reasoning


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.