Default Knowledge With Partial Matching

Ronald R. Yager

doi:10.1117/12.969775

1 March 1990 Default Knowledge With Partial Matching

Ronald R. Yager

Proceedings Volume 1192, Intelligent Robots and Computer Vision VIII: Algorithms and Techniques; (1990) https://doi.org/10.1117/12.969775
Event: 1989 Symposium on Visual Communications, Image Processing, and Intelligent Robotics Systems, 1989, Philadelphia, PA, United States

Abstract

We look at the problem of default reasoning. We discuss some of the key issues which arise in nonmonotonic reasoning. In particular, we discuss the essential fixed point nature of nonmonotonic reasoning and the issue of priority. We introduce a modal like operator to help in the representation of default knowledge. This operator allows for the representation of partial matching. In addition, it concerns itself with possibilities based upon the current state of the knowledge. We investigate this operator in binary logic and approximate reasoning.

Citation Download Citation

Ronald R. Yager "Default Knowledge With Partial Matching", Proc. SPIE 1192, Intelligent Robots and Computer Vision VIII: Algorithms and Techniques, (1 March 1990); https://doi.org/10.1117/12.969775

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available