Foundations of logic programming
Foundations of logic programming
Programming in Prolog (2nd ed.)
Programming in Prolog (2nd ed.)
Executing temporal logic programs
Executing temporal logic programs
MOLOG: A system that extends PROLOG with modal logic
New Generation Computing
Tokio: logic programming language based on temporal logic and its compilation to Prolog
Proceedings on Third international conference on logic programming
Temporal-logic theorem proving
Temporal-logic theorem proving
Modal and temporal logic programming
Temporal logics and their applications
Denotational and operational semantics for Prolog
Journal of Logic Programming
Foundations of deductive databases and logic programming
Foundations of deductive databases and logic programming
Foundations of deductive databases and logic programming
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The logical basis for computer programming: vol. 2, deductive systems
The logical basis for computer programming: vol. 2, deductive systems
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Contributions to the Theory of Logic Programming
Journal of the ACM (JACM)
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
On the Semantics of Temporal Logic Prograrnrning
On the Semantics of Temporal Logic Prograrnrning
Introduction to Logic Programming
Introduction to Logic Programming
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Journal of Symbolic Computation
On the representation of infinite temporal data and queries (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Finite representation of infinite query answers
ACM Transactions on Database Systems (TODS)
Polynomial time query processing in temporal deductive databases
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Handling infinite temporal data
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Datalog LITE: a deductive query language with linear time model checking
ACM Transactions on Computational Logic (TOCL)
Approximate reasoning by similarity-based SLD resolution
Theoretical Computer Science
Integrating Calendar Dates and Qualitative Temporal Constraints in the Treatment of Periodic Events
IEEE Transactions on Knowledge and Data Engineering
L.0: A Truly Concurrent Executable Temporal Logic Language for Protocols
IEEE Transactions on Software Engineering
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
A Constraint-Based Framework for Prototyping Distributed Virtual Applications
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Neural-symbolic intuitionistic reasoning
Design and application of hybrid intelligent systems
Artificial Intelligence Review
Invariant-Free Clausal Temporal Resolution
Journal of Automated Reasoning
Foundations of data-aware process analysis: a database theory perspective
Proceedings of the 32nd symposium on Principles of database systems
Logical foundations for more expressive declarative temporal logic programming languages
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
This paper addresses semantic and expressiveness issues for temporal logic programming and in particular for the TEMPLOG language proposed by Abadi and Manna. Two equivalent formulations of TEMPLOG's declarative semantics are given: in terms of a minimal Herbrand model and in terms of a least fixpoint. By relating these semantics to TEMPLOG's operational semantics, we prove the completeness of the resolution proof system underlying TEMPLOG's execution mechanism. To study TEMPLOG's expressiveness, we consider its propositional version. We show how propositional TEMPLOG programs can be translated into a temporal fixpoint calculus and prove that they can express essentially all regular properties of sequences.