LICS 2017: THIRTY-SECOND ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE

This page contains an index consisting of author-provided keywords.

(
(co)induction	Constructive completeness for the linear-time mu-calculus
*
*-autonomous categories	A categorical semantics for causal structure
\
\Sigma_0^3-completeness	Large scale geometries of infinite strings
A
Abstracct interpretation	A cartesian closed category for higher-order model checking
abstract machines	Fully Abstract Encodings of lambda-Calculus in HOcore through Abstract Machines
adjunction	Quotients in monadic programming: Projective algebras are equivalent to coalgebras
affine programs	Register automata with linear arithmetic
algebraic approach	The Complexity of Minimal Inference Problem for Conservative Constraint Languages
algebraic automata theory	Quantifiers on languages and codensity monads
Algebraic Complexity	Uniform, Integral and Efficient Proofs for the Determinant Identities
Algebraic Effects	Effectful Applicative Bisimilarity: Monads, Relators, and Howe's Method
algorithms	Succinct progress measures for solving parity games
Alternating parity automata	Constructive completeness for the linear-time mu-calculus
Analysis of distributed systems	Static Analysis of Deterministic Negotiations
Antimirov's partial derivatives	Partial Derivatives on Graphs for Kleene Allegories
Applicative Bisimilarity	Effectful Applicative Bisimilarity: Monads, Relators, and Howe's Method
approximability	Infinitary Intersection Types as Sequences: a New Answer to Klop’s Problem
Asymptotic cones	Large scale geometries of infinite strings
Aumann algebras	Unrestricted Stone Duality for Markov Processes
automata and logic	Partial Derivatives on Graphs for Kleene Allegories
Automata theory	Succinct progress measures for solving parity games Separation for Dot-Depth Two
Automata transformations	Constructive completeness for the linear-time mu-calculus
axiomatization	Riesz Modal Logic for Markov Processes
B
B\"uchi automata	Large scale geometries of infinite strings
Banach spaces	Bounded time computation on metric spaces and Banach spaces
Bar Induction	Bar Induction: The Good, the Bad, and the Ugly
bar recursion	An interpretation of system F through bar recursion
Bernays-Schoenfinkel-Ramsey fragment	A fine-grained hierarchy of hard problems in the separated fragment
Bisimulation	Lean and Full Congruence Formats for Recursion Common Knowledge and Multi-Scale Locality Analysis in Cayley Structures
Boolean closure	Separation for Dot-Depth Two
Boolean spaces with internal monoid	Quantifiers on languages and codensity monads
Bounded Arithmetic	Uniform, Integral and Efficient Proofs for the Determinant Identities
bounded expansion classes of graphs	Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion
bounded treewidth	The Homomorphism Problem for Regular Graph Patterns
branching vector addition systems	Timed pushdown automata and branching vector addition systems
Brotherston-Simpson conjecture	Equivalence of Inductive Definitions and Cyclic Proofs under Arithmetic
Brzozowski's derivatives	Partial Derivatives on Graphs for Kleene Allegories
Böhm tree	Infinitary Intersection Types as Sequences: a New Answer to Klop’s Problem
C
C1 functions	Differentiation in Logical Form
canonization	Capturing Polynomial Time using Modular Decomposition
capturing of polynomial time	Capturing Polynomial Time using Modular Decomposition
categorical model	Quotients in monadic programming: Projective algebras are equivalent to coalgebras
categorical quantum mechanics	A categorical semantics for causal structure
categorical semantics	Unrestricted Stone Duality for Markov Processes Dual-Context Calculi for Modal Logic Fibred Fibration Categories
Category Theory	A cartesian closed category for higher-order model checking The Pebbling Comonad in Finite Model Theory A Convenient Category for Higher-Order Probability Theory Categorical Liveness Checking by Corecursive Algebras
causal structure	A categorical semantics for causal structure
cellular automata	On shift-invariant maximal filters and hormonal cellular automata
Choice Sequences	Bar Induction: The Good, the Bad, and the Ugly
Circuit Complexity	Uniform, Integral and Efficient Proofs for the Determinant Identities
circular proofs	Constructive completeness for the linear-time mu-calculus
circumscription	The Complexity of Minimal Inference Problem for Conservative Constraint Languages
Clarke's subgradient	Differentiation in Logical Form
clone homomorphism	The Two Dichotomy Conjectures for Infinite Domain Constraint Satisfaction Problems Are Equivalent
coalgebra	Categorical Liveness Checking by Corecursive Algebras
Coalgebras	The Pebbling Comonad in Finite Model Theory
codatatypes	Foundational Nonuniform (Co)datatypes for Higher-Order Logic
codensity monad	Quantifiers on languages and codensity monads
cographs	Capturing Polynomial Time using Modular Decomposition
Coherent spaces	Differentiation in Logical Form
coinduction	Infinitary Intersection Types as Sequences: a New Answer to Klop’s Problem Effectful Applicative Bisimilarity: Monads, Relators, and Howe's Method
Coinductive Types	The Clocks Are Ticking: No More Delays! Reduction Semantics for Type Theory with Guarded Recursion
coKleisli category	The Pebbling Comonad in Finite Model Theory
Common Knowledge Logic	Common Knowledge and Multi-Scale Locality Analysis in Cayley Structures
commonsense reasoning	The Complexity of Minimal Inference Problem for Conservative Constraint Languages
comonad	Quotients in monadic programming: Projective algebras are equivalent to coalgebras
Comonads	The Pebbling Comonad in Finite Model Theory
Completeness proof	Constructive completeness for the linear-time mu-calculus
complexity	Typability in Bounded Dimension Logics for Continuous Reachability in Petri Nets and Vector Addition Systems with States Decidability, complexity, and expressiveness of first-order logic over the subword ordering
Computability	Enumeration Reducibility in Closure Spaces with Applications to Logic and Algebra
computable analysis	Bounded time computation on metric spaces and Banach spaces On the extension of computable real functions
Computable Mathematics	Enumeration Reducibility in Closure Spaces with Applications to Logic and Algebra
Computable modulus	On the extension of computable real functions
Computable real function	On the extension of computable real functions
computation models	On shift-invariant maximal filters and hormonal cellular automata
Computation with atoms	Linear Combinations of Unordered Data Vectors
computational complexity	The Complexity of Minimal Inference Problem for Conservative Constraint Languages Bounded time computation on metric spaces and Banach spaces Foundations of Information Integration under Bag Semantics
computational effects	A monad for full ground reference cells
computational logic	Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion
computational monad	Quotients in monadic programming: Projective algebras are equivalent to coalgebras
computational time complexity	A fine-grained hierarchy of hard problems in the separated fragment
Concatenation hierarchies	Separation for Dot-Depth Two
concurrency	The Geometry of Concurrent Interaction: Handling Multiple Ports by Way of Multiple Tokens
Congruence formats	Lean and Full Congruence Formats for Recursion
conjunctive queries	Foundations of Information Integration under Bag Semantics
conjunctive regular path queries	The Homomorphism Problem for Regular Graph Patterns
constraint programming	The Limits of SDP Relaxations for General-Valued CSPs
constraint satisfaction	The Limits of SDP Relaxations for General-Valued CSPs Definability of Semidefinite Programming and Lasserre Lower Bounds for CSPs
constraint satisfaction problem	Constraint Satisfaction Problems over semilattice block Mal'tsev algebras The Two Dichotomy Conjectures for Infinite Domain Constraint Satisfaction Problems Are Equivalent
Constructive Completeness	Cut-free Completeness for Modal Mu-Calculus
constructive modal logic	Dual-Context Calculi for Modal Logic
continuity	The Continuity of Monadic Stream Functions
continuous reachability	Logics for Continuous Reachability in Petri Nets and Vector Addition Systems with States
convex relaxations	The Limits of SDP Relaxations for General-Valued CSPs
Coq	Bar Induction: The Good, the Bad, and the Ugly
corecursive algebra	Categorical Liveness Checking by Corecursive Algebras
countable choice	Stack Semantics of Type Theory
countable MDPs	Parity Objectives in Countable MDPs
countably categorical structure	The Two Dichotomy Conjectures for Infinite Domain Constraint Satisfaction Problems Are Equivalent
Counting complexity classes	Descriptive Complexity for Counting Complexity Classes
counting complexity theory	The Logic of Counting Query Answers
counting hierarchy	Computing Quantiles in Markov Chains with Multi-Dimensional Costs
counting problems	Computing Quantiles in Markov Chains with Multi-Dimensional Costs
Crane Beach	A Crevice on the Crane Beach: Finite-Degree Predicates
Curry-Howard	Dual-Context Calculi for Modal Logic
Curry-Howard correspondence	Gödel Logic: From Natural Deduction to Parallel Computation
Cut-free Axiomatisations	Cut-free Completeness for Modal Mu-Calculus
cyclic proofs	Equivalence of Inductive Definitions and Cyclic Proofs under Arithmetic
D
data structures	Data structures for quasistrict higher categories
database dependencies	Foundations of Information Integration under Bag Semantics
database theory	The Logic of Counting Query Answers Foundations of Information Integration under Bag Semantics
datatypes	Foundational Nonuniform (Co)datatypes for Higher-Order Logic
De Finetti's Theorem	A Convenient Category for Higher-Order Probability Theory
decidability	Decidability, complexity, and expressiveness of first-order logic over the subword ordering
decidable first-order fragment	A fine-grained hierarchy of hard problems in the separated fragment
Decidable Fragments	Herbrand Property: Finite Quasi-Herbrand Models and Lifting Chandra-Merlin Theorem to Quantified Conjunctive Queries
definability of algebraic properties	The Descriptive Complexity of Solving Linear Equation Systems and its Applications
Delay Games	Games with Costs and Delays
denotational semantics	A monad for full ground reference cells A Weakest Pre-Expectation Semantics for Mixed-Sign Expectations
dependent type theory	A Type-Theoretical Definition of Weak omega-Categories
descriptive complexity	The Descriptive Complexity of Solving Linear Equation Systems and its Applications The Logic of Counting Query Answers Learning first-order definable concepts over structures of small degree A Crevice on the Crane Beach: Finite-Degree Predicates Definability of Semidefinite Programming and Lasserre Lower Bounds for CSPs Descriptive Complexity for Counting Complexity Classes
descriptive complexity theory	Definability of Summation Problems for Abelian Groups and Semigroups
Determinization	On Delay and Regret Determinization of Max-Plus Automata
dialogue tree	The Continuity of Monadic Stream Functions
Difference Bound Matrices	Revisiting Reachability in Timed Automata
Dimension	Typability in Bounded Dimension
Dolev-Yao adversary	Verification of randomized security protocols
Domain theory	Differentiation in Logical Form
Domains	Domains and Event Structures for Fusions
dual-context	Dual-Context Calculi for Modal Logic
duality	Riesz Modal Logic for Markov Processes
E
effect masking	A monad for full ground reference cells
Effective convergence	On the extension of computable real functions
effects	An Effectful Way to Eliminate Addiction to Dependence
Energy Games	MDPs with Energy-Parity Objectives
equations over sets of integers	Timed pushdown automata and branching vector addition systems
equivalence	Register automata with linear arithmetic
Event structures	Domains and Event Structures for Fusions
Existential Pebble Games	The Pebbling Comonad in Finite Model Theory
Expressive Completeness	Common Knowledge and Multi-Scale Locality Analysis in Cayley Structures
expressive power	The primitivity of operators in the algebra of binary relations under conjunctions of containments
expressiveness	Decidability, complexity, and expressiveness of first-order logic over the subword ordering
F
Feasible Mathematics	Uniform, Integral and Efficient Proofs for the Determinant Identities
fibred category	Fibred Fibration Categories
finite model property	A fine-grained hierarchy of hard problems in the separated fragment
finite model theory	Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion The Logic of Counting Query Answers The Pebbling Comonad in Finite Model Theory
finite-degree predicates	A Crevice on the Crane Beach: Finite-Degree Predicates
Finite-Model Property	Herbrand Property: Finite Quasi-Herbrand Models and Lifting Chandra-Merlin Theorem to Quantified Conjunctive Queries
First-Order Logic	Decidability, complexity, and expressiveness of first-order logic over the subword ordering Herbrand Property: Finite Quasi-Herbrand Models and Lifting Chandra-Merlin Theorem to Quantified Conjunctive Queries
First-order logic and Quantifier alternation	Separation for Dot-Depth Two
first-order logic with counting and numerical predicates	First-order logic with counting: At least, WEAK Hanf normal forms always exist and can be computed!
fixed point logic with counting	Capturing Polynomial Time using Modular Decomposition
fixed-point logic	Definability of Semidefinite Programming and Lasserre Lower Bounds for CSPs
fixed-point logic with counting	Definability of Summation Problems for Abelian Groups and Semigroups
fixed-point logics with counting	The Weisfeiler-Leman dimension of planar graphs is at most 3
formal mathematics	Data structures for quasistrict higher categories
Frege proofs	Uniform, Integral and Efficient Proofs for the Determinant Identities
full abstraction	Fully Abstract Encodings of lambda-Calculus in HOcore through Abstract Machines
full ground references	A monad for full ground reference cells
functional programming	The Continuity of Monadic Stream Functions
functorial semantics	A monad for full ground reference cells
Fusions	Domains and Event Structures for Fusions
G
games and logic	Succinct progress measures for solving parity games
generalised species	Generalised Species of Rigid Resource Terms
Generic real	On the extension of computable real functions
Generic set	On the extension of computable real functions
Geometric logic	Differentiation in Logical Form
geometry of interaction	The Geometry of Concurrent Interaction: Handling Multiple Ports by Way of Multiple Tokens
globular sets	A Type-Theoretical Definition of Weak omega-Categories
graph database	The primitivity of operators in the algebra of binary relations under conjunctions of containments
graph isomorphism	The Descriptive Complexity of Solving Linear Equation Systems and its Applications
graph languages	Partial Derivatives on Graphs for Kleene Allegories
Graph rewriting	Domains and Event Structures for Fusions
Guarded Recursion	The Clocks Are Ticking: No More Delays! Reduction Semantics for Type Theory with Guarded Recursion
Gödel Logic	Gödel Logic: From Natural Deduction to Parallel Computation
H
hereditary head normalization	Infinitary Intersection Types as Sequences: a New Answer to Klop’s Problem
Hierarchical observations	Strategy Logic with Imperfect Information
higher category theory	Data structures for quasistrict higher categories
higher inductive types	The real projective spaces in homotopy type theory
Higher order model checking	A cartesian closed category for higher-order model checking
higher-order automata	Higher-order parity automata
Higher-order Function	A Convenient Category for Higher-Order Probability Theory
higher-order logic	Foundational Nonuniform (Co)datatypes for Higher-Order Logic
higher-order model checking	Higher-order parity automata
Higher-Order Probabilistic Programming Language	A Convenient Category for Higher-Order Probability Theory
higher-order process calculi	Fully Abstract Encodings of lambda-Calculus in HOcore through Abstract Machines
Hilbert Basis	Polynomial Automata: Zeroness and Applications
homomorphism problem	The Homomorphism Problem for Regular Graph Patterns
homotopy type theory	The real projective spaces in homotopy type theory Fibred Fibration Categories
Howe's Method	Effectful Applicative Bisimilarity: Monads, Relators, and Howe's Method
I
Imperfect information	Strategy Logic with Imperfect Information
Indistinguishability	Verification of randomized security protocols
inductive definitions	Equivalence of Inductive Definitions and Cyclic Proofs under Arithmetic
infinitary calculus	Infinitary Intersection Types as Sequences: a New Answer to Klop’s Problem
infinite Ramsey theorem	Equivalence of Inductive Definitions and Cyclic Proofs under Arithmetic
infinite state space	On Strong Determinacy of Countable Stochastic Games
information integration	Foundations of Information Integration under Bag Semantics
integrability	A Weakest Pre-Expectation Semantics for Mixed-Sign Expectations
interaction nets	The Geometry of Concurrent Interaction: Handling Multiple Ports by Way of Multiple Tokens
Intersection types	Typability in Bounded Dimension Infinitary Intersection Types as Sequences: a New Answer to Klop’s Problem
Intuitionistic Logic	Bar Induction: The Good, the Bad, and the Ugly
invariant problem	Register automata with linear arithmetic
Isabelle/HOL	Foundational Nonuniform (Co)datatypes for Higher-Order Logic
isomorphism testing	The Weisfeiler-Leman dimension of planar graphs is at most 3
K
Kleene allegories	Partial Derivatives on Graphs for Kleene Allegories
knowledge compilation	Understanding the complexity of #SAT using knowledge compilation
L
L-derivative	Differentiation in Logical Form
labelled Markov processes	Unrestricted Stone Duality for Markov Processes
lambda calculus	Higher-order parity automata Dual-Context Calculi for Modal Logic
lambda-calculus	Fully Abstract Encodings of lambda-Calculus in HOcore through Abstract Machines
learning theory	Learning first-order definable concepts over structures of small degree
Left-c.e. real number	On the extension of computable real functions
Linear Algebra	Uniform, Integral and Efficient Proofs for the Determinant Identities
linear arithmetic	Logics for Continuous Reachability in Petri Nets and Vector Addition Systems with States Register automata with linear arithmetic Revisiting Reachability in Timed Automata
linear identity	The Two Dichotomy Conjectures for Infinite Domain Constraint Satisfaction Problems Are Equivalent
linear logic	Higher-order parity automata
liveness	Categorical Liveness Checking by Corecursive Algebras
Localic approximable mapping	Differentiation in Logical Form
locality	First-order logic with counting: At least, WEAK Hanf normal forms always exist and can be computed!
logic	Enumeration Reducibility in Closure Spaces with Applications to Logic and Algebra Riesz Modal Logic for Markov Processes
logic and graphs	Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion
logic for polynomial time	Definability of Summation Problems for Abelian Groups and Semigroups
logic in databases	Foundations of Information Integration under Bag Semantics
logical predicate	Fibred Fibration Categories
M
Mal'tsev algebra	Constraint Satisfaction Problems over semilattice block Mal'tsev algebras
Markov chains	Computing Quantiles in Markov Chains with Multi-Dimensional Costs
Markov Decision Processes	MDPs with Energy-Parity Objectives
Markov processes	Unrestricted Stone Duality for Markov Processes
Markov's principle	Stack Semantics of Type Theory
Martin-L\"of randomness	Large scale geometries of infinite strings
Martin-Lof's system of inductive definitions	Equivalence of Inductive Definitions and Cyclic Proofs under Arithmetic
maximal filters	On shift-invariant maximal filters and hormonal cellular automata
Mazurkiewicz traces	Static Analysis of Deterministic Negotiations
memory requirement	Parity Objectives in Countable MDPs
metric entropy	Bounded time computation on metric spaces and Banach spaces
Metric semantics	On Axiomatizability of the Quantitative Algebras
metric spaces	Bounded time computation on metric spaces and Banach spaces
minimal inference problem	The Complexity of Minimal Inference Problem for Conservative Constraint Languages
mixed-sign unbounded expectation	A Weakest Pre-Expectation Semantics for Mixed-Sign Expectations
modal lambda calculus	Dual-Context Calculi for Modal Logic
modal logics	Unrestricted Stone Duality for Markov Processes
Modal Mu-Calculus	Cut-free Completeness for Modal Mu-Calculus
model checking	Strategy Logic with Imperfect Information Foundation for a Series of Efficient Simulation Algorithms Succinct progress measures for solving parity games First-order logic with counting: At least, WEAK Hanf normal forms always exist and can be computed! Revisiting Reachability in Timed Automata
model counting	Understanding the complexity of #SAT using knowledge compilation
Model-checking	Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion Static Analysis of Deterministic Negotiations
modular decomposition	Capturing Polynomial Time using Modular Decomposition
modular quantifiers	Quantifiers on languages and codensity monads
monad	The Continuity of Monadic Stream Functions
monadic first-order fragment	A fine-grained hierarchy of hard problems in the separated fragment
Monadic first-order logic without equality	Verification of randomized security protocols
monadic stream function	The Continuity of Monadic Stream Functions
monads	A monad for full ground reference cells An Effectful Way to Eliminate Addiction to Dependence
mu-calculus	Constructive completeness for the linear-time mu-calculus
multi-dimensional energy games	Perfect Half Space Games
multisets	Foundations of Information Integration under Bag Semantics
N
Natural Deduction	Gödel Logic: From Natural Deduction to Parallel Computation
neutral letters	A Crevice on the Crane Beach: Finite-Degree Predicates
nonidempotent intersection type system	Generalised Species of Rigid Resource Terms
nonmonotonic reasoning	The Complexity of Minimal Inference Problem for Conservative Constraint Languages
nonuniform recursion	Foundational Nonuniform (Co)datatypes for Higher-Order Logic
Nullstellensatz	The Descriptive Complexity of Solving Linear Equation Systems and its Applications
Nuprl	Bar Induction: The Good, the Bad, and the Ugly
O
one counter automata	Regular Separability of One Counter Automata
one counter nets	Regular Separability of One Counter Automata
One-counter Automata	MDPs with Energy-Parity Objectives
One-way transducers	Untwisting two-way transducers in elementary time
Optimal Strategies	Games with Costs and Delays
optimization	Definability of Semidefinite Programming and Lasserre Lower Bounds for CSPs
P
PAC learning	Learning first-order definable concepts over structures of small degree
parametricity	Foundational Nonuniform (Co)datatypes for Higher-Order Logic
parametrized complexity	Understanding the complexity of #SAT using knowledge compilation
Parikh images	Computing Quantiles in Markov Chains with Multi-Dimensional Costs
Parity Conditions with Costs	Games with Costs and Delays
Parity Games	MDPs with Energy-Parity Objectives
parity objectives	Parity Objectives in Countable MDPs
partition refinement algorithms	Foundation for a Series of Efficient Simulation Algorithms
pasting scheme	A Type-Theoretical Definition of Weak omega-Categories
permutation graphs	Capturing Polynomial Time using Modular Decomposition
Petri nets	Logics for Continuous Reachability in Petri Nets and Vector Addition Systems with States Linear Combinations of Unordered Data Vectors Polynomial Automata: Zeroness and Applications
planar graphs	The Weisfeiler-Leman dimension of planar graphs is at most 3
Podelski-Rybalchenko termination theorem	Equivalence of Inductive Definitions and Cyclic Proofs under Arithmetic
polymorphic recursion	Foundational Nonuniform (Co)datatypes for Higher-Order Logic
polymorphism	An interpretation of system F through bar recursion
polymorphisms	The Limits of SDP Relaxations for General-Valued CSPs
polynomial calculus	The Descriptive Complexity of Solving Linear Equation Systems and its Applications
Predicate transformer	Differentiation in Logical Form
presheaf semantics	A monad for full ground reference cells
probabilistic program	A Weakest Pre-Expectation Semantics for Mixed-Sign Expectations
probabilistic semantics	Unrestricted Stone Duality for Markov Processes
probability	Riesz Modal Logic for Markov Processes
Probability Theory	A Convenient Category for Higher-Order Probability Theory
probablistic systems	Unrestricted Stone Duality for Markov Processes
Process calculi	Domains and Event Structures for Fusions
Proof Complexity	Uniform, Integral and Efficient Proofs for the Determinant Identities
Proof theory	Typability in Bounded Dimension Equivalence of Inductive Definitions and Cyclic Proofs under Arithmetic Constructive completeness for the linear-time mu-calculus
proof-search	Constructive completeness for the linear-time mu-calculus
Proximity lattices	Differentiation in Logical Form
Q
Quantified Conjunctive Query Containment	Herbrand Property: Finite Quasi-Herbrand Models and Lifting Chandra-Merlin Theorem to Quantified Conjunctive Queries
Quantified CTL	Strategy Logic with Imperfect Information
quantiles	Computing Quantiles in Markov Chains with Multi-Dimensional Costs
Quantitative Algebras	On Axiomatizability of the Quantitative Algebras
quantitative games	Perfect Half Space Games
Quantitative systems	On Axiomatizability of the Quantitative Algebras
Quasi-isometry	Large scale geometries of infinite strings
query evaluation over fully dynamic databases	First-order logic with counting: At least, WEAK Hanf normal forms always exist and can be computed!
query language	The primitivity of operators in the algebra of binary relations under conjunctions of containments
quotient type	Quotients in monadic programming: Projective algebras are equivalent to coalgebras
R
Randomized Cryptographic protocols	Verification of randomized security protocols
ranking function	Categorical Liveness Checking by Corecursive Algebras
ranking supermartingale	Categorical Liveness Checking by Corecursive Algebras
rational numbers	Register automata with linear arithmetic
reachability	Register automata with linear arithmetic Revisiting Reachability in Timed Automata
Reactive synthesis	On Delay and Regret Determinization of Max-Plus Automata
real projective space	The real projective spaces in homotopy type theory
realizability	An interpretation of system F through bar recursion
Recursion	Lean and Full Congruence Formats for Recursion
Recursive Types	The Clocks Are Ticking: No More Delays! Reduction Semantics for Type Theory with Guarded Recursion
Reduction Semantics	The Clocks Are Ticking: No More Delays! Reduction Semantics for Type Theory with Guarded Recursion
register automata	Register automata with linear arithmetic
Regret minimization	On Delay and Regret Determinization of Max-Plus Automata
regular expressions	Partial Derivatives on Graphs for Kleene Allegories
regular graph patterns	The Homomorphism Problem for Regular Graph Patterns
relational parametricity	Fibred Fibration Categories
Relators	Effectful Applicative Bisimilarity: Monads, Relators, and Howe's Method
resouce calculus	Generalised Species of Rigid Resource Terms
S
Satisfiability Problem	Herbrand Property: Finite Quasi-Herbrand Models and Lifting Chandra-Merlin Theorem to Quantified Conjunctive Queries
Schaefer's framework	The Complexity of Minimal Inference Problem for Conservative Constraint Languages
schema mappings	Foundations of Information Integration under Bag Semantics
Scott continuous	Differentiation in Logical Form
SDP	The Limits of SDP Relaxations for General-Valued CSPs
Secrecy	Verification of randomized security protocols
Semantics	A Convenient Category for Higher-Order Probability Theory Bar Induction: The Good, the Bad, and the Ugly
semidefinite programming	Definability of Semidefinite Programming and Lasserre Lower Bounds for CSPs
semilattice	Constraint Satisfaction Problems over semilattice block Mal'tsev algebras
Separation problem	Separation for Dot-Depth Two
sequent calculus	Constructive completeness for the linear-time mu-calculus
simulation preorder	Foundation for a Series of Efficient Simulation Algorithms
size-change termination theorem	Equivalence of Inductive Definitions and Cyclic Proofs under Arithmetic
stack model	Stack Semantics of Type Theory
Static analysis	Static Analysis of Deterministic Negotiations
stochastic games	On Strong Determinacy of Countable Stochastic Games
Stone duality	Differentiation in Logical Form Unrestricted Stone Duality for Markov Processes Quantifiers on languages and codensity monads
strategies	Parity Objectives in Countable MDPs
Strategy Logic	Strategy Logic with Imperfect Information
strategy tree	The Continuity of Monadic Stream Functions
stream	The Continuity of Monadic Stream Functions
string diagrams	A categorical semantics for causal structure
Strong Consistency	The Pebbling Comonad in Finite Model Theory
strong determinacy	On Strong Determinacy of Countable Stochastic Games
Strong Normalisation	The Clocks Are Ticking: No More Delays! Reduction Semantics for Type Theory with Guarded Recursion
Structural Operational Semantics	Lean and Full Congruence Formats for Recursion
subword ordering	Decidability, complexity, and expressiveness of first-order logic over the subword ordering
successor-invariant logics	Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion
summation in Abelian semigroups	Definability of Summation Problems for Abelian Groups and Semigroups
Sweeping transducers	Untwisting two-way transducers in elementary time
Symbolic Dynamics	Enumeration Reducibility in Closure Spaces with Applications to Logic and Algebra
T
Taylor expansion	Generalised Species of Rigid Resource Terms
the regular separability problem	Regular Separability of One Counter Automata
Ties of functions	Differentiation in Logical Form
Timed automata	Revisiting Reachability in Timed Automata
timed pushdown automata	Timed pushdown automata and branching vector addition systems
token machines	The Geometry of Concurrent Interaction: Handling Multiple Ports by Way of Multiple Tokens
tractability	The Complexity of Minimal Inference Problem for Conservative Constraint Languages
Tradeoffs	Games with Costs and Delays
transition systems	Foundation for a Series of Efficient Simulation Algorithms
Tree automata	Strategy Logic with Imperfect Information
Treewidth	The Pebbling Comonad in Finite Model Theory
Two-way transducers	Untwisting two-way transducers in elementary time
Typability	Typability in Bounded Dimension
Type inference	Typability in Bounded Dimension
type system	A cartesian closed category for higher-order model checking Infinitary Intersection Types as Sequences: a New Answer to Klop’s Problem
type theory	Gödel Logic: From Natural Deduction to Parallel Computation The Continuity of Monadic Stream Functions An Effectful Way to Eliminate Addiction to Dependence The Clocks Are Ticking: No More Delays! Reduction Semantics for Type Theory with Guarded Recursion Stack Semantics of Type Theory
U
Ultra-filter	Large scale geometries of infinite strings
uniform continuity	The Two Dichotomy Conjectures for Infinite Domain Constraint Satisfaction Problems Are Equivalent
univalence axiom	The real projective spaces in homotopy type theory Stack Semantics of Type Theory
Universal Algebra	Enumeration Reducibility in Closure Spaces with Applications to Logic and Algebra The Limits of SDP Relaxations for General-Valued CSPs
universal solutions	Foundations of Information Integration under Bag Semantics
V
validity	Infinitary Intersection Types as Sequences: a New Answer to Klop’s Problem
Variety theorems	On Axiomatizability of the Quantitative Algebras
vector addition systems	Perfect Half Space Games
vector addition systems with states	Logics for Continuous Reachability in Petri Nets and Vector Addition Systems with States Regular Separability of One Counter Automata
verification	Succinct progress measures for solving parity games Categorical Liveness Checking by Corecursive Algebras
W
weak normalizibility	Infinitary Intersection Types as Sequences: a New Answer to Klop’s Problem
weak ω-category	A Type-Theoretical Definition of Weak omega-Categories
Weighted Automata	On Delay and Regret Determinization of Max-Plus Automata Polynomial Automata: Zeroness and Applications
Weighted logics	Descriptive Complexity for Counting Complexity Classes
Weisfeiler-Leman algorithm	The Weisfeiler-Leman dimension of planar graphs is at most 3
Well-structured transition systems	Linear Combinations of Unordered Data Vectors
Word transductions	Untwisting two-way transducers in elementary time
wp-calculus	A Weakest Pre-Expectation Semantics for Mixed-Sign Expectations

Disclaimer | Powered by EasyChair Smart Program