FLOC 2022: FEDERATED LOGIC CONFERENCE 2022

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

A
absolute value maximization	MaxSAT: Parameterized, Parallel, Absolute
Abstract Argumentation	Tractable Abstract Argumentation via Backdoor-Treewidth
access control	Parameterized algorithmics in access control: linking theory and practice
approximation	Parameterized Approximations and CSPs
B
backdoor depth	The Parameterized Complexity of SAT
Backdoors	Tractable Abstract Argumentation via Backdoor-Treewidth The Parameterized Complexity of SAT
Biased graphs	Resolving Inconsistency of Linear Equations
C
classification instance	Learning Small Decision Trees
Completion of an Ordering	Kemeny Rank Aggregation: Width Measure and Diversity Notion
computational social choice	The Tournament Fixing Problem
constraint satisfaction	Parameterized Approximations and CSPs
D
Diversity of Solutions	Kemeny Rank Aggregation: Width Measure and Diversity Notion
Dynamic Programming	Parameterized Algorithmics and Counting: Treewidth in Practice
E
elections	The Tournament Fixing Problem
F
fixed-parameter tractability	Tractable Abstract Argumentation via Backdoor-Treewidth Kemeny Rank Aggregation: Width Measure and Diversity Notion The Parameterized Complexity of SAT
FO model checking	Decompositions and algorithms for interpretations of sparse graphs
I
Important separators	Resolving Inconsistency of Linear Equations
interpretation of sparse graphs	Decompositions and algorithms for interpretations of sparse graphs
introduction	Welcome and Introduction
K
Kemeny Rank Aggregation	Kemeny Rank Aggregation: Width Measure and Diversity Notion
kernelization	MaxSAT: Parameterized, Parallel, Absolute
L
learning decision trees	Learning Small Decision Trees
linear equations	Resolving Inconsistency of Linear Equations
locally bounded treewidth	Decompositions and algorithms for interpretations of sparse graphs
M
Max-CSP	Parameterized Approximations and CSPs
model counting	The Parameterized Complexity of SAT
O
organization	Welcome and Introduction
P
parameterized complexity	Kemeny Rank Aggregation: Width Measure and Diversity Notion Resolving Inconsistency of Linear Equations MaxSAT: Parameterized, Parallel, Absolute
Parmeterized Algorithms	Parameterized Algorithmics and Counting: Treewidth in Practice
play-off competitions	The Tournament Fixing Problem
Practical Problem Solving	Parameterized Algorithmics and Counting: Treewidth in Practice
Propositional satisfiability	The Parameterized Complexity of SAT
Q
Quantified Boolean Formula	Towards Tractable QSAT for Structural Parameters Below Treewidth
R
rank-width	Learning Small Decision Trees
S
structural parameters	Towards Tractable QSAT for Structural Parameters Below Treewidth
T
TBA1	TBA
TBA2	TBA
TBA3	TBA
Tournament Fixing problem	The Tournament Fixing Problem
treedepth	Towards Tractable QSAT for Structural Parameters Below Treewidth
Treewidth	Tractable Abstract Argumentation via Backdoor-Treewidth Parameterized Algorithmics and Counting: Treewidth in Practice The Parameterized Complexity of SAT
twin-width	The Parameterized Complexity of SAT
U
user authorization query problem	Parameterized algorithmics in access control: linking theory and practice
W
weighted maximum satisfiability	MaxSAT: Parameterized, Parallel, Absolute
Welcome	Welcome and Introduction
workflow satisfiability problem	Parameterized algorithmics in access control: linking theory and practice

Disclaimer | Powered by EasyChair Smart Program