The DLS algorithm
Circumscription.
Formula:
all x y xa xs (-Ab(asp(x,y),xa,xs) & Poss(xa,xs) -> (C(x,y,xs) <-> R(x,y,xa,xs))) & all x y xa xs (Poss(paint(x,y),xs) -> R(x,y,paint(x,y),xs)) & all x y1 y2 xa xs (R(x,y1,xa,xs) & R(x,y2,xa,xs) -> y1=y2) & all x1 y1 x2 y2 (paint(x1,y1)=paint(x2,y2) -> (x1=x2 & y1=y2)) & all x y1 y2 xs (C(x,y1,xs) & C(x,y2,xs) -> y1=y2) & all x1 x2 y1 y2 (asp(x1,y1)=asp(x2,y2)-> x1=x2 & y1=y2)
Predicates to be minimized (separate with commas):
Predicates to be varied (separate with commas):
Generate all solutions and choose the shortest (default = no)
Generate the output unformated (default = no)
Example of a filled in form
Main page
|
DLS page
|
Syntax