Search Results for author:
Found 3 papers, 0 papers with code
Partial Queries for Constraint Acquisition
Learning constraint networks is known to require a number of membership queries exponential in the number of variables.
On Singleton Arc Consistency for CSPs Defined by Monotone Patterns
Singleton arc consistency is an important type of local consistency which has been recently shown to solve all constraint satisfaction problems (CSPs) over constraint languages of bounded width.
On Backdoors To Tractable Constraint Languages
In the context of CSPs, a strong backdoor is a subset of variables such that every complete assignment yields a residual instance guaranteed to have a specified property.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
