yusuke1997/dblp-id-title huggingface dataset:
A Generalization of Stability and its Application to Circumscription of Positive Introspective Knowledge
Game Comonads & Generalised Quantifiers
Quantified Constraint Satisfaction on Monoids
Algorithms for Omega-Regular Games with Imperfect Information ,
A Bounded Set Theory with Anti-Foundation Axiom and Inductive Definability
Normalized Types
Computing Measure as a Primitive Operation in Real Number Computation
Verification of Security Protocols (Invited Talk)
A Direct Proof for the Completeness of SLD-Resolution
Tight Upper Bounds for Streett and Parity Complementation
Calculi of Meta-variables
Permutative Logic
Fast Infinite-State Model Checking in Integer-Based Systems (Invited Lecture)
Fuzzy Algebraic Theories
Localisable Monads
A decision procedure for satisfiability in separation logic with inductive predicates
Developing Logic Programs: Computing Through Normalizing
Space-Efficient Computation by Interaction
Labelled Natural Deduction for Interval Logics
The tractability frontier of graph-like first-order query sets
Differential Games, Locality, and Model Checking for FO Logic of Graphs
On Flat Lossy Channel Machines
The Complexity of Independence-Friendly Fixpoint Logic
A Dependent Type Theory with Names and Binding
Call-by-Value Games
Separating regular languages with first-order logic
A Duality Theory for Quantitative Semantics
Uniform Derivation of Decision Procedures by Superposition
Theories for Subexponential-size Bounded-depth Frege Proofs
Insights from Univalent Foundations: A Case Study Using Double Categories
Equational Termination by Semantic Labelling
The complexity of admissibility in Omega-regular games
Algebraic Characterization of the Alternation Hierarchy in FO 2 [<] on Finite Words
On the Complexity of Hybrid Logics with Binders
A Category Theoretic View of Nondeterministic Recursive Program Schemes
Query Learning of Derived Omega-Tree Languages in Polynomial Time
A Space Efficient Implementation of a Tableau Calculus for a Logic with a Constructive Negation
Towards a Characterization of Order-Invariant Queries over Tame Structures
Decomposition theorems and model-checking for the modal μ -calculus
Simple Stochastic Parity Games
Efficient Enumeration for Conjunctive Queries over X-underbar Structures
Complexity Classifications via Algebraic Logic
Intersection Logic
Modal Satisfiability Is in Deterministic Linear Space
Logical Relations for Dynamic Name Creation
CSL '87, 1st Workshop on Computer Science Logic, Karlsruhe, Germany, October 12-16, 1987, Proceedings
An Abstract Strong Normalization Theorem
Modal mu-Calculus with Atoms
Combining Linear Logic and Size Types for Implicit Complexity
Satisfiability and Finite Model Property for the Alternating-Time mu -Calculus
A Recursion-Theoretic Characterisation of the Positive Polynomial-Time Functions
Unifying Sequent Systems for Gödel-Löb Provability Logic via Syntactic Transformations
Quantifers and the System KE: Some Surprising Results
Citations for the test-of-time award from 1994
Proving Finite Satisfiability of Deductive Databases
Concurrency Semantics for the Geiger-Paz-Pearl Axioms of Independence
The True Concurrency of Herbrand's Theorem
Definability and Complexity of Graph Parameters (Invited Talk)
Turing machines with atoms, constraint satisfaction problems, and descriptive complexity
A Computational Interpretation of the Axiom of Determinacy in Arithmetic
How to Lie Without Being (Easily) Convicted and the Length of Proofs in Propositional Calculus
Deciding the Inductive Validity of FOR ALL THERE EXISTS * Queries
Congruence Types
An Internal Language for Categories Enriched over Generalised Metric Spaces
A Normalized Edit Distance on Infinite Words
On Constraint Satisfaction Problems below P
Proofnets and Context Semantics for the Additives
Useful Open Call-By-Need
Decidable Entailments in Separation Logic with Inductive Definitions: Beyond Establishment
The Computability Path Ordering: The End of a Quest
Concurrent Games with Tail Objectives
A Unified Approach to Boundedness Properties in MSO
Relative Completeness for Logics of Functional Programs
Coping Polynomially with Numerous but Identical Elements within Planning Problems
Petri Nets and the Equivalence Problem
Bounded Fixed-Point Definability and Tabular Recognition of Languages
The Complexity of Set Constraints
Normal Forms and the Complexity of Computations of Logic Programs
The Complexity of Abduction for Equality Constraint Languages
Innocent Game Semantics via Intersection Type Assignment Systems
Descriptive complexity of approximate counting CSPs
Nested Hoare Triples and Frame Rules for Higher-Order Store
32nd EACSL Annual Conference on Computer Science Logic, CSL 2024, Naples, Italy, February 19-23, 2024
First-Order Spectra with One Binary Predicate
Variants of Collapsible Pushdown Systems
Deciding the Path- and Word-Fair Equivalence Problem
On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT
Spatial Existential Positive Logics for Hyperedge Replacement Grammars
Quantitative Foundations for Resource Theories
The geometry of synchronization
A Many-Sorted Epistemic Logic for Chromatic Hypergraphs
The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL
Promise and Infinite-Domain Constraint Satisfaction
Quantifiying the Robustness of Dynamical Systems. Relating Time and Space to Length and Precision
A Self-Interpreter of Lambda Calculus Having a Normal Form
On Relativisation and Complexity Gap
Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space
On Rational Trees
30th EACSL Annual Conference on Computer Science Logic, CSL 2022, Göttingen, Germany (Virtual Conference), February 14-19, 2022
Effectively Given Information Systems and Domains
The Focused Calculus of Structures
Optimal Strategies in Concurrent Reachability Games
Trade-off analysis meets probabilistic model checking
Denotational Versus Declarative Semantics for Functional Programming
Infinite Domain Constraint Satisfaction Problem
On the Variable Hierarchy of the Modal µ-Calculus
29th EACSL Annual Conference on Computer Science Logic, CSL 2021, Ljubljana, Slovenia (Virtual Conference), January 25-28, 2021
On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and Smale
Characteristic Properties of Majorant-Computability over the Reals
On the Complexity of Branching-Time Logics
On the Complexity of Existential Pebble Games
Resolution Games and Non-Liftable Resolution Orderings
Relational Semantics of Linear Logic and Higher-order Model Checking
Semiring Provenance for Fixed-Point Logic
A Mixed Linear and Non-Linear Logic: Proofs, Terms and Models (Extended Abstract)
Program Verification Using Dynamic Logic
Predicate Inequalities as a Basis for Automated Termination Proofs for Prolog Programs
Optimization Problems: Expressibility, Approximation Properties and Expected Asymptotic Growth of Optimal Solutions
Basic Operational Preorders for Algebraic Effects in General, and for Combined Probability and Nondeterminism in Particular
Plausibility Logic
CALF: Categorical Automata Learning Framework
Trees in Trees: Is the Incomplete Information about a Tree Consistent?
L-Recursion and a new Logic for Logarithmic Space
Goal-Directed Methods for Lukasiewicz Logic
Open Higher-Order Logic
Logics for Belief Dependence
Context-Free Graph Properties via Definable Decompositions
Delete Operations and Horn Formulas
Four-Valued Diagnoses for Stratified Knowledge-Bases
XML Navigation and Tarski's Relation Algebras
Logical Refinements of Church's Problem
Analysis of Hybrid Systems: An Ounce of Realism Can Save an Infinity of States
On the Existence of Fixpoints in Moore's Autoepistemic Logic and the Non-Monotonic Logic of McDermott and Doyle
Incorporating Tables into Proofs
Front Matter, Table of Contents, Preface, Conference Organisation, External Reviewers
Categorical Structures for Type Theory in Univalent Foundations
Logic of Approximation Reasoning
Hoare Logics for Recursive Procedures and Unbounded Nondeterminism
Elementary Choiceless Constructive Analysis
Equality and fixpoints in the calculus of structures
Equational Axioms of Test Algebra
Simple Types for Probabilistic Termination
A Tag-Frame System of Resource Management for Proof Search in Linear-Logic Programming
A Concurrent Logical Relation
Tree-Width for First Order Formulae
Propositional Provability and Models of Weak Arithmetic
Coq Modulo Theory
An Algebraic Decision Procedure for Two-Variable Logic with a Between Relation
On the Relations between the Syntactic Theories of lambda-mu-Calculi
A Decidable Fragment of Second Order Logic With Applications to Synthesis
Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata
On Logical Descriptions of Some Concepts in Structural Complexity Theory
First-Order Interpolation and Grey Areas of Proofs (Invited Talk)
Interval Temporal Logic and Star-Free Expressions
Domain Theory in Constructive and Predicative Univalent Foundations
A domain-theoretic approach to Brownian motion and general continuous stochastic processes
Weak Semantics Based on Lighted Button Pressing Experiments
A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms
On Homogeneous Models of Fluted Languages
Cyclic Proofs for Transfinite Expressions
Extraction of Proofs from the Clausal Normal Form Transformation
Boundedness of Cost Register Automata over the Integer Min-Plus Semiring
Graded Computation Tree Logic with Binary Coding
Many-Valued First-Order Logics with Probabilistic Semantics
Automated Synthesis: Going Distributed
Honest Polynomial-Time Degrees of Elementary Recursive Sets
A Homomorphism Concepts for omega-Regularity
The Decidability of Model Checking Mobile Ambients
Towards Machine-Checked Compiler Correctness for Higher-order Pure Functional Languages
Polishness of Some Topologies Related to Automata
Cut Free Formalization of Logic with Finitely Many Variables. Part I
Explorable Automata
A quest for algorithmically random infinite structures
A Counting Logic for Structure Transition Systems
The Logic of Contextuality
Fully Complete Minimal PER Models for the Simply Typed lambda-Calculus
Validity of CTL Queries Revisited
Reducibility of Monotone Formulas to µ-Formulas
Using Finite-Linear Temporal Logic for Specifying Database Dynamics
Proofs, Programs and Abstract Complexity
An Indexed System for Multiplicative Additive Polarized Linear Logic
Connection Matrices and the Definability of Graph Parameters
Symmetric normalisation for intuitionistic logic
Towards a Canonical Classical Natural Deduction System
A Natural Intuitionistic Modal Logic: Axiomatization and Bi-Nested Calculus
The Ackermann Award 2024
A Fixed-Point Logic with Symmetric Choice
An Intuitionistic Modal Logic with Applications to the Formal Verification of Hardware
Preservation and decomposition theorems for bounded degree structures
Infinite-state energy games
Analytic Calculi for Non-Classical Logics: Theory and Applications
Realizability Without Symmetry
An Extension of Models of Axiomatic Domain Theory to Models of Synthetic Domain Theory
A Model Checking Procedure for Interval Temporal Logics based on Track Representatives
Local Reasoning about Programs that Alter Data Structures
Tower-Complete Problems in Contraction-Free Substructural Logics
Parity Games of Bounded Tree-Depth
Designs, Disputes and Strategies
Safe Proof Checking in Type Theory with Y
Transfinite Extension of the Mu-Calculus
Classical Linear Logic of Implications
On the Complexity of H-Subsumption
Expressive completeness of separation logic with two variables and no separating conjunction
Relating Two Semantics of Locally Scoped Names
Minimizing Regret in Discounted-Sum Games
Anti-Unification of Unordered Goals
Axiomatizing Propositional Dependence Logics
A Logic for Probabilities in Semantics
Continuous Previsions
Minimal from Classical Proofs
Acyclicity and Coherence in Multiplicative Exponential Linear Logic
Process Algebra with Combinators
On the Almighty Wand
Concurrent Construction of Proof-Nets
Stratified Context Unification Is in PSPACE
Classical Linear Logic in Perfect Banach Lattices
A Decidable Quantified Fragment of Set Theory Involving Ordered Pairs with Applications to Description Logics
Bounded Satisfiability for PCTL
Linear Realisability over Nets: Multiplicatives
Configuration Theories
On the pigeonhole and related principles in deep inference and monotone systems
Structures for Multiplicative Cyclic Linear Logic: Deepness vs Cyclicity
Internalizing Relational Parametricity in the Extensional Calculus of Constructions
Definable Inapproximability: New Challenges for Duplicator
Degrees of Security: Protocol Guarantees in the Face of Compromising Adversaries
Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Dyadic Fragments of Quantum Computation
Separating Functional Computation from Relations
The Consistency Dimension, Compactness, and Query Learning
A Fragment of First Order Logic Adequate for Observation Equivalence
Revisiting Parameter Synthesis for One-Counter Automata
Bounds for the quantifier depth in finite-variable logics: Alternation hierarchy
A Kleene Algebra with Tests for Union Bound Reasoning About Probabilistic Programs
Proving Termination for Term Rewriting Systems
Extensional Uniformity for Boolean Circuits
Parametricity in an Impredicative Sort
Reachability Analysis of First-order Definable Pushdown Systems
Asymptotic behaviour in temporal logic
Dynamic Complexity of Parity Exists Queries
Are Two Binary Operators Necessary to Finitely Axiomatise Parallel Composition?
A Mixed Linear and Graded Logic: Proofs, Terms, and Models
Transition systems over games
Short Proofs of Tautologies Using the Schema of Equivalence
The Logic of Explicitly Presentation-Invariant Circuits
A Survey of Rewrite Systems
Quantum and Classical Markovian Graphical Causal Models and Their Identification
Applications of Alfred Tarski's Ideas in Database Theory
An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces
On the Subject Reduction Property for Algebraic Type Systems
Infinitary Proof Theory: the Multiplicative Additive Case
Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence
A Logic for Approximate First-Order Reasoning
Discounted-Sum Automata with Multiple Discount Factors
Integration of Descriptive and Procedural Language Constructs
A Complete Graphical Language for Linear Optical Circuits with Finite-Photon-Number Sources and Detectors
Quantifier Elimination in Fuzzy Logic
Logical Semantics of Modularisation
Proving Abstract Non-interference
On the Power of Quantifers in First-Order Algebraic Specification
Extracting Herbrand trees in classical realizability using forcing
The Keys to Decidable HyperLTL Satisfiability: Small Models or Very Simple Formulas
Equational Specification of Abstract Types and Combinators
Translating Proofs from an Impredicative Type System to a Predicative One
The Semantics of the C Programming Language
A Negative Conjunctive Query is Easy if and only if it is Beta-Acyclic
KAT + B!
Stratified Default Theories
The Relational Model Is Injective for Multiplicative Exponential Linear Logic
Computer Science Logic, 8th International Workshop, CSL '94, Kazimierz, Poland, September 25-30, 1994, Selected Papers
Static Analysis for Logic-based Dynamic Programs
A Decidable Spatial Logic with Cone-Shaped Cardinal Directions
Feasible Proofs of Matrix Properties with Csanky's Algorithm
Semantics of Intensional Type Theory extended with Decidable Equational Theories
What Monads Can and Cannot Do with a Bit of Extra Time
Closure Properties of Weak Systems of Bounded Arithmetic
Validity and Entailment in Modal and Propositional Dependence Logics
Algorithmic Aspects of Propositional Tense Logics
L-Nets, Strategies and Proof-Nets
The Logic of the Partial lambda-Calculus with Equality
Satisfiability modulo counting: a new approach for analyzing privacy properties
Symmetry in concurrent games
Towards CERes in intuitionistic logic
A Note on the Relation Between Polynomial Time Functionals and Constable's Class K
Bad Variables Under Control
High-Quality Synthesis Against Stochastic Environments
A Strongly Normalising Curry-Howard Correspondence for IZF Set Theory
MSO queries on trees: enumerating answers under updates
Automatic Equivalence Structures of Polynomial Growth
Abstracting Allocation
Rewriting with Extensional Polymorphic Lambda-Calculus
Succinct Graph Representations of μ-Calculus Formulas
Church's Thesis and Related Axioms in Coq's Type Theory
A Quasi-Polynomial Black-Box Algorithm for Fixed Point Evaluation
A Logical Operational Semantics of Full Prolog. Part I: Selection Core and Control
Nash Equilibrium for Upward-Closed Objectives
Annotation-Free Sequent Calculi for Full Intuitionistic Linear Logic
A P-Time Completeness Proof for Light Logics
The Church Synthesis Problem with Metric
Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs
Computer Science Logic 2013, CSL 2013, Torino, Italy, September 2-5, 2013
Semantic Bounds and Multi Types, Revisited
Contextuality, Cohomology and Paradox
Lambda Representation of Operations Between Fifferent Term Algebras
On the Relation between Sized-Types Based Termination and Semantic Labelling
Proofs and Refutations for Intuitionistic and Second-Order Logic
CSL '89, 3rd Workshop on Computer Science Logic, Kaiserslautern, Germany, October 2-6, 1989, Proceedings
The Railroad Crossing Problem: An Experiment with Instantaneous Actions and Immediate Reactions
Social Confluence in Client-Server Systems
Logical Relations and Data Abstraction
A Type-Free Resource-Aware Lambda-Calculus
A Definability Dichotomy for Finite Valued CSPs
Henkin Models of the Partial sigma-Calculus
Logic Programming and Co-inductive Definitions
Church Synthesis Problem with Parameters
Correspondences Between Codensity and Coupling-Based Liftings, a Practical Approach
Set-Theoretic Reductions of Hilbert's Tenth Problem
Tightening the Exchange Rates Between Automata
Log-Approximable Minimization Problems on Random Inputs
Degree Spectra, and Relative Acceptability of Notations
Enumeration Complexity of Logical Query Problems with Second-order Variables
Equivalence and Isomorphism for Boolean Constraint Satisfaction
New Ways for Developing Proof Theories for First-Order Multi Modal Logics
Internal Parametricity for Cubical Type Theory
An Abstract Look at Realizability
Some Aspects of the Probabilistic Behavior of Variants of Resolution
Evaluation Trade-Offs for Acyclic Conjunctive Queries
Taylor Expansion, lambda-Reduction and Normalization
A Universal Innocent Game Model for the Böhm Tree Lambda Theory
The Model-Theoretic Expressiveness of Propositional Proof Systems
On the succinctness of query rewriting over shallow ontologies
A Fixpoint Theory for Non-monotonic Parallelism
Revisiting the Duality of Computation: An Algebraic Analysis of Classical Realizability Models
Greibach Normal Form in Algebraically Complete Semirings
Transfinite Update Procedures for Predicative Systems of Analysis
Models of Lambda-Calculus and the Weak MSO Logic
Abductive, Inductive and Deductive Reasoning about Resources
MacNeille Completion and Buchholz' Omega Rule for Parameter-Free Second Order Logics
On Cartesian Monoids
Cuting Plane Versus Frege Proof Systems
Coprimality in Finite Models
The Yoneda Reduction of Polymorphic Types
Kleene's Slash and Existence of Values of Open Terms in Type Theory
Monadic Second Order Logic, Tree Automata and Forbidden Minors
Logical Relations and Inductive/Coinductive Types
Decidable Theories of the Ordering of Natural Numbers with Unary Predicates
Normalization of Typable Terms by Superdevelopments
Quantified Positive Temporal Constraints
Diagrammatic Semantics for Digital Circuits
An Algebraic View of Structural Induction
Propositional Logics of Overwhelming Truth
Decidability for Sturmian Words
The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness
Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars
Loop Detection in Propositional Prolog Programs
Open Proofs and Open Terms: A Basis for Interactive Logic
Senescent ground tree rewrite systems
Inflationary Fixed Points in Modal Logic
Concurrent Constraint Programming and Non-commutative Logic
33rd EACSL Annual Conference on Computer Science Logic, CSL 2025, Amsterdam, The Netherlands, February 10-14, 2025
Team building in dependence
General Form Recursive Equations I
A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem
Model Theory of Deductive Databases
Winning Strategies and Synthesis of Controllers (Tutorial)
Deadlock and lock freedom in the linear π-calculus
The Ackermann Award 2015
Representing Unification in a Logical Framework
Loose Diagrams, Semigroupoids, Categories, Groupoids and Iteration
Non-elementary complexities for branching VASS, MELL, and extensions
Characterizing Complexity Classes by General Recursive Definitions in Higher Types
Completeness of First-Order Bi-Intuitionistic Logic
A Generic Strong Normalization Argument: Application to the Calculus of Constructions
Bounded Model Checking of Pointer Programs
Ordinal Processes in Comparative Concurrency Semantics
Cartesian Cubical Computational Type Theory: Constructive Reasoning with Paths and Equalities
Approximable Minimization Problems and Optimal Solutions on Random Inputs
Computer Science Logic, 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL, Edinburgh, Scotland, UK, September 22-25, 2002, Proceedings
Classical Program Extraction in the Calculus of Constructions
Modal Logic and Distributed Message Passing Automata
Interactive Proof Systems: Provers, Rounds, and Error Bounds
Free-Cut Elimination in Linear Logic and an Application to a Feasible Arithmetic
Automata on Lempel-ziv Compressed Strings
µ-Calculus via Games
Eta-Expansions in F omega
Normalization for Typed Lambda Calculi with Explicit Substitution
Branching in Well-Structured Transition Systems (Invited Talk)
Computer Science Logic, 10th International Workshop, CSL '96, Annual Conference of the EACSL, Utrecht, The Netherlands, September 21-27, 1996, Selected Papers
A Lattice-Theoretical View of Strategy Iteration
On Algebraic Specifications of Abstract Data Types
On the Reduction Theory for Average Case Complexity
A Resolution Mechanism for Prenex Gödel Logic
Between Deterministic and Nondeterministic Quantitative Automata (Invited Talk)
Molecules as Automata
Noetherian Quasi-Polish spaces
Descriptive and Parameterized Complexity
leanEA: A Lean Evolving Algebra Compiler
Inductive Definability with Counting on Finite Structures
Linear Lambda-Calculus and Categorial Models Revisited
The Complexity of Second-Order HyperLTL
Interactive Realizability for Classical Peano Arithmetic with Skolem Axioms
Synthesizing Reactive Programs
Pattern logics and auxiliary relations
Descriptive complexity for pictures languages
A Theory of Explicit Mathematics Equivalent to ID 1
Applications of Craig Interpolation to Model Checking
Thinking Algorithmically About Impossibility (Invited Talk)
On the Parallel Complexity of Bisimulation on Finite Systems
An Algebraic Approach for the Unsatisfiability of Nonlinear Constraints
Pregrammars and Intersection Types
A Calculus of Realizers for EM1 Arithmetic (Extended Abstract)
Decidability of Higher-Order Subtyping with Intersection Types
Relating Structure and Power: Comonadic Semantics for Computational Resources
QLTL Model-Checking
31st EACSL Annual Conference on Computer Science Logic, CSL 2023, Warsaw, Poland, February 13-16, 2023
The Parameterized Complexity of Learning Monadic Second-Order Logic
A Semantic Formulation of TT-Lifting and Logical Predicates for Computational Metalanguage
Approximating Probabilistic Automata by Regular Languages
Comparative Transition System Semantics
Sharing Distributed Knowledge on the Web (Invited Talk)
Confluence of Conditional Rewriting Modulo
String Diagrams for Non-Strict Monoidal Categories
Upper Bounds on Stream I/O Using Semantic Interpretations
Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time
Notions of Average-Case Complexity for Random 3-SAT