Minc: A Deniable Expert System That Reasons With Simplifying Assumptions.

Sankar Virdhagriswaran; Niki Afshartous

doi:10.1117/12.940600

11 May 1987 Minc: A Deniable Expert System That Reasons With Simplifying Assumptions.

Sankar Virdhagriswaran, Niki Afshartous

Proceedings Volume 0786, Applications of Artificial Intelligence V; (1987) https://doi.org/10.1117/12.940600
Event: 1987 Technical Symposium Southeast on Optics, Electro-Optics, and Sensors, 1987, Orlando, FL, United States

Abstract

Proposing specific computer systems to meet customer requirements expressed at a very high level is an iterative process. Performance prediction rules are used to generate intermediate configurations based on highly abstract inputs. These intermediate configurations are then used interactively to further define the requirements. Conclusions reached based on incomplete information are denied and new information is input in the system. This paper describes an expert system under development which uses an Extended Contradiction Resolution Mechanism based on a Truth Maintenance System (TMS) to implement this interactive computer configuration generation process.

Citation Download Citation

Sankar Virdhagriswaran and Niki Afshartous "Minc: A Deniable Expert System That Reasons With Simplifying Assumptions.", Proc. SPIE 0786, Applications of Artificial Intelligence V, (11 May 1987); https://doi.org/10.1117/12.940600

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