Open AccessA BTP-Based Family of Variable Elimination Rules for Binary CSPs
Author(s) -
Achref El Mouelhi
Publication year - 2017
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v31i1.11126
Subject(s) - constraint satisfaction problem , merge (version control) , satisfiability , heuristics , mathematics , computer science , binary number , mathematical optimization , binary tree , combinatorics , algorithm , artificial intelligence , arithmetic , probabilistic logic , information retrieval
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom