A Fixpoint Semantics and an SLD-Resolution Calculus for Modal Logic Programs

作者: Linh Anh Nguyen

DOI:

关键词:

摘要: We propose a modal logic programming language called MProlog, which is as expressive the general Horn fragment. give fixpoint semantics and an SLD-resolution calculus for MProlog in all of basic serial logics KD, T, KDB, B, KD4, S4, KD5, KD45, S5. For program P L being one mentioned logics, we define operator T_{L,P}, has least I_{L,P}. This set formulae, may contain labeled forms d, L-model generator P. The standard model I_{L,P} shown to be designed with similar style classical programming. It sound complete. also extend almost KB, K5, K45, KB5.

参考文章(29)
J. W. Lloyd, Foundations of logic programming; (2nd extended ed.) Springer-Verlag New York, Inc.. ,(1987)
Mamede Lima-Marques, Andreas Herzig, Jean-Marc Alliot, Implementing Prolog Extensions: a Parallel Inference Machine. Future Generation Computer Systems. pp. 833- 842 ,(1992)
Philippe Balbiani, Andreas Herzig, Luis Fariñas del Cerro, Declarative Semantics for Modal Logic Programs. Future Generation Computer Systems. pp. 507- 514 ,(1988)
Mehmet A. Orgun, Wanli Ma, An Overview of Temporal and Modal Logic Programming ICTL '94 Proceedings of the First International Conference on Temporal Logic. pp. 445- 479 ,(1994) , 10.1007/BFB0014004
Ben C. Moszkowski, Executing Temporal Logic Programs ,(1986)
John Wylie Lloyd, Foundations of logic programming ,(1984)
Alexander Leitsch, The Resolution Calculus ,(1997)
Jack Minker, Logic and Databases: A 20 Year Retrospective logic in databases. pp. 3- 57 ,(1996) , 10.1007/BFB0031734
Jörg Hudelmaier, Improved Decision Procedures for the Modal Logics K, T, and S4 computer science logic. pp. 320- 334 ,(1995) , 10.1007/3-540-61377-3_46
Hans Jürgen Ohlbach, A Resolution Calculus for Modal Logics conference on automated deduction. pp. 500- 516 ,(1988) , 10.1007/BFB0012852