TALK KEYWORD INDEX

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

- | |

- Data Mining | |

- High Utility Itemsets | |

- Propositional Satisfiability | |

A | |

abductive explanations | |

Acquisition of conjectures | |

Adaptive Search Heuristic | |

Algorithms | |

almost stable matching | |

Any-space Algorithms | |

auditable solving | |

automated algorithm configuration | |

automated algorithm design | |

automated instance generation | |

automation | |

B | |

backdoor depth | |

backdoor sets | |

Bayesian Network Structure Learning | |

benchmarking | |

Binary Constraint Tree | |

bounds | |

branch-and-bound | |

branch-and-cut | |

C | |

Cache | |

case study | |

certifying algorithms | |

Chvátal-Gomory cuts | |

CNF | |

Color refinement algorithm | |

Combinatorial optimization | |

Complete Search Algorithms | |

complexity | |

Compressed tables | |

Constrained Single-Row Facility Layout Problem | |

constraint | |

Constraint Acquisition | |

Constraint Learning | |

Constraint Modelling | |

Constraint Optimization Problems | |

constraint programming | |

constraint propagation | |

constraint satisfaction | |

Constraint Satisfaction Problem | |

constraint satisfaction problems | |

Contamination Constraints | |

contrastive explanations | |

cost function network | |

Counting solutions | |

cutting planes | |

D | |

data-driven algorithm design | |

DCOP | |

decision diagrams | |

Decision trees | |

declarative modeling language | |

Dial A Ride | |

digraphs | |

discrete optimization | |

distributed algorithms | |

Dominance Breaking | |

E | |

Electric power network | |

embarrassingly parallel search | |

F | |

Filtering algorithm | |

finite constraint languages | |

first-order logic | |

G | |

generalization guarantees | |

Gini index | |

global constraints | |

graph coloring | |

Grounded Theory | |

H | |

heuristics | |

Human-Computer Interaction | |

I | |

Insertion Variables | |

integer programming | |

interpretable models | |

K | |

Knowledge Compilation | |

Knowledge Representation | |

L | |

large neighborhood search | |

Large Neighbourhood Search | |

Lazy clause generation | |

linear constraints | |

Linear programming relaxation | |

Local Search | |

M | |

machine learning | |

machine learning theory | |

Maritime Traffic Control | |

max-sat | |

Max-SAT Resolution | |

maximum clique | |

MDD | |

Metaheuristics | |

minimum explanations | |

Mixed Integer Progamming | |

Mixed Integer Programming | |

Mixed-Integer Programming | |

Model Checking Problem | |

Model Counter | |

Model Synthesis | |

Modelling | |

Multi-Agent Path Coordination | |

Multi-homomorphism | |

multi-valued decision diagrams | |

music composition | |

N | |

Negative tables | |

network security | |

networks/graphs | |

NFA | |

O | |

optimization | |

Ordered Multivalued Decision Diagram | |

P | |

parallel branch-and-bound | |

Parallel Machine Scheduling | |

parameterized complexity | |

Passive Learning | |

Patient Transportation | |

Planning | |

polymorphism | |

Portfolio | |

project management | |

Promise Constraint Satisfaction Problem | |

Promise Valued Constraint Satisfaction Problem | |

Proof | |

proof logging | |

propagation | |

propagation strength | |

Propositional planning | |

pseudo-Boolean constraints | |

R | |

redundancy | |

reinforcement learning | |

relaxation | |

resource-constrained project scheduling problem | |

Robust Solutions | |

S | |

sample complexity | |

SAT encodings | |

SAT Sampling | |

SAT solver | |

SAT solvers | |

Satisfiability | |

scheduling | |

search heuristic | |

sequence generation | |

Sequence Variables | |

sequencing | |

Ship refit planning | |

Simulated Annealing | |

Solution counting | |

solver engine | |

Spread constraint | |

Subgraph isomorphism | |

Symmetric fractional polymorphisms | |

T | |

Testing of Samplers | |

The Art of Computer Programming | |

three-dimensional stable matching with cyclic preferences | |

Trajectory Learning | |

Transmission maintenance scheduling | |

tree search | |

trustworthy decision making | |

TSPTW | |

Turan number | |

U | |

Uncertainty | |

User study | |

V | |

Variable Ordering Heuristic | |

Vehicle Routing | |

W | |

weighted constraint satisfaction problem |