Pages that link to "Item:Q1591203"

The following pages link to Decidable fragments of first-order temporal logics (Q1591203):

Displayed 46 items.

• On temporal logics with data variable quantifications: decidability and complexity (Q342712) ‎ (← links)
• Temporal BI: proof system, semantics and translations (Q391122) ‎ (← links)
• Deciding safety and liveness in TPTL (Q402360) ‎ (← links)
• Constraint LTL satisfiability checking without automata (Q472802) ‎ (← links)
• On the axiomatizability of some first-order spatio-temporal theories (Q514577) ‎ (← links)
• Bounded linear-time temporal logic: a proof-theoretic investigation (Q764266) ‎ (← links)
• A decidable and expressive fragment of Many-Sorted first-order linear temporal logic (Q821564) ‎ (← links)
• Sound verification procedures for temporal properties of infinite-state systems (Q832273) ‎ (← links)
• Quantified epistemic logics for reasoning about knowledge in multi-agent systems (Q835839) ‎ (← links)
• First-order temporal verification in practice (Q851137) ‎ (← links)
• On the freeze quantifier in Constraint LTL: Decidability and complexity (Q868025) ‎ (← links)
• Combining linear-time temporal logic with constructiveness and paraconsistency (Q975875) ‎ (← links)
• Decidability of infinite-state timed CCP processes and first-order LTL (Q1763732) ‎ (← links)
• Axiomatizing the monodic fragment of first-order temporal logic (Q1849866) ‎ (← links)
• A construction of cylindric and polyadic algebras from atomic relation algebras (Q1935018) ‎ (← links)
• Parameterized verification of leader/follower systems via first-order temporal logic (Q2149965) ‎ (← links)
• Propositional epistemic logics with quantification over agents of knowledge (an alternative approach) (Q2323640) ‎ (← links)
• Evolving objects in temporal information systems (Q2385447) ‎ (← links)
• A survey on temporal logics for specifying and verifying real-time systems (Q2418645) ‎ (← links)
• Decidable cases of first-order temporal logic with functions (Q2426731) ‎ (← links)
• Mechanising first-order temporal resolution (Q2486579) ‎ (← links)
• Quantification over sets of possible worlds in branching-time semantics (Q2500778) ‎ (← links)
• Checking content consistency of integrated web documents (Q2508393) ‎ (← links)
• Complexity of monodic guarded fragments over linear and real time (Q2576942) ‎ (← links)
• Theorem proving using clausal resolution: from past to present (Q2695485) ‎ (← links)
• Temporal Logics of Knowledge and their Applications in Security (Q2866724) ‎ (← links)
• A Cookbook for Temporal Conceptual Data Modelling with Description Logics (Q2946734) ‎ (← links)
• A Conceptual Framework for Secrecy-preserving Reasoning in Knowledge Bases (Q2946749) ‎ (← links)
• Undecidable Propositional Bimodal Logics and One-Variable First-Order Linear Temporal Logics with Counting (Q2957765) ‎ (← links)
• Beyond Knowing That: A New Generation of Epistemic Logics (Q3299590) ‎ (← links)
• Undecidability of First-Order Intuitionistic and Modal Logics with Two variables (Q3370616) ‎ (← links)
• A Decidable Temporal Relevant Logic for Time-Dependent Relevant Human Reasoning (Q3457702) ‎ (← links)
• A Complete Quantified Epistemic Logic for Reasoning about Message Passing Systems (Q3602954) ‎ (← links)
• Temporal Verification of Fault-Tolerant Protocols (Q3623816) ‎ (← links)
• Foundations of Temporal Conceptual Data Models (Q3637331) ‎ (← links)
• First-Order Linear-Time Epistemic Logic with Group Knowledge: An Axiomatisation of the Monodic Fragment (Q3638280) ‎ (← links)
• The serializability problem for a temporal logic of transaction queries (Q3647287) ‎ (← links)
• Deductive verification of simple foraging robotic behaviours (Q3653523) ‎ (← links)
• Serializable histories in quantified propositional temporal logic (Q4652741) ‎ (← links)
• Undecidability of QLTL and QCTL with two variables and one monadic predicate letter (Q5059700) ‎ (← links)
• Fair Derivations in Monodic Temporal Reasoning (Q5191107) ‎ (← links)
• First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries (Q5870513) ‎ (← links)
• First-order expressivity for S5-models: Modal vs. two-sorted languages (Q5960012) ‎ (← links)
• Refutation-aware Gentzen-style calculi for propositional until-free linear-time temporal logic (Q6067745) ‎ (← links)
• Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино? (Q6075540) ‎ (← links)
• Are bundles good deals for first-order modal logic? (Q6116193) ‎ (← links)