The DLS algorithm
Circumscription.
Formula:
all x (Bird(x) & -Ab(x)->Flies(x)) & Bird(tweety) & Bird(fred) & Ab(fred) & -tweety=fred
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