Complexity Results for Default Reasoning from Conditional Knowledge Bases
<p>Conditional knowledge bases have been proposed as belief bases that include defeasible rules (also called defaults) of the form \"<em>phi->psi</em>\", which informally read as \"generally, if <em>phi</em> then <em>psi</em>\". Su...
| Main Authors: | , |
|---|---|
| Format: | Conference item |
| Published: |
Morgan Kaufmann
2000
|