Arrow Research search
Back to AAAI

AAAI 1993

Restricted Monotonicity

Conference Paper Nonmonotonic Logic Artificial Intelligence

Abstract

Vladimir Lifschitz* Department of Computer Sciences and Department of Philosophy University of Texas at Austin Austin, TX 78712 Examples ation. When additional assumptions are made, the class of domains that are being described becomes smaller, so that the class of conclusions that are true in all the domains becomes larger. As a result, a satisfactory solution to a parametric knowledge representation problem on the basis of some nonmonotonic formali’ sm can be expected to have a certain formal property, that we call restricted monotonicity. We argue that it is important to recognize parametric knowledge representation problems and to verify restricted monotonicity fir their proposed solutions.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
AAAI Conference on Artificial Intelligence
Archive span
1980-2026
Indexed papers
28718
Paper id
959562013160157138