Paper Info
Title
Assumption analysis in compiled logic-based decision support systems (LDSSs) (abstract only)
Abstract
We describe a LDSS which extends and improves on prior proposals1. It uses a connection graph to compile programs for handling ordinary queries2, 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 system3. 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 semi-structured problems and being supporting, descriptive, effective, and evolutionary. Future work includes interfacing to large statistical packages and dealing with aggregate functions like average.
Year
DOI
Venue
1985
10.1145/320599.322543
ACM Conference on Computer Science
Keywords
Field
DocType
certain existentially,future work,deductive search,large statistical package,desirable characteristic,connection graph,aggregate function,general decision support system,logic-based decision support system,assumption analysis,ordinary queries2,compilers,portability,grammars,semantics,syntax,error correction,decision support system,connected graph
Rule-based machine translation,Programming language,Computer science,Decision support system,Interfacing,Theoretical computer science,Compiler,Software portability,Syntax,Semantics,Tracing
Conference
ISBN
Citations 
PageRank 
0-89791-150-4
1
0.48
References 
Authors
1
2
Name
Order
Citations
PageRank
Michael C. Chen1837.68
Lawrence J. Henschen2478280.94