Browsing by Author "Bulatov, Andrei A."

Sort by: Order: Results:

  • Dismantlability, connectedness, and mixing in relational structures
    Briceño, Raimundo; Bulatov, Andrei A.; Dalmau, Víctor; Larose, Benoit (Elsevier, 2021)
    The Constraint Satisfaction Problem (CSP) and its counting counterpart appears under different guises in many areas of mathematics, computer science, and elsewhere. Its structural and algorithmic properties have been shown ...
  • Learning intersection-closed classes with signatures
    Bulatov, Andrei A.; Chen, Hubie; Dalmau, Víctor (Elsevier, 2007)
    Intersection-closed classes of concepts arise naturally in many contexts and have been intensively studied in computational learning theory. In this paper, we study intersection-closed classes that contain the concepts ...
  • Towards a dichotomy theorem for the counting constraint satisfaction problem
    Bulatov, Andrei A.; Dalmau, Víctor (Elsevier, 2007)
    The Counting Constraint Satisfaction Problem (#CSP) can be expressed as follows: given a set of variables, a set of values that can be taken by the variables, and a set of constraints specifying some restrictions on the ...