A PROOF PROCEDURE FOR TEMPORAL LOGIC PROGRAMMING

DOI10.1142/S0129054104002509zbMATH Open1067.68044MaRDI QIDQ3022009FDOQ3022009

Authors: Manolis Gergatsoulis, Christos Nomikos 

Publication date: 22 June 2005

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

Recommendations

• Temporal logic programming
• scientific article; zbMATH DE number 4119669
• Branching-time logic programming: the language Cactus and its applications
• Foundations of linear-time logic programming
• A clausal resolution method for CTL branching-time temporal logic

zbMATH Keywords

theorem provingbranching-timetemporal logic programmingproof procedures

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• Extensions of the branching-time logic programming language CACTUS
• Temporal stratification tests for linear and branching-time deductive databases
• A proof system for a unified temporal logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• CACTUS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3022009)