Semantics of Framed Temporal Logic Programs

2005 ◽  
pp. 356-370 ◽  
Author(s):  
Zhenhua Duan ◽  
Xiaoxiao Yang ◽  
Maciej Koutny
Keyword(s):  
Temporal Logic ◽  
Logic Programs

Executing Temporal Logic Programs.

1988 ◽  
Vol 53 (1) ◽  
pp. 309
Author(s):  
Joseph Y. Halpern ◽  
B. C. Moszkowski
Keyword(s):  
Temporal Logic ◽  
Logic Programs

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.

Strongly Equivalent Temporal Logic Programs

2008 ◽  
pp. 8-20 ◽  
Author(s):  
Felicidad Aguado ◽  
Pedro Cabalar ◽  
Gilberto Pérez ◽  
Concepción Vidal
Keyword(s):  
Temporal Logic ◽  
Logic Programs

Axiomatic semantics of projection temporal logic programs

2010 ◽  
Vol 20 (5) ◽  
pp. 865-914 ◽  
Author(s):  
XIAOXIAO YANG ◽  
ZHENHUA DUAN ◽  
QIAN MA
Keyword(s):  
Temporal Logic ◽  
Axiom System ◽  
Automatic Verification ◽  
Inference Rules ◽  
Hoare Logic ◽  
Logic Programs ◽  
Operational Model ◽  
Current State ◽  
Axiomatic Semantics ◽  
State Inference

In this paper, we investigate the axiomatic semantics of the projection temporal logic programming language MSVL. To this end, we employ Propositional Projection Temporal Logic (PPTL) as an assertion language to specify the desired properties. We give a set of state axioms and state inference rules. In order to deduce a program over an interval, we also formalise a set of rules in terms of a Hoare logic-like triple. These rules enable us to deduce a program into its normal form and from the current state to the next one. They also enable us to verify properties over intervals. In this way, an axiom system for proving the correctness of MSVL programs is established. The axiom system is proved to be sound and relatively complete with respect to an operational model of MSVL, and give an example showing how the axiom system works. Finally, we employ a recently developed prototype verifier based on PVS as an example of semi-automatic verification using MSVL.

Sign in / Sign up

Export Citation Format

Share Document