Pages that link to "Item:Q2265816"
From MaRDI portal
The following pages link to Decision procedures and expressiveness in the temporal logic of branching time (Q2265816):
Displaying 50 items.
- Completeness and decidability results for CTL in constructive type theory (Q287375) (← links)
- Reasoning about equilibria in game-like concurrent systems (Q345709) (← links)
- Branching-time logics with path relativisation (Q386037) (← links)
- A tableau-based decision procedure for CTL\(^*\) (Q432138) (← links)
- \textit{Once} and \textit{for all} (Q439961) (← links)
- Decidability of an Xstit logic (Q456970) (← links)
- Linear temporal logic symbolic model checking (Q465680) (← links)
- Rewrite rules for \(\mathrm{CTL}^\ast\) (Q518745) (← links)
- A symbolic model for timed concurrent constraint programming (Q530859) (← links)
- Completeness of a branching-time logic with possible choices (Q622622) (← links)
- Completeness for flat modal fixpoint logics (Q638475) (← links)
- A hierarchy of temporal logics with past (Q672329) (← links)
- Deontic action logic, atomic Boolean algebras and fault-tolerance (Q846527) (← links)
- A clausal resolution method for branching-time logic \(\text{ECTL}^+\) (Q862827) (← links)
- An optimal decision procedure for right propositional neighborhood logic (Q877892) (← links)
- A uniform method for proving lower bounds on the computational complexity of logical theories (Q917543) (← links)
- A purely model-theoretic proof of the exponential succinctness gap between CTL\(^{+}\) and CTL (Q975478) (← links)
- Epistemic logic for rule-based agents (Q1006511) (← links)
- Verifying time, memory and communication bounds in systems of reasoning agents (Q1036066) (← links)
- Multi-modal CTL: completeness, complexity, and an application (Q1037587) (← links)
- A logic to reason about likelihood (Q1090326) (← links)
- Automata-theoretic techniques for modal logics of programs (Q1090675) (← links)
- Interpreting logics of knowledge in propositional dynamic logic (Q1096609) (← links)
- The complexity of reasoning about knowledge and time. I: Lower bounds (Q1119565) (← links)
- TABLEAUX: A general theorem prover for modal logics (Q1181709) (← links)
- A guide to completeness and complexity for modal logics of knowledge and belief (Q1193476) (← links)
- A logical query language for hypermedia systems (Q1328531) (← links)
- Determinization and memoryless winning strategies (Q1357005) (← links)
- Axiomatising extended computation tree logic (Q1389439) (← links)
- Mathematical modal logic: A view of its evolution (Q1422628) (← links)
- Clausal resolution in a logic of rational agency (Q1606116) (← links)
- Backdoors for linear temporal logic (Q1725638) (← links)
- Cycle detection in computation tree logic (Q1784962) (← links)
- The price of universality (Q1815426) (← links)
- On the expressive power of hybrid branching-time logics (Q1989342) (← links)
- Branching-time logic \(\mathsf{ECTL}^{\#}\) and its tree-style one-pass tableau: extending fairness expressibility of \(\mathsf{ECTL}^+\) (Q1989347) (← links)
- Branching time logics with multiagent temporal accessibility relations (Q2030777) (← links)
- Temporal logic with recursion (Q2051830) (← links)
- Branching interval algebra: an almost complete picture (Q2051838) (← links)
- Tableaux and sequent calculi for \textsf{CTL} and \textsf{ECTL}: satisfiability test with certifying proofs and models (Q2095426) (← links)
- Complexity of finite-variable fragments of propositional temporal and modal logics of computation (Q2148903) (← links)
- Multiagent temporal logics, unification problems, and admissibilities (Q2160194) (← links)
- Strategic reasoning with a bounded number of resources: the quest for tractability (Q2238736) (← links)
- A novel approach to verifying context free properties of programs (Q2290651) (← links)
- Model checking for hybrid branching-time logics (Q2291813) (← links)
- No easy puzzles: hardness results for jigsaw puzzles (Q2346997) (← links)
- A goal-directed decision procedure for hybrid PDL (Q2351150) (← links)
- Proof-based verification approaches for dynamic properties: application to the information system domain (Q2355384) (← links)
- Sequent calculi for branching time temporal logics of knowledge and beliefwith awareness: completeness and decidability (Q2376368) (← links)
- A branching distributed temporal logic for reasoning about entanglement-free quantum state transformations (Q2401638) (← links)
