A PROOF PROCEDURE FOR TEMPORAL LOGIC PROGRAMMING

DOI10.1142/S0129054104002509zbMath1067.68044MaRDI QIDQ3022009

Manolis Gergatsoulis, Christos Nomikos

Publication date: 22 June 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

theorem provingtemporal logic programmingbranching-timeproof procedures

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Logic programming (68N17)

Related Items (1)

Temporal stratification tests for linear and branching-time deductive databases

Uses Software

• CACTUS

Cites Work

• Temporal logic programming
• Dealing with multiple granularity of time in temporal logic programming
• Programming in metric temporal logic
• Verification of reactive systems using temporal logic with clocks
• A Temporal extension of Prolog
• A clausal resolution method for CTL branching-time temporal logic
• Branching-time logic programming: the language Cactus and its applications
• Foundations of linear-time logic programming
• Temporal disjunctive logic programming
• The branching-time transformation technique for chain datalog programs

This page was built for publication: A PROOF PROCEDURE FOR TEMPORAL LOGIC PROGRAMMING