FLOC 2022: FEDERATED LOGIC CONFERENCE 2022

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

A
Answer Set Counting	Rushing and Strolling among Answer Sets - Navigation Made Easy
Answer Set Navigation	Rushing and Strolling among Answer Sets - Navigation Made Easy
Answer Set Programming	Rushing and Strolling among Answer Sets - Navigation Made Easy
C
causal inference	Extending Partially Directed Graphs and Determine the Size of their Markov Equivalence Class
CDCL based Sampling	Designing Samplers is Easy: The Boon of Testers
chordal graphs	Extending Partially Directed Graphs and Determine the Size of their Markov Equivalence Class
Cognitive Reasoning
combinatorial optimisation	Stochastic Constraint Optimisation with Applications in Network Analysis
constraint programming	Stochastic Constraint Optimisation with Applications in Network Analysis
counting	Randomized Synthesis for Diversity and Cost Constraints with Control Improvisation
Counting Complexity	Counting Complexity for Projected Reasoning in Abstract Argumentation
D
directed acyclic graphs	Extending Partially Directed Graphs and Determine the Size of their Markov Equivalence Class
E
exact computation	Heuristic computation of exact treewidth - some improvements and more experimental evaluations
F
first-order logic	Recursive Solutions to First-Order Model Counting
fixed-parameter tractability	A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth
G
graphical models	Extending Partially Directed Graphs and Determine the Size of their Markov Equivalence Class
H
heuristic algorithms	Heuristic computation of exact treewidth - some improvements and more experimental evaluations
I
Incidence Graph	A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth
K
Knowledge Compilation	Scalable Uniform Sampling via Efficient Knowledge Compilation Recursive Solutions to First-Order Model Counting
M
Markov equivalence	Extending Partially Directed Graphs and Determine the Size of their Markov Equivalence Class
model counting	Scalable Uniform Sampling via Efficient Knowledge Compilation Quantifying Software Reliability via Model-Counting Recursive Solutions to First-Order Model Counting
P
parameterized complexity	Counting Complexity for Projected Reasoning in Abstract Argumentation Generating Random Weighted Model Counting Instances: An Empirical Analysis with Varying Primal Treewidth
Plausibility
practical implementations	Heuristic computation of exact treewidth - some improvements and more experimental evaluations
probabilistic inference	Stochastic Constraint Optimisation with Applications in Network Analysis
Projected Model Counting	Counting Complexity for Projected Reasoning in Abstract Argumentation
Psychology
Q
quantitative reasoning
R
random model	Generating Random Weighted Model Counting Instances: An Empirical Analysis with Varying Primal Treewidth
Randomized Synthesis	Randomized Synthesis for Diversity and Cost Constraints with Control Improvisation
S
sampling	Randomized Synthesis for Diversity and Cost Constraints with Control Improvisation
SAT solvers	Designing Samplers is Easy: The Boon of Testers
software bounded model checking	Quantifying Software Reliability via Model-Counting
software reliability	Quantifying Software Reliability via Model-Counting
software verification	Quantifying Software Reliability via Model-Counting
stochastic constraints	Stochastic Constraint Optimisation with Applications in Network Analysis
T
Testing of Samplers	Designing Samplers is Easy: The Boon of Testers
Treewidth	A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth Counting Complexity for Projected Reasoning in Abstract Argumentation Heuristic computation of exact treewidth - some improvements and more experimental evaluations
U
Uniform Sampling	Scalable Uniform Sampling via Efficient Knowledge Compilation Designing Samplers is Easy: The Boon of Testers
W
weighted model counting	Stochastic Constraint Optimisation with Applications in Network Analysis Generating Random Weighted Model Counting Instances: An Empirical Analysis with Varying Primal Treewidth

Disclaimer | Powered by EasyChair Smart Program