ASSUMPTION ANALYSES IN COMPILED LOGIC-BASED DECISION SUPPORT SYSTEMS (LDSSs)

Michael C. Chen*, Lawrence J. Henschen

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We describe a LDSS which extends and improves on prior proposals. It uses a connection graph to compile programs for handling ordinary queries, thus eliminating the need for deductive search at query time. It provides for assumption analyses (like 'what-if' questions) by allowing changes to the rules (clauses) of the system and tracing the effects of such changes, thereby avoiding the need to recompile the whole system. It allows certain existentially quantified formulas to participate in the LDSS as constraints on answers produced by rules. Such a LDSS exhibits desirable characteristics of general decision support systems like handling semistructured problems and being supporting, descriptive, effective, and evolutionary. Future work includes interfacing to large statistical packages and dealing with aggregate functions like average.

Original languageEnglish (US)
Title of host publicationUnknown Host Publication Title
PublisherACM
Number of pages1
ISBN (Print)0897911504
StatePublished - Dec 1 1985

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'ASSUMPTION ANALYSES IN COMPILED LOGIC-BASED DECISION SUPPORT SYSTEMS (LDSSs)'. Together they form a unique fingerprint.

Cite this