Branching-time logic programming: the language Cactus and its applications

DOI10.1016/S0096-0551(98)00009-5MaRDI QIDQ4719299zbMATH OpenOpenAlexFDO

Authors Panos Rondogiannis, Manolis Gergatsoulis, Themis Panayiotopoulos

Publication date 4 January 2000

Published in Computer Languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0096-0551(98)00009-5

zbMATH Keywords

temporal programming languages

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Extensions of the branching-time logic programming language CACTUS
• A PROOF PROCEDURE FOR TEMPORAL LOGIC PROGRAMMING
• Temporal logic programming
• “Sometimes” and “not never” revisited
• scientific article; zbMATH DE number 4082943

Cited in

(9)

• A temporal programming model with atomic blocks based on projection temporal logic
• Operational semantics of Framed Tempura
• Temporal stratification tests for linear and branching-time deductive databases
• Extensions of the branching-time logic programming language CACTUS
• A PROOF PROCEDURE FOR TEMPORAL LOGIC PROGRAMMING
• Axiomatic semantics of projection temporal logic programs
• Temporal disjunctive logic programming
• Stratified negation in temporal logic programming and the cycle-sum test
• The branching-time transformation technique for chain datalog programs

Describes a project that uses

Uses Software

• CACTUS

This page was built for publication: Branching-time logic programming: the language Cactus and its applications

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