A PROOF PROCEDURE FOR TEMPORAL LOGIC PROGRAMMING
From MaRDI portal
Publication:3022009
Recommendations
Cites work
- 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
- Dealing with multiple granularity of time in temporal logic programming
- Foundations of linear-time logic programming
- Programming in metric temporal logic
- Temporal disjunctive logic programming
- Temporal logic programming
- The branching-time transformation technique for chain datalog programs
- Verification of reactive systems using temporal logic with clocks
Cited in
(6)- scientific article; zbMATH DE number 4076583 (Why is no real title available?)
- scientific article; zbMATH DE number 1059321 (Why is no real title available?)
- A proof system for a unified temporal logic
- scientific article; zbMATH DE number 6423748 (Why is no real title available?)
- Extensions of the branching-time logic programming language CACTUS
- Temporal stratification tests for linear and branching-time deductive databases
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)