yusuke1997/dblp-id-title huggingface dataset:
Descriptive Complexity Theory for Constraint Databases
Temporal Logics with Local Constraints (Invited Talk)
Compositional higher-order model checking via ω -regular games over Böhm trees
Precise Relational Invariants Through Strategy Iteration
Constructive and Synthetic Reducibility Degrees: Post's Problem for Many-One and Truth-Table Reducibility in Coq
Pfaffian Hybrid Systems
Some Extensions to Propositional Mean-Value Caculus: Expressiveness and Decidability
Decision Procedures Using Model Building Techniques
Non-Definability Results for Randomised First-Order Logic
Integral Categories and Calculus Categories
Generalized Implicit Definitions on Finite Structures
The Fixed-Parameter Tractability of Model Checking Concurrent Systems
Finite Models and Full Completeness
Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings
Strategies with Parallel Causes
Computer Science Logic, 15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001, Proceedings
Collapsing non-idempotent intersection types
Coinduction up-to in a fibrational setting
Step-Indexed Relational Reasoning for Countable Nondeterminism
On the Word Problem for SP{Sigma Pi}-Categories, and the Properties of Two-Way Communication
Optimal Complexity Bounds for Positive LTL Games
Definability of linear equation systems over groups and rings
Syntactic Metatheory of Higher-Order Subtyping
The Call-By-Value Lambda-Calculus with Generalized Applications
Integrating Linear Arithmetic into Superposition Calculus
Expanding the Realm of Systematic Proof Theory
Typed Normal Form Bisimulation
Numberings of R 1 union F
On Free Completely Iterative Algebras
On Bunched Polymorphism
A Cut-Free and Invariant-Free Sequent Calculus for PLTL
On the Minimisation of Transition-Based Rabin Automata and the Chromatic Memory Requirements of Muller Conditions
Synthetic Integral Cohomology in Cubical Agda
The Alternating-Time μ-Calculus with Disjunctive Explicit Strategies
Abstract interpretation from Büchi automata
On the First-Order Complexity of Induced Subgraph Isomorphism
The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic
Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic
MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
On the Tracking of Loops in Automated Deductions
Reductions in Higher-Order Rewriting and Their Equivalence
Stable Logic
First-Order Logic with Equicardinality in Random Graphs
The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem
The Prophecy of Timely Rollback (Invited Talk)
On the Modal Logic K Plus Theories
The Expressive Power of Horn Monadic Linear Logic
A Games Model of Bunched Implications
ML with PTIME complexity guarantees
De Jongh's Theorem for Intuitionistic Zermelo-Fraenkel Set Theory
Unbounded Proof-Length Speed-Up in Deduction Modulo
Elementary Elimination of Prenex Cuts in Disjunction-free Intuitionistic Logic
Intuitionistic LTL and a New Characterization of Safety and Liveness
Rich omega-Words and Monadic Second-Order Arithmetic
The Ackermann Award 2023
Classical and Intuitionistic Arithmetic with Higher Order Comprehension Coincide on Inductive Well-Foundedness
On the Computational Complexity of Quantified Horn Clauses
Clique-Width and Parity Games
Nonmonotonic Logics and Their Algebraic Foundations
Automata and Logics for Words and Trees over an Infinite Alphabet
Identifying Polynomial-Time Recursive Functions
Computer Science Logic, 12th International Workshop, CSL '98, Annual Conference of the EACSL, Brno, Czech Republic, August 24-28, 1998, Proceedings
The Model Theory of Concurrency
The Surprising Power of Restricted Programs and Gödel's Functionals
Effective Model Completeness of the Theory of Restricted Pfaffian Functions (Invited Lecture)
Open Least Element Principle and Bounded Query Computation
Monotone Inductive and Coinductive Constructors of Rank 2
Communicating Evolving Algebras
Jump from Parallel to Sequential Proofs: Multiplicatives
Two-Restricted One Context Unification is in Polynomial Time
Abstract Interpretation of Proofs: Classical Propositional Calculus
Coalgebraic Learning
Expansions and Models of Autoepistemic Theories
Decision Problems for Tarski and Presburger Arithmetics Extended With Sets
Sub-classical Boolean Bunched Logics and the Meaning of Par
A Van Benthem Theorem for Modal Team Semantics
Artificial Intelligence and Artificial Ignorance (Invited Talk)
A Logical Aspect of Parametric Polymorphism
Algebraic Characterization of FO for Scattered Linear Orderings
Separation and Renaming in Nominal Sets
The Ackermann Award 2012
On Acyclic Conjunctive Queries and Constant Delay Enumeration
Verification of Infinite State Systems (Tutorial)
Local Operators in Topos Theory and Separation of Semi-Classical Axioms in Intuitionistic Arithmetic
Interactive Programs in Dependent Type Theory
A Syntactical Approach to Weak omega-Groupoids
A Complete Axiomatisation of a Fragment of Language Algebra
Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs
Fast(er) Reasoning in Interval Temporal Logic
Background, Reserve, and Gandy Machines
Une tentative malheureuse do construire une structure éliminant rapidement les quanteurs
Uniform One-Dimensional Fragments with One Equivalence Relation
Signature Extensions Preserve Termination - An Alternative Proof via Dependency Pairs
Note on Formal Analogical Reasoning in the Juridical Context
The Expressive Power of Transitive Closue and 2-way Multihead Automata
Bar Recursion in Classical Realisability: Dependent Choice and Continuum Hypothesis
Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic
Improved Set-Based Symbolic Algorithms for Parity Games
Infinite-state games with finitary conditions
Graph logics with rational relations: the role of word combinatorics
EXPTIME Tableaux for the Coalgebraic µ -Calculus
Atomic Cut Elimination for classical Logic
Guarded Teams: The Horizontally Guarded Case
Computational Complexity of the Weisfeiler-Leman Dimension
MSO on the Infinite Binary Tree: Choice and Order
Quantitative Game Semantics for Linear Logic
When is Metric Temporal Logic Expressively Complete?
A New Approach to Abstract Data Types II: Computation on ADTs as Ordinary Computation
The Monadic Quantifier Alternation Hierarchy over Grids and Pictures
Randomness and Turing Reducibility Restraints
Quine's Fluted Fragment is Non-Elementary
Resolution Refutations and Propositional Proofs with Height-Restrictions
Travelling on Designs
A Proof System for Finite Trees
Disjunctive Tautologies as Synchronisation Schemes
On Duality for the Modal µ-Calculus
Equivalences among Various Logical Frameworks of Partial Algebras
On Classical PCF, Linear Logic and the MIX Rule
Reachability for Multi-Priced Timed Automata with Positive and Negative Rates
Choice Construct and Lindström Logics
Belnap, Urquhart and Relevant Decidability & Complexity. "Das ist nicht Mathematik, das ist Theologie."
Trakhtenbrot Theorem and Fuzzy Logic
Memoryful geometry of interaction: from coalgebraic components to algebraic effects
Interactive Theorem Proving Using Type Theory
On Guarding Nested Fixpoints
Infinite State Model-Checking of Propositional Dynamic Logics
A Concurrent Branching Time Temporal Logic
Nominal Domain Theory for Concurrency
A Cyclic Proof System for Full Computation Tree Logic
Local Validity for Circular Proofs in Linear Logic with Fixed Points
Is Average Superlinear Speedup Possible?
Axioms for Delimited Continuations in the CPS Hierarchy
Some Results on a Game-Semantic Approach to Verifying Finitely-Presentable Infinite Structures (Extended Abstract)
Tangent Categories from the Coalgebras of Differential Categories
Full Completeness: Interactive and Geometric Characterizations of the Space of Proofs (Abstract)
Continuous Functionals of Dependent Types and Equilogical Spaces
Deciding the weak definability of Büchi definable tree languages
Typable Fragments of Polynomial Automatic Amortized Resource Analysis
Comparing the Succinctness of Monadic Query Languages over Finite Trees
A Partial Metric Semantics of Higher-Order Types and Approximate Program Transformations
Logical characterization of weighted pebble walking automata
Two-variable Logic with Counting and a Linear Order
Understanding biology through logic
On Asymptotic Probabilities of Monadic Second Order Properties
Strong Bisimulation for Control Operators (Invited Talk)
Non-Uniform Complexity via Non-Wellfounded Proofs
Logical Relations for Monadic Types
Ehrenfeucht-Fraïssé Games in Semiring Semantics
Non-Commutative Infinitary Peano Arithmetic
The Ackermann Award 2010
Functional Interpretations of Intuitionistic Linear Logic
Rule Algebras for Adhesive Categories
Adding Transitivity and Counting to the Fluted Fragment
Remarks on Parikh-Recognizable Omega-languages
Computer Science Logic, 23rd international Workshop, CSL 2009, 18th Annual Conference of the EACSL, Coimbra, Portugal, September 7-11, 2009. Proceedings
Polymorphic Recursion and Semi-Unification
Set Constraints on Regular Terms
A Propositional Proof System for Log Space
Decision Problems for Nash Equilibria in Stochastic Games
Expressivity Landscape for Logics with Probabilistic Interventionist Counterfactuals
On the Reasons for Average Superlinear Speedup in Parallel Backtrack Search
Semantics for "Enough-Certainty" and Fitting's Embedding of Classical Logic in S4
A Streamlined Temporal Completeness Theorem
From Feasible Proofs to Feasible Computations
A temporal Logic Approach to Specify and to Prove Properties of Finite State Concurrent Systems
MonadicNLIN and Quantifier-Free Reductions
Universality Results for Models in Locally Boolean Domains
Reasoning with Higher Order Partial Functions
Solving Pushdown Games with a Sigma 3 Winning Condition
The Directed Homotopy Hypothesis
Modal Logics Preserving Admissible for S4 Inference Rules
First-Order Logic with Connectivity Operators
Counting and Matching
Dependence Logic vs. Constraint Satisfaction
Classical and Intuitionistic Logic Are Asymptotically Identical
On the Complexity of Reasoning About Dynamic Policies
Efficiency Considerations on Goal-Directed Chaining for Logic Programs
The Functional Machine Calculus II: Semantics
Extracting Non-Deterministic Concurrent Programs
On Transitive Closure Logic
Counting in Team Semantics
Algebraic Operational Semantics and Modula-2
Existence of Reduction Hierarchies
Translating Theory into Practice - Abstract State Machines within Microsoft
Confluence of Pure Differential Nets with Promotion
Simple Parsimonious Types and Logarithmic Space
Solving 3-Satisfiability in Less Then 1, 579 n Steps
A Complete Characterization of Observational Equivalence in Polymorphic lambda -Calculus with General References
Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains
A Sequent Calculus with Implicit Term Representation
The Matrix Ring of a μ-Continuous Chomsky Algebra is mu-Continuous
Weak Bisimulation Approximants
Normal Forms in Infinite-Valued Logic: The Case of One Variable
On the Complexity of the Decision Problem in Propositional Nonmonotonic Logic
On the computing power of +, -, and ×
Strongly Normalizing Audited Computation
On the Average Case Complexity of Backtracking for the Exact-Satisfiability Problem
A Systematic Approach to Canonicity in the Classical Sequent Calculus
Taking Bi-Intuitionistic Logic First-Order: A Proof-Theoretic Investigation via Polytree Sequents
Substitution, jumps, and algebraic effects
Results on the Guarded Fragment with Equivalence or Transitive Relations
Stone Duality and the Substitution Principle
Dynamic Complexity of Regular Languages: Big Changes, Small Work
Subclasses of presburger arithmetic and the weak EXP hierarchy
Computer Science Logic, 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings
Environment and Classical Channels in Categorical Quantum Mechanics
Craig Interpolation for Linear Temporal Languages
Diagonalizing over Deterministic Polynomial Time
Quantified Differential Dynamic Logic for Distributed Hybrid Systems
Degrees of Lookahead in Context-free Infinite Games
A Semantic Approach to Illative Combinatory Logic
Forest Expressions
Infinite and Bi-infinite Words with Decidable Monadic Theories
The Descriptive Comlexity of the Fixed-Points of Bounded Formulas
An Algebraic Approach to Valued Constraint Satisfaction
On Type Inference for Object-Oriented Programming Languages
Semi-continuous Sized Types and Termination
Hierarchies in independence logic
Confluence of Layered Rewrite Systems
The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case
Complexity of Polyadic Boolean Modal Logics: Model Checking and Satisfiability
RAM with Compact Memory: A Realistic and Robust Model of Computation
Extending Homotopy Type Theory with Strict Equality
Categorifying Non-Idempotent Intersection Types
Beyond Admissibility: Dominance Between Chains of Strategies
Dynamic Complexity Meets Parameterised Algorithms
On Unambiguous Regular Tree Languages of Index (0, 2)
The Girard Translation Extended with Recursion
Constraint Solving for Program Verification: Theory and Practice by Example
Game Quantification on Automatic Structures and Hierarchical Model Checking Games
Active Learning of Deterministic Transducers with Outputs in Arbitrary Monoids
Cardinality Quantifiers in MLO over Trees
Decidable Logics with Associative Binary Modalities
Is SETL a Suitable Language for Parallel Programming - A Theoretical Approach
Two-Variable Universal Logic with Transitive Closure
A Subtyping for the Fisher-Honsell-Mitchell Lambda Calculus of Objects
What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead
On dialogue games and coherent strategies
A Coalgebraic Decision Procedure for WS1S
Quantum Circuit Completeness: Extensions and Simplifications
Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraïssé Games
Computer Science Logic, 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008. Proceedings
Climbing up the Elementary Complexity Classes with Theories of Automatic Structures
On the Complexity of SPEs in Parity Games
Quantitative Temporal Logic
Computer Science Logic, 11th International Workshop, CSL '97, Annual Conference of the EACSL, Aarhus, Denmark, August 23-29, 1997, Selected Papers
Nominal Unificaiton
On the Union Closed Fragment of Existential Second-Order Logic and Logics with Team Semantics
Infinite sequential games with real-valued payoffs
Lambda Theories of Effective Lambda Models
Expressive Logics for Coinductive Predicates
Goal-Directed Calculli for Gödel-Dummett Logics
Definability over Linear Constraints
Extending Two-Variable Logic on Trees
Friends or Foes? Communities in Software Verification (Invited Lecture)
Elimination of Negation in a Logical Framework
Quantifying Bounds in Strategy Logic
Global semantic typing for inductive and coinductive computing
Correctness Proof For the WAM with Types
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics
Decidability of weak logics with deterministic transitive closure
A Fully Abstract Game Semantics for Parallelism with Non-Blocking Synchronization on Shared Variables
Hennessy-Milner Theorems via Galois Connections
Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent
26th EACSL Annual Conference on Computer Science Logic, CSL 2017, Stockholm, Sweden, August 20-24, 2017
A Formalisation of the Normal Forms of Context-Free Grammars in HOL4
On the Hoare theory of monadic recursion schemes
Asymptotic Rewriting (Invited Talk)
Verifying Liveness by Augmented Abstraction
Usability: Formalising (Un)definedness in Typed Lambda Calculus
The Ackermann Award 2006
Realizability and Strong Normalization for a Curry-Howard Interpretation of HA + EM1
The Ackermann Award 2018
Separation Logic for Higher-Order Store
Guarded Hybrid Team Logics
Borel Sets in Reverse Mathematics (Invited Talk)
On the Building of Affine Retractions
Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
Achieving new upper bounds for the hypergraph duality problem through logic
Computational Mathematics, Computational Logic, and Symbolic Computation (Invited Lecture)
Computational Aspects of Arity Hierarchies
Finite Relational Semantics for Language Kleene Algebra with Complement
Synthesis from Probabilistic Components
Tableau Calculi for CSL \mathcal{CSL} over minspaces
Safe Queries in Relational Databases with Functions
An Interpreter with Lazy Evaluation for Prolog with Functions
Solving Games Without Determinization
A Universal Turing Machine
Measure-Theoretic Semantics for Quantitative Parity Automata
Focalisation and Classical Realisability
Relative Undecidability in Term Rewriting
A Primitive Recursive Set Theory and AFA: On the Logical Complexity of the Largest Bisimulation
Logic Programming in Tau Categories
Boolean Complexity of Algebraic Interpolation Problems
Ramsey's Theorem in Bounded Arithmetic
Coordination Logic
Coverage and Vacuity in Network Formation Games
Revision Programming = Logic Programming + Integrity Constraints
Oracles and Quantifiers
Constructive Many-One Reduction from the Halting Problem to Semi-Unification
First-Order Queries over One Unary Function
Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories
Factorize Factorization
Commutative Data Automata
Nontrivial Lower Bounds for some NP-Problems on Directed Graphs
Padding and the Expressive Power of Existential Second-Order Logics
Axiomatizations for Propositional and Modal Team Logic
A new correctness criterion for MLL proof nets
On the Existence of Fair Schedulers
The Seifert-van Kampen Theorem in Homotopy Type Theory
A functional functional interpretation
CSL '88, 2nd Workshop on Computer Science Logic, Duisburg, Germany, October 3-7, 1988, Proceedings
MSO Undecidability for Hereditary Classes of Unbounded Clique Width
Choiceless Polynominal Time Logic: Inability to Express
Strongly Unambiguous Büchi Automata Are Polynomially Predictable With Membership Queries
On the Automatizability of Resolution and Related Propositional Proof Systems
Concurrent Stochastic Lossy Channel Games
Three lightings of logic (Invited Talk)
The Power of Linear Functions
The Kleene-Post and Post's Theorem in the Calculus of Inductive Constructions
State Space Reduction For Parity Automata
Complexity Results for Modal Dependence Logic
Convergence and 0-1 Laws for L_inf, omega^k under Arbitrary Measures
Moving in a Crumbling Network: The Balanced Case
The Epsilon Calculus (Tutorial)
Implicit Computational Complexity for Higher Type Functionals
Flatness Is Not a Weakness
System F with coercion constraints
On the Computational Complexity of Type 2 Functionals
A Lambda-Calculus Structure Isomorphic to Gentzen-Style Sequent Calculus Structure
An Existential Locality Theorem
Two-Way One-Counter Nets Revisited
Integrating Equational Reasoning into Instantiation-Based Theorem Proving
Two-way cost automata and cost logics over infinite trees
Schema Revisited
Monadic NP and Graph Minors
Capturing Logarithmic Space and Polynomial Time on Chordal Claw-Free Graphs
A Soft Type Assignment System for lambda -Calculus
A Quantifier-Free Completion of Logic Programs
Probably safe or live
A Theory of Classes for a Functional Language with Effects
Choiceless Computation and Symmetry: Limitations of Definability
A Logic for Abstract State Machines
Global Winning Conditions in Synthesis of Distributed Systems with Causal Memory
Modal Logic and the Two-Variable Fragment
Logical Algorithmics: From Theory to Practice (Invited Talk)
Limiting Partial Combinatory Algebras towards Infinitary Lambda-Calculi and Classical Logic
Safety, Absoluteness, and Computability
Efficient Type-Checking for Amortised Heap-Space Analysis
Locus Solum: From the Rules of Logic to the Logic of Rules
Monadic Logical Definability of NP-Complete Problems
Generalizing Allowedness While Retaining Completeness of SLDNF-Resolution
A Logic of Sequentiality
Quantitative Graded Semantics and Spectra of Behavioural Metrics
A Transformational Methodology for Proving Termination of Logic Programs
On the Probabilistic and Statistical Verification of Infinite Markov Chains (Invited Talk)
Reasoning and Rewriting with Set-Relations I: Ground Completeness
Intuitionistic Gödel-Löb Logic, à la Simpson: Labelled Systems and Birelational Semantics
On the Verification of Modules
Confluence of Shallow Right-Linear Rewrite Systems
Satisfiability: where Theory meets Practice (Invited Talk)
Algebraic Operational Semantics and Occam
The Power of the Filtration Technique for Modal Logics with Team Semantics
A Characterisation of Lambda Definability with Sums Via TT-Closure Operators
Sequents, Frames, and Completeness
Fixpoint Alternation and the Game Quantifier
Fixed Points of Type Constructors and Primitive Recursion
Characterization of Logics over Ranked Tree Languages
Kleene Algebra with Commutativity Conditions Is Undecidable
Automatic Structures of Bounded Degree Revisited
On Model Checking Boolean BI
Decidability Issues for Two-Variable Logics with Several Linear Orders
The Symbolic Approach to Repeated Games (Abstract)
24th EACSL Annual Conference on Computer Science Logic, CSL 2015, Berlin, Germany, September 7-10, 2015
Model-Checking First-Order Logic: Automata and Locality
Hyper-Ackermannian bounds for pushdown vector addition systems
On the VC Dimension of First-Order Logic with Counting and Weight Aggregation
Filter Models: Non-idempotent Intersection Types, Orthogonality and Polymorphism
Herbrand-Confluence for Cut Elimination in Classical First Order Logic
Higher-Order Positive Set Constraints
From Action Calculi to Linear Logic
Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability
A type theory for productive coprogramming via guarded recursion
A Pumping Lemma for Collapsible Pushdown Graphs of Level 2
Algorithmic Analysis of Array-Accessing Programs
A Fully Complete PER Model for ML Polymorphic Types
A Horn Clause that Implies and Undecidable Set of Horn Clauses
Recursive Inseparability in Linear Logic
The FO2 alternation hierarchy is decidable
Computer Science Logic, 17th International Workshop, CSL 2003, 12th Annual Conference of the EACSL, and 8th Kurt Gödel Colloquium, KGC 2003, Vienna, Austria, August 25-30, 2003, Proceedings
Towards Kleene Algebra with Recursion
Encoding Tight Typing in a Unified Framework
Linear Lower Bounds and Simulations in Frege Systems with Substitutions
Bounded-Variable Fixpoint Queries are PSPACE-complete
Monitoring Event Frequencies
Subtyping Union Types
Incompleteness of a First-Order Gödel Logic and Some Temporal Logics of Programs
Higher-Order Interpretations and Program Complexity
Supported Sets - A New Foundation for Nominal Sets and Automata
Anti-Symmetry of Higher-Order Subtyping
Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems
Finite-Degree Predicates and Two-Variable First-Order Logic
Limit-Computable Mathematics and Its Applications
How to Develop an Intuition for Risk... and Other Invisible Phenomena (Invited Talk)
A Contextual Reconstruction of Monadic Reflection
Qualitative Temporal and Spatial Reasoning Revisited
Semantics of Non-terminating Rewrite Systems Using Minimal Coverings
Complexity of Some Problems in Modal and Intuitionistic Calculi
A Formulation of Linear Logic Based on Dependency-Relations
Quantifiers Closed Under Partial Polymorphisms
Completeness with Respect to Interpretations in Deterministic and Nondeterministic Polynomial Time
Finite-memory strategy synthesis for robust multidimensional mean-payoff objectives
Evolution as a Computational Engine
Compactness and Continuity, Constructively Revisited
Non-Homogenizable Classes of Finite Structures
A Logical Viewpoint on Process-Algebraic Quotients
Optimization Aspects of Logical Formulas
From Semantics to Rules: A Machine Assisted Analysis
Cut Reduction in Linear Logic as Asynchronous Session-Typed Communication
Zero-reachability in probabilistic multi-counter automata