Loading...
Please wait, while we are loading the content...
Similar Documents
Institut national de recherche en informatique et en automatique.
| Content Provider | CiteSeerX |
|---|---|
| Author | Euzenat, Jr Me Euzenat, Jrme Euzenat, Jdrme |
| Abstract | Non monotonic reason maintenance systems (RMS) are able, provided with a dependency graph (which represents a reasoning), to return a weakly grounded labelling of that graph (which represents a set of beliefs that the reasoner can hold). There can be several weakly grounded labellings. This work investigates the labelling process of these graphs in order to find parts of the graph which lead to multiple labellings: the multiple labelling generators (MLG). Two criteria are presented in order to isolate them. It is proved that: they do not belong to stratified even strongly connected components (SCC) of the complete support graph. |
| File Format | |
| Access Restriction | Open |
| Content Type | Text |