I t is shown tha t the method of anal y t i c a l h e u r i s t i c s / 2 / , b ina r i zed formal i s m / 3 / and the model o f A r t i f i c i a l Conceptual I n t e l l i g e n c e / 4 / could be succe s s f u l l y used as a basis f o r desc r ib ing the process of " a r r i v x n g at dec is ions" based on the u n i f i e d d e s c r i p t i o n of " be g inn ing of c o n d i t i o n s " ,...

ARCHITECTURE The relationships within the domain of findings and the relationships within the domain of hypotheses are far more numerous and complex than their interrelationships. However, during the initial stages of diagnostic activity, the shifts of reasoning from the findings base to the diagnostic (hypotheses) base are crucial, as they establish the initial context for the problemsolving a...

This paper reports our continuing e orts and initial results with the problem of admission control in real time networks This problem was rst addressed by the Tenet group and their approach was based on the assumption that the link level scheduling was EDD Earliest Due Date based Our work departs from this assumption by addressing the problem in the context of any arbit rary dynamic xed priorit...

Learning problem solving from examples suffers from three problems. F i r s t , there is a strong dependency on the order of the presented examples. Second, each example has i t s own pecul iar i t ies which must be overcome. Third, the size of the generalization space can be huge, even if the instance language is small. By adding perturbation operators to the concept tree each of these problem...

We present various heu r i s t i c techniques fo r use in proving the correctness of computer programs. The techniques are designed to obta in automat ical ly the " induc t i ve asser t ions" attached to the loops of the program which previously required human "understanding" of the program's performance. We d i s t i ngu ish between two general approaches: one in which we obta in the induct iv...

Th~s paper presents an on-going project mtended to enhance WordNet molpholog~cally and semanttcally The mottvatmn for th~s work steams from the current hm~tat~ons of WordNet when used as a hngmst~c knowledge base We enwmon a software tool that automatically parses the conceptual defining glosses, attributing part-ofspeech tags and phrasal brackets The nouns, verbs, adjectives and adverbs from e...

This is a report of the application of the Model Generation Theorem Prover developed at ICOT to problems in the theory of finite quasigroups. Several of the problems were pre­ viously open. In this paper, we discuss our the­ orem proving methods, related to those of the existing provers SATCHMO (Manthey, Bry) and OTTER (McCune), and note how parallel processing on the ICOT Parallel Inference Ma...

Th e performance of a mean field theory (MFT) neu ral network technique for finding approximate solutions to optimi zation problems is invest igat ed for the case of the minimum cut graph bisectio n problem, which is NPcomplete. We address the issues of solut ion quality, progr amming complexity, convergence tim es and scala bility. Both standard random gr aphs an d mor e st ruct ured geomet ri...

aspect BalancingBridgeTemplate { abstract pointcut i n s t a n t i a t i o n ( Object w) ; abstract pointcut handl ing ( Object w) ; after ( Object w) : i n s t a n t i a t i o n (w) { ba lance r . n o t i f y I n s t an t i a t i o n (w) ; } after ( Object w) : handl ing (w) { ba lancer . not i fyHand l ing (w) ; } } Listing 8. Aspect Template: Balancing Bridge. To integrate the balancing comp...

Heurist ic search procedures are useful in a large number of problems of pract ica l impor tance . Such procedures operate by searching several paths in a search space at the same t i m e , expand ing some paths more qu ick ly t han others depending on which paths look most promising. Of ten large amounts of t ime are required in keeping track of the contro l knowledge. For some problems, th is...