Resolution Conflict-Driven Clause Learning



consider 2 clauses



(
a

b

c
)


{\displaystyle (a\lor b\lor c)}

,



(
¬
c

d

¬
e
)


{\displaystyle (\neg c\lor d\lor \neg e)}

. clause



(
a

b

d

¬
e
)


{\displaystyle (a\lor b\lor d\lor \neg e)}

, obtained merging 2 clauses , removing both



¬
c


{\displaystyle \neg c}

,



c


{\displaystyle c}

, called resolvent of 2 clauses.







Comments

Popular posts from this blog

Mobility.2C training and insignia Impi

Expenses controversy Ian Gibson (politician)

11th century parish church of St Leonard Hythe, Kent