FLOC 2022: FEDERATED LOGIC CONFERENCE 2022
DPCP22 DOCTORAL PROGRAM PAPERS: KEYWORD INDEX
PapersPapers with AbstractsPrefaceAuthor IndexKeyword Index
Shortcuts: ABCDEFGHIKLMNPQRSTV
A
Aggressive Bound Descent
Aggressive Bound Descent for Constraint Optimization (, talk)
Artificial intelligence
Extended Abstract: Acquiring Maps of Interrelated Conjectures on Sharp Bounds (, talk)
Finding Counterfactual Explanations through Constraint Relaxations (, talk)
A Boolean Formula Seeker in the Context of Acquiring Maps of Interrelated Conjectures on Sharp Bounds (, talk)
automated algorithm configuration
Improved Sample Complexity Bounds for Branch-and-Cut (, talk)
B
Backtracking Search
Aggressive Bound Descent for Constraint Optimization (, talk)
BCT
CNF Encodings of Binary Constraint Trees (Extended Abstract) (, talk)
Belief Propagation
Exploiting Model Entropy to Make Branching Decisions in Constraint Programming (, talk)
boolean satisfiability
Automated SAT Problem Feature Extraction using 1 Convolutional Autoencoders (, talk)
branch-and-bound
Improved Sample Complexity Bounds for Branch-and-Cut (, talk)
Peel-and-Bound: Generating Stronger Relaxed Bounds with Multivalued Decision Diagrams (, talk)
branch-and-cut
Improved Sample Complexity Bounds for Branch-and-Cut (, talk)
C
CNF
CNF Encodings of Binary Constraint Trees (Extended Abstract) (, talk)
CNF Encoding
Automated SAT Problem Feature Extraction using 1 Convolutional Autoencoders (, talk)
Combinatorial optimization
Extended Abstract: Acquiring Maps of Interrelated Conjectures on Sharp Bounds (, talk)
A Boolean Formula Seeker in the Context of Acquiring Maps of Interrelated Conjectures on Sharp Bounds (, talk)
Combinatorics
Extended Abstract: Acquiring Maps of Interrelated Conjectures on Sharp Bounds (, talk)
A Boolean Formula Seeker in the Context of Acquiring Maps of Interrelated Conjectures on Sharp Bounds (, talk)
compiler optimization
Optimized Code Generation against Power Side Channels (, talk)
Computing methodologies
Extended Abstract: Acquiring Maps of Interrelated Conjectures on Sharp Bounds (, talk)
A Boolean Formula Seeker in the Context of Acquiring Maps of Interrelated Conjectures on Sharp Bounds (, talk)
Constrained Single-Row Facility Layout Problem
Solving the Constrained Single-Row Facility Layout Problem with Decision Diagrams (Extended Abstract) (, talk)
Constraint acquisition
Extended Abstract: Constraint Acquisition Based on Solution Counting (, talk)
Constraint Optimization
Aggressive Bound Descent for Constraint Optimization (, talk)
Constraint Optimization Problems
Exploiting Functional Constraints in Automatic Dominance Breaking for Constraint Optimization (Extended Abstract) (, talk)
constraint programming
Exploiting Model Entropy to Make Branching Decisions in Constraint Programming (, talk)
Explaining Propagation for Gini and Spread with Variable Mean (Extended Abstract) (, talk)
On PB Encodings for Constraint Problems (, talk)
Combining Reinforcement Learning and Constraint Programming for Sequence-Generation Tasks with Hard Constraints - Extended Abstract (, talk)
Large Neighborhood Search for Robust Solutions for Constraint Satisfaction Problems with Ordered Domains (, talk)
Solving the Non-Crossing MAPF for non point-sized robots (, talk)
Extended Abstract for : Scheduling the Equipment Maintenance of an Electric Power Transmission Network using Constraint Programming (, talk)
Peel-and-Bound: Generating Stronger Relaxed Bounds with Multivalued Decision Diagrams (, talk)
Optimized Code Generation against Power Side Channels (, talk)
constraint satisfaction problems
Finding Counterfactual Explanations through Constraint Relaxations (, talk)
convolutional autoencoders
Automated SAT Problem Feature Extraction using 1 Convolutional Autoencoders (, talk)
counterfactual explanations
Finding Counterfactual Explanations through Constraint Relaxations (, talk)
CSP
Extended Abstract: Constraint Acquisition Based on Solution Counting (, talk)
cutting planes
Improved Sample Complexity Bounds for Branch-and-Cut (, talk)
D
data-driven algorithm design
Improved Sample Complexity Bounds for Branch-and-Cut (, talk)
Decision Diagrams
Solving the Constrained Single-Row Facility Layout Problem with Decision Diagrams (Extended Abstract) (, talk)
Peel-and-Bound: Generating Stronger Relaxed Bounds with Multivalued Decision Diagrams (, talk)
deep learning
Automated SAT Problem Feature Extraction using 1 Convolutional Autoencoders (, talk)
Dial-A-Ride
Extended Abstract: Sequence Variables for Routing Problems (, talk)
Discrete mathematics
Extended Abstract: Acquiring Maps of Interrelated Conjectures on Sharp Bounds (, talk)
A Boolean Formula Seeker in the Context of Acquiring Maps of Interrelated Conjectures on Sharp Bounds (, talk)
Discrete Optimization
Solving the Constrained Single-Row Facility Layout Problem with Decision Diagrams (Extended Abstract) (, talk)
Peel-and-Bound: Generating Stronger Relaxed Bounds with Multivalued Decision Diagrams (, talk)
Dominance Breaking
Exploiting Functional Constraints in Automatic Dominance Breaking for Constraint Optimization (Extended Abstract) (, talk)
Dominance Relations
Exploiting Functional Constraints in Automatic Dominance Breaking for Constraint Optimization (Extended Abstract) (, talk)
DQBF
Boolean Functional Synthesis and its Applications (, talk)
E
Electric power network
Extended Abstract for : Scheduling the Equipment Maintenance of an Electric Power Transmission Network using Constraint Programming (, talk)
Entropy
Exploiting Model Entropy to Make Branching Decisions in Constraint Programming (, talk)
exclusion set
Finding Counterfactual Explanations through Constraint Relaxations (, talk)
F
feature extraction
Automated SAT Problem Feature Extraction using 1 Convolutional Autoencoders (, talk)
Filtering algorithm
Explaining Propagation for Gini and Spread with Variable Mean (Extended Abstract) (, talk)
G
generalization guarantees
Improved Sample Complexity Bounds for Branch-and-Cut (, talk)
Gini index
Explaining Propagation for Gini and Spread with Variable Mean (Extended Abstract) (, talk)
H
Heuristic function construction
Extended Abstract: Acquiring Maps of Interrelated Conjectures on Sharp Bounds (, talk)
I
integer programming
Improved Sample Complexity Bounds for Branch-and-Cut (, talk)
K
Knowledge compilation
Symmetry breaking and Knowledge Compilation (, talk)
L
Large Neighbourhood Search
Large Neighborhood Search for Robust Solutions for Constraint Satisfaction Problems with Ordered Domains (, talk)
Lazy clause generation
Explaining Propagation for Gini and Spread with Variable Mean (Extended Abstract) (, talk)
linear constraints
Selecting SAT Encodings for Pseudo-Boolean and Linear Integer Constraints (, talk)
M
machine learning
Selecting SAT Encodings for Pseudo-Boolean and Linear Integer Constraints (, talk)
machine learning theory
Improved Sample Complexity Bounds for Branch-and-Cut (, talk)
masking
Optimized Code Generation against Power Side Channels (, talk)
Mathematics of computing
Extended Abstract: Acquiring Maps of Interrelated Conjectures on Sharp Bounds (, talk)
A Boolean Formula Seeker in the Context of Acquiring Maps of Interrelated Conjectures on Sharp Bounds (, talk)
MDD
CNF Encodings of Binary Constraint Trees (Extended Abstract) (, talk)
Mixed-Integer Programming
Solving the Constrained Single-Row Facility Layout Problem with Decision Diagrams (Extended Abstract) (, talk)
Model counting
Extended Abstract: Constraint Acquisition Based on Solution Counting (, talk)
Multi-Agent Path Finding
Solving the Non-Crossing MAPF for non point-sized robots (, talk)
Music generation
Combining Reinforcement Learning and Constraint Programming for Sequence-Generation Tasks with Hard Constraints - Extended Abstract (, talk)
N
NFA/MDD constraint
CNF Encodings of Binary Constraint Trees (Extended Abstract) (, talk)
P
Patient Transportation
Extended Abstract: Sequence Variables for Routing Problems (, talk)
PB solving
On PB Encodings for Constraint Problems (, talk)
power side channels
Optimized Code Generation against Power Side Channels (, talk)
program synthesis
Boolean Functional Synthesis and its Applications (, talk)
propagation strength
CNF Encodings of Binary Constraint Trees (Extended Abstract) (, talk)
pseudo-Boolean constraints
Selecting SAT Encodings for Pseudo-Boolean and Linear Integer Constraints (, talk)
Q
QBF
Boolean Functional Synthesis and its Applications (, talk)
R
Reinforcement Learning
Combining Reinforcement Learning and Constraint Programming for Sequence-Generation Tasks with Hard Constraints - Extended Abstract (, talk)
RNN
Combining Reinforcement Learning and Constraint Programming for Sequence-Generation Tasks with Hard Constraints - Extended Abstract (, talk)
Robust Solutions
Large Neighborhood Search for Robust Solutions for Constraint Satisfaction Problems with Ordered Domains (, talk)
S
sample complexity
Improved Sample Complexity Bounds for Branch-and-Cut (, talk)
SAT encodings
On PB Encodings for Constraint Problems (, talk)
Selecting SAT Encodings for Pseudo-Boolean and Linear Integer Constraints (, talk)
Search methodologies
Extended Abstract: Acquiring Maps of Interrelated Conjectures on Sharp Bounds (, talk)
A Boolean Formula Seeker in the Context of Acquiring Maps of Interrelated Conjectures on Sharp Bounds (, talk)
security
Optimized Code Generation against Power Side Channels (, talk)
Sentential Decision Diagram
Symmetry breaking and Knowledge Compilation (, talk)
Sequence Variables
Extended Abstract: Sequence Variables for Routing Problems (, talk)
sequencing
Peel-and-Bound: Generating Stronger Relaxed Bounds with Multivalued Decision Diagrams (, talk)
Solution counting
Extended Abstract: Constraint Acquisition Based on Solution Counting (, talk)
Spread constraint
Explaining Propagation for Gini and Spread with Variable Mean (Extended Abstract) (, talk)
Symmetry breaking
Symmetry breaking and Knowledge Compilation (, talk)
T
Transmission maintenance scheduling
Extended Abstract for : Scheduling the Equipment Maintenance of an Electric Power Transmission Network using Constraint Programming (, talk)
tree search
Improved Sample Complexity Bounds for Branch-and-Cut (, talk)
trustworthy AI
Finding Counterfactual Explanations through Constraint Relaxations (, talk)
TSPTW
Extended Abstract: Sequence Variables for Routing Problems (, talk)
V
Variable Neighborhood Search
Solving the Non-Crossing MAPF for non point-sized robots (, talk)
Variable Ordering heuristic
Exploiting Model Entropy to Make Branching Decisions in Constraint Programming (, talk)
Vehicle Routing
Extended Abstract: Sequence Variables for Routing Problems (, talk)