Modal logic programming revisited

Journal of Applied Non-Classical Logics 19 (2):167-181 (2009)
  Copy   BIBTEX

Abstract

We present optimizations for the modal logic programming system MProlog, including the standard form for resolution cycles, optimized sets of rules used as meta-clauses, optimizations for the version of MProlog without existential modal operators, as well as iterative deepening search and tabulation. Our SLD-resolution calculi for MProlog in a number of modal logics are still strongly complete when resolution cycles are in the standard form and optimized sets of rules are used. We also show that the labelling technique used in our direct approach is relatively better than the Skolemization technique used in the translation approaches for modal logic programming.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2013-12-25

Downloads
47 (#298,872)

6 months
3 (#445,838)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Linh Nguyen
Lycoming College

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references