TALK KEYWORD INDEX

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

( | |

(iterated) admissibility | |

A | |

Accuracy | |

advisor | |

Aerospace | |

Algorithmic Game Theory | |

algorithmic graph theory | |

all I know | |

AND-OR graph | |

archery | |

artificial intelligence | |

assumptions | |

Autoencoding | |

Automata | |

automata theory | |

Automata-Theoretic Approach | |

automated numerical planning and scheduling | |

automated reasoning | |

Aviation | |

B | |

B\"uchi automata | |

BDD | |

Bell Labs | |

best-effort synthesis | |

bisimulation | |

Boolean synthesis | |

Branching Time | |

C | |

category theory | |

CAV | |

collaboration | |

Combinations of Logic and Machine Learning | |

Combinations of Solvers and Gradient Descent | |

combinatorial structures | |

Comment | |

Comparators | |

complexity | |

complexity over structures | |

computability over structures | |

computable queries | |

computational complexity | |

Computer Science | |

Consistency Analysis | |

constraint logic programming | |

constraint satisfaction | |

constraint satisfaction problems | |

contextuality | |

Cooperation in MAS | |

counting | |

Cyber-physical systems | |

D | |

Data Complexity | |

database dependencies | |

database query languages | |

database theory | |

Databases | |

databases as logical theories | |

decidability | |

decision diagrams | |

Descriptive Complexity | |

Deterministic Emerson-Lei automata | |

Determinization | |

differential privacy | |

Dimensionality reduction | |

Divide-and-conquer | |

Dynamic Logic | |

E | |

Energy Efficiency | |

epistemic logic | |

Ethics | |

Evolution | |

expressive power | |

F | |

Fair simulation | |

finite automata | |

Finite Model Theory | |

finite-variable logics | |

firmware | |

first-order logic | |

fixpoint logic | |

Formal | |

formal methods | |

formal verification | |

G | |

game | |

game theory | |

gang membership | |

Graph databases | |

Graph games | |

graph theory | |

H | |

hardware | |

Hardware Verification | |

hybrid systems | |

I | |

incomplete information | |

Interaction | |

Invited Talk | |

K | |

k-consistency | |

Kavraki | |

Knowledge Acquisition | |

Knowledge Compilation | |

Kupferman | |

L | |

languages | |

law enforcement | |

Legal Contracts | |

Limit-Deterministic Buchi Automata | |

Linear Time | |

Linear Time Logic on Finite Traces | |

Linear-time Temporal Logic on Finite and Infinite Traces | |

Logic | |

Logic and finite model theory | |

Logic and Law | |

Logical theories | |

Logics for Multi-Agent Systems | |

Logics for the strategic reasoning | |

Loop termination | |

losslessness | |

LTL | |

LTL model checking | |

LTL over finite traces | |

LTLf | |

M | |

machine learning | |

Manufacturing | |

Markov decision processes | |

Mechanism Design | |

Mechanized Logic | |

message passing | |

Minimal Independent Sets | |

misconceptions | |

model checking | |

Model-Free Reinforcement Learning | |

Module checking | |

monadic NP | |

Multi-Agent Systems | |

Multi-Agent Systems (MAS) | |

N | |

Neurosymbolic AI | |

O | |

Omega Automata | |

Open Problems | |

ordinary differential equations | |

P | |

PCTL | |

Planning | |

Program Verification | |

proof checking | |

proof of unsatisfiability | |

property language design | |

Q | |

QPTIME | |

quantitative reasoning | |

quantum mechanics | |

Query Evaluation | |

Query rewriting | |

R | |

Rational Synthesis | |

rationality | |

reactive synthesis | |

Reactive systems | |

Reasoning | |

Recollections | |

reconfigurable interaction | |

Register automata | |

Regular expressions | |

Regular path queries | |

relational complexity | |

relational databases | |

relational machines | |

representation learning | |

Ron Fagin | |

S | |

safety | |

SAT-based reasoning | |

Satisfiability | |

satisfiability checking | |

Satisfiability Solvers | |

SDD | |

Series-parallel graphs | |

sheaves and cohomology | |

situation calculus | |

Skolem Problem | |

SMT Solving | |

Species Interaction Code | |

Specification | |

Strategic Reasoning | |

Strategy Logic | |

Strongly Connected Components (SCCs) | |

Survival of the Fitted | |

Synthesis | |

Synthesis under Environment Specifications | |

T | |

Temporal Logic | |

Temporal Logics | |

temporal reasoning | |

toasts | |

Training Deep Neural Networks | |

transition systems | |

translation | |

U | |

user studies | |

V | |

Vardi | |

Vardifest | |

Verification | |

view-based query answering | |

view-based query processing | |

W | |

Weisfeiler-Leman | |

X | |

ximplified proofs | |

Z | |

ZDD |