Unification in linear temporal logic LTL
From MaRDI portal
Publication:716499
DOI10.1016/J.APAL.2011.06.004zbMATH Open1241.03014OpenAlexW1989441839MaRDI QIDQ716499FDOQ716499
Authors: Sergey Babenyshev, Vladimir Rybakov Edit this on Wikidata
Publication date: 22 September 2011
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2011.06.004
Recommendations
- Unified temporal logic
- Writing out Unifiers in Linear Temporal Logic
- Projective formulas and unification in linear temporal logic \(\mathrm{LTL}_{U}\)
- Unifying proof methodologies of duration calculus and timed linear temporal logic
- A proof system for unified temporal logic
- A proof system for a unified temporal logic
- Intuitionistic linear temporal logics
- A Unified Translation of Linear Temporal Logic to ω-Automata
- Combining linear-time temporal logic with constructiveness and paraconsistency
- Unification in Linear Modal Logic on Non-transitive Time with the Universal Modality
Temporal logic (03B44) Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Cites Work
- Proof theory for admissible rules
- Best solving modal equations
- On the admissible rules of intuitionistic propositional logic
- A Resolution/Tableaux Algorithm for Projective Approximations in IPC
- Independent Bases of Admissible Rules
- Admissible Rules of Lukasiewicz Logic
- The complexity of propositional linear temporal logics
- Unification in intuitionistic logic
- Admissible Rules of Modal Logics
- Unification, finite duality and projectivity in varieties of Heyting algebras
- Complexity of admissible rules
- Temporal logic and state systems
- Rules of inference with parameters for intuitionistic logic
- Unification through projectivity
- Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus
- A General Tableau Method for Deciding Description Logics, Modal Logics and Related First-Order Fragments
- A criterion for admissibility of rules in the modal system S4 and intuitionistic logic
- Unification in the description logic EL
- Unification in a description logic with transitive closure of roles
- Multi-modal and Temporal Logics with Universal Formula--Reduction of Admissibility to Validity and Unification
- Title not available (Why is that?)
- Computer Science Logic
- Unification of concept terms in description logics
- Linear temporal logic with until and next, logical consecutions
- Fast algorithms for uniform semi-unification
- A tableau method for checking rule admissibility in S4
- Automated synthesis of tableau calculi
Cited In (18)
- Inference rules in Nelson's logics, admissibility and weak admissibility
- Projective formulas and unification in linear temporal logic \(\mathrm{LTL}_{U}\)
- DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV
- On unification and admissible rules in Gabbay-de Jongh logics
- Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\)
- Unification and Inference Rules in the Multi-modal Logic of Knowledge and Linear Time LTK
- Enhancing unsatisfiable cores for LTL with information on temporal relevance
- Admissibility and Unifiability in Contact Logics
- Unification in Linear Modal Logic on Non-transitive Time with the Universal Modality
- Projective formulas and unification in linear discrete temporal multi-agent logics
- Best unifiers in transitive modal logics
- About the unification types of modal logics
- Title not available (Why is that?)
- Admissibility via natural dualities
- Unified temporal logic
- Writing out Unifiers in Linear Temporal Logic
- KD is nullary
- Satisfiability problem in interval FP-logic
This page was built for publication: Unification in linear temporal logic LTL
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q716499)
