Examples presented at LPNMR '97 (Dagstuhl). Those examples whose number appears
in brackets probably won't be presented.


1.   The classic ancestor example for deductive closure.
 
     `dl ancestor ancestor.db1`

     ancestor.db2 contains a larger database.     


2.   3-colorability 

     3col.l6 is a ladder graph with 6 elements, 3col.l10 has 10 elements;

 [a] With a non-disjunctive program.

     `dl 3coln 3col.l6`

 [b] With a disjunctive program

     `dl 3colv 3col.l6`

  c. With a disjunctive program and constraints

     `dl 3col 3col.l6`


[3]  Boolean 3-colorability 
     (a generalization of graph 3-uncolorability that is $\Sigma^P_2$ complete)

     `dl bool-3col`


[4]  An artificial example from Cristi that exhibits full hardness for the
     model checker 

     `dl full-head-cycle`


5.   Brave & Cautious reasoning: Strategic companies ($\Sigma^P_2$)

     `dl strat-comp` (with "-FB" resp. "-FC")

     - brave: "strategic(panino)"
     - cautious: "strategic(panino)"
     - cautious: "strategic(barilla)"


6.   General and single failure diagnosis of a computer network

     `dl network* -FD`
     `dl network* -FDsingle`


7.   Key finding for relational databases with minimal diagnosis

  a. An educational institution with Teachers, Classes, Hours, Rooms, 
     and Students.

     `dl edu-keys* -FDmin`

 [b] A "classic" example

     `dl keys* -FDmin`


[8]  All three diagnosis modes with a single example that consists of a
     linear structure.

     `dl diag* -FD`
     `dl diag* -FDsingle`
     `dl diag* -FDmin`


9.   Deductive Closure in SQL3 -- list of materials 

     `dl materials.*`
