Pages that link to "Item:Q2946565"
From MaRDI portal
The following pages link to ACM Transactions on Computational Logic (Q2946565):
Displaying 50 items.
- Verifying security protocols as planning in logic programming (Q5738918) (← links)
- A computational theory of normative positions (Q5738919) (← links)
- Logic programming revisited (Q5738920) (← links)
- The intuitionism behind Statecharts steps (Q5738950) (← links)
- Datalog LITE (Q5738951) (← links)
- Reasoning with higher-order abstract syntax in a logical framework (Q5738952) (← links)
- Intuitionistic Light Affine Logic (Q5738953) (← links)
- Description logics of minimal knowledge and negation as failure (Q5738954) (← links)
- Sequent calculi for propositional nonmonotonic logics (Q5738955) (← links)
- Abstract computability and algebraic specification (Q5738956) (← links)
- Editorial (Q5738957) (← links)
- On first-order topological queries (Q5738958) (← links)
- Probabilistic game semantics (Q5738959) (← links)
- A syntactical analysis of non-size-increasing polynomial time computation (Q5738960) (← links)
- Resource-bounded continuity and sequentiality for type-two functionals (Q5738961) (← links)
- Back and forth between guarded and modal logics (Q5738962) (← links)
- Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement (Q5738963) (← links)
- Polynomial-time computation via local inference relations (Q5738964) (← links)
- Revisiting quantification in autoepistemic logic (Q5738965) (← links)
- Typed interpretations of extensible objects (Q5738966) (← links)
- Boolean satisfiability with transitivity constraints (Q5738967) (← links)
- A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions (Q5875940) (← links)
- Logics for Temporal Information Systems in Rough Set Theory (Q5875942) (← links)
- Continuous One-counter Automata (Q5875944) (← links)
- Good-for-Game QPTL: An Alternating Hodges Semantics (Q5875946) (← links)
- The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation (Q5875947) (← links)
- Canonisation and Definability for Graphs of Bounded Rank Width (Q5875948) (← links)
- SAT-Inspired Eliminations for Superposition (Q5875949) (← links)
- MaxSAT Resolution and Subcube Sums (Q5875950) (← links)
- Reducible Theories and Amalgamations of Models (Q5875951) (← links)
- Hardness Characterisations and Size-width Lower Bounds for QBF Resolution (Q5886517) (← links)
- A Generalized Realizability and Intuitionistic Logic (Q5886518) (← links)
- On Composing Finite Forests with Modal Logics (Q5886519) (← links)
- Linear Logic Properly Displayed (Q5886520) (← links)
- Precise Subtyping for Asynchronous Multiparty Sessions (Q5886521) (← links)
- Witnesses for Answer Sets of Logic Programs (Q5886522) (← links)
- On Monotonic Determinacy and Rewritability for Recursive Queries and Views (Q5886523) (← links)
- Testing using CSP Models: Time, Inputs, and Outputs (Q5886524) (← links)
- Generalizing Parikh’s Criterion for Relevance-Sensitive Belief Revision (Q5886525) (← links)
- Guest editorial (Q5892167) (← links)
- Least and Greatest Fixed Points in Linear Logic (Q5892168) (← links)
- Nominal Unification from a Higher-Order Perspective (Q5892169) (← links)
- Epistemic Strategies and Games on Concurrent Processes (Q5892170) (← links)
- Does Treewidth Help in Modal Satisfiability? (Q5892171) (← links)
- Parameterized Complexity of DPLL Search Procedures (Q5892172) (← links)
- Verification of linear duration properties over continuous-time markov chains (Q5892173) (← links)
- Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems (Q5892174) (← links)
- Minimizing Deterministic Lattice Automata (Q5892175) (← links)
- The Complexity of Decomposing Modal and First-Order Theories (Q5892176) (← links)
- A Decidable Fragment of First Order Modal Logic: Two Variable Term Modal Logic (Q6082225) (← links)
