On the public citation graph

Logical Methods in Computer Science

https://doi.org/10.2168/0
0 signed · 244 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4689710openalex-extracted
Smyth and Hoare Power Constructions Commute on All Well-Filtered Dcpos
inferred← citeshttps://doi.org/10.1007/11690634_5openalex-snapshot
More on Bisimulations for Higher Order π-Calculus
inferred← citeshttps://doi.org/10.1007/11901433_16openalex-snapshot
Formalising Progress Properties of Non-blocking Programs
inferred← citeshttps://doi.org/10.1007/11964681_4openalex-snapshot
A Rational Deconstruction of Landin’s J Operator
inferred← citeshttps://doi.org/10.1007/978-0-387-09680-3_26openalex-snapshot
Canonical Sequent Proofs via Multi-Focusing
inferred← citeshttps://doi.org/10.1007/978-0-387-09680-3_29openalex-snapshot
Regular n-ary Queries in Trees and Variable Independence
inferred← citeshttps://doi.org/10.1007/978-3-030-01800-9_4openalex-snapshot
Modal Ω-Logic: Automata, Neo-Logicism, and Set-Theoretic Realism
inferred← citeshttps://doi.org/10.1007/978-3-030-30229-0_3openalex-snapshot
The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings
inferred← citeshttps://doi.org/10.1007/978-3-030-85480-5_5openalex-snapshot
Hard Problem and Free Will: An Information-Theoretical Approach
inferred← citeshttps://doi.org/10.1007/978-3-031-34518-0_7openalex-snapshot
Semantics and Syntax, Between Computer Science and Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-319-03542-0_24openalex-snapshot
Environmental Bisimulations for Delimited-Control Operators
inferred← citeshttps://doi.org/10.1007/978-3-319-03967-1_13openalex-snapshot
Modeling the Value Chain with Object-Valued Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-04921-2_37openalex-snapshot
Are Good-for-Games Automata Good for Probabilistic Model Checking?
inferred← citeshttps://doi.org/10.1007/978-3-319-06410-9_33openalex-snapshot
Refactoring, Refinement, and Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-319-06410-9_9openalex-snapshot
The VerCors Tool for Verification of Concurrent Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-06880-0_6openalex-snapshot
(Co)Algebraic Characterizations of Signal Flow Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-07151-0_7openalex-snapshot
On Cross-Stage Persistence in Multi-Stage Programming
inferred← citeshttps://doi.org/10.1007/978-3-319-07317-0_5openalex-snapshot
Verification of Concurrent Systems with VerCors
inferred← citeshttps://doi.org/10.1007/978-3-319-09698-8_24openalex-snapshot
From Algebra to Logic: There and Back Again The Story of a Hierarchy
inferred← citeshttps://doi.org/10.1007/978-3-319-10696-0_23openalex-snapshot
On the Discriminating Power of Testing Equivalences for Reactive Probabilistic Systems: Results and Open Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-10936-7_10openalex-snapshot
Invariance of Conjunctions of Polynomial Equalities for Algebraic Differential Equations
inferred← citeshttps://doi.org/10.1007/978-3-319-11164-3_3openalex-snapshot
Two Generalisations of Roşu and Chen’s Trace Slicing Algorithm A
inferred← citeshttps://doi.org/10.1007/978-3-319-12736-1_1openalex-snapshot
NetKAT — A Formal System for the Verification of Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-14125-1_6openalex-snapshot
From Outermost Reduction Semantics to Abstract Machine
inferred← citeshttps://doi.org/10.1007/978-3-319-15545-6_9openalex-snapshot
Localized Operational Termination in General Logics
inferred← citeshttps://doi.org/10.1007/978-3-319-15579-1_55openalex-snapshot
A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-22102-1_9openalex-snapshot
Machine-Checked Verification of the Correctness and Amortized Complexity of an Efficient Union-Find Implementation
inferred← citeshttps://doi.org/10.1007/978-3-319-24246-0_16openalex-snapshot
Proofs and Reconstructions
inferred← citeshttps://doi.org/10.1007/978-3-319-25524-8_15openalex-snapshot
Module Checking for Uncertain Agents
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_27openalex-snapshot
Secure Data Flow in a Calculus for Context Awareness
inferred← citeshttps://doi.org/10.1007/978-3-540-70889-6_5openalex-snapshot
Verification of Data Paths Using Unbounded Integers: Automata Strike Back
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_78openalex-snapshot
Model Theory Makes Formulas Large
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_23openalex-snapshot
What Are Iteration Theories?
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_29openalex-snapshot
Relativizing Small Complexity Classes and Their Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_7openalex-snapshot
Omega-Regular Half-Positional Winning Conditions
inferred← citeshttps://doi.org/10.1007/978-3-540-75454-1_6openalex-snapshot
Costs Are Expensive!
inferred← citeshttps://doi.org/10.1007/978-3-540-77505-8_18openalex-snapshot
A Spatial Logical Characterisation of Context Bisimulation
inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_34openalex-snapshot
On Natural Non-dcpo Domains
inferred← citeshttps://doi.org/10.1007/978-3-540-78499-9_34openalex-snapshot
Model Checking Freeze LTL over One-Counter Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_34openalex-snapshot
Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence
inferred← citeshttps://doi.org/10.1007/978-3-540-89439-1_34openalex-snapshot
An Algorithmic Interpretation of a Deep Inference System
inferred← citeshttps://doi.org/10.1007/978-3-540-93920-7_6openalex-snapshot
Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions
inferred← citeshttps://doi.org/10.1007/978-3-642-00596-1_29openalex-snapshot
Realizability of Concurrent Recursive Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-01492-5_13openalex-snapshot
Model Checking Linear-Time Properties of Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-01492-5_9openalex-snapshot
Weighted Tree Automata and Tree Transducers
inferred← citeshttps://doi.org/10.1007/978-3-642-02273-9_23openalex-snapshot
Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-03034-5_1openalex-snapshot
J Is for JavaScript: A Direct-Style Correspondence between Algol-Like Languages and JavaScript Using First-Class Continuations
inferred← citeshttps://doi.org/10.1007/978-3-642-03275-2_3openalex-snapshot
Towards Parametric Verification of Prioritized Time Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-03359-9_28openalex-snapshot
Formal Verification of Exact Computations Using Newton’s Method
inferred← citeshttps://doi.org/10.1007/978-3-642-03409-1_17openalex-snapshot
Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies
inferred← citeshttps://doi.org/10.1007/978-3-642-03429-9_17openalex-snapshot
A Coalgebraic Characterization of Behaviours in the Linear Time – Branching Time Spectrum
inferred← citeshttps://doi.org/10.1007/978-3-642-04027-6_11openalex-snapshot
Cardinality Quantifiers in MLO over Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-04027-6_14openalex-snapshot
Expanding the Realm of Systematic Proof Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-04027-6_31openalex-snapshot
Decidable Extensions of Church’s Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-04164-8_10openalex-snapshot
Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part II: Reduction Semantics and Abstract Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-04164-8_9openalex-snapshot
Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part I: Denotational Semantics, Natural Semantics, and Abstract Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-04368-0_9openalex-snapshot
Model Checking Logic WCTL with Multi Constrained Modalities on One Clock Priced Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-04570-7_2openalex-snapshot
On a Uniform Framework for the Definition of Stochastic Process Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-04652-0_3openalex-snapshot
From Reduction-Based to Reduction-Free Normalization
inferred← citeshttps://doi.org/10.1007/978-3-642-04761-9_18openalex-snapshot
On Minimal Odd Rankings for Büchi Complementation
inferred← citeshttps://doi.org/10.1007/978-3-642-10373-5_33openalex-snapshot
Circular Coinduction with Special Contexts
inferred← citeshttps://doi.org/10.1007/978-3-642-10452-7_20openalex-snapshot
Defining Behaviours by Quasi-finality
inferred← citeshttps://doi.org/10.1007/978-3-642-11999-6_7openalex-snapshot
Type Checking and Inference Are Equivalent in Lambda Calculi with Existential Types
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_1openalex-snapshot
Introduction to Decidability of Higher-Order Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_7openalex-snapshot
Retaining the Probabilities in Probabilistic Testing Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-13529-3_35openalex-snapshot
On the Correctness of Rough-Set Based Approximate Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-642-13962-8_45openalex-snapshot
What Is the Problem with Proof Nets for Classical Logic?
inferred← citeshttps://doi.org/10.1007/978-3-642-13962-8_5openalex-snapshot
Proofs, Programs, Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-14107-2_8openalex-snapshot
Verifying Executable Object-Oriented Specifications with Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-14455-4_15openalex-snapshot
Rankers over Infinite Words
inferred← citeshttps://doi.org/10.1007/978-3-642-15205-4_28openalex-snapshot
A Sequent Calculus with Implicit Term Representation
inferred← citeshttps://doi.org/10.1007/978-3-642-15675-5_20openalex-snapshot
Stable Belief Sets Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-15784-4_18openalex-snapshot
Composing Systems While Preserving Probabilities
inferred← citeshttps://doi.org/10.1007/978-3-642-17164-2_24openalex-snapshot
Relational Parametricity for a Polymorphic Linear Lambda Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-18098-9_28openalex-snapshot
State of Büchi Complementation
inferred← citeshttps://doi.org/10.1007/978-3-642-20514-9_6openalex-snapshot
Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices
inferred← citeshttps://doi.org/10.1007/978-3-642-20775-4_1openalex-snapshot
Types for Role-Based Access Control of Dynamic Web Data
inferred← citeshttps://doi.org/10.1007/978-3-642-21070-9_19openalex-snapshot
Omega Algebras and Regular Equations
inferred← citeshttps://doi.org/10.1007/978-3-642-21254-3_2openalex-snapshot
Automatic Structures and Groups
inferred← citeshttps://doi.org/10.1007/978-3-642-21455-4_3openalex-snapshot
Automated Verification Techniques for Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-21875-0_11openalex-snapshot
Axiomatizing Resource Bounds for Measure
inferred← citeshttps://doi.org/10.1007/978-3-642-22119-4_12openalex-snapshot
On the Proof Complexity of Cut-Free Bounded Deep Inference
inferred← citeshttps://doi.org/10.1007/978-3-642-22256-6_2openalex-snapshot
Streamable Fragments of Forward XPath
inferred← citeshttps://doi.org/10.1007/978-3-642-22438-6_14openalex-snapshot
Experimenting with Deduction Modulo
inferred← citeshttps://doi.org/10.1007/978-3-642-22993-0_22openalex-snapshot
The Role of Polymorphism in the Characterisation of Complexity by Soft Types
inferred← citeshttps://doi.org/10.1007/978-3-642-24276-2_5openalex-snapshot
Automating Derivations of Abstract Machines from Reduction Semantics:
inferred← citeshttps://doi.org/10.1007/978-3-642-24288-5_2openalex-snapshot
Observing Continuous-Time MDPs by 1-Clock Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-24310-3_4openalex-snapshot
Time-Bounded Verification of CTMCs against Real-Time Specifications
inferred← citeshttps://doi.org/10.1007/978-3-642-24559-6_41openalex-snapshot
Automating Algebraic Methods in Isabelle
inferred← citeshttps://doi.org/10.1007/978-3-642-24769-9_40openalex-snapshot
The BMC Method for the Existential Part of RTCTLK and Interleaved Interpreted Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-25318-8_11openalex-snapshot
Polymorphic Multi-stage Language with Control Effects
inferred← citeshttps://doi.org/10.1007/978-3-642-27660-6_35openalex-snapshot
An Algorithm for Probabilistic Alternating Simulation
inferred← citeshttps://doi.org/10.1007/978-3-642-28412-0_14openalex-snapshot
Towards Bialgebraic Semantics for the Linear Time – Branching Time Spectrum
inferred← citeshttps://doi.org/10.1007/978-3-642-29822-6_7openalex-snapshot
Normal Form Bisimulations for Delimited-Control Operators
inferred← citeshttps://doi.org/10.1007/978-3-642-30793-5_6openalex-snapshot
Beyond Lassos: Complete SMT-Based Bounded Model Checking for Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-31262-5_15openalex-snapshot
Abstract Machines for Argumentation
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_27openalex-snapshot
Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations
inferred← citeshttps://doi.org/10.1007/978-3-642-31606-7_12openalex-snapshot
Weighted Nested Word Automata and Logics over Strong Bimonoids
inferred← citeshttps://doi.org/10.1007/978-3-642-31612-8_5openalex-snapshot
An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-32347-8_6openalex-snapshot
Construction of Real Algebraic Numbers in Coq
inferred← citeshttps://doi.org/10.1007/978-3-642-32495-6_3openalex-snapshot
Interpolation-Based Height Analysis for Improving a Recurrence Solver
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_6openalex-snapshot
Simple Models for Recursive Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-32897-8_13openalex-snapshot
Full Hybrid μ-Calculus, Its Bisimulation Invariance and Application to Argumentation
inferred← citeshttps://doi.org/10.1007/978-3-642-32940-1_29openalex-snapshot
Coalgebraic Trace Semantics for Probabilistic Transition Systems Based on Measure Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-33158-9_1openalex-snapshot
Reasoning and Query Answering in Description Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-33365-1_5openalex-snapshot
Playing Optimally on Timed Automata with Random Delays
inferred← citeshttps://doi.org/10.1007/978-3-642-34059-8_18openalex-snapshot
Towards Communication-Based Steering of Complex Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-34281-3_26openalex-snapshot
More Anti-chain Based Refinement Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-35182-2_21openalex-snapshot
A Dynamic Interpretation of the CPS Hierarchy
inferred← citeshttps://doi.org/10.1007/978-3-642-35722-0_13openalex-snapshot
The Wadge Hierarchy of Petri Nets ω-Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-37036-6_18openalex-snapshot
On Distributability in Process Calculi
inferred← citeshttps://doi.org/10.1007/978-3-642-37890-4_10openalex-snapshot
SAT-Based BMC for Deontic Metric Temporal Logic and Deontic Interleaved Interpreted Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-38946-7_9openalex-snapshot
The Resource Lambda Calculus Is Short-Sighted in Its Relational Model
inferred← citeshttps://doi.org/10.1007/978-3-642-39038-8_6openalex-snapshot
A Formal Semantics for Isorecursive and Equirecursive State Abstractions
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_20openalex-snapshot
Stochastic Context-Free Grammars, Regular Languages, and Newton’s Method
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_31openalex-snapshot
The IO and OI Hierarchies Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_36openalex-snapshot
Proof Systems for Retracts in Simply Typed Lambda Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-39698-4_22openalex-snapshot
Synthesizing Switching Controllers for Hybrid Systems by Generating Invariants
inferred← citeshttps://doi.org/10.1007/978-3-642-39718-9_15openalex-snapshot
Counterexample-Preserving Reduction for Symbolic Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-39718-9_3openalex-snapshot
Advances in Quantitative Verification for Ubiquitous Computing
inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_33openalex-snapshot
Upper Bounds for Newton’s Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-40184-8_25openalex-snapshot
Cost Preserving Bisimulations for Probabilistic Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_20openalex-snapshot
Tractable Combinations of Global Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-40885-4_22openalex-snapshot
Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering
inferred← citeshttps://doi.org/10.1007/978-3-642-41036-9_8openalex-snapshot
Deciding Continuous-Time Metric Temporal Logic with Counting Modalities
inferred← citeshttps://doi.org/10.1007/978-3-642-41674-3_176openalex-snapshot
Model Checking Probabilistic Timed Systems against Timed Automata Specification
inferred← citeshttps://doi.org/10.1007/978-3-642-45221-5_17openalex-snapshot
Multi-objective Discounted Reward Verification in Graphs and MDPs
inferred← citeshttps://doi.org/10.1007/978-3-642-54013-4_3openalex-snapshot
Relational Thread-Modular Static Value Analysis by Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/978-3-642-54108-7_11openalex-snapshot
An Automatic Encoding from VeriFast Predicates into Implicit Dynamic Frames
inferred← citeshttps://doi.org/10.1007/978-3-642-54789-8_6openalex-snapshot
A Logical Basis for Quantum Evolution and Entanglement
inferred← citeshttps://doi.org/10.1007/978-3-642-54862-8_19openalex-snapshot
Characterizing Algebraic Invariants by Differential Radical Invariants
inferred← citeshttps://doi.org/10.1007/978-3-662-44471-9_6openalex-snapshot
From Linear Types to Behavioural Types and Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-662-44522-8_22openalex-snapshot
Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures
inferred← citeshttps://doi.org/10.1007/978-3-662-44602-7_24openalex-snapshot
Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata
inferred← citeshttps://doi.org/10.1007/978-3-662-46081-8_24openalex-snapshot
A Hierarchy of Proof Rules for Checking Differential Invariance of Algebraic Sets
inferred← citeshttps://doi.org/10.1007/978-3-662-46678-0_22openalex-snapshot
Typing Weak MSOL Properties
inferred← citeshttps://doi.org/10.1007/978-3-662-48561-3_21openalex-snapshot
Algebraic Semantics for Dynamic Dynamic Logic
inferred← citeshttps://doi.org/10.1007/978-3-662-48561-3_37openalex-snapshot
Epistemic Updates on Bilattices
inferred← citeshttps://doi.org/10.1007/978-3-7643-8354-1_8openalex-snapshot
What is a Logic, and What is a Proof?
inferred← citeshttps://doi.org/10.1007/s00037-015-0113-8openalex-snapshot
Relativizing small complexity classes and their theories
inferred← citeshttps://doi.org/10.1007/s00224-017-9763-zopenalex-snapshot
The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy
inferred← citeshttps://doi.org/10.1007/s00354-008-0038-8openalex-snapshot
A New Type System for JVM Lock Primitives
inferred← citeshttps://doi.org/10.1007/s00493-015-3003-4openalex-snapshot
Regular families of forests, antichains and duality pairs of relational structures
inferred← citeshttps://doi.org/10.1007/s00607-025-01569-xopenalex-snapshot
Model checking spatial-temporal features of cascading failures in wireless sensor networks
inferred← citeshttps://doi.org/10.1007/s10458-013-9232-2openalex-snapshot
BDD-versus SAT-based bounded model checking for the existential fragment of linear temporal logic with knowledge: algorithms and their performance
inferred← citeshttps://doi.org/10.1007/s10458-023-09601-0openalex-snapshot
Quantifying over information change with common knowledge
inferred← citeshttps://doi.org/10.1007/s10485-010-9241-0openalex-snapshot
Deep Inference and Probabilistic Coherence Spaces
inferred← citeshttps://doi.org/10.1007/s10485-025-09811-5openalex-snapshot
Monadic Aspects of the Ideal Lattice Functor on the Category of Distributive Lattices
inferred← citeshttps://doi.org/10.1007/s10626-011-0101-3openalex-snapshot
Symbolic Supervisory Control of Infinite Transition Systems Under Partial Observation Using Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/s10703-012-0176-yopenalex-snapshot
Loop summarization using state and transition invariants
inferred← citeshttps://doi.org/10.1007/s10703-025-00472-7openalex-snapshot
Variable automata over infinite alphabets
inferred← citeshttps://doi.org/10.1007/s10817-007-9066-1openalex-snapshot
A Decision Procedure for Linear “Big O” Equations
inferred← citeshttps://doi.org/10.1007/s10817-011-9222-5openalex-snapshot
On Explicit Substitution with Names
inferred← citeshttps://doi.org/10.1007/s10817-015-9332-6openalex-snapshot
Automating Boolean Set Operations in Mizar Proof Checking with the Aid of an External SAT Solver
inferred← citeshttps://doi.org/10.1007/s10817-015-9337-1openalex-snapshot
Improving Legibility of Formal Proofs Based on the Close Reference Principle is NP-Hard
inferred← citeshttps://doi.org/10.1007/s10817-025-09742-9openalex-snapshot
Theorem Proving as Constraint Solving for Coherent Logic with Function Symbols
inferred← citeshttps://doi.org/10.1007/s10844-011-0189-9openalex-snapshot
Towards an effective automatic query expansion process using an association rule mining approach
inferred← citeshttps://doi.org/10.1007/s10849-022-09357-yopenalex-snapshot
A Logic for Conditional Local Strategic Reasoning
inferred← citeshttps://doi.org/10.1007/s10849-024-09423-7openalex-snapshot
A Propositional Cirquent Calculus for Computability Logic
inferred← citeshttps://doi.org/10.1007/s10992-012-9252-4openalex-snapshot
What is Nominalistic Mereology?
inferred← citeshttps://doi.org/10.1007/s10992-013-9275-5openalex-snapshot
Daggers, Kernels, Baer *-semigroups, and Orthomodularity
inferred← citeshttps://doi.org/10.1007/s10992-023-09703-wopenalex-snapshot
Intuitionistic Mereology II: Overlap and Disjointness
inferred← citeshttps://doi.org/10.1007/s10992-023-09723-6openalex-snapshot
Logic-Sensitivity and Bitstring Semantics in the Square of Opposition
inferred← citeshttps://doi.org/10.1007/s11083-021-09571-6openalex-snapshot
Critical Relations of Crowns in Critical Times of Coronavirus Depression
inferred← citeshttps://doi.org/10.1007/s11225-011-9347-xopenalex-snapshot
Dynamic Logics of Evidence-Based Beliefs
inferred← citeshttps://doi.org/10.1007/s11225-012-9372-4openalex-snapshot
Constraint Satisfaction, Irredundant Axiomatisability and Continuous Colouring
inferred← citeshttps://doi.org/10.1007/s11225-014-9590-zopenalex-snapshot
Properties of Saturation in Monotonic Neighbourhood Models and Some Applications
inferred← citeshttps://doi.org/10.1007/s11225-024-10110-8openalex-snapshot
On a Generalization of Heyting Algebras I
inferred← citeshttps://doi.org/10.1007/s11229-008-9381-zopenalex-snapshot
Evidence with uncertain likelihoods
inferred← citeshttps://doi.org/10.1007/s11229-022-04032-yopenalex-snapshot
Someone knows that local reasoning on hypergraphs is a weakly aggregative modal logic
inferred← citeshttps://doi.org/10.1007/s11229-025-05207-zopenalex-snapshot
Obligations and permissions on selfextensional logics
inferred← citeshttps://doi.org/10.1007/s41468-025-00201-3openalex-snapshot
On the topology of concurrent systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2013.09.010openalex-snapshot
Continuity of Gödelʼs System T Definable Functionals via Effectful Forcing
inferred← citeshttps://doi.org/10.1016/j.entcs.2019.09.014openalex-snapshot
The Construction of Set-Truncated Higher Inductive Types
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.03.020openalex-snapshot
Derivation tree analysis for accelerated fixed-point computation
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.01.015openalex-snapshot
Canonicity and normalization for dependent type theory
inferred← citeshttps://doi.org/10.1017/jsl.2014.76openalex-snapshot
MARTIN-LÖF RANDOMNESS IN SPACES OF CLOSED SETS
inferred← citeshttps://doi.org/10.1017/s0960129508007159openalex-snapshot
Bunched polymorphism
inferred← citeshttps://doi.org/10.1017/s0960129524000355openalex-snapshot
Synthetic G-jet-structures in modal homotopy type theory
inferred← citeshttps://doi.org/10.1051/ita/2020007openalex-snapshot
Betweenness of partial orders
inferred← citeshttps://doi.org/10.1080/11663081.2017.1370663openalex-snapshot
A general framework for dynamic epistemic logic: towards canonical correspondences
inferred← citeshttps://doi.org/10.1080/11663081.2019.1703469openalex-snapshot
Modal translation of substructural logics
inferred← citeshttps://doi.org/10.1080/11663081.2023.2233346openalex-snapshot
Nested sequents for intermediate logics: the case of Gödel-Dummett logics
inferred← citeshttps://doi.org/10.1093/logcom/exab049openalex-snapshot
On the behaviour of coalgebras with side effects and algebras with effectful iteration
inferred← citeshttps://doi.org/10.1093/logcom/exab050openalex-snapshot
Steps and traces
inferred← citeshttps://doi.org/10.1093/logcom/exad066openalex-snapshot
Applying Theory to Practice
inferred← citeshttps://doi.org/10.1103/physreva.90.012109openalex-snapshot
Complete set of circuit equations for stabilizer quantum mechanics
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00009openalex-snapshot
Syntactic Effectful Realizability in Higher-Order Logic
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00038openalex-snapshot
Learning Weighted Automata over Number Rings, Concretely and Categorically
inferred← citeshttps://doi.org/10.1109/synasc.2018.00077openalex-snapshot
The Blockchain, Today and Tomorrow
inferred← citeshttps://doi.org/10.1142/s0129054108005802openalex-snapshot
A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
inferred← citeshttps://doi.org/10.1142/s0129054110007258openalex-snapshot
THE COMPLEXITY OF MODEL CHECKING FOR BOOLEAN FORMULAS
inferred← citeshttps://doi.org/10.1142/s0129054121500283openalex-snapshot
Two Effective Properties of ω-Rational Functions
inferred← citeshttps://doi.org/10.1142/s0129054122410039openalex-snapshot
The Triple-Pair Construction for Weighted ω-Pushdown Automata
inferred← citeshttps://doi.org/10.1142/s0129054122450010openalex-snapshot
Compositions with Constant Weighted Extended Tree Transducers
inferred← citeshttps://doi.org/10.1142/s021819670900524xopenalex-snapshot
OMITTING TYPES, BOUNDED WIDTH AND THE ABILITY TO COUNT
inferred← citeshttps://doi.org/10.1142/s0218196710005686openalex-snapshot
WEAKLY ITERATED BLOCK PRODUCTS AND APPLICATIONS TO LOGIC AND COMPLEXITY
inferred← citeshttps://doi.org/10.1142/s1793005719500017openalex-snapshot
Quantale-Valued Generalizations of Approach Groups
inferred← citeshttps://doi.org/10.1145/2185632.2185672openalex-snapshot
Verification of linear duration properties over continuous-time markov chains
inferred← citeshttps://doi.org/10.1145/2213977.2213999openalex-snapshot
Time-space tradeoffs in resolution
showing the first 200 of 244 · page through all 244
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.