FLOC 2022: FEDERATED LOGIC CONFERENCE 2022

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

A
automated deployment	Automatic Deployment of Component-based Applications in the Cloud
automated reasoning	Computer algebra and automation in Lean's mathematical library
B
benchmarking	Automatic Deployment of Component-based Applications in the Cloud
C
Combinatorial Enumeration	Enumerating Projective Planes of Order Nine with Proof Verification
Combinatorial Inequalities	NP: SMT-Solving Combinatorial Inequalities
Computer Algebra	NP: SMT-Solving Combinatorial Inequalities
computer-assisted proof	Enumerating Projective Planes of Order Nine with Proof Verification
constraint optimization	Automatic Deployment of Component-based Applications in the Cloud
constraint programming	Automatic Deployment of Component-based Applications in the Cloud
Constraint Solving	Non-Linear Real Arithmetic with Transcendental Function Symbols: Undecidable but Easy?
Cylindrical Algebraic Coverings	Cylindrical Algebraic Coverings for Quantifiers
D
decidability	Decidability of difference logics with unary predicates
decision procedure	Decidability of difference logics with unary predicates
difference logics	Decidability of difference logics with unary predicates
I
Interactive Theorem Proving	Computer algebra and automation in Lean's mathematical library
isomorph-free generation	An SC-Square Approach to the Minimum Kochen–Specker Problem
K
Kochen–Specker systems	An SC-Square Approach to the Minimum Kochen–Specker Problem
M
mathematical programming	Automatic Deployment of Component-based Applications in the Cloud
N
Non-linear Arithmetic	Cylindrical Algebraic Coverings for Quantifiers
O
optimization modulo theory	Automatic Deployment of Component-based Applications in the Cloud
Q
Quantified logics	Decidability of difference logics with unary predicates
quantifier elimination	Cylindrical Algebraic Coverings for Quantifiers
R
Rational Functions	NP: SMT-Solving Combinatorial Inequalities
real domain	Decidability of difference logics with unary predicates
S
satisfiability checking	Enumerating Projective Planes of Order Nine with Proof Verification
Satisfiability Modulo Theories	NP: SMT-Solving Combinatorial Inequalities
satisfiability solving	An SC-Square Approach to the Minimum Kochen–Specker Problem
SMT	Decidability of difference logics with unary predicates
Software Synthesis	Non-Linear Real Arithmetic with Transcendental Function Symbols: Undecidable but Easy?
Symbolic Computation	Enumerating Projective Planes of Order Nine with Proof Verification An SC-Square Approach to the Minimum Kochen–Specker Problem
symmetry breaking	An SC-Square Approach to the Minimum Kochen–Specker Problem Automatic Deployment of Component-based Applications in the Cloud
T
type theory	Computer algebra and automation in Lean's mathematical library
U
unary uninterpreted predicates	Decidability of difference logics with unary predicates
V
Verification of Complex Systems	Non-Linear Real Arithmetic with Transcendental Function Symbols: Undecidable but Easy?
W
Wordpress	Automatic Deployment of Component-based Applications in the Cloud

Disclaimer | Powered by EasyChair Smart Program