The DLS algorithm
Circumscription.
Formula:
all x y z (-Ab(x) & C(x,y) & C(wife(x),z) -> y=z) & all x y z (C(x,y) & C(x,z) -> y=z) & all x exists y (C(x,y))
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
|
NAT page
|
Syntax