Feature structures: a logical theory with application to language analysis
Feature structures: a logical theory with application to language analysis
The logic of typed feature structures
The logic of typed feature structures
Feature structures and nonmonotonicity
Computational Linguistics - Special issue on inheritance: I
A practical approach to multiple default inheritance for unification-based lexicons
Computational Linguistics - Special issue on inheritance: II
Domains for Denotational Semantics
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Defaults in unification grammar
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
DATR: a language for lexical knowledge representation
Computational Linguistics
Nonmonotonic consequences in default domain theory
Annals of Mathematics and Artificial Intelligence
Default representation in constraint-based frameworks
Computational Linguistics
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
User-defined nonmonotonicity in unification-based formalisms
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
| Hi-index | 0.00 |
Suppose we have a feature system, and we wish to add default values in a well-defined way. We might start with Kasper-Rounds logic, and use Reiter's example to form it into a default logic. Giving a node a default value would be equivalent to saying "if it is consistent for this node to have that value, then it does." Then we could use default theories to describe feature structures. The particular feature structure described would be the structure that supports the extension of the default theory. This is, in effect, what the theory of nonmonotonic sorts gives you. This paper describes how that theory derives from what is described above.