The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The computational complexity of propositional STRIPS planning
Artificial Intelligence
Reasoning about knowledge
An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Languages, automata, and logic
Handbook of formal languages, vol. 3
Journal of the ACM (JACM)
Using temporal logics to express search control knowledge for planning
Artificial Intelligence
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Dynamic Logic
Automata Theory and Its Applications
Automata Theory and Its Applications
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Cosmological lower bound on the circuit complexity of a small problem in logic
Journal of the ACM (JACM)
The ForSpec Temporal Logic: A New Temporal Property-Specification Language
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Automata-Theoretic Approach to Planning for Temporally Extended Goals
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Proceedings of the Conference on Logic of Programs
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
A Practical Introduction to PSL (Series on Integrated Circuits and Systems)
A Practical Introduction to PSL (Series on Integrated Circuits and Systems)
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Classifying discrete temporal properties
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Planning for temporally extended goals
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Enacting declarative languages using LTL: avoiding errors and improving performance
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
Specifying and computing preferred plans
Artificial Intelligence
Symbolic implementation of alternating automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Computing infinite plans for LTL goals using a classical planner
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
| Hi-index | 0.00 |
In this paper we look into the assumption of interpreting LTL over finite traces. In particular we show that LTLf, i.e., LTL under this assumption, is less expressive than what might appear at first sight, and that at essentially no computational cost one can make a significant increase in expressiveness while maintaining the same intuitiveness of LTLf. Indeed, we propose a logic, LDLf for Linear Dynamic Logic over finite traces, which borrows the syntax from Propositional Dynamic Logic (PDL), but is interpreted over finite traces. Satisfiability, validity and logical implication (as well as model checking) for LTLf. are PSPACE-complete as for LTLf. (and LTL).