FLOC 2022: FEDERATED LOGIC CONFERENCE 2022
TALK KEYWORD INDEX

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

A
abduction
abstraction refinement
Actions
Anti-Unification
arithmetic constraints
Associativity
Automated reasoning
automated theorem proving
B
Bayesian Machine Learning
benchmarking
Bernays–Schönfinkel Fragment
binary codes
C
Calculus of Names
Choice logics
clause learning from simple models
clause redundancy
closure redundancy
Cloud Security
Commonsense reasoning
Commutativity
Complexity
complexity analysis
concurrency
connectedness
consequence relations
Constraint tableaux
counter systems
countermodel construction
CTL*
Cut Elimination
cut-elimination
Cyclic proofs
cylindrical algebraic coverings
D
Data analysis
decidability
Decidable Subclasses
Default logic
definitions
Description Logic
Description Logic EL
Diagonalizable matrices
differential dynamic logic
E
Effective algorithms
entailment
equational unification
evaluation
Eventual non-negativity
explanation
F
factor interpretation
finite axiomatizability
first-order logic
first-order logic with equality
First-order theorem proving
Formula Simplification
Fuzzy proximity relations
G
Generalization
Geometry Problem Solving
ground joinability
Gödel logic
H
Haskell
Higher-order logic
Hilbert-style proof systems
Hypersequents
I
infeasibility
Integer Programs
integer transition systems
Invariance
Isabelle/HOL
J
justifications
L
Lambek calculus
Le\'sniewski
Linear Arithmetic
Linear dynamical systems
linear logic
Linear recurrence sequences
loop acceleration
lower runtime bounds
M
machine learning
maximum satisfiability
MaxSAT
Minimal tableau
minimal unsastisfiable set
minimality criterion
modal logic
Modal logics
N
NMatrices
nominal logic
non-deterministic semantics
non-monotonic reasoning
non-termination
nonlinear real arithmetic
O
ontology
P
Paraconsistency
parametric solution
path orders
Pigeonhole Principle
planning
preferences
preprocessing
preserving primitivity
prime implicates
Procedure
proof-search
Proof-search heuristics
Proofs
propagation redundancy
propagation redundant proof
Propositional Dynamic Logic
propositional intermediate logics
propositional logic
Q
Quantitative theories
R
randomization
reachability
Redundancy Elimination
Refutation calculus
relevance
rewriting logic
S
SAT solving
Satisfiability
Satisfiability Modulo Theories
saturation-based theorem proving
Separation Logic
Sequent Calculi
Sequent Calculus
SMT
sound and complete calculus
Strategy Scheduling
Subexponentials
substitution
Subsumption
superposition
symbolic reachability
syntax with bindings
Synthetic tableau
T
Tableaux
term rewriting
Termination
Theorem proving
Theory of Sequences
TPTP
Transitive Closure Logic
Two-dimensional logics
type theory
U
upper runtime bounds
V
Verification
verification of hybrid systems
Visualization