No subject
P.Refenes@CS.UCL.AC.UK
P.Refenes at CS.UCL.AC.UK
Fri Feb 9 10:12:42 EST 1990
The Knowledge Engineering Review is planning a special issue on
"Combined Symbolic & Numeric Processing Systems". Is there anyone
out there with an interest in "theories and techniques for mixed
symbolic/numeric processing systems" who is willing to write a
comprehensive review paper?
There follow the short notes for contributors. The first one is
in straight ascii, the second in postscript:
==========================================================
The Knowledge Engineering Review
Published by Cambridge University Press
Special Issue on:
Combined Symbolic & numeric processing Systems
NOTES FOR CONTRIBUTORS
Editor:
Apostolos N. REFENES
Department of Computer Science BITNET: refenes%uk.ac.ucl.cs at ukacrl
University College London UUCP: {...mcvax!ukc!}ucl.cs!refenes
Gower Street, London, WC 1 6BT, UK. ARPANet: refenes at cs.ucl.ac.uk
THE KNOWLEDGE ENGINEERING REVIEW - SPECIAL ISSUE ON
Inferences and Algorithms: co-operating in computation
or
(Symbols and Numbers: co-operating in computation)
THEME
The theme of this special issue of KER is to review
developments in the subject of integrated symbolic and
numeric computation. The subject area of combined
symbolic and numeric computation is a prominent
emerging subject. In Europe, ESPRIT is already funding
a $15m project to investigate the integration of
symbolic and numeric computation and is planning to
issue a further call for a $20m type A project in
Autumn this year. In the USA, various funding agencies,
like the DoD and NSF, have been heavily involved in
supporting research into the integration of symbolic
and numeric computing systems over the last few years.
Algorithmic (or numeric) computational methods are
mostly used for low-level, data driven computations to
achieve problem solutions by exhaustive evaluation, and
are based on static, hardwired decision making
procedures. The statisticity and regularity of the
knowledge, data, and control structures that are
employed by such algorithmic methods permits their
efficient mapping and execution on conventional
supercomputers. However, the scale of the computation
increases often non-linearly with the problem size, and
the strength of the data inter-dependencies.
Symbolic (or inference) computational methods have the
capability to drastically reduce the required
computations by using high-level, model-driven
knowledge, and hypothesis-and-test techniques about the
application domain. However, the irregularity,
uncertainty, and dynamicity of the knowledge, data, and
control structures that are employed by symbolic
methods presents a major obstacle to their efficient
mapping and execution on conventional parallel
computers.
This has led many researchers to propose the
development of integrated numeric and symbolic
computation systems, which have the potential to
achieve optimal solutions for large classes of
problems, in which algorithmic and symbolic component
are engaged in close co-operation. The need for such
interaction is particularly obvious in such
applications as image understanding, speech
recognition, weather forecasting, financial
forecasting, the solution of partial differential
equations etc. In these applications, numeric software
components are tightly coupled with their symbolic
counterparts, which in turn, have the power to feed-
back adjustable algorithm parameters, and hence,
support a "hypothesis-and-test" capability required to
validate the numeric data.
It is this application domain that provided the
motivation for developing theoretical frameworks,
techniques, programming languages, and computer
architectures to efficiently support both symbolic and
numeric computation. The special issue of The
Knowledge Engineering Review KER aims to provide a
comprehensive and timely review of the state of the art
in integrated symbolic and numeric knowledge
engineering systems. The special issue will cover the
topics outlined in the next section.
TOPICS
There are four important topics that are related to the
subject area of integrated symbolic and numeric
computation. This special issue will have one
comprehensive review paper in each of the topics, and a
general overview article (or editorial) to link them
together.
1. Theory and Techniques
Traditional theoretical frameworks for decision
making are are generally considered to be too
restrictive for developing practical knowledge
based systems. The principal set of restrictions is
that classical algorithmic decision theories and
techniques do not address the need to reason about
the decision process itself. Classical techniques
cannot reflect on what the decision is, what the
options are, what methods should be (or have been)
used in making decision and so forth. Approaches
that accommodate numerical methods but extend them
with non-monotonic inference techniques are
described extensively in the literature e.g
[Coguen, Eberbach, Vanneschi, Fox et al, etc]. What
is needed is an in-depth analysis, taxonomy and
evaluation of these techniques. This review of the
theoretical approaches and background into
integrated symbolic and numeric computation should
be highly valuable to those involved in symbolic,
numeric, and integrated symbolic plus numeric
computation.
2. Applications
Here there would be a review of the applications
which provide the stimulus, and demonstrate
techniques for integrating symbolic and numeric
computing components. Effectiveness considerations
and performance gains should also be included where
appropriate. Model applications may include: image
understanding, weather forecasting, financial
forecasting, expert systems for PDE solving,
simulation, real-time process control,etc. The
review article should expose the common ground that
these applications share, the potential improvement
in reasoning and computation efficiency, the
requirements that they impose on the theoretical
frameworks, programming languages, and computer
architecture.
3. Programming Languages
This would be a review of the programming languages
which provide the means for integrating symbolic
and numeric computations. The article(s) should
describe the competing approaches, i.e. integration
through homogenisation, and integration through
interfacing heterogeneous systems. Language design
issues, features for parallelism, etc. Possible
languages that might be considered are: Spinlog,
Orient84K, LOOPS , Cornerstone, Solve, Parle, etc.
A comparative analysis of the involved languages
should be included.
4. Computer Architecture
This review should give a comprehensive review of
the novel computer architectures that are involved,
their basic operating principles, their internal
structure, a comparative analysis, etc. Possible
architectures that might be considered are:
PADMAVATI, SPRINT, ...
DEADLINES
March 15th - Extended Abstract.
April 30th - Full Manuscript.
==================================================================
%!PS-Adobe-1.0
%%Creator: beans.cs.ucl.ac.uk:pnr (Paul Refenes,301,3717)
%%Title: stdin (ditroff)
%%CreationDate: Fri Feb 9 13:53:37 1990
%%EndComments
% Start of psdit.pro -- prolog for ditroff translator
% Copyright (c) 1985,1987 Adobe Systems Incorporated. All Rights Reserved.
% GOVERNMENT END USERS: See Notice file in TranScript library directory
% -- probably /usr/lib/ps/Notice
% RCS: $Header: psdit.pro,v 2.2 87/11/17 16:40:42 byron Rel $
/$DITroff 140 dict def $DITroff begin
/fontnum 1 def /fontsize 10 def /fontheight 10 def /fontslant 0 def
% Change at UCL
% /xi {0 72 11 mul translate 72 resolution div dup neg scale 0 0 moveto
/xi {0 72 11 mul translate 0 35 translate 72 resolution div dup neg scale 0 0 moveto
/fontnum 1 def /fontsize 10 def /fontheight 10 def /fontslant 0 def F
/pagesave save def}def
/PB{save /psv exch def currentpoint translate
resolution 72 div dup neg scale 0 0 moveto}def
/PE{psv restore}def
/m1 matrix def /m2 matrix def /m3 matrix def /oldmat matrix def
/tan{dup sin exch cos div}bind def
/point{resolution 72 div mul}bind def
/dround {transform round exch round exch itransform}bind def
/xT{/devname exch def}def
/xr{/mh exch def /my exch def /resolution exch def}def
/xp{}def
/xs{docsave restore end}def
/xt{}def
/xf{/fontname exch def /slotno exch def fontnames slotno get fontname eq not
{fonts slotno fontname findfont put fontnames slotno fontname put}if}def
/xH{/fontheight exch def F}bind def
/xS{/fontslant exch def F}bind def
/s{/fontsize exch def /fontheight fontsize def F}bind def
/f{/fontnum exch def F}bind def
/F{fontheight 0 le {/fontheight fontsize def}if
fonts fontnum get fontsize point 0 0 fontheight point neg 0 0 m1 astore
fontslant 0 ne{1 0 fontslant tan 1 0 0 m2 astore m3 concatmatrix}if
makefont setfont .04 fontsize point mul 0 dround pop setlinewidth}bind def
/X{exch currentpoint exch pop moveto show}bind def
/N{3 1 roll moveto show}bind def
/Y{exch currentpoint pop exch moveto show}bind def
/S /show load def
/ditpush{}def/ditpop{}def
/AX{3 -1 roll currentpoint exch pop moveto 0 exch ashow}bind def
/AN{4 2 roll moveto 0 exch ashow}bind def
/AY{3 -1 roll currentpoint pop exch moveto 0 exch ashow}bind def
/AS{0 exch ashow}bind def
/MX{currentpoint exch pop moveto}bind def
/MY{currentpoint pop exch moveto}bind def
/MXY /moveto load def
/cb{pop}def % action on unknown char -- nothing for now
/n{}def/w{}def
/p{pop showpage pagesave restore /pagesave save def}def
/abspoint{currentpoint exch pop add exch currentpoint pop add exch}def
/dstroke{currentpoint stroke moveto}bind def
/Dl{2 copy gsave rlineto stroke grestore rmoveto}bind def
/arcellipse{oldmat currentmatrix pop
currentpoint translate 1 diamv diamh div scale /rad diamh 2 div def
rad 0 rad -180 180 arc oldmat setmatrix}def
/Dc{gsave dup /diamv exch def /diamh exch def arcellipse dstroke
grestore diamh 0 rmoveto}def
/De{gsave /diamv exch def /diamh exch def arcellipse dstroke
grestore diamh 0 rmoveto}def
/Da{currentpoint /by exch def /bx exch def /fy exch def /fx exch def
/cy exch def /cx exch def /rad cx cx mul cy cy mul add sqrt def
/ang1 cy neg cx neg atan def /ang2 fy fx atan def cx bx add cy by add
2 copy rad ang1 ang2 arcn stroke exch fx add exch fy add moveto}def
/Barray 200 array def % 200 values in a wiggle
/D~{mark}def
/D~~{counttomark Barray exch 0 exch getinterval astore /Bcontrol exch def pop
/Blen Bcontrol length def Blen 4 ge Blen 2 mod 0 eq and
{Bcontrol 0 get Bcontrol 1 get abspoint /Ycont exch def /Xcont exch def
Bcontrol 0 2 copy get 2 mul put Bcontrol 1 2 copy get 2 mul put
Bcontrol Blen 2 sub 2 copy get 2 mul put
Bcontrol Blen 1 sub 2 copy get 2 mul put
/Ybi /Xbi currentpoint 3 1 roll def def 0 2 Blen 4 sub
{/i exch def
Bcontrol i get 3 div Bcontrol i 1 add get 3 div
Bcontrol i get 3 mul Bcontrol i 2 add get add 6 div
Bcontrol i 1 add get 3 mul Bcontrol i 3 add get add 6 div
/Xbi Xcont Bcontrol i 2 add get 2 div add def
/Ybi Ycont Bcontrol i 3 add get 2 div add def
/Xcont Xcont Bcontrol i 2 add get add def
/Ycont Ycont Bcontrol i 3 add get add def
Xbi currentpoint pop sub Ybi currentpoint exch pop sub rcurveto
}for dstroke}if}def
end
/ditstart{$DITroff begin
/nfonts 60 def % NFONTS makedev/ditroff dependent!
/fonts[nfonts{0}repeat]def
/fontnames[nfonts{()}repeat]def
/docsave save def
}def
% character outcalls
/oc {/pswid exch def /cc exch def /name exch def
/ditwid pswid fontsize mul resolution mul 72000 div def
/ditsiz fontsize resolution mul 72 div def
ocprocs name known{ocprocs name get exec}{name cb}
ifelse}def
/fractm [.65 0 0 .6 0 0] def
/fraction
{/fden exch def /fnum exch def gsave /cf currentfont def
cf fractm makefont setfont 0 .3 dm 2 copy neg rmoveto
fnum show rmoveto currentfont cf setfont(\244)show setfont fden show
grestore ditwid 0 rmoveto} def
/oce {grestore ditwid 0 rmoveto}def
/dm {ditsiz mul}def
/ocprocs 50 dict def ocprocs begin
(14){(1)(4)fraction}def
(12){(1)(2)fraction}def
(34){(3)(4)fraction}def
(13){(1)(3)fraction}def
(23){(2)(3)fraction}def
(18){(1)(8)fraction}def
(38){(3)(8)fraction}def
(58){(5)(8)fraction}def
(78){(7)(8)fraction}def
(sr){gsave .05 dm .16 dm rmoveto(\326)show oce}def
(is){gsave 0 .15 dm rmoveto(\362)show oce}def
(->){gsave 0 .02 dm rmoveto(\256)show oce}def
(<-){gsave 0 .02 dm rmoveto(\254)show oce}def
(==){gsave 0 .05 dm rmoveto(\272)show oce}def
end
% DIThacks fonts for some special chars
50 dict dup begin
/FontType 3 def
/FontName /DIThacks def
/FontMatrix [.001 0.0 0.0 .001 0.0 0.0] def
/FontBBox [-220 -280 900 900] def% a lie but ...
/Encoding 256 array def
0 1 255{Encoding exch /.notdef put}for
Encoding
dup 8#040/space put %space
dup 8#110/rc put %right ceil
dup 8#111/lt put %left top curl
dup 8#112/bv put %bold vert
dup 8#113/lk put %left mid curl
dup 8#114/lb put %left bot curl
dup 8#115/rt put %right top curl
dup 8#116/rk put %right mid curl
dup 8#117/rb put %right bot curl
dup 8#120/rf put %right floor
dup 8#121/lf put %left floor
dup 8#122/lc put %left ceil
dup 8#140/sq put %square
dup 8#141/bx put %box
dup 8#142/ci put %circle
dup 8#143/br put %box rule
dup 8#144/rn put %root extender
dup 8#145/vr put %vertical rule
dup 8#146/ob put %outline bullet
dup 8#147/bu put %bullet
dup 8#150/ru put %rule
dup 8#151/ul put %underline
pop
/DITfd 100 dict def
/BuildChar{0 begin
/cc exch def /fd exch def
/charname fd /Encoding get cc get def
/charwid fd /Metrics get charname get def
/charproc fd /CharProcs get charname get def
charwid 0 fd /FontBBox get aload pop setcachedevice
40 setlinewidth
newpath 0 0 moveto gsave charproc grestore
end}def
/BuildChar load 0 DITfd put
%/UniqueID 5 def
/CharProcs 50 dict def
CharProcs begin
/space{}def
/.notdef{}def
/ru{500 0 rls}def
/rn{0 750 moveto 500 0 rls}def
/vr{20 800 moveto 0 -770 rls}def
/bv{20 800 moveto 0 -1000 rls}def
/br{20 770 moveto 0 -1040 rls}def
/ul{0 -250 moveto 500 0 rls}def
/ob{200 250 rmoveto currentpoint newpath 200 0 360 arc closepath stroke}def
/bu{200 250 rmoveto currentpoint newpath 200 0 360 arc closepath fill}def
/sq{80 0 rmoveto currentpoint dround newpath moveto
640 0 rlineto 0 640 rlineto -640 0 rlineto closepath stroke}def
/bx{80 0 rmoveto currentpoint dround newpath moveto
640 0 rlineto 0 640 rlineto -640 0 rlineto closepath fill}def
/ci{355 333 rmoveto currentpoint newpath 333 0 360 arc
50 setlinewidth stroke}def
/lt{20 -200 moveto 0 550 rlineto currx 800 2cx s4 add exch s4 a4p stroke}def
/lb{20 800 moveto 0 -550 rlineto currx -200 2cx s4 add exch s4 a4p stroke}def
/rt{20 -200 moveto 0 550 rlineto currx 800 2cx s4 sub exch s4 a4p stroke}def
/rb{20 800 moveto 0 -500 rlineto currx -200 2cx s4 sub exch s4 a4p stroke}def
/lk{20 800 moveto 20 300 -280 300 s4 arcto pop pop 1000 sub
currentpoint stroke moveto
20 300 4 2 roll s4 a4p 20 -200 lineto stroke}def
/rk{20 800 moveto 20 300 320 300 s4 arcto pop pop 1000 sub
currentpoint stroke moveto
20 300 4 2 roll s4 a4p 20 -200 lineto stroke}def
/lf{20 800 moveto 0 -1000 rlineto s4 0 rls}def
/rf{20 800 moveto 0 -1000 rlineto s4 neg 0 rls}def
/lc{20 -200 moveto 0 1000 rlineto s4 0 rls}def
/rc{20 -200 moveto 0 1000 rlineto s4 neg 0 rls}def
end
/Metrics 50 dict def Metrics begin
/.notdef 0 def
/space 500 def
/ru 500 def
/br 0 def
/lt 250 def
/lb 250 def
/rt 250 def
/rb 250 def
/lk 250 def
/rk 250 def
/rc 250 def
/lc 250 def
/rf 250 def
/lf 250 def
/bv 250 def
/ob 350 def
/bu 350 def
/ci 750 def
/bx 750 def
/sq 750 def
/rn 500 def
/ul 500 def
/vr 0 def
end
DITfd begin
/s2 500 def /s4 250 def /s3 333 def
/a4p{arcto pop pop pop pop}def
/2cx{2 copy exch}def
/rls{rlineto stroke}def
/currx{currentpoint pop}def
/dround{transform round exch round exch itransform} def
end
end
/DIThacks exch definefont pop
ditstart
(psc)xT
576 1 1 xr
1(Times-Roman)xf 1 f
2(Times-Italic)xf 2 f
3(Times-Bold)xf 3 f
4(Times-BoldItalic)xf 4 f
5(Helvetica)xf 5 f
6(Helvetica-Bold)xf 6 f
7(Courier)xf 7 f
8(Courier-Bold)xf 8 f
9(Symbol)xf 9 f
10(DIThacks)xf 10 f
10 s
1 f
xi
%%EndProlog
%%Page: 1 1
10 s 0 xH 0 xS 1 f
2434 192(\302)N
3 f
19 s
1266 704(T)N
1367(he)X
1557(K)X
1676(now)X
1945(ledge)X
2322(E)X
2423(ngineering)X
3155(R)X
3264(eview)X
13 s
1519 880(Published)N
1985(by)X
2121(Cambridge)X
2650(University)X
3139(Press)X
1 f
16 s
518 1584(Special)N
928(Issue)X
1224(on:)X
2 f
18 s
893 1936(Com)N
(bined)S
1521(Sym)X
1761(bolic)X
2085(and)X
2337(Num)X
(eric)S
2869(Processing)X
3545(System)X
3945(s)X
3 f
1431 3504(N)N
1535(O)X
1647(TES)X
1955(FO)X
2155(R)X
2295(C)X
2399(O)X
2511(N)X
2615(TR)X
(IBU)S
(TO)S
3279(R)X
3383(S)X
1 f
518 4944(Editor:)N
11 s
863 5200(Apostolos)N
1242(N.)X
1349(REFENES)X
863 5328(Department)N
1301(of)X
1396(Computer)X
1771(Science)X
2688(BITNET:)X
3048(refenes%uk.ac.ucl.cs at ukacrl)X
863 5456(University)N
1257(College)X
1554(London)X
2688(UUCP:)X
2991({...mcvax!ukc!}ucl.cs!refenes)X
863 5584(Gower)N
1123(Street,)X
1373(London,)X
1691(WC)X
1855(1)X
1921(6BT,)X
2122(UK.)X
2688(ARPANet:)X
3096(refenes at cs.ucl.ac.uk)X
2 p
%%Page: 2 2
11 s 0 xH 0 xS 1 f
2433 256(\302)N
3 f
1079 704(THE)N
1288(KNOWLEDGE)X
1908(ENGINEERING)X
2565(REVIEW)X
2953(-)X
3004(SPECIAL)X
3407(ISSUE)X
3683(ON)X
13 s
1192 960(Inferences)N
1681(and)X
1875(Algorithms:)X
2440(co-operating)X
3027(in)X
3140(computation)X
1 f
11 s
2411 1088(or)N
3 f
1435 1216(\(Symbols)N
1804(and)X
1968(Numbers:)X
2365(co-operating)X
2861(in)X
2957(computation\))X
518 1600(THEME)N
1 f
806 1792(The)N
982(theme)X
1237(of)X
1349(this)X
1517(special)X
1802(issue)X
2018(of)X
2131(KER)X
2347(is)X
2446(to)X
2555(review)X
2834(developments)X
3364(in)X
3473(the)X
3621(subject)X
3911(of)X
4024(integrated)X
806 1920(symbolic)N
1192(and)X
1381(numeric)X
1731(computation.)X
2256(The)X
2454(subject)X
2765(area)X
2972(of)X
3106(combined)X
3515(symbolic)X
3900(and)X
4088(numeric)X
806 2048(computation)N
1274(is)X
1359(a)X
1424(prominent)X
1813(emerging)X
2172(subject.)X
2471(In)X
2571(Europe,)X
10 s
2872(ESPRIT)X
11 s
3165(is)X
3251(already)X
3537(funding)X
3838(a)X
3904($15m)X
4132(project)X
806 2176(to)N
898(investigate)X
1304(the)X
1435(integration)X
1840(of)X
1935(symbolic)X
2281(and)X
2430(numeric)X
2741(computation)X
3227(and)X
3376(is)X
3457(planning)X
3788(to)X
3879(issue)X
4077(a)X
4138(further)X
806 2304(call)N
963(for)X
1094(a)X
1162($20m)X
1392(type)X
1573(A)X
1665(project)X
1939(in)X
2037(Autumn)X
2355(this)X
2512(year.)X
2714(In)X
2816(the)X
10 s
2951(USA)X
11 s
(,)S
3162(various)X
3450(funding)X
3753(agencies,)X
4107(like)X
4269(the)X
10 s
806 2432(DoD)N
11 s
984(and)X
10 s
1131(NSF)X
11 s
1277(,)X
1321(have)X
1509(been)X
1697(heavily)X
1979(involved)X
2310(in)X
2401(supporting)X
2800(research)X
3114(into)X
3274(the)X
3404(integration)X
3809(of)X
3904(symbolic)X
4250(and)X
806 2560(numeric)N
1117(computing)X
1517(systems)X
1818(over)X
1996(the)X
2126(last)X
2271(few)X
2424(years.)X
806 2752(Algorithmic)N
1290(\(or)X
1444(numeric\))X
1814(computational)X
2372(methods)X
2723(are)X
2882(mostly)X
3175(used)X
3389(for)X
3544(low-level,)X
3952(data)X
4152(driven)X
806 2880(computations)N
1329(to)X
1445(achieve)X
1761(problem)X
2102(solutions)X
2468(by)X
2603(exhaustive)X
3026(evaluation,)X
3462(and)X
3635(are)X
3788(based)X
4034(on)X
4168(static,)X
806 3008(hardwired)N
1194(decision)X
1520(making)X
1817(procedures.)X
2256(The)X
2426 0.3011(statisticity)AX
2824(and)X
2984(regularity)X
3360(of)X
3466(the)X
3607(knowledge,)X
4048(data,)X
4250(and)X
806 3136(control)N
1091(structures)X
1468(that)X
1635(are)X
1776(employed)X
2158(by)X
2280(such)X
2475(algorithmic)X
2917(methods)X
3250(permits)X
3549(their)X
3745(ef\256cient)X
4068(mapping)X
806 3264(and)N
969(execution)X
1349(on)X
1474(conventional)X
1967(supercomputers.)X
2583(However,)X
2963(the)X
3108(scale)X
3321(of)X
3431(the)X
3576(computation)X
4055(increases)X
806 3392(often)N
1009(non-linearly)X
1462(with)X
1641(the)X
1771(problem)X
2087(size,)X
2268(and)X
2417(the)X
2547(strength)X
2853(of)X
2948(the)X
3078(data)X
3247(inter-dependencies.)X
806 3584(Symbolic)N
1167(\(or)X
1291(inference\))X
1670(computational)X
2199(methods)X
2521(have)X
2710(the)X
2841(capability)X
3213(to)X
3305(drastically)X
3696(reduce)X
3953(the)X
4084(required)X
806 3712(computations)N
1328(by)X
1462(using)X
1699(high-level,)X
2125(model-driven)X
2645(knowledge,)X
3098(and)X
3270(hypothesis-and-test)X
4000(techniques)X
806 3840(about)N
1053(the)X
1212(application)X
1657(domain.)X
2018(However,)X
2413(the)X
2573(irregularity,)X
3044(uncertainty,)X
3515(and)X
3694(dynamicity)X
4144(of)X
4269(the)X
806 3968(knowledge,)N
1249(data,)X
1452(and)X
1613(control)X
1897(structures)X
2273(that)X
2440(are)X
2581(employed)X
2963(by)X
3085(symbolic)X
3443(methods)X
3776(presents)X
4098(a)X
4171(major)X
806 4096(obstacle)N
1117(to)X
1208(their)X
1392(ef\256cient)X
1703(mapping)X
2034(and)X
2183(execution)X
2548(on)X
2658(conventional)X
3136(parallel)X
3423(computers.)X
806 4288(This)N
1003(has)X
1160(led)X
1308(many)X
1544(researchers)X
1978(to)X
2087(propose)X
2405(the)X
2553(development)X
3049(of)X
3162(integrated)X
3555(numeric)X
3885(and)X
4053(symbolic)X
806 4416(computation)N
1287(systems,)X
1627(which)X
1881(have)X
2086(the)X
2233(potential)X
2582(to)X
2690(achieve)X
2998(optimal)X
3308(solutions)X
3666(for)X
3807(large)X
4022(classes)X
4304(of)X
806 4544(problems,)N
1192(in)X
1297(which)X
1548(algorithmic)X
1992(and)X
2155(symbolic)X
2515(component)X
2943(are)X
3086(engaged)X
3415(in)X
3520(close)X
3737(co-operation.)X
4240(The)X
806 4672(need)N
997(for)X
1123(such)X
1308(interaction)X
1710(is)X
1793(particularly)X
2224(obvious)X
2527(in)X
2620(such)X
2805(applications)X
3256(as)X
3353(image)X
3593(understanding,)X
4138(speech)X
806 4800(recognition,)N
1261(weather)X
1570(forecasting,)X
2014(\256nancial)X
2350(forecasting,)X
2795(the)X
2935(solution)X
3252(of)X
3357(partial)X
3615(differential)X
4039(equations)X
806 4928(etc.)N
990(In)X
1100(these)X
1318(applications,)X
1804(numeric)X
2130(software)X
2469(components)X
2932(are)X
3076(tightly)X
3345(coupled)X
3661(with)X
3855(their)X
4053(symbolic)X
806 5056(counterparts,)N
1285(which)X
1522(in)X
1613(turn,)X
1799(have)X
1987(the)X
2118(power)X
2360(to)X
2452(feed-back)X
2821(adjustable)X
3202(algorithm)X
3569(parameters,)X
4000(and)X
4150(hence,)X
806 5184(support)N
1092(a)X
1153("hypothesis-and-test")X
1932(capability)X
2303(required)X
2618(to)X
2709(validate)X
3011(the)X
3141(numeric)X
3452(data.)X
806 5376(It)N
894(is)X
987(this)X
2 f
1149(application)X
1586(domain)X
1 f
1884(that)X
2051(provided)X
2398(the)X
2540(motivation)X
2958(for)X
3095(developing)X
2 f
3522(theoretical)X
3940(frameworks,)X
806 5504(techniques,)N
1265(programming)X
1808(languages)X
1 f
2170(,)X
2251(and)X
2 f
2437(computer)X
2828(architectures)X
1 f
3352(to)X
3480(ef\256ciently)X
3897(support)X
4220(both)X
806 5632(symbolic)N
1156(and)X
1309(numeric)X
1624(computation.)X
2136(The)X
2299(special)X
2570(issue)X
2772(of)X
2871(The)X
3034(Knowledge)X
3465(Engineering)X
3923(Review)X
10 s
4217(KER)X
11 s
806 5760(aims)N
997(to)X
1090(provide)X
1383(a)X
1446(comprehensive)X
2003(and)X
2154(timely)X
2405(review)X
2668(of)X
2765(the)X
2 f
2896(state)X
3086(of)X
3178(the)X
3309(art)X
1 f
3435(in)X
3527(integrated)X
3903(symbolic)X
4250(and)X
806 5888(numeric)N
1120(knowledge)X
1531(engineering)X
1972(systems.)X
2298(The)X
2460(special)X
2730(issue)X
2931(will)X
3094(cover)X
3314(the)X
3447(topics)X
3683(outlined)X
3998(in)X
4092(the)X
4225(next)X
806 6016(section.)N
3 p
%%Page: 3 3
11 s 0 xH 0 xS 1 f
2433 256(\302)N
3 f
518 512(TOPICS)N
1 f
806 640(There)N
1052(are)X
1200(four)X
1388(important)X
1774(topics)X
2027(that)X
2202(are)X
2351(related)X
2633(to)X
2744(the)X
2894(subject)X
3186(area)X
3374(of)X
3489(integrated)X
3884(symbolic)X
4250(and)X
806 768(numeric)N
1126(computation.)X
1621(This)X
1809(special)X
2085(issue)X
2292(will)X
2461(have)X
2658(one)X
2816(comprehensive)X
3380(review)X
3650(paper)X
3876(in)X
3975(each)X
4166(of)X
4269(the)X
806 896(topics,)N
1061(and)X
1210(a)X
1271(general)X
1552(overview)X
1901(article)X
2144(\(or)X
2268(editorial\))X
2614(to)X
2705(link)X
2865(them)X
3064(together.)X
3 f
828 1088(1.)N
916(Theory)X
1212(and)X
1376(Techniques)X
1 f
982 1216(Traditional)N
1405(theoretical)X
1808(frameworks)X
2257(for)X
2389(decision)X
2713(making)X
3008(are)X
3145(are)X
3282(generally)X
3640(considered)X
4051(to)X
4150(be)X
4264(too)X
982 1344(restrictive)N
1359(for)X
1485(developing)X
1901(practical)X
2229(knowledge)X
2639(based)X
2863(systems.)X
3188(The)X
3349(principal)X
3686(set)X
3807(of)X
3903(restrictions)X
4318(is)X
982 1472(that)N
1149(classical)X
1482(algorithmic)X
1924(decision)X
2252(theories)X
2565(and)X
2726(techniques)X
3137(do)X
3259(not)X
3406(address)X
3703(the)X
3845(need)X
4045(to)X
4148(reason)X
982 1600(about)N
1212(the)X
1354(decision)X
1682(process)X
1979(itself.)X
2212(Classical)X
2565(techniques)X
2976(cannot)X
3245(re\257ect)X
3499(on)X
3621(what)X
3826(the)X
3968(decision)X
4296(is,)X
982 1728(what)N
1183(the)X
1321(options)X
1611(are,)X
1770(what)X
1971(methods)X
2300(should)X
2565(be)X
2678(\(or)X
2810(have)X
3006(been\))X
3231(used)X
3422(in)X
3521(making)X
3816(decision)X
4141(and)X
4299(so)X
982 1856(forth.)N
1204(Approaches)X
1652(that)X
1814(accommodate)X
2333(numerical)X
2715(methods)X
3043(but)X
3185(extend)X
3448(them)X
3653(with)X
3838(non-monotonic)X
982 1984(inference)N
1365(techniques)X
1798(are)X
1961(described)X
2354(extensively)X
2812(in)X
2938(the)X
3103(literature)X
3479(e.g)X
3641([Coguen,)X
4023(Eberbach,)X
982 2112(Vanneschi,)N
1402(Fox)X
1566(et)X
1657(al,)X
1770(etc].)X
1951(What)X
2169(is)X
2255(needed)X
2531(is)X
2617(an)X
2726(in-depth)X
3046(analysis,)X
3378(taxonomy)X
3757(and)X
3910(evaluation)X
4304(of)X
982 2240(these)N
1202(techniques.)X
1640(This)X
1836(review)X
2115(of)X
2228(the)X
2376(theoretical)X
2789(approaches)X
3224(and)X
3391(background)X
3846(into)X
4024(integrated)X
982 2368(symbolic)N
1339(and)X
1499(numeric)X
1821(computation)X
2296(should)X
2564(be)X
2680(highly)X
2939(valuable)X
3270(to)X
3371(those)X
3589(involved)X
3930(in)X
4031(symbolic,)X
982 2496(numeric,)N
1315(and)X
1464(integrated)X
1839(symbolic)X
2185(plus)X
2354(numeric)X
2665(computation.)X
3 f
828 2688(2.)N
916(Applications)X
1 f
982 2816(Here)N
1179(there)X
1382(would)X
1629(be)X
1739(a)X
1806(review)X
2073(of)X
2174(the)X
2310(applications)X
2765(which)X
3008(provide)X
3305(the)X
3441(stimulus,)X
3791(and)X
3946(demonstrate)X
982 2944(techniques)N
1421(for)X
1585(integrating)X
2030(symbolic)X
2416(and)X
2605(numeric)X
2955(computing)X
3394(components.)X
3903(Effectiveness)X
982 3072(considerations)N
1540(and)X
1716(performance)X
2210(gains)X
2446(should)X
2731(also)X
2923(be)X
3056(included)X
3410(where)X
3674(appropriate.)X
4147(Model)X
982 3200(applications)N
1458(may)X
1659(include:)X
1992(image)X
2256(understanding,)X
2825(weather)X
3151(forecasting,)X
3612(\256nancial)X
3964(forecasting,)X
982 3328(expert)N
1236(systems)X
1549(for)X
1685(PDE)X
1885(solving,)X
2201(simulation,)X
2631(real-time)X
2984(process)X
3281(control,etc.)X
3712(The)X
3883(review)X
4156(article)X
982 3456(should)N
1246(expose)X
1519(the)X
1656(common)X
1994(ground)X
2272(that)X
2434(these)X
2644(applications)X
3100(share,)X
3335(the)X
3471(potential)X
3809(improvement)X
4308(in)X
982 3584(reasoning)N
1363(and)X
1529(computation)X
2011(ef\256ciency,)X
2420(the)X
2568(requirements)X
3068(that)X
3241(they)X
3433(impose)X
3728(on)X
3856(the)X
4004(theoretical)X
982 3712(frameworks,)N
1445(programming)X
1947(languages,)X
2343(and)X
2492(computer)X
2847(architecture.)X
3 f
828 3904(3.)N
916(Programming)X
1466(Languages)X
1 f
982 4032(This)N
1163(would)X
1407(be)X
1514(a)X
1577(review)X
1840(of)X
1937(the)X
2069(programming)X
2574(languages)X
2951(which)X
3191(provide)X
3485(the)X
2 f
3618(means)X
1 f
3867(for)X
3994(integrating)X
982 4160(symbolic)N
1335(and)X
1490(numeric)X
1807(computations.)X
2333(The)X
2498(article\(s\))X
2839(should)X
3102(describe)X
3423(the)X
3559(competing)X
3960(approaches,)X
982 4288(i.e.)N
1136(integration)X
1565(through)X
1885(homogenisation,)X
2517(and)X
2690(integration)X
3119(through)X
3440(interfacing)X
3869(heterogeneous)X
982 4416(systems.)N
1308(Language)X
1680(design)X
1935(issues,)X
2192(features)X
2495(for)X
2622(parallelism,)X
3062(etc.)X
3212(Possible)X
3530(languages)X
3906(that)X
4063(might)X
4294(be)X
982 4544(considered)N
1393(are:)X
1555(Spinlog,)X
1882(Orient84K,)X
12 s
2312(LOOPS)X
11 s
2645(,)X
2698(Cornerstone,)X
3181(Solve,)X
3435(Parle,)X
3669(etc.)X
3847(A)X
3941(comparative)X
982 4672(analysis)N
1288(of)X
1383(the)X
1513(involved)X
1844(languages)X
2218(should)X
2475(be)X
2580(included.)X
3 f
828 4864(4.)N
916(Computer)X
1323(Architecture)X
1 f
982 4992(This)N
1169(review)X
1438(should)X
1704(give)X
1887(a)X
1957(comprehensive)X
2521(review)X
2791(of)X
2895(the)X
3034(novel)X
3261(computer)X
3625(architectures)X
4106(that)X
4270(are)X
982 5120(involved,)N
1345(their)X
1539(basic)X
1752(operating)X
2117(principles,)X
2519(their)X
2713(internal)X
3015(structure,)X
3377(a)X
3448(comparative)X
3915(analysis,)X
4252(etc.)X
982 5248(Possible)N
1298(architectures)X
1770(that)X
1925(might)X
2154(be)X
2259(considered)X
2662(are:)X
10 s
2814(PADMAVATI)X
11 s
3295(,)X
10 s
3337(SPRINT)X
11 s
3612(,)X
3656(...)X
3 f
518 5376(DEADLINES)N
1 f
806 5504(March)N
1057(15th)X
1236(-)X
1309(Extended)X
1664(Abstract.)X
806 5632(April)N
1014(30th)X
1215(-)X
1288(Full)X
1453(Manuscript.)X
3 p
%%Trailer
xt
xs
====================================
More information about the Connectionists
mailing list