A decision procedure and complete axiomatization for projection temporal logic
From MaRDI portal
(Redirected from Publication:1986563)
Recommendations
- Complete axiomatization for projection temporal logic with finite time
- An efficient decision procedure for propositional projection temporal logic
- Efficient decision procedure for propositional projection temporal logic
- A complete proof system for propositional projection temporal logic
- Propositional temporal logics: decidability and completeness
Cites work
- scientific article; zbMATH DE number 438994 (Why is no real title available?)
- scientific article; zbMATH DE number 439891 (Why is no real title available?)
- scientific article; zbMATH DE number 512815 (Why is no real title available?)
- scientific article; zbMATH DE number 1927551 (Why is no real title available?)
- scientific article; zbMATH DE number 2196589 (Why is no real title available?)
- A Complete Proof System for First-order Interval Temporal Logic with Projection
- A Decision Procedure and Complete Axiomatization of Finite Interval Temporal Logic with Projection
- A Hierarchical Completeness Proof for Propositional Interval Temporal Logic with Finite Time
- A canonical form based decision procedure and model checking approach for propositional projection temporal logic
- A complete axiom system for propositional interval temporal logic with infinite time
- A complete axiom system for propositional projection temporal logic with cylinder computation model
- A complete proof system for propositional projection temporal logic
- A cylinder computation model for many-core parallel computing
- A decision procedure for propositional projection temporal logic with infinite models
- A light-weight integration of automated and interactive theorem proving
- A mechanism of function calls in MSVL
- A practical decision procedure for propositional projection temporal logic with infinite models
- Axiomatising first-order temporal logic: Until and since over linear time
- Complete Proof System for QPTL
- Completing the temporal picture
- Corrigendum: Soundness and Completeness of an Axiom System for Program Verification
- Depth-First Search and Linear Graph Algorithms
- Duration calculus. A formal approach to real-time systems.
- Expressiveness of propositional projection temporal logic with star
- Extending MSVL with semaphore
- Framed temporal logic programming
- Incompleteness of first-order temporal logic with until
- Logic Programming
- Propositional temporal logics: decidability and completeness
- \(2^{5}\) years of model checking
Cited in
(10)- A decision procedure for propositional projection temporal logic with infinite models
- A complete proof system for propositional projection temporal logic
- A Complete Proof System for First-order Interval Temporal Logic with Projection
- Complete axiomatization for projection temporal logic with finite time
- A sound and complete proof system for a unified temporal logic
- Efficient decision procedure for propositional projection temporal logic
- A Relatively Complete Axiomatisation of Projection onto State in the Duration Calculus
- Axiomatic semantics of projection temporal logic programs
- A complete axiom system for propositional projection temporal logic with cylinder computation model
- Propositional Projection Temporal Logic, B $\ddot{u}$ chi Automata and ω-Regular Expressions
This page was built for publication: A decision procedure and complete axiomatization for projection temporal logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1986563)
