| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428440 | Information Processing Letters | 2006 | 5 Pages |
Abstract
The complexity of deciding equivalence of a formula to an extension of a default theory is investigated for the Reiter, justified, constrained, and rational semantics.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
