Foundations of linear-time logic programming
From MaRDI portal
Publication:4876388
Recommendations
Cites work
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- scientific article; zbMATH DE number 3901996 (Why is no real title available?)
- scientific article; zbMATH DE number 3664336 (Why is no real title available?)
- scientific article; zbMATH DE number 54243 (Why is no real title available?)
- scientific article; zbMATH DE number 1337627 (Why is no real title available?)
- scientific article; zbMATH DE number 4119592 (Why is no real title available?)
- scientific article; zbMATH DE number 3363520 (Why is no real title available?)
- A Temporal extension of Prolog
- Concerning the semantic consequence relation in first-order temporal logic
- Extending Temporal Logic Programming with Choice Predicates Non-determinism
- MOLOG: A system that extends PROLOG with modal logic
- Temporal logic programming
- The Semantics of Predicate Logic as a Programming Language
- The power of temporal proofs
- Towards a unified theory of intensional logic programming
Cited in
(7)- On the computational complexity of stratified negation in linear-time temporal logic programming
- Temporal disjunctive logic programming
- Extending Temporal Logic Programming with Choice Predicates Non-determinism
- scientific article; zbMATH DE number 139798 (Why is no real title available?)
- Linear time Datalog and branching time logic
- A PROOF PROCEDURE FOR TEMPORAL LOGIC PROGRAMMING
- scientific article; zbMATH DE number 3960965 (Why is no real title available?)
This page was built for publication: Foundations of linear-time logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4876388)