A decision procedure and complete axiomatization for projection temporal logic
DOI10.1016/J.TCS.2017.09.026zbMATH Open1506.03070OpenAlexW2760114350MaRDI QIDQ1986563FDOQ1986563
Authors: Xinfeng Shu, Zhenhua Duan, Hongwei Du 
Publication date: 8 April 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.09.026
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
Mechanization of proofs and logical operations (03B35) Temporal logic (03B44) Formalization of mathematics in connection with theorem provers (68V20)
Cites Work
- Depth-First Search and Linear Graph Algorithms
- Duration calculus. A formal approach to real-time systems.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Incompleteness of first-order temporal logic with until
- Framed temporal logic programming
- A mechanism of function calls in MSVL
- A cylinder computation model for many-core parallel computing
- Propositional temporal logics: decidability and completeness
- A decision procedure for propositional projection temporal logic with infinite models
- A complete proof system for propositional projection temporal logic
- A Decision Procedure and Complete Axiomatization of Finite Interval Temporal Logic with Projection
- Title not available (Why is that?)
- Completing the temporal picture
- Axiomatising first-order temporal logic: Until and since over linear time
- Title not available (Why is that?)
- A Complete Proof System for First-order Interval Temporal Logic with Projection
- Expressiveness of propositional projection temporal logic with star
- A practical decision procedure for propositional projection temporal logic with infinite models
- Corrigendum: Soundness and Completeness of an Axiom System for Program Verification
- A complete axiom system for propositional interval temporal logic with infinite time
- A canonical form based decision procedure and model checking approach for propositional projection temporal logic
- A complete axiom system for propositional projection temporal logic with cylinder computation model
- Complete Proof System for QPTL
- Logic Programming
- Extending MSVL with semaphore
- \(2^{5}\) years of model checking
- A Hierarchical Completeness Proof for Propositional Interval Temporal Logic with Finite Time
- Title not available (Why is that?)
- A light-weight integration of automated and interactive theorem proving
Cited In (10)
- A complete proof system for propositional projection temporal logic
- Axiomatic semantics of projection temporal logic programs
- A Complete Proof System for First-order Interval Temporal Logic with Projection
- Propositional Projection Temporal Logic, B $\ddot{u}$ chi Automata and ω-Regular Expressions
- A decision procedure for propositional projection temporal logic with infinite models
- A complete axiom system for propositional projection temporal logic with cylinder computation model
- 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
Uses Software
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)
