FLOC 2022: FEDERATED LOGIC CONFERENCE 2022

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

-
- Data Mining	On the Enumeration of Frequent High Utility Itemsets: A symbolic AI Approach
- High Utility Itemsets	On the Enumeration of Frequent High Utility Itemsets: A symbolic AI Approach
- Propositional Satisfiability	On the Enumeration of Frequent High Utility Itemsets: A symbolic AI Approach
A
abductive explanations	Formal Explainable AI
Acquisition of conjectures	Acquiring Maps of Interrelated Conjectures on Sharp Bounds
Adaptive Search Heuristic	A Portfolio-Based Approach to Select Efficient Variable Ordering Heuristics for Constraint Satisfaction Problems
Algorithms	All Questions Answered
almost stable matching	Computing relaxations for the three-dimensional stable matching problem with cyclic preferences
Any-space Algorithms	Completeness Matters: Towards Efficient Caching in Tree-based Synchronous Backtracking Search for DCOPs
auditable solving	Solving with Provably Correct Results: Beyond Satisfiability, and Towards Constraint Programming
automated algorithm configuration	Improved Sample Complexity Bounds for Branch-and-Cut A framework for generating informative benchmark instances
automated algorithm design	Improved Sample Complexity Bounds for Branch-and-Cut
automated instance generation	A framework for generating informative benchmark instances
automation	Exploiting Functional Constraints in Generating Dominance Breaking Nogoods for Constraint Optimization
B
backdoor depth	CSP Beyond Tractable Constraint Languages
backdoor sets	CSP Beyond Tractable Constraint Languages
Bayesian Network Structure Learning	Structured Set Variable Domains in Bayesian Network Structure Learning
benchmarking	A framework for generating informative benchmark instances
Binary Constraint Tree	CNF Encodings of Binary Constraint Trees
bounds	Acquiring Maps of Interrelated Conjectures on Sharp Bounds
branch-and-bound	Improved Sample Complexity Bounds for Branch-and-Cut Peel-and-Bound: Generating Stronger Relaxed Bounds with Multivalued Decision Diagrams
branch-and-cut	Improved Sample Complexity Bounds for Branch-and-Cut
C
Cache	Completeness Matters: Towards Efficient Caching in Tree-based Synchronous Backtracking Search for DCOPs
case study	Plotting: A Planning Problem With Complex Transitions
certifying algorithms	Solving with Provably Correct Results: Beyond Satisfiability, and Towards Constraint Programming
Chvátal-Gomory cuts	Improved Sample Complexity Bounds for Branch-and-Cut
CNF	CNF Encodings of Binary Constraint Trees
Color refinement algorithm	Weisfeiler-Leman Invariant Promise Valued CSPs
Combinatorial optimization	Parallel Hybrid Best-First Search Learning MAX-SAT Models from Examples using Genetic Algorithms and Knowledge Compilation
Complete Search Algorithms	Completeness Matters: Towards Efficient Caching in Tree-based Synchronous Backtracking Search for DCOPs
complexity	Complexity of Minimum-Size Arc-Inconsistency Explanations
Compressed tables	Doctoral Research Award
Constrained Single-Row Facility Layout Problem	Solving the Constrained Single-Row Facility Layout Problem with Decision Diagrams
constraint	CNF Encodings of Binary Constraint Trees
Constraint Acquisition	Constraint Acquisition Based on Solution Counting
Constraint Learning	Learning Constraint Programming Models from Data using Generate-and-Aggregate Learning MAX-SAT Models from Examples using Genetic Algorithms and Knowledge Compilation
Constraint Modelling	A framework for generating informative benchmark instances Understanding how people approach constraint modelling and solving
Constraint Optimization Problems	Exploiting Functional Constraints in Generating Dominance Breaking Nogoods for Constraint Optimization
constraint programming	Sequence Variables for Routing Problems Learning Constraint Programming Models from Data using Generate-and-Aggregate Scheduling the Equipment Maintenance of an Electric Power Transmission Network using Constraint Programming Complexity of Minimum-Size Arc-Inconsistency Explanations Modeling and Solving Parallel Machine Scheduling with Contamination Constraints in the Agricultural Industry Peel-and-Bound: Generating Stronger Relaxed Bounds with Multivalued Decision Diagrams Computing relaxations for the three-dimensional stable matching problem with cyclic preferences Explaining Propagation for Gini and Spread with Variable Mean A Constraint Programming Approach to Ship Refit Project Scheduling Selecting SAT Encodings for Pseudo-Boolean and Linear Integer Constraints MDD-Based Constraint Programming in Haddock
constraint propagation	Complexity of Minimum-Size Arc-Inconsistency Explanations Isomorphisms between STRIPS problems and sub-problems
constraint satisfaction	On Redundancy in Constraint Satisfaction Problems CSP Beyond Tractable Constraint Languages
Constraint Satisfaction Problem	A Portfolio-Based Approach to Select Efficient Variable Ordering Heuristics for Constraint Satisfaction Problems
constraint satisfaction problems	All Questions Answered
Contamination Constraints	Modeling and Solving Parallel Machine Scheduling with Contamination Constraints in the Agricultural Industry
contrastive explanations	Formal Explainable AI
cost function network	Parallel Hybrid Best-First Search
Counting solutions	Early Career Award
cutting planes	Improved Sample Complexity Bounds for Branch-and-Cut An Auditable Constraint Programming Solver
D
data-driven algorithm design	Improved Sample Complexity Bounds for Branch-and-Cut
DCOP	Completeness Matters: Towards Efficient Caching in Tree-based Synchronous Backtracking Search for DCOPs
decision diagrams	Peel-and-Bound: Generating Stronger Relaxed Bounds with Multivalued Decision Diagrams Heuristics for MDD Propagation in Haddock Solving the Constrained Single-Row Facility Layout Problem with Decision Diagrams Doctoral Research Award
Decision trees	Structured Set Variable Domains in Bayesian Network Structure Learning
declarative modeling language	MDD-Based Constraint Programming in Haddock
Dial A Ride	Sequence Variables for Routing Problems
digraphs	Acquiring Maps of Interrelated Conjectures on Sharp Bounds
discrete optimization	Peel-and-Bound: Generating Stronger Relaxed Bounds with Multivalued Decision Diagrams Solving the Constrained Single-Row Facility Layout Problem with Decision Diagrams
distributed algorithms	Weisfeiler-Leman Invariant Promise Valued CSPs
Dominance Breaking	Exploiting Functional Constraints in Generating Dominance Breaking Nogoods for Constraint Optimization
E
Electric power network	Scheduling the Equipment Maintenance of an Electric Power Transmission Network using Constraint Programming
embarrassingly parallel search	Parallel Hybrid Best-First Search
F
Filtering algorithm	Explaining Propagation for Gini and Spread with Variable Mean
finite constraint languages	CSP Beyond Tractable Constraint Languages
first-order logic	Fixed-Template Promise Model Checking Problems
G
generalization guarantees	Improved Sample Complexity Bounds for Branch-and-Cut
Gini index	Explaining Propagation for Gini and Spread with Variable Mean
global constraints	Heuristics for MDD Propagation in Haddock Selecting SAT Encodings for Pseudo-Boolean and Linear Integer Constraints
graph coloring	From Cliques to Colorings and Back Again
Grounded Theory	Understanding how people approach constraint modelling and solving
H
heuristics	Heuristics for MDD Propagation in Haddock
Human-Computer Interaction	Understanding how people approach constraint modelling and solving
I
Insertion Variables	Sequence Variables for Routing Problems
integer programming	Improved Sample Complexity Bounds for Branch-and-Cut
interpretable models	Formal Explainable AI
K
Knowledge Compilation	Nucleus-Satellites Systems of OMDDs for Reducing the Size of Compiled Forms
Knowledge Representation	Nucleus-Satellites Systems of OMDDs for Reducing the Size of Compiled Forms
L
large neighborhood search	DUELMIPs: Jointly Optimizing Software Defined Network Functionality and Security
Large Neighbourhood Search	Large Neighborhood Search for Robust Solutions for Constraint Satisfaction Problems with Ordered Domains
Lazy clause generation	Explaining Propagation for Gini and Spread with Variable Mean
linear constraints	Selecting SAT Encodings for Pseudo-Boolean and Linear Integer Constraints
Linear programming relaxation	Weisfeiler-Leman Invariant Promise Valued CSPs
Local Search	Modeling and Solving Parallel Machine Scheduling with Contamination Constraints in the Agricultural Industry
M
machine learning	Learning Constraint Programming Models from Data using Generate-and-Aggregate Learning MAX-SAT Models from Examples using Genetic Algorithms and Knowledge Compilation Selecting SAT Encodings for Pseudo-Boolean and Linear Integer Constraints Early Career Award
machine learning theory	Improved Sample Complexity Bounds for Branch-and-Cut
Maritime Traffic Control	Trajectory Optimization for Safe Navigation in Maritime Traffic Using Historical Data
max-sat	Learning MAX-SAT Models from Examples using Genetic Algorithms and Knowledge Compilation
Max-SAT Resolution	From Crossing-Free Resolution to Max-SAT Resolution
maximum clique	From Cliques to Colorings and Back Again
MDD	CNF Encodings of Binary Constraint Trees
Metaheuristics	Modeling and Solving Parallel Machine Scheduling with Contamination Constraints in the Agricultural Industry
minimum explanations	Complexity of Minimum-Size Arc-Inconsistency Explanations
Mixed Integer Progamming	Modeling and Solving Parallel Machine Scheduling with Contamination Constraints in the Agricultural Industry
Mixed Integer Programming	Trajectory Optimization for Safe Navigation in Maritime Traffic Using Historical Data DUELMIPs: Jointly Optimizing Software Defined Network Functionality and Security
Mixed-Integer Programming	Solving the Constrained Single-Row Facility Layout Problem with Decision Diagrams
Model Checking Problem	Fixed-Template Promise Model Checking Problems
Model Counter	Constraint Acquisition Based on Solution Counting
Model Synthesis	Learning Constraint Programming Models from Data using Generate-and-Aggregate
Modelling	Plotting: A Planning Problem With Complex Transitions
Multi-Agent Path Coordination	Trajectory Optimization for Safe Navigation in Maritime Traffic Using Historical Data
Multi-homomorphism	Fixed-Template Promise Model Checking Problems
multi-valued decision diagrams	MDD-Based Constraint Programming in Haddock
music composition	Combining Reinforcement Learning and Constraint Programming for Sequence-Generation Tasks with Hard Constraints
N
Negative tables	Doctoral Research Award
network security	DUELMIPs: Jointly Optimizing Software Defined Network Functionality and Security
networks/graphs	Peel-and-Bound: Generating Stronger Relaxed Bounds with Multivalued Decision Diagrams
NFA	CNF Encodings of Binary Constraint Trees
O
optimization	Structured Set Variable Domains in Bayesian Network Structure Learning A Constraint Programming Approach to Ship Refit Project Scheduling
Ordered Multivalued Decision Diagram	Nucleus-Satellites Systems of OMDDs for Reducing the Size of Compiled Forms
P
parallel branch-and-bound	Parallel Hybrid Best-First Search
Parallel Machine Scheduling	Modeling and Solving Parallel Machine Scheduling with Contamination Constraints in the Agricultural Industry
parameterized complexity	CSP Beyond Tractable Constraint Languages
Passive Learning	Constraint Acquisition Based on Solution Counting
Patient Transportation	Sequence Variables for Routing Problems
Planning	Plotting: A Planning Problem With Complex Transitions
polymorphism	On Redundancy in Constraint Satisfaction Problems
Portfolio	A Portfolio-Based Approach to Select Efficient Variable Ordering Heuristics for Constraint Satisfaction Problems
project management	A Constraint Programming Approach to Ship Refit Project Scheduling
Promise Constraint Satisfaction Problem	Fixed-Template Promise Model Checking Problems
Promise Valued Constraint Satisfaction Problem	Weisfeiler-Leman Invariant Promise Valued CSPs
Proof	From Crossing-Free Resolution to Max-SAT Resolution
proof logging	An Auditable Constraint Programming Solver Solving with Provably Correct Results: Beyond Satisfiability, and Towards Constraint Programming
propagation	Heuristics for MDD Propagation in Haddock
propagation strength	CNF Encodings of Binary Constraint Trees
Propositional planning	Isomorphisms between STRIPS problems and sub-problems
pseudo-Boolean constraints	Selecting SAT Encodings for Pseudo-Boolean and Linear Integer Constraints
R
redundancy	On Redundancy in Constraint Satisfaction Problems
reinforcement learning	Combining Reinforcement Learning and Constraint Programming for Sequence-Generation Tasks with Hard Constraints Building a Constraint Programming Solver Guided by Machine Learning: Opportunities and Challenges
relaxation	Computing relaxations for the three-dimensional stable matching problem with cyclic preferences
resource-constrained project scheduling problem	A Constraint Programming Approach to Ship Refit Project Scheduling
Robust Solutions	Large Neighborhood Search for Robust Solutions for Constraint Satisfaction Problems with Ordered Domains
S
sample complexity	Improved Sample Complexity Bounds for Branch-and-Cut
SAT encodings	Selecting SAT Encodings for Pseudo-Boolean and Linear Integer Constraints
SAT Sampling	On Quantitative Testing of Samplers
SAT solver	Isomorphisms between STRIPS problems and sub-problems
SAT solvers	On Quantitative Testing of Samplers
Satisfiability	From Crossing-Free Resolution to Max-SAT Resolution From Cliques to Colorings and Back Again Early Career Award
scheduling	A Constraint Programming Approach to Ship Refit Project Scheduling
search heuristic	Building a Constraint Programming Solver Guided by Machine Learning: Opportunities and Challenges
sequence generation	Combining Reinforcement Learning and Constraint Programming for Sequence-Generation Tasks with Hard Constraints
Sequence Variables	Sequence Variables for Routing Problems
sequencing	Peel-and-Bound: Generating Stronger Relaxed Bounds with Multivalued Decision Diagrams
Ship refit planning	A Constraint Programming Approach to Ship Refit Project Scheduling
Simulated Annealing	Modeling and Solving Parallel Machine Scheduling with Contamination Constraints in the Agricultural Industry
Solution counting	Constraint Acquisition Based on Solution Counting
solver engine	Building a Constraint Programming Solver Guided by Machine Learning: Opportunities and Challenges
Spread constraint	Explaining Propagation for Gini and Spread with Variable Mean
Subgraph isomorphism	Isomorphisms between STRIPS problems and sub-problems
Symmetric fractional polymorphisms	Weisfeiler-Leman Invariant Promise Valued CSPs
T
Testing of Samplers	On Quantitative Testing of Samplers
The Art of Computer Programming	All Questions Answered
three-dimensional stable matching with cyclic preferences	Computing relaxations for the three-dimensional stable matching problem with cyclic preferences
Trajectory Learning	Trajectory Optimization for Safe Navigation in Maritime Traffic Using Historical Data
Transmission maintenance scheduling	Scheduling the Equipment Maintenance of an Electric Power Transmission Network using Constraint Programming
tree search	Improved Sample Complexity Bounds for Branch-and-Cut
trustworthy decision making	An Auditable Constraint Programming Solver
TSPTW	Sequence Variables for Routing Problems
Turan number	On Redundancy in Constraint Satisfaction Problems
U
Uncertainty	Large Neighborhood Search for Robust Solutions for Constraint Satisfaction Problems with Ordered Domains
User study	Understanding how people approach constraint modelling and solving
V
Variable Ordering Heuristic	A Portfolio-Based Approach to Select Efficient Variable Ordering Heuristics for Constraint Satisfaction Problems
Vehicle Routing	Sequence Variables for Routing Problems
W
weighted constraint satisfaction problem	Parallel Hybrid Best-First Search

Disclaimer | Powered by EasyChair Smart Program