Pages that link to "Item:Q4635856"
From MaRDI portal
The following pages link to Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (Q4635856):
Displayed 50 items.
- Unifying Logical and Statistical AI (Q4635857) (← links)
- Duality in Computer Science (Q4635858) (← links)
- The Probabilistic Model Checking Landscape (Q4635859) (← links)
- Stochastic mechanics of graph rewriting (Q4635860) (← links)
- On the Satisfiability of Some Simple Probabilistic Logics (Q4635861) (← links)
- Distinguishing Hidden Markov Chains (Q4635862) (← links)
- Quantitative Automata under Probabilistic Semantics (Q4635863) (← links)
- Deciding First-Order Satisfiability when Universal and Existential Variables are Separated (Q4635864) (← links)
- The Diagonal Problem for Higher-Order Recursion Schemes is Decidable (Q4635865) (← links)
- Two-variable Logic with a Between Relation (Q4635866) (← links)
- Decidability and Complexity for Quiescent Consistency (Q4635867) (← links)
- From positive and intuitionistic bounded arithmetic to monotone proof complexity (Q4635868) (← links)
- Gödel's functional interpretation and the concept of learning (Q4635869) (← links)
- Understanding Gentzen and Frege Systems for QBF (Q4635870) (← links)
- Unified Semantics and Proof System for Classical, Intuitionistic and Affine Logics (Q4635871) (← links)
- Data Communicating Processes with Unreliable Channels (Q4635872) (← links)
- A New Perspective on FO Model Checking of Dense Graph Classes (Q4635873) (← links)
- Proving Liveness of Parameterized Programs (Q4635874) (← links)
- Model and Objective Separation with Conditional Lower Bounds (Q4635875) (← links)
- The complexity of regular abstractions of one-counter languages (Q4635876) (← links)
- Two-Way Visibly Pushdown Automata and Transducers (Q4635877) (← links)
- Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings (Q4635878) (← links)
- Plays as Resource Terms via Non-idempotent Intersection Types (Q4635879) (← links)
- Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives (Q4635880) (← links)
- Games with bound guess actions (Q4635881) (← links)
- Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler--Leman Refinement Steps (Q4635882) (← links)
- Hanf normal form for first-order logic with unary counting quantifiers (Q4635883) (← links)
- Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic (Q4635884) (← links)
- Querying Visible and Invisible Information (Q4635885) (← links)
- Coinduction All the Way Up (Q4635886) (← links)
- Denotational semantics of recursive types in synthetic guarded domain theory (Q4635887) (← links)
- Type Theory based on Dependent Inductive and Coinductive Types (Q4635888) (← links)
- Program Equivalence is Coinductive (Q4635889) (← links)
- Fixed Points In Quantitative Semantics (Q4635890) (← links)
- Ability to Count Messages Is Worth Θ(Δ) Rounds in Distributed Computing (Q4635891) (← links)
- The Definitional Side of the Forcing (Q4635893) (← links)
- Towards Completeness via Proof Search in the Linear Time μ-calculus (Q4635894) (← links)
- First-order definability of rational transductions (Q4635895) (← links)
- Order Invariance on Decomposable Structures (Q4635897) (← links)
- Definability equals recognizability for graphs of bounded treewidth (Q4635898) (← links)
- Monadic second order logic as the model companion of temporal logic (Q4635899) (← links)
- Interaction Graphs (Q4635900) (← links)
- Conflict nets (Q4635901) (← links)
- Infinitary Lambda Calculi from a Linear Perspective (Q4635902) (← links)
- First-order logic with reachability for infinite-state systems (Q4635903) (← links)
- The Complexity of Coverability in ν-Petri Nets (Q4635904) (← links)
- Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete (Q4635905) (← links)
- Comparing Chemical Reaction Networks (Q4635906) (← links)
- A categorical approach to open and interconnected dynamical systems (Q4635907) (← links)
- Differential Refinement Logic (Q4635909) (← links)