Logical foundations for more expressive declarative temporal logic programming languages

2013 ◽  
Vol 14 (4) ◽  
pp. 1-41 ◽  
Author(s):  
Jose Gaintzarain ◽  
Paqui Lucio
Keyword(s):  
Logic Programming ◽  
Programming Languages ◽  
Temporal Logic ◽  
Logical Foundations ◽  
Temporal Logic Programming ◽  
Logic Programming Languages

A PROOF PROCEDURE FOR TEMPORAL LOGIC PROGRAMMING

2004 ◽  
Vol 15 (02) ◽  
pp. 417-443 ◽  
Author(s):  
MANOLIS GERGATSOULIS ◽  
CHRISTOS NOMIKOS
Keyword(s):  
Logic Programming ◽  
Programming Languages ◽  
Temporal Logic ◽  
Programming Language ◽  
Branching Time ◽  
Logic Programs ◽  
Temporal Logic Programming ◽  
Time Logic ◽  
Proof Procedure ◽  
Resolution Proof

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.

Objects in concurrent logic programming languages

1986 ◽  
Vol 21 (11) ◽  
pp. 242-257 ◽  
Author(s):  
Kenneth Kahn ◽  
Eric Dean Tribble ◽  
Mark S. Miller ◽  
Daniel G. Bobrow
Keyword(s):  
Logic Programming ◽  
Programming Languages ◽  
Concurrent Logic Programming ◽  
Logic Programming Languages
Sign in / Sign up

Export Citation Format

Share Document