Foundations of linear-time logic programming
From MaRDI portal
Publication:4876388
DOI10.1080/00207169508804444zbMATH Open0847.68022DBLPjournals/ijcm/Orgun95OpenAlexW2050994281WikidataQ58185354 ScholiaQ58185354MaRDI QIDQ4876388FDOQ4876388
Authors: Mehmet A. Orgun
Publication date: 7 October 1996
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169508804444
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Semantics of Predicate Logic as a Programming Language
- MOLOG: A system that extends PROLOG with modal logic
- Concerning the semantic consequence relation in first-order temporal logic
- Towards a unified theory of intensional logic programming
- Title not available (Why is that?)
- Temporal logic programming
- The power of temporal proofs
- A Temporal extension of Prolog
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extending Temporal Logic Programming with Choice Predicates Non-determinism
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
- Title not available (Why is that?)
- Linear time Datalog and branching time logic
- A PROOF PROCEDURE FOR TEMPORAL LOGIC PROGRAMMING
- Title not available (Why is that?)
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)