Sign inSign in
ConceptAI & ML

Arc consistency

A property of a constraint satisfaction problem where for every arc between two variables, every value in the domain of the first variable has a corresponding value in the domain of the second variable that satisfies the constraint.
as Pieter Abbeel defines itUC BerkeleyThe wording closest to all 3 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Pieter Abbeel

    UC Berkeley · Undergraduate

    An arc is consistent if for every value in the tail there is some value in the head which can be assigned without violating a constraint.
    • 53:45Constraint Satisfaction Problems (CSPs) Part 1/2
  • Brian Yu

    Harvard University · Undergraduate

    When all the values in a variable's domain satisfy the variable's binary constraints.
    • 6:34:35Harvard CS50’s Artificial Intelligence with Python – Full University Course

Connections

12

The lectures that define it or assume it, and the concepts next to it.

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.