A PROOF PROCEDURE FOR TEMPORAL LOGIC PROGRAMMING-Reference-Cited by-同舟云学术

A PROOF PROCEDURE FOR TEMPORAL LOGIC PROGRAMMING

Published:2004-04 Issue:02 Volume:15 Page:417-443
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

GERGATSOULIS MANOLIS¹,NOMIKOS CHRISTOS²

Affiliation:

1. Department of Archive and Library Sciences, Ionian University, Palea Anaktora, Plateia Eleftherias, 49100 Corfu, Greece

2. Computer Science Department, University of Ioannina, Dourouti Campus, Ioannina, 451 10, Greece

Abstract

In this paper, we propose a new resolution proof procedure for the branching-time logic programming language Cactus. The particular strength of the new proof procedure, called CSLD-resolution, is that it can handle, in a more general way, open-ended queries, i.e. goal clauses that include atoms which do not refer to specific moments in time, without the need of enumerating all their canonical instances. We also prove soundness, completeness and independence of the computation rule for CSLD-resolution. The new proof procedure overcomes the limitations of a family of proof procedures for temporal logic programming languages, which were based on the notions of canonical program and goal clauses. Moreover, it applies directly to Chronolog programs and it can be easily extended to apply to multi-dimensional logic programs as well as to Chronolog(MC) programs.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054104002509

Reference22 articles.

1. Temporal logic programming

2. M. Baudinet, Intensional Logics for Programming, eds. L. Fariñas del Cerro and M. Penttonen (Oxford University Press, 1993) pp. 51–83.

3. M. Baudinet, J. Chomicki and P. Wolper, Temporal Databases: Theory, Design, and Implementation, eds. L. Fariñas del Cerro and M. Penttonen (The Benjamin/Cummings Publishing Company, Inc, 1993) pp. 294–320.

4. A clausal resolution method for CTL branching-time temporal logic

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An infinitary encoding of temporal equilibrium logic;Theory and Practice of Logic Programming;2015-07

2. Logical foundations for more expressive declarative temporal logic programming languages;ACM Transactions on Computational Logic;2013-11

3. References;An Introduction to Practical Formal Methods Using Temporal Logic;2011-04-26

4. Temporal stratification tests for linear and branching-time deductive databases;Theoretical Computer Science;2005-09

5. Temporal agent programs;Artificial Intelligence;2001-03