Last update:
Thu Mar 22 09:49:48 MDT 2018
I. Herman The Use of Projective Geometry in
Computer Graphics . . . . . . . . . . . 1
H. L. Bodlaender and
J. Gilbert and
H. Hafsteinsson and
T. Kloks Approximating treewidth, pathwidth and
minimum elimination tree height . . . . 1
B. Courcelle and
M. Mosbah Monadic second-order evaluations on
tree-decomposable graphs . . . . . . . . 13
R. Heckmann and
R. Klasing and
B. Monien and
W. Unger Optimal embedding of complete binary
trees into lines and grids . . . . . . . 25
Y. Okada and
M. Hayashi Graph rewriting systems and their
application to network reliability
analysis . . . . . . . . . . . . . . . . 36
A. Schurr and
A. Zundorf Nondeterministic control structures for
graph rewriting systems . . . . . . . . 48
M. Andries and
J. Paredaens A language for generic
graph-transformations . . . . . . . . . 63
R. Freund and
B. Haberstroh Attributed elementary programmed graph
grammars . . . . . . . . . . . . . . . . 75
E. Ihler The complexity of approximating the
class Steiner tree problem . . . . . . . 85
Z. Lonc On the complexity of some chain and
antichain partition problems . . . . . . 97
J. Czyzowicz and
E. Rivera-Campo and
N. Santoro and
J. Urrutia and
J. Zaks Tight bounds for the rectangular art
gallery problem . . . . . . . . . . . . 105
L. Guibas and
J. Mitchell and
T. Roos Voronoi diagrams of moving points in the
plane . . . . . . . . . . . . . . . . . 113
T. Shoudai and
S. Miyano Using maximal independent sets to solve
problems in parallel . . . . . . . . . . 126
Z. Kedem and
K. Palem and
G. Pantziou and
P. Spirakis and
C. Zaroliagis Fast parallel algorithms for coloring
random graphs . . . . . . . . . . . . . 135
X. Y. Jiang and
H. Bunke Optimal vertex ordering of a graph and
its application to symmetry detection 148
O. Sykora and
I. Vrto Edge separators for graphs of bounded
genus with applications . . . . . . . . 159
D.-Z. Du and
Y.-D. Lyuu and
D.-F. Hsu Line digraph iterations and the spread
concept --- with application to graph
theory, fault tolerance, and routing . . 169
L. Kucera A generalized encryption scheme based on
random graphs . . . . . . . . . . . . . 180
E. Feuerstein and
A. Marchetti-Spaccamela Dynamic algorithms for shortest paths in
planar graphs . . . . . . . . . . . . . 187
I. Stewart Complete problems for logspace involving
lexicographic first paths in graphs . . 198
T. Takaoka A new upper bound on the complexity of
the all pairs shortest path problem . . 209
O. Sykora and
I. Vrto On the crossing number of the hypercube
and the cube connected cycles . . . . . 214
P. Damaschke Logic arrays for interval indicator
functions . . . . . . . . . . . . . . . 219
E. Stohr On the broadcast time of the Butterfly
network . . . . . . . . . . . . . . . . 226
H. L. Bodlaender On disjoint cycles . . . . . . . . . . . 230
A. Brandstadt Short disjoint cycles in cubic
bridgeless graphs . . . . . . . . . . . 239
G. S. Makanin Investigations on Equations in a Free
Group . . . . . . . . . . . . . . . . . 1
A. Koscielski An Analysis of Makanin's Algorithm
Deciding Solvability of Equations in
Free Groups . . . . . . . . . . . . . . 12
H. Abdulrab Implementation of Makanin's Algorithm 61
K. U. Schulz Makanin's Algorithm for Word Equations
--- Two Improvements and a
Generalization . . . . . . . . . . . . . 85
F. Baader Unification Theory . . . . . . . . . . . 151
A. Bockmayr Algebraic and Logic Aspects of
Unification . . . . . . . . . . . . . . 171
A. Bockmayr Model-Theoretic Aspects of Unification 181
A. Ohsuga and
K. Sakai Complete Equational Unification Based on
an Extension of the Knuth--Bendix
Completion Procedure . . . . . . . . . . 197
F. Baader Unification in Varieties of Completely
Regular Semigroups . . . . . . . . . . . 210
R. V. Book A Note on Confluent Thue Systems . . . . 231
C. Wrathall Confluence of One-Rule Thue Systems . . 237
J. Karhumaki Systems of Equations over a Finite Set
of Words and Automata Theory (extended
abstract) . . . . . . . . . . . . . . . 247
A. G. Makanina New System of Defining Relations of the
Braid Group . . . . . . . . . . . . . . 250
O. Danvy Back to direct style . . . . . . . . . . 183--196
F. Henglein Dynamic typing: syntax and proof theory 197--230
M. P. Jones A theory of qualified types . . . . . . 231--256
J. M. Larcheveque Interprocedural type propagation for
object-oriented languages . . . . . . . 257--282
C. Hankin and
S. Hunt Approximate fixed points in abstract
interpretation . . . . . . . . . . . . . 283--306
J. Hughes and
J. Launchbury Reversing abstract interpretations . . . 307--326
F. Nielson and
H. R. Nielson The tensor product in Wadler's analysis
of lists . . . . . . . . . . . . . . . . 327--354
A. Cheese Parallel Execution of Parlog . . . . . . 1
G. Agha and
C. Houck and
R. Panwar Distributed Execution of Actor Programs 1
S. Hiranandani and
K. Kennedy and
C. Koelbel and
U. Kremer and
C.-W. Tseng An Overview of the Fortran D Programming
System . . . . . . . . . . . . . . . . . 18--34
J. Werth and
J. Browne and
S. Sobek and
T. Lee and
P. Newton and
R. Jain The Interaction of the Formal and the
Practical in Parallel Programming
Environment Development: CODE . . . . . 35
D. Scales and
M. Rinard and
M. Lam and
J. Anderson Hierarchical Concurrency in Jade . . . . 50
R. Eigenmann and
J. Hoeflinger and
Z. Li and
D. Padua Experience in the Automatic
Parallelization of Four
Perfect-Benchmark Programs . . . . . . . 65
J. Lee and
C. Lin and
L. Snyder Programming SIMPLE for Parallel
Portability . . . . . . . . . . . . . . 84
Z. Ariola and
Arvind Compilation of Id . . . . . . . . . . . 99
R. Johnson and
W. Li and
K. Pingali An Executable Representation of Distance
and Direction . . . . . . . . . . . . . 122
S. Tjiang and
M. Wolf and
M. Lam and
K. Pieper and
J. Hennessy Integrating Scalar Optimization and
Parallelization . . . . . . . . . . . . 137
M. Girkar and
C. Polychronopoulos Optimization of Data/Control Conditions
in Task Graphs . . . . . . . . . . . . . 152
D. Callahan Recognizing and Parallelizing Bounded
Recurrences . . . . . . . . . . . . . . 169
C.-H. Huang and
P. Sadayappan Communication-Free Hyperplane
Partitioning of Nested Loops . . . . . . 186
L.-C. Lu and
M. Chen Parallelizing Loops with Indirect Array
References or Pointers . . . . . . . . . 201
A. Nicolau and
R. Potasman and
H. Wang Register Allocation, Renaming and Their
Impact on Fine-Grain Parallelism . . . . 218
B. R. Rau Data Flow and Dependence Analysis for
Instruction Level Parallelism . . . . . 236
A. Kallis and
D. Klappholz Extending Conventional Flow Analysis to
Deal with Array References . . . . . . . 251
M. Furnari and
C. Polychronopoulos Run-Time Management of Lisp Parallelism
and the Hierarchical Task Graph Program
Representation . . . . . . . . . . . . . 266
H. Kasahara and
H. Honda and
A. Mogi and
A. Ogura and
K. Fujiwara and
S. Narita A Multi-Grain Parallelizing Compilation
Scheme for OSCAR . . . . . . . . . . . . 283
J. Labarta and
E. Ayguade and
J. Torres and
M. Valero and
J. M. Llaberia Balanced Loop Partitioning Using GTS . . 298
J. Fang and
M. Lu An Iteration Partition Approach for
Cache or Local Memory Thrashing on
Parallel Processing . . . . . . . . . . 313
J. Ferrante and
V. Sarkar and
W. Thrash On Estimating and Enhancing Cache
Effectiveness . . . . . . . . . . . . . 328
Y.-J. Ju and
H. Dietz Reduction of Cache Coherence Overhead by
Compiler Data Layout and Loop
Transformation . . . . . . . . . . . . . 344
G. Gao and
Q. Ning Loop Storage Optimization for Dataflow
Machines . . . . . . . . . . . . . . . . 359
R. Hardon and
S. Pinter Optimal Partitioning of Programs for
Data Flow Machines . . . . . . . . . . . 374
N. Carriero and
D. Gelernter A Foundation for Advanced Compile-time
Analysis of Linda Programs . . . . . . . 389
H. Srinivasan and
M. Wolfe Analyzing Programs with Explicit
Parallelism . . . . . . . . . . . . . . 405
M. Thapar and
B. A. Delagi and
M. J. Flynn Scalable Cache Coherence for Shared
Memory Multiprocessors . . . . . . . . . 1
M. Wolfe New Program Restructuring Technology . . 13
T. G. Lewis and
R. Currey and
J. Liu Data Parallel Program Design . . . . . . 37
Ch. Caerts and
R. Lauwereins and
J. A. Peperstraete A Powerful High-Level Debugger for
Parallel Programs . . . . . . . . . . . 54
E. D. Brooks and
B. C. Gorda and
K. H. Warren The PCP/PFP Programming Models on the
BBN TC2000 . . . . . . . . . . . . . . . 65
B. M. Chapman and
H. M. Herbeck Knowledge-Based Parallelization for
Distributed Memory Systems . . . . . . . 77
M. Gerndt and
H. Moritsch Parallelization for Multiprocessors with
Memory Hierarchies . . . . . . . . . . . 89
A. D. Malony and
D. H. Hammerslag and
D. J. Jablonowski Trace View: A Trace Visualization Tool 102
A. Weininger and
Th. Schnekenburger and
M. Friedrich Parallel and Distributed Programming
With ParMod-C . . . . . . . . . . . . . 115
P. Brezany and
V. Sipkova Code Generation for a Data Parallel SIMD
Language . . . . . . . . . . . . . . . . 127
M. Wolfe and
H. Srinivasan Data Structures for Optimizing Programs
with Explicit Parallelism . . . . . . . 139
W. Diestelkamp and
H. Bi and
A. Bottcher MODULA-S: A Language to Exploit Two
Dimensional Parallelism . . . . . . . . 157
M. Philippsen and
W. F. Tichy MODULA-2 and Its Compilation . . . . . . 169
J. H. Merlin ADAPTing Fortran 90 Array Programs for
Distributed Memory Architectures . . . . 184--200
M. H. Reymond Evolution of Massive Parallel Compute
Servers from a Research Object to a
Production Pool . . . . . . . . . . . . 201
S. K. Tripathi and
G. Serazzi and
D. Ghosal Processor Scheduling in Multiprocessor
Systems . . . . . . . . . . . . . . . . 208
F. Makedon and
A. Simvonis Multipacket Routing on Rings . . . . . . 226
G. Vesztergombi and
F. Rohrbach Massively Parallel Processing in High
Energy Physics: The CERN-MPPC Project 238
H.-U. Heiss and
R. Wiesenfarth A Heuristic Algorithm for Dynamic Task
Allocation in Highly Parallel Systems 252
H. Ilmberger and
S. Thurmel Analysis of Parallel Lisp Programs Based
on a Trace Mechanism . . . . . . . . . . 266
U. Glasser and
G. Hannesen and
M. Karcher and
G. Lehrenfeld A Distributed Implementation of Flat
Concurrent Prolog on Multi-Transputer
Environments . . . . . . . . . . . . . . 277
J.-M Jacquet Negation in Conclog . . . . . . . . . . 289
P. S. Wang Symbolic Computation and Parallel
Software . . . . . . . . . . . . . . . . 316
D. Wang On the Parallelization of
Characteristic-Set-Based Algorithms . . 338
P. Lippitsch and
K. C. Posch and
R. Posch Multiplication as Parallel as Possible 350
J. Zerovnik On the Existence of an Efficient
Parallel Algorithm for a Graph Theoretic
Problem . . . . . . . . . . . . . . . . 359
W. Kuchlin On the Multi-Threaded Computation of
Modular Polynomial Greatest Common
Divisors . . . . . . . . . . . . . . . . 369
D. J. Hawley A Buchberger Algorithm for Distributed
Memory Multiprocessors . . . . . . . . . 385
K. Schulten Computational Biology on Massively
Parallel Machines . . . . . . . . . . . 391
G. Horton and
R. Knirsch Time-Parallel Multigrid in an
Extrapolation Method for Time-Dependent
Partial Differential Equations . . . . . 401
F. Breitenecker and
G. Schuster and
I. Husinsky and
J. Fritscher Parallelization of Simulation Tasks:
Methodology --- Implementation ---
Application . . . . . . . . . . . . . . 412
H. Adeli and
O. Kamal Parallel Algorithms for Stress Analysis
on Shared-Memory Multiprocessors . . . . 426
S. Miguet and
Y. Robert Elastic Load-Balancing for Image
Processing Algorithms . . . . . . . . . 438
Yves Bekkers and
Lucien Ungaro Real-Time Memory Management for Prolog 1
M. Belmesk A Process Semantics of Logic Programs 13
Egon Borger and
Elvinia Riccobene Logical Operational Semantics of Parlog:
Part II: Or-Parallelism . . . . . . . . 27
Egon Borger and
Dean Rosenzweig WAM Algebras --- A Mathematical Study of
Implementation: Part II . . . . . . . . 35
A. G. Bondarenko Abductive Systems for Non-monotonic
Reasoning . . . . . . . . . . . . . . . 55
Vladimir B. Borshchev Properties of Algorithmic Operators . . 66
Dmitri Yu. Boulanger Deep Logic Program Transformation Using
Abstract Interpretation . . . . . . . . 79
Antonio Brogi and
Evelina Lamma and
Paola Mello Objects in a Logic Programming Framework 102
Francois Bry and
Rainer Manthey and
Bern Martens Integrity Verification in Knowledge
Bases . . . . . . . . . . . . . . . . . 114
Stefania Costantini and
Gaetano Lanzarone On Procedural Semantics of Metalevel
Negation . . . . . . . . . . . . . . . . 140
Eugene Dantsin Probabilistic Logic Programs and Their
Semantics . . . . . . . . . . . . . . . 152
Bart Demoen and
Andre Marien Implementation of Prolog as Binary
Definite Programs . . . . . . . . . . . 165
A. Ja. Dikowski Prolog Semantics for Measuring Space
Consumption . . . . . . . . . . . . . . 177
Wai-Keong Foong Or-Parallel Prolog with Heuristic Task
Distribution . . . . . . . . . . . . . . 193
Hans-Gunther Hein and
Manfred Meyer A WAM Compilation Scheme . . . . . . . . 201
Martin C. Henson Safe Positive Induction in the
Programming Logic TK . . . . . . . . . . 215
S. Ivanets and
N. Ilinsky and
M. Krylov WAM Specification for Parallel Execution
on SIMD computer . . . . . . . . . . . . 232
G. Janssens and
M. Bruynooghe On Abstracting the Procedural Behaviour
of Logic Programs . . . . . . . . . . . 240
Norbert Kehrer and
Gustaf Neumann Treating Enhanced Entity Relationship
Models in a Declarative Style . . . . . 263
Eugeny L. Kitaev Processing of Ground Regular Terms in
Prolog . . . . . . . . . . . . . . . . . 271
Andrei Mantsivoda and
Vyacheslav Petukhin Compiling Flang . . . . . . . . . . . . 286
Manfred Meyer and
Hans-Gunther Hein and
Jorg Muller FIDO: Finite Domain Consistency
Techniques in Logic Programming . . . . 294
Pierangelo Miglioli and
Ugo Moscato and
Mario Ornaghi A Constructive Logic Approach to
Database Theory . . . . . . . . . . . . 302
Dale Miller Abstract Syntax and Logic Programming 322
Vladimir S. Neiman Deduction Search with Generalized Terms 338
Gustaf Neumann A Simple Transformation from
Prolog-Written Metalevel Interpreters
into Compilers and its Implementation 349
Michel Parigot Free Deduction: An Analysis of
``Computations'' in Classical Logic . . 361
Aida Pliuskeviciene Gentzen-type Calculi for Modal Logic S4
with Barcan Formula . . . . . . . . . . 381
Regimantas Pliuskevicius Logical Foundation for Logic Programming
Based on First Order Linear Temporal
Logic . . . . . . . . . . . . . . . . . 391
David M. Powers Logic Programming with Pseudo-Resolution 407
T. J. Reynolds and
P. Kefals BRAVE: An OR-Parallel Dialect of Prolog
and its Application to Artificial
Intelligence . . . . . . . . . . . . . . 415
Francesco Russo and
Mirko Sancassani A Declarative Debugging Environment for
DATALOG . . . . . . . . . . . . . . . . 433
Jurate Sakalauskaite A Sequent Calculus for a First Order
Linear Temporal Logic with Explicit Time 442
P. Sebillot A Logical-Based Language for Feature
Specification and Transmission Control 452
Paul Tarau Program Transformations and WAM-Support
for the Compilation of Definite
Metaprograms . . . . . . . . . . . . . . 462
Wiebe van der Hoek Some Considerations on the Logic Psub F
D --- A Logic Combining Modality and
Probability . . . . . . . . . . . . . . 474
Andrei Voronkov Logic Programming with Bounded
Quantifiers . . . . . . . . . . . . . . 486
S. MacGinnes How Objective is Object-Oriented
Analysis . . . . . . . . . . . . . . . . 1
T. Rose and
C. Maltzahn and
M. Jarke Integrating Object and Agent Worlds . . 17
P. Borras and
A. Doucet and
P. Pfeffer A Fully Integrated Programming
Environment for an Object-Oriented
Database . . . . . . . . . . . . . . . . 33
L. Jesus and
R. Carapuca Automatic Generation of Documentation
for Information Systems . . . . . . . . 48
A. L. Opdahl and
A. Solvberg A Framework for Performance Engineering
During Information System Development 65
C-C D. Poo A Framework for Software Maintenance . . 88
R. Zicari and
F. Cacace and
C. Capelli and
A. Galipo and
A. Pirovano and
A. Romboli The SOL Object-Oriented Database
Language . . . . . . . . . . . . . . . . 105
E. Andonoff and
C. Sallaberry and
G. Zurfluh Interactive Design of Object-Oriented
Databases . . . . . . . . . . . . . . . 128
B. C. Ghosh and
V. Wuwongse Conceptual Graphs as a Framework for
Deductive Object-Oriented Databases . . 147
S. Ip and
T. Holden A Knowledge Based Technique for the
Process Modelling of Information
Systems: The Object Life Cycle Diagram 164
J.-L. Hainaut and
M. Cadelli and
B. Decuyper and
O. Marchand Database CASE Tool Architecture:
Principles for Flexible Design
Strategies . . . . . . . . . . . . . . . 187
M. L. G. Shaw and
B. R. Gaines The Synthesis of Knowledge Engineering
and Software Engineering . . . . . . . . 208
J. Hagelstein and
D. Roelants Reconciling Operational and Declarative
Specifications . . . . . . . . . . . . . 221
M. Leonard and
I. Prince NelleN: A Framework for Literate Data
Modelling . . . . . . . . . . . . . . . 239
C. Rolland and
C. Proix A Natural Language Approach for
Requirements Engineering . . . . . . . . 257
G. Fouque and
C. Vrain Building a Tool for Software Code
Analysis: A Machine Learning Approach 278
A. Sutcliffe and
N. Maiden Supporting Component Matching for
Software Reuse . . . . . . . . . . . . . 290
P. Constantopoulos and
E. Pataki A Browser for Software Reuse . . . . . . 304
E. Dubois and
P. Du Bois and
A. Rifaut Elaborating, Structuring and Expressing
Formal Requirements of Composite Systems 327
O. P. Lopez and
F. Hayes and
S. Bear OASIS: An Object-Oriented Specification
Language . . . . . . . . . . . . . . . . 348
A. H. M. ter Hofstede and
H. A. Proper and
Th. P. van der Weide Data Modelling in Complex Application
Domains . . . . . . . . . . . . . . . . 364
D. Budgen and
G. Friel Augmenting the Design Process
Transformations from Abstract Design
Representations . . . . . . . . . . . . 378
S. Dewal A Methodology for Requirements Analysis
and Evaluation of SDEs . . . . . . . . . 394
F. Reim Organizational Integration of the
Information System Design Process . . . 410
H. Dalianis A Method for Validating a Conceptual
Model by Natural Language Discourse
Generation . . . . . . . . . . . . . . . 425
T. A. Halpin and
J. I. McCormack Automated Validation of Conceptual
Schema Constraints . . . . . . . . . . . 445
M. M. Fonkam and
W. A. Gray An Approach to Eliciting the Semantics
of Relational Databases . . . . . . . . 463
A. A. Verrijn-Stuart and
G. J. Ramackers Model Integration in Information
Planning Tools . . . . . . . . . . . . . 481
P. Osmon and
P. Sleat IDRIS: Interactive Design of Reactive
Information Systems . . . . . . . . . . 494
I. Comyn-Wattiau and
M. Bouzeghoub Constraint Confrontation: An Important
Step in View Integration . . . . . . . . 507
M. Brough Methods for CASE: A Generic Framework 524
M. Rossi and
M. Gustafsson and
K. Smolander and
L.-A. Johansson and
K. Lyytinen Metamodeling Editor as a Front End Tool
for a CASE Shell . . . . . . . . . . . . 546
F. Oquendo and
J.-D. Zucker and
P. Griffiths A Meta-CASE Environment for Software
Process-Centred CASE Environments . . . 568
M. A. Casanova and
A. S. Hemerly and
A. L. Furtado A Declarative Conceptual Modelling
Language: Description and Example
Applications . . . . . . . . . . . . . . 589
D. Costal and
A. Olive A Method for Reasoning About Deductive
Conceptual Models of Information Systems 612
N. Leone and
A. Mecchia and
G. Rossi and
P. Rullo The Basic Query Machine of the KIWIS
System . . . . . . . . . . . . . . . . . 632
Helmut Alt and
Johannes Blomer Resemblance and Symmetries of Geometric
Patterns . . . . . . . . . . . . . . . . 1
Rudolf Fleischer and
Otfried Fries and
Kurt Mehlhorn and
Stefan Meiser and
Stefan Naher and
Hans Rohnert and
Stefan Schirra and
Klaus Simon and
Athanasios Tsakalidis and
Christian Uhrig Selected Topics from Computational
Geometry, Data Structures and Motion
Planning . . . . . . . . . . . . . . . . 25
Franz Hofting and
Thomas Lengauer and
Egon Wanke Processing of Hierarchically Defined
Graphs and Graph Families . . . . . . . 44
Hans-Peter Kriegel and
Thomas Brinkhoff and
Ralf Schneider The Combination of Spatial Access
Methods and Computational Geometry in
Geographic Database Systems . . . . . . 70
Hans-Peter Kriegel and
Peter Heep and
Stephan Heep and
Michael Schiwietz and
Ralf Schneider A Flexible and Extensible Index Manager
for Spatial Database Systems . . . . . . 87
Hans-Peter Kriegel and
Holger Horn and
Michael Schiwietz The Performance of Object Decomposition
Techniques for Spatial Query Processing 104
Heinrich Muller and
Jorg Winckler Distributed Image Synthesis with
Breadth-First Ray Tracing and the
Ray-Z-Buffer . . . . . . . . . . . . . . 124
Bengt J. Nilsson and
Thomas Ottmann and
Sven Schuierer and
Christian Icking Restricted Orientation Computational
Geometry . . . . . . . . . . . . . . . . 148
H. Noltemeier and
K. Verbarg and
C. Zirkelbach Monotonous Bisectorsup * Trees --- A
Tool for Efficient Partitioning of
Complex Scenes of Geometric Objects . . 186
Bernd Schmeltz Learning Convex Sets Under Uniform
Distribution . . . . . . . . . . . . . . 204
Hans-Werner Six and
Peter Widmayer Spatial Access Structures for Geometric
Databases . . . . . . . . . . . . . . . 214
Emo Welzl On Spanning Trees with Low Crossing
Numbers . . . . . . . . . . . . . . . . 233
Martin Dietzfelbinger and
Friedhelm Meyer auf der Heide High Performance Universal Hashing, with
Applications to Shared Memory
Simulations . . . . . . . . . . . . . . 250--269
R. Feldmann and
P. Mysliwietz and
B. Monien Distributed Game Tree Search on a
Massively Parallel System . . . . . . . 270
Manfred Kunde and
Thomas Tensi Balanced Strategies for Routing on
Meshes . . . . . . . . . . . . . . . . . 289
Miroslaw Kutylowski Complexity of Boolean Functions on PRAMs
--- Lower Bound Techniques . . . . . . . 309
Berthold Kroger and
Oliver Vornberger Enumerative vs. Genetic Optimization Two
Parallel Algorithms for the Bin Packing
Problem . . . . . . . . . . . . . . . . 330
Rudiger Reischuk and
Bernd Schmeltz Area Efficient Methods to Increase the
Reliability of Circuits . . . . . . . . 363
M. Levene The Nested Universal Relation Database
Model . . . . . . . . . . . . . . . . . 1
Martin Aronsson Methodology and Programming Techniques
in GCLA II . . . . . . . . . . . . . . . 1
Harold Boley Extended Logic-plus-Functional
Programming . . . . . . . . . . . . . . 45
Antonio Brogi and
Evelina Lamma and
Paola Mello Open Logic Theories . . . . . . . . . . 73
Lars-Henrik Eriksson A Finitary Version of the Calculus of
Partial Inductive Definitions . . . . . 89
Amy Felty A Logic Programming Approach to
Implementing Higher-Order Term Rewriting 135
Torkel Franzen and
Seif Haridi and
Sverker Janson An Overview of the Andorra Kernel
Language . . . . . . . . . . . . . . . . 163
Lars Hallnas Logical and Computational Invariants of
Programs . . . . . . . . . . . . . . . . 181
John Hannan Implementing lambda-Calculus Reduction
Strategies in Extended Logic Programming
Languages . . . . . . . . . . . . . . . 193
Philipp Hanschke Terminological Reasoning and Partial
Inductive Definitions . . . . . . . . . 221
Per Kreuger GCLA II A Definitional Approach to
Control . . . . . . . . . . . . . . . . 239
Spiro Michaylov and
Frank Pfenning Natural Semantics and Some of Its
Meta-Theory in Elf . . . . . . . . . . . 299
David W. Reed and
Donald W. Loveland and
Bruce T. Smith The Near-Horn Approach to Disjunctive
Logic Programming . . . . . . . . . . . 345
Hans Werner Gusgen and
J. Hertzberg Introduction . . . . . . . . . . . . . . 1--4
Hans Werner Gusgen and
J. Hertzberg The Office World . . . . . . . . . . . . 5--16
Hans Werner Gusgen and
J. Hertzberg Backtracking Approaches . . . . . . . . 57--66
Hans Werner Gusgen and
J. Hertzberg From Simple Filtering to Tagging . . . . 67--82
Hans Werner Gusgen and
J. Hertzberg Approaches to Filtering in Parallel . . 83--96
Hans Werner Gusgen and
J. Hertzberg Optimization Approaches . . . . . . . . 97--110
QingMing Ma and
John C. Reynolds Types, Abstraction, and Parametric
Polymorphism, Part 2 . . . . . . . . . . 1
John Gateley and
Bruce F. Duba Call-by-Value Combinatory Logic and the
Lambda-Value Calculus . . . . . . . . . 41
Scott F. Smith From Operational to Denotational
Semantics . . . . . . . . . . . . . . . 54
Michael W. Mislove and
Frank J. Oles A Simple Language Supporting Angelic
Nondeterminism and Parallel Composition 77
Kim B. Bruce The Equivalence of Two Semantic
Definitions for Inheritance in
Object-Oriented Languages . . . . . . . 102
Neal Nelson Primitive Recursive Functionals with
Dependent Types . . . . . . . . . . . . 125
Gary T. Leavens and
Don Pigozzi Typed Homomorphic Relations Extended
with Subtypes . . . . . . . . . . . . . 144
Jon Barwise Information Links in Domain Theory . . . 168
J. J. M. M. Rutten Nonwellfounded Sets and Programming
Language Semantics . . . . . . . . . . . 193
John W. Gray Simultaneous Substitution in the Typed
Lambda Calculus . . . . . . . . . . . . 207
Michael Barr HSP Type Theorems in the Category of
Posets . . . . . . . . . . . . . . . . . 221
Achim Jung and
Leonid Libkin and
Hermann Puhlmann Decomposition of Domains . . . . . . . . 235
Michael Huth Cartesian Closed Categories of Domains
and the Space Proj(D) . . . . . . . . . 259
Reinhold Heckmann An Upper Power Domain Construction in
Terms of Strongly Compact Sets . . . . . 272
Mitchell Wand Correctness of Procedure Representations
in Higher-Order Assembly Language . . . 294
Nicolas Mercouroff An Algorithm for Analyzing Communicating
Processes . . . . . . . . . . . . . . . 312
Stephen Brookes and
Shai Geva Continuous Functions and Parallel
Algorithms on Concrete Data Structures 326
Bard Bloom and
Marta Kwiatkowska Trade-Offs in True Concurrency: Pomsets
and Mazurkiewicz Traces . . . . . . . . 350
Luca Aceto On Relating Concurrency and
Nondeterminism . . . . . . . . . . . . . 376
Stefano Kasangian On Continuous Time Agents . . . . . . . 403
Zhang Guo-Qiang A Monoidal Closed Category of Event
Structures . . . . . . . . . . . . . . . 426
Giuseppe Rosolini An Exper Model for Quest . . . . . . . . 436
Ernest G. Manes Equations for if-then-else . . . . . . . 446
Stephen L. Bloom and
Zoltan Esik Program Correctness and Matricial
Iteration Theories . . . . . . . . . . . 457
Nils Klarlund Liminf Progress Measures . . . . . . . . 477
Austin Melton and
Bernd S. W. Schroeder and
George E. Strecker Connections . . . . . . . . . . . . . . 492
F. Allard A User's View of Current Practice and
Possibilities . . . . . . . . . . . . . 1
J. Killin The Management and Maintenance of an
Operational KADS System Development . . 6
M. Georges Knowledge Engineering Trends in Europe 7
K. Morik Applications of Machine Learning . . . . 9
H. Eriksson and
M. A. Musen Conceptual Models for Automatic
Generation of Knowledge-Acquisition
Tools . . . . . . . . . . . . . . . . . 14
C. Greboval and
G. Kassel An Approach to Operationalize Conceptual
Models: The Shell Aide . . . . . . . . . 37
M. Linster Linking Modeling to Make Sense and
Modeling to Implement Systems in an
Operational Modeling Environment . . . . 55
U. Gappa and
K. Poeck Common Ground and Differences of the
KADS and Strong-Problem-Solving-Shell
Approach . . . . . . . . . . . . . . . . 75
G. Schreiber and
B. Wielinga and
H. Akkermans Differentiating Problem Solving Methods 95
G. van Heijst and
B. Wielinga and
N. Shadbolt Using Generalised Directive Models in
Knowledge Acquisition . . . . . . . . . 112
P. Geelen and
Z. Ruttkay and
J. Treur Towards a Formal Framework to Compare
Protocol Interpretations and Task
Specifications . . . . . . . . . . . . . 133
K. Tsujino and
V. G. Dabija and
S. Nishida Knowledge Acquisition Driven by
Constructive and Interactive Induction 153
C. Nedellec and
K. Causse Knowledge Refinement Using Knowledge
Acquisition and Machine Learning Methods 171
J. Schweiger Generating Configuration Expert Systems
from Conceptual Specifications of the
Expert Knowledge . . . . . . . . . . . . 191
W. Jonker and
J. W. Spee Yet Another Formalisation of KADS
Conceptual Models . . . . . . . . . . . 211
S. Neubert and
R. Studer The KEEP Model, a Knowledge Engineering
Process Model . . . . . . . . . . . . . 230
H. S. Nwana and
R. C. Paton and
M. J. R. Shave and
T. J. M. Bench-Capon Domain-Driven Knowledge Modelling:
Mediating and Intermediate
Representations for Knowledge
Acquisition . . . . . . . . . . . . . . 250
M.-M. Portman and
S. M. Easterbrook PMI: Knowledge Elicitation and De Bono's
Thinking Tools . . . . . . . . . . . . . 264
O. I. Larichev A New Approach to the Solution of Expert
Classification Problems . . . . . . . . 283
R. Dieng and
A. Giboin and
P.-A. Tourtier and
O. Corby Knowledge Acquisition for Explainable,
Multi-Expert, Knowledge-Based Design
Systems . . . . . . . . . . . . . . . . 298
J. Charlet and
J.-P. Krivine and
C. Reynaud Causal Model-Based Knowledge Acquisition
Tools: Discussion of Experiments . . . . 318
F. Maurer Knowledge Base Maintenance and
Consistency Checking in MOLTKE/HyDi . . 337
D. Allemang and
T. E. Rothenfluh Acquiring Knowledge of Knowledge
Acquisition: A Self-Study of Generic
Tasks . . . . . . . . . . . . . . . . . 353
D. Porter Reusable Analysis and Design Components
for Knowledge-Based System Development 373
M. Manago and
N. Conruyt and
J. le Renard Acquiring Descriptive Knowledge for
Classification and Identification . . . 392
F. Schmalhofer and
T. Reinartz and
B. Tschaitschian Intelligent Documentation as a Catalyst
for Developing Cooperative
Knowledge-Based Systems . . . . . . . . 406
J. M. Bradshaw and
P. Holm and
O. Kipersztok and
T. Nguyen eQuality: An Application of DDucks to
Process Management . . . . . . . . . . . 425
M. Abadi and
L. Lamport An Old-Fashioned Recipe for Real Time 1
R. Alur and
C. Courcoubetis and
D. Dill Verifying Automata Specifications of
Probabilistic Real-Time Systems . . . . 28
R. Alur and
D. Dill The Theory of Timed Automata . . . . . . 45
R. Alur and
T. A. Henzinger Logics and Models of Real Time: A Survey 74
J. C. M. Baeten and
J. A. Bergstra The State Operator in Real Time Process
Algebra . . . . . . . . . . . . . . . . 107
T. Bolognesi and
F. Lucidi Timed Process Algebras with Urgent
Interactions and a Unique Powerful
Binary Operator . . . . . . . . . . . . 124
J. P. Courtiat and
M. Diaz Time in State Based Formal Description
Techniques for Distributed Systems . . . 149
E. Allen Emerson Real-Time and the Mu-Calculus . . . . . 176
N. Halbwachs and
F. Rocheteau Implementing Reactive Programs on
Circuits: A Hardware Implementation of
LUSTRE . . . . . . . . . . . . . . . . . 195
M. R. Hansen and
Chaochen Zhou Semantics and Completeness of Duration
Calculus . . . . . . . . . . . . . . . . 209
T. A. Henzinger and
Z. Manna and
A. Pnueli Timed Transition Systems . . . . . . . . 226
J. Hooman Compositional Verification of Real-Time
Systems Using Extended Hoare Triples . . 252
C. Huizing and
R. Gerth Semantics of Reactive Systems in
Abstract Time . . . . . . . . . . . . . 291
M. Joseph Problems, Promises and Performance: Some
Questions for Real-Time System
Specification . . . . . . . . . . . . . 315
A. S. Klusener Abstraction in Real Time Process Algebra 325
R. Koymans (Real) Time: A Philosophical Perspective 353
I. Lee and
R. Gerber Specification and Analysis of
Resource-Bound Real-Time Systems . . . . 371
N. Lynch and
F. Vaandrager Forward and Backward Simulations for
Timing-Based Systems . . . . . . . . . . 397
O. Maler and
Z. Manna and
A. Pnueli From Timed to Hybrid Systems . . . . . . 447
A. K. Mok Coping with Implementation Dependencies
in Real-Time System Verification . . . . 485
A. Morzenti Validating Real-Time Systems by
Executing Logic Specifications . . . . . 502
X. Nicollin and
J. Sifakis An Overview and Synthesis on Timed
Process Algebras . . . . . . . . . . . . 526
X. Nicollin and
J. Sifakis and
S. Yovine From ATP to Timed Graphs and Hybrid
Systems . . . . . . . . . . . . . . . . 549
J. S. Ostroff Verification of Safety Critical Systems
Using TIM/RTTL . . . . . . . . . . . . . 573
M. Schenke Predicative Specification of Timed
Processes . . . . . . . . . . . . . . . 603
F. B. Schneider and
B. Bloom and
K. Marzullo Putting Time into Proof Outlines . . . . 618
S. Schneider and
J. Davies and
D. M. Jackson and
G. M. Reed and
J. N. Reed and
A. W. Roscoe Timed CSP: Theory and Practice . . . . . 640
W. G. Wood A Specification of the Cat and Mouse
Problem . . . . . . . . . . . . . . . . 676
J. Zwiers Layering and Action Refinement for Timed
Systems . . . . . . . . . . . . . . . . 687
Jingsen Chen Merging and Splitting Priority Queues
and Deques in Parallel . . . . . . . . . 1
Nader H. Bshouty Lower Bounds for the Complexity of
Functions in a Realistic RAM Model . . . 12
Claire Kenyon and
Valerie King On Boolean Decision Trees with Faulty
Nodes . . . . . . . . . . . . . . . . . 24
Martin Charles Golumbic and
Ron Shamir Interval Graphs, Interval Orders and the
Consistency of Temporal Events . . . . . 32
Andrei Voronkov Higher Order Functions in First Order
Theory . . . . . . . . . . . . . . . . . 43
Walter Dosch Reduction Relations in Strict
Applicative Languages . . . . . . . . . 55
Guy Kortsarz and
David Peleg Approximation Algorithms for Minimum
Time Broadcast . . . . . . . . . . . . . 67
Ben-Asher Yosi and
David Peleg and
Assaf Schuster The Complexity of Reconfiguring Network
Models . . . . . . . . . . . . . . . . . 79
Shmuel Gal and
Yona Hollander and
Alon Itai Optimal Mapping in Direct Mapped Cache
Environments . . . . . . . . . . . . . . 91
Edith Cohen and
Nimrod Megiddo New Algorithms for Generalized Network
Flows . . . . . . . . . . . . . . . . . 103
Victor S. Miller Factoring Polynomials via
Relation-Finding . . . . . . . . . . . . 115
Victor Pan New Resultant Inequalities and Complex
Polynomial Factorization . . . . . . . . 122
Elliot Linzer Can Symmetric Toeplitz Solvers be
Strongly Stable? . . . . . . . . . . . . 137
Ilan Sadeh and
Amir Averbuch Bounds On Parallel Computation of
Multivariate Polynomials . . . . . . . . 147
Cynthia Dwork and
Maurice Herlihy and
Serge A. Plotkin and
Orli Waarts Time-Lapse Snapshots . . . . . . . . . . 154
Rainer Gawlick and
Nancy Lynch and
Nir Shavit Concurrent Timestamping Made Simple . . 171
Jean-Michel Helary and
Michel Raynal Distributed Evaluation: A Tool for
Constructing Distributed Detection
Programs . . . . . . . . . . . . . . . . 184
Evgeny V. Luk-Zilberman Foundations of Asymptotical Theory of
Determinate Compact Testing . . . . . . 195
Irith Ben-Arroyo Hartman Optimal K-Colouring and K-Nesting of
Intervals . . . . . . . . . . . . . . . 207
H. Maurer Why Hypermedia Systems Are Important . . 1
L. Moore and
D. Smith Project CALC: Calculus as a Laboratory
Course . . . . . . . . . . . . . . . . . 16
J. H. Murray and
S. A. Malone The Structures of Advanced Multimedia
Learning Environments: Reconfiguring
Space, Time, Story, and Text . . . . . . 21
M. W. Petruk Adjusting to the Paradigm Shift in
Teaching and Learning or: What Do I Do
Now? . . . . . . . . . . . . . . . . . . 34
B. Shneiderman Engagement and Construction: Educational
Strategies for the Post-TV Era . . . . . 39
B. P. Woolf Building Knowledge-Based Tutors . . . . 46
L. Allinson Learning Styles and Computer-Based
Learning Environments . . . . . . . . . 61
A. M. Anoskey and
R. Catrambone Text and Graphics in Instructional
Design . . . . . . . . . . . . . . . . . 74
A. Badre and
M. Beranek and
J. M. Morris and
J. Stasko Assessing Program Visualization Systems
as Instructional Aids . . . . . . . . . 87
C. Balle and
F. Dubreuil and
B. Bouret At Last! A Computer Aid for the Teaching
of Electronics Which Answers All the
Nagging Questions About Capacitors . . . 100
Th. Beltran and
A. Peninou An Object-Oriented Approach to Produce
Educational Hypermedia Software . . . . 111
K. Bertels and
P. Vanneste and
C. De Backer A Cognitive Model of Programming
Knowledge for Procedural Languages . . . 124
C. Brown and
H. Fell and
V. K. Proulx and
R. Rasala Programming by Experimentation and
Example . . . . . . . . . . . . . . . . 136
D. Clement and
C. Vieville and
P. Vilers An Experiment of Cooperative Learning
with Hypercard . . . . . . . . . . . . . 148
Th. Diessel and
A. Lehmann An ITS for Engineering Domains: Concept,
Design and Application . . . . . . . . . 161
U. Dumslaff and
J. Ebert Structuring the Subject Matter . . . . . 174
W. J. Egnatoff MIDI Draw: Designing an Impressionistic
Medium for Young Musicians, Artists, and
Writers . . . . . . . . . . . . . . . . 187
O. ElHani and
G. Gouarderes Standardized Architecture for Integrated
Open Courseware . . . . . . . . . . . . 198
P. Forcheri and
M. T. Molfino Formal Techniques in Higher Education: A
Proposal . . . . . . . . . . . . . . . . 212
M. Futtersack and
J.-M. Labat QUIZ: A Distributed Intelligent Tutoring
System . . . . . . . . . . . . . . . . . 225
J. C. Gonzalez and
J. J. Sancho and
J. M. Carbo and
A. Patak and
F. Sanz Intelligent Tutorial System in Medicine
Through an Interactive Testing Program:
HyperMIR . . . . . . . . . . . . . . . . 238
R. Gunzenhauser and
A. Zimmermann DCE: A Knowledge-Based Tutoring and
Advisory System: Tutoring Strategies and
Architecture . . . . . . . . . . . . . . 247
R. Hashim and
H. Hamburger Discourse Style and Situation Viewpoint
for a Conversational Language Tutor . . 258
T. Hayashi and
Y. Yano Open Structured CAI System for Kanji
Learning . . . . . . . . . . . . . . . . 271
L. A. Hesser and
R. P. Hogan and
A. P. Mizell The Sum of the Parts Is Greater than the
Whole in Online Graduate Education . . . 283
K. Hidaka Development of GeoBlock: A Micro-World
for Learning and Teaching Geometry . . . 294
L. Hohmann and
M. Guzdial and
E. Soloway SODA: A Computer Aided Design
Environment for the Doing and Learning
of Software Design . . . . . . . . . . . 307
D. Jackson and
M. A. Bell A Graphical CAL Author Language . . . . 320
D. M. Kaminski A Knowledge Base Approach to Learning to
Program in Prolog . . . . . . . . . . . 332
S. Katz and
A. Lesgold and
G. Eggan and
M. Gordin and
L. Greenberg Self-Adjusting Curriculum Planning in
Sherlock II . . . . . . . . . . . . . . 343
Ph. A. Lawson Integrating an Educational Simulation
into a Logic Design Course . . . . . . . 356
M.-Ch. Lee An Algorithm Animation Programming
Environment . . . . . . . . . . . . . . 367
J. Li and
A. Rovick and
J. Michael ABASE: A Hypermedia-Based Tutoring and
Authoring System . . . . . . . . . . . . 380
H. Lianjing A Tool for Developing Intelligent
Tutoring Systems . . . . . . . . . . . . 391
R. Lilly Applying Computer Models of Phonological
Competence to CALL . . . . . . . . . . . 392
L. A. Livingston Vigilance in a Long-Term Cognitive
Computing Task: The Effects of Subject
Strategy and Screen Colour on
Performance . . . . . . . . . . . . . . 405
Ch. Lu and
D. Frye Mastering the Machine: A Comparison of
the Mouse and Touch Screen for
Children's Use of Computers . . . . . . 417
P. Marcenac An Authoring System for ITS Which Is
Based on a Generic Level of Tutoring
Strategies . . . . . . . . . . . . . . . 428
J. Michael and
A. Rovick and
M. Evens and
L. Shim and
Ch. Woo and
N. Kim The Uses of Multiple Student Inputs in
Modeling and Lesson Planning in CAI and
ICAI Programs . . . . . . . . . . . . . 441
M. Muhlhauser and
J. Schaper Project NESTOR: New Approaches to
Cooperative Multimedia
Authoring/Learning . . . . . . . . . . . 453
T. Muldner and
R. Blondon Design and Implementation of Courseware
for Teaching Programming Languages . . . 466
T. Muldner and
M. Elammari OBJECTOR: Yet Another Authoring System 478
R. I. Nicolson Design and Evaluation of the SUMIT
Intelligent Tutoring Assistant for
Arithmetic . . . . . . . . . . . . . . . 491
R. I. Nicolson and
A. J. Fawcett Spelling Remediation for Dyslexic
Children Using the Selfspell Programs 503
R. I. Nicolson and
A. J. Simpson Using HyperCard to Create a Flexible
Learning Package for Statistics: Costs,
Benefits and Effectiveness . . . . . . . 516
Th. Nodenot Educational Software Engineering: A
Methodology Based on Cooperative
Developments . . . . . . . . . . . . . . 529
R. Okamoto and
Y. Yano Environmental CAL for Conversation
Pattern Learning . . . . . . . . . . . . 542
B. de La Passardiere and
A. Dufresne Adaptive Navigational Tools for
Educational Hypermedia . . . . . . . . . 555
K. B. Seminar and
R. N. Robson A Tool for Storing and Exploring Ideas 568
J. Vassileva Dynamic CAL-Courseware Generation Within
an ITS-Shell Architecture . . . . . . . 581
E. Wilson and
I. Lindley and
S. Pullen CALLGUIDE: Using Programmable Hypertext
as a Shell for CALL Programs . . . . . . 592
M. J. Looney and
A. O'Brien Distributed Application Designed Using
MASCOT and Implemented in Ada . . . . . 1
Gary Raines Real Time Ada in the International Space
Station Freedom . . . . . . . . . . . . 9
John A. Anderson and
John D. Sheffler Managing Ada Object-Oriented Development 20
Alison Wearing Software Engineering, Ada and Metrics 35
Rob Duell and
Hugo J. Sebel and
Franklin C. A. de Wit Using Ada Source Code Generators in a
Large Project . . . . . . . . . . . . . 47
Wayne M. Zage and
Dolores M. Zage and
Manjari Bhargava and
Dale J. Gaumer Design and Code Metrics Through a
DIANA-Based Tool . . . . . . . . . . . . 60
Miech Groeneveld Using Ada in Integrating ATC Systems . . 72
W. M. Thomas and
A. Delis and
V. R. Basili An Evaluation of Ada Source Code Reuse 80
Fred A. Maymir-Ducharme Porting Embedded Real-Time Ada Software 92
Juan A. de la Puente and
Juan Zamorano and
Alejandro Alonso and
Jose L. Fernandez Reusable Executives for Hard Real-Time
Systems in Ada . . . . . . . . . . . . . 104
A. Burns and
A. J. Wellings Designing Hard Real-Time Systems . . . . 116
M. Gobin and
M. Timmerman and
F. J. A. Gielen Runtime System Support for Data-Oriented
Synchronization in Ada-9X . . . . . . . 128
Benjamin M. Brosgol and
Robert I. Eachus and
David E. Emery Decimal Arithmetic in Ada . . . . . . . 138
Cheng Jingde Task Dependence Net as a Representation
for Concurrent Ada Programs . . . . . . 150
Leslie C. Lander and
Sandeep Mitra Detection and Avoidance of
Elaboration-Time Problems for Multi-Unit
Real-Time Ada Applications . . . . . . . 165
Arlet Ottens and
Hans Toetenel Simulation of Mosca Specifications in
Ada . . . . . . . . . . . . . . . . . . 182
Steen Silberg Considerations with Regard to Validation
of Ada Debuggers . . . . . . . . . . . . 197
W. Treurniet SWG APSE Test Support Toolset
(Assessment of the CAIS-A Interface Set) 214
Do Thanh-Nu Compilation Integration: A Solution for
the Challenge of Developing and Reusing
Ada Software on Different Platforms . . 230
Tzilla Elrad and
Lee Sungyoung and
Ufuk Verun Extending Working Environments for the
Development of Reactive\slash Adaptive
Systems with Intelligent Controls . . . 242
Lars Lundberg Predicting the Speedup of Parallel Ada
Programs . . . . . . . . . . . . . . . . 257
Susan Flynn Hummel A Highley Parallel Ada Task Scheduler 275
G. Bazalgette and
D. Bekele and
C. Bernon and
M. Filali and
J. M. Rigaud and
A. Sayah STRAda --- An Ada Transformation and
Distribution System . . . . . . . . . . 287
Karlotto Mangold AMPATS --- A Multi-processor Ada Tool
Set . . . . . . . . . . . . . . . . . . 300
M. Bayassi and
H. Bitteur and
J.-F. Jezequel and
P. Legrain A Practical Use of the Ada Rendez-Vous
Paradigm in Distributed Systems . . . . 312
Y. Lirov Gaining Strategic Advantage with
Real-Time Distributed Artificial
Intelligence . . . . . . . . . . . . . . 1
A. B. Cremers and
G. Kniesel and
T. Lemke and
L. Plumer Intelligent Databases and
Interoperability . . . . . . . . . . . . 15
Mark S. Fox The TOVE Project: Towards a Common-Sense
Model of the Enterprise . . . . . . . . 25
B. Radig and
W. Eckstein and
K. Klotz and
T. Messer and
J. Pauli Automatization in the Design of Image
Understanding Systems . . . . . . . . . 35
M. Dincbas Constraint Programming --- an
Alternative to Expert Systems . . . . . 46
H. Yamamoto and
H. Fujimoto Case-Based Reasoning in Expert Systems
Assisting Production Line Design . . . . 49
J. Vanwelkenhuysen Scaling-Up Model-Based Troubleshooting
by Exploiting Design Functionalities . . 59
G. Clark and
P. Mehta and
T. Thomson Application of Knowledge-Based Systems
to Optimised Building Maintenance
Management . . . . . . . . . . . . . . . 69
W. Kehl and
H. Hopfmuller and
T. Koussev and
M. Newstead Application of Model-Based Reasoning to
the Maintenance of Telecommunication
Networks . . . . . . . . . . . . . . . . 79
M. A. Newstead and
B. Stahl and
G. Schapeler Advanced Information Modelling for
Integrated Network Management
Applications . . . . . . . . . . . . . . 89
T. Karamouzis and
S. Feyock An Integration of Case-Based and
Model-Based Reasoning and its
Application to Physical System Faults 100
K.-H. Becks and
J. Dahm and
F. Seidel Analysing Particle Jets with Artificial
Neural Networks . . . . . . . . . . . . 109
L. Monostori and
A. Bothe Convergence Behaviour of Connectionist
Models in Large Scale Diagnostic
Problems . . . . . . . . . . . . . . . . 113
B. Kotterba Pattern Recognition Approach to an
Acoustical Quality Test of Burnt Ceramic
Products . . . . . . . . . . . . . . . . 123
B. Muller Enhancing Software Engineering
Capabilities of PROLOG by
Object-Oriented Concepts . . . . . . . . 127
A. Borden and
U. Cinar Specifying Decision-Making Processes . . 139
R. G. Reynolds and
J. I. Maletic and
E. Zannoni Operationalizing Software Reuse as a
Problem in Inductive Learning . . . . . 143
Ir. W. Zeiler Towards a Real CAD-System Using
Artificial Intelligence Technology . . . 154
B. Pasternak and
G. Gabrielides and
R. Sprengel WIZ --- A Prototype for Knowledge-Based
Drawing Interpretation . . . . . . . . . 164
A. Lekova and
D. Batanov and
N. Nikolaev Intelligent System for Feature-Based
Modelling of Machine Parts . . . . . . . 174
Ll. Vila and
C. Sierra and
A. B. Martinez and
J. Climent Intelligent Process Control by Means of
Expert Systems and Machine Vision . . . 185
U. Schnepf and
A. Asteroth and
M. S. Fischer and
K. Moller Tracking and Grasping of Moving Objects
--- a Behaviour-Based Approach . . . . . 195
B. Mertsching PANTER --- Knowledge Based Image
Analysis System for Workpiece
Recognition . . . . . . . . . . . . . . 205
U. Nonnenmann and
J. K. Eddy KITSS: Using Knowledge-Based Software
Engineering for Functional Testing . . . 215
N. Botten Complex Knowledge Base Verification
Using Matrices . . . . . . . . . . . . . 225
F. Saglietti Structural Testing Strategies Applied to
Knowledge-Based Systems . . . . . . . . 236
D. Barschdorff and
A. Bothe and
U. Gartner and
A. Jager Retraining and Redundancy Elimination
for a Condensed Nearest Neighbour
Network . . . . . . . . . . . . . . . . 246
B. Pagurek and
N. Dawes and
R. Kaye A Multiple Paradigm Diagnostic System
for Wide Area Communication Networks . . 256
G. Lackner and
S. S. Melsheimer and
J. N. Beard Recursive Neural Net Modeling of a
Multi-Zone Tenter Frame Dryer . . . . . 266
D. Bayliss and
S. Berry and
D. Curtis and
B. Cox Representation of the Design to
Manufacture Methodology of the Armour
Protection Element of the Fibre Optic
Submarine Cable Within an Expert System 276
A. Bernardi and
C. Klauck and
R. Legleitner PIM --- Planning in Manufacturing ---
CAPP Using Skeletal Plans . . . . . . . 284
D. Schmidt and
J. Haddock and
W. A. Wallace and
R. Wright Visual Modelling: A Knowledge
Acquisition Method for Intelligent
Process Control Systems . . . . . . . . 294
F. Lehmann and
R. Seising and
E. Walther-Klaus Machine Learning in Communication Nets 304
D. Specht and
S. Weib Supporting Model-Based Diagnosis with
Explanation-Based Learning and
Analogical Inferences . . . . . . . . . 314
Ll. Belanche and
M. Sanchez and
U. Cortes and
P. Serra A Knowledge-Based System for the
Diagnosis of Waste-Water Treatment
Plants . . . . . . . . . . . . . . . . . 324
Fu LiMin Connectionism for Fuzzy Learning in
Rule-Based Expert Systems . . . . . . . 337
Guan Qi and
G. Friedrich Extending Constraint Satisfaction
Problem Solving in Structural Design . . 341
A. Ukita and
T. Kitagawa A Modulation Package Tuning Machine
Applying Fuzzy Logic . . . . . . . . . . 351
C. Ramos and
E. Oliveira Towards Intelligent Robotic Assemblies 361
U. Kernebeck Action Planning for Multiple Robots in
Space . . . . . . . . . . . . . . . . . 371
A. Schrott A Calibration of a Mobile Camera Used
for a Camera-Guided Grasping by an
Eye-In-Hand Robot . . . . . . . . . . . 381
S. Kirn and
J. Schneider STRICT: Selecting the `Right'
Architecture . . . . . . . . . . . . . . 391
L. Cervoni and
F. Rousseaux Solving Temporal Constraints
Satisfaction Problems with an
Object-Oriented Model . . . . . . . . . 401
H. Arai and
Y. Fukazawa and
T. Kadokura and
T. Hasegawa An Integration Mechanism for Design
Models in the Design Environment DATE 411
M. Kopisch and
A. Gunther Configuration of a Passenger Aircraft
Cabin Based on Conceptual Hierarchy,
Constraints and Flexible Control . . . . 421
A. Brinkop and
N. Laudwein Configuration of Industrial
Mixing-Machines-Development of a
Knowledge-Based System . . . . . . . . . 431
O. Najmann and
B. Stein A Theoretical Framework for
Configuration . . . . . . . . . . . . . 441
B. Freisleben Stock Market Prediction with
Backpropagation Networks . . . . . . . . 451
C. de Groot and
D. Wurtz Forecasting Time Series with
Connectionist Nets: Applications in
Statistics, Signal Processing and
Economics . . . . . . . . . . . . . . . 461
T. Van de Merckt ILISCE: A System for Learning Control
Heuristics in a Scheduling Environment 471
G. Weichert and
R. Lackmann KUSET --- Knowledge Based User Support
for Electron Beam Testing . . . . . . . 481
W. Burgard and
S. Luttringhaus-Kappel and
L. Plumer Knowledge-Based Design of Ergonomic
Lighting for Underground Scenarios . . . 491
R. Bruning and
W. Hauenschild and
W. John A Monitoring Approach Supporting
Performance Analysis of Expert Systems
for the EMC Design of Printed Circuit
Boards . . . . . . . . . . . . . . . . . 495
B. Zalik and
N. Guid and
A. Vesel Representing Geometric Objects Using
Constraint Description Graphs . . . . . 505
D. D'Aloisi A Terminological Language for
Representing Complex Knowledge . . . . . 515
S. Goss and
I. Wallace and
K. Bluff Knowledge Representation and Decision
Making: A Hybrid Approach . . . . . . . 525
G. Schmidt Knowledge Acquisition from Text in a
Complex Domain . . . . . . . . . . . . . 529
R. A. Reid and
M. M. Matthews Parallel Parsing of Ambiguous Languages
on Hypercube Architectures . . . . . . . 539
F. Puppe and
U. Gappa Towards Knowledge Acquisition by Experts 546
J. Stefanowski and
R. Nowicki and
R. Slowinski The Rough Sets Approach to Knowledge
Analysis for Classification Support in
Technical Diagnostics of Mechanical
Objects . . . . . . . . . . . . . . . . 556
B. W. Hagen Bi-Directional Probabilistic Assessment 566
D. Nauck and
F. Klawonn and
R. Kruse and
U. Lohs Reasoning under Uncertainty with
Temporal Aspects . . . . . . . . . . . . 572
Z. A. Vale and
A. Machado e. Moura An Expert System Approach for Power
System Diagnosis . . . . . . . . . . . . 581
K.-H. Becks and
A. Hemker and
J. Ortmann and
G. Schlageter and
R. Meyer and
A. B. Cremers DELPHI-EXPERT: An Expert System for
Error Diagnosis in High Energy Physics
Detectors . . . . . . . . . . . . . . . 585
W. Brockmann Combining Real-Time with Knowledge
Processing Techniques . . . . . . . . . 594
R. M. Aiken and
D. Allemang Tailoring Advanced Instructional
Software for AI . . . . . . . . . . . . 604
A. S. Tabandeh Interpreting Unexpected User Activity in
an Intelligent User Interface . . . . . 614
J. Mikulecka and
P. Mikulecky Yet Another Knowledge-Based
Front-End-To-Database Project . . . . . 622
F. Plabmeier and
R. Kuke and
D. Exner and
K. F. Lehmann Fault Diagnosis Based on Simulation
Models . . . . . . . . . . . . . . . . . 626
A. K. Ray and
R. B. Misra Real-Time Fault Diagnosis --- Using
Occupancy Grids and Neural Network
Technology . . . . . . . . . . . . . . . 636
E. Kurz Expert Systems for Fault Diagnosis on
CNC Machines . . . . . . . . . . . . . . 641
Gu Jun Design Efficient Local Search Algorithms 651
G. Ketteler and
M. Lenart The Design of Building Parts by Using
Knowledge Based Systems . . . . . . . . 655
K. P. Mason Information Fusion in a Knowledge-Based
Classification and Tracking System . . . 666
F. Quante and
H. Kirsch and
M. Ruckhaberle Numerical and Syntactic Tools for Fusion
and Diagnosis Provided with the
TOPMUSS-System . . . . . . . . . . . . . 676
K. Milzner Learning Performance Estimations in a
Knowledge Based CAD-Environment . . . . 680
P. Malhotra and
R. E. Seviora Object Oriented Framework for Generating
Machine Understanding of a Digital
System Design . . . . . . . . . . . . . 690
C. J. Skelton and
C. Hammer M. Lopez and
M. J. Reeve and
P. Townsend and
K. F. Wong EDS: A Parallel Computer System for
Advanced Information Processing . . . . 3
Y. Liu and
A. K. Singh and
R. L. Bagrodia A Decompositional Approach to the Design
of Efficient Parallel Programs . . . . . 21
J. Katajainen and
C. Levcopoulos and
O. Petersson Space-Efficient Parallel Merging . . . . 37
J. Hromkovic and
V. Muller and
O. Sykora and
I. Vrto On Embedding Interconnection Networks
into Rings of Processors . . . . . . . . 53
J. Glauert Asynchronous Mobile Processes and Graph
Rewriting . . . . . . . . . . . . . . . 63
F. Capello and
J.-L. Bechennec and
J-L Giavitto PTAH: Introduction to a New Parallel
Architecture for Highly Numeric
Processing . . . . . . . . . . . . . . . 81
P. Osmon and
T. Stiemerling and
T. Valsamidis and
A. Whitcroft and
T. Wilkinson and
N. Williams The Topsy Project: a Position Paper . . 97
R. Feldmann and
J. Hromkovic and
S. Madhavapeddy and
B. Monien and
P. Mysliwietz Optimal Algorithms for Dissemination of
Information in Generalized Communication
Modes . . . . . . . . . . . . . . . . . 115
S. K. Das and
C. C.-Y. Chen Efficient Parallel Algorithms on
Interval Graphs . . . . . . . . . . . . 131
T. Collette and
H. Essafi and
D. Juvin and
J. Kaiser SYMPATIX: a SIMD Computer Performing the
Low and Intermediate Levels of Image
Processing . . . . . . . . . . . . . . . 147
V. Getov $1$-Dimensional Parallel FFT Benchmark
on SUPRENUM . . . . . . . . . . . . . . 163
A. A. Farrag and
R. Dawson and
Q. Yao On Designing Fault-Tolerant Extensions
with Optimal Fanout for Complete
Bipartite Networks . . . . . . . . . . . 177
X. Zhong and
V. M. Lo Application-Specific Deadlock Free
Wormhole Routing on Multicomputers . . . 193
M. Dubois and
L. Barroso and
Y.-S. Chen and
K. Oner Scalability Problems in Multiprocessors
with Private Caches . . . . . . . . . . 211
P. Chavel and
J. Taboury Promises and Issues in Optical Computing 231
J.-P. Bahsoun and
L. Feraud A Model to Design Reusable Parallel
Software Components . . . . . . . . . . 245
L. Thomas Extensibility and Reuse of
Object-Oriented Synchronization
Components . . . . . . . . . . . . . . . 261
M. Spiliopoulou and
M. Hatzopoulos and
C. Vassilakis Using Parallelism and Pipeline for the
Optimisation of Join Queries . . . . . . 279
R. Marek and
E. Rahm Performance Evaluation of Parallel
Transaction Processing in Shared Nothing
Database Systems . . . . . . . . . . . . 295
H. Bi Explicit Expression of Multidimensional
Data Parallelism . . . . . . . . . . . . 313
J.-M. Jezequel and
F. Berghuel and
F. Andre Programming Massively Parallel
Architectures with Sequential Object
Oriented Languages . . . . . . . . . . . 329
M. O'Boyle and
G. A. Hedayat A New Program Transformation to Minimise
Communication in Distributed Memory
Architectures . . . . . . . . . . . . . 347
M. Rudalics Distributed Termination Enforcement . . 363
F. Lin and
T. Shih Verification of Systolic Architecture
Designs . . . . . . . . . . . . . . . . 381
H. Le Verge Reduction Operators in ALPHA . . . . . . 397
L. Moreau An Operational Semantics for a Parallel
Functional Language with Continuations 415
C. Queinnec A Concurrent and Distributed Extension
of Scheme . . . . . . . . . . . . . . . 431
Y. Robert and
S. W. Song New Techniques for Cycle Shrinking . . . 449
G. Jin and
F. Chen Loop Restructuring Techniques for
Thrashing Problem . . . . . . . . . . . 465
E. T. Freeman and
D. P. Friedman Characterizing the Paralation Model
Using Dynamic Assignment . . . . . . . . 483
S. Cox and
S.-Y. Huang and
P. Kelly and
J. Liu and
F. Taylor An Implementation of Static Functional
Process Networks . . . . . . . . . . . . 497
A. J. Martin Translating Concurrent Programs into
VLSI Chips . . . . . . . . . . . . . . . 515
M. J. Wise Message-Brokers and Communicating Prolog
Processes . . . . . . . . . . . . . . . 535
C. Mourlas and
C. Halatsis Extensions to a Parallel Prolog System
to Support Real-Time Applications . . . 551
L. Bic and
J. M. A. Roy and
M. Nagel Declarative Programming for Conventional
MIMD Multiprocessors . . . . . . . . . . 569
Q. Ning and
G. R. Gao Minimizing Loop Storage Allocation for
An Argument-Fetching Dataflow
Architecture Model . . . . . . . . . . . 585
K. A. M. Ali and
R. Karlsson Performance of Muse on the BBN Butterfly
TC2000 . . . . . . . . . . . . . . . . . 603
G. Gupta and
V. Santos Costa And-Or Parallelism in Full Prolog with
Paged Binding Arrays . . . . . . . . . . 617
J. Duato Improving the Efficiency of Virtual
Channels with Time-Dependent Selection
Functions . . . . . . . . . . . . . . . 635
G. V. Wilson Using Opportunistic Combining Networks
to Reduce Contention in Multicomputers 651
M. S. Baig and
T. A. El-Ghazawi and
N. A. Alexandridis Mixed-Mode Multicomputers with Load
Adaptability . . . . . . . . . . . . . . 669
Y. Hidaka and
H. Koike and
H. Tanaka Architecture of Parallel Management
Kernel fo PIE64 . . . . . . . . . . . . 685
M. R. Meybodi Concurrent Data Structures for Hypercube
Machine . . . . . . . . . . . . . . . . 703
B. Codenotti and
M. Leoncini and
G. Resta Repeated Matrix Squaring for the
Parallel Solution of Linear Systems . . 725
J.-M. Kuntz Performance Evaluation of Cache Memories
in Tightly Coupled Multiprocessor
Systems . . . . . . . . . . . . . . . . 735
S. Krishnamoorthy and
A. Choudhary An Evaluation of Set-Associativity in
Two-Level Caches for Shared Memory
Multiprocessors . . . . . . . . . . . . 751
E. Kuhn and
F. Puntigam Reliable Communication in VPL . . . . . 769
P. Anderson and
D. Bolton and
P. Kelly Paragon Specifications: Structure,
Analysis and Implementation . . . . . . 783
A. Gupta Stanford DASH Multiprocessor: The
Hardware and Software Approach . . . . . 801
P. W. P. J. Grefen and
P. M. G. Apers Dynamic Action Scheduling in a Parallel
Database System . . . . . . . . . . . . 809
C. Chachaty and
P. Borla-Salamet and
M. Ward A Compositional Approach for the Design
of a Parallel Query Processing Language 825
F. Cherief Back and Forth Bisimulations On Prime
Event Structures . . . . . . . . . . . . 843
J. Fanchon Dynamic Concurrent Processes . . . . . . 859
F. Carino and
P. Kostamaa Exegesis of DBC/1012 and P-90 Industrial
Supercomputer Database Machines . . . . 877
S. H. Lavington and
M. E. Waite and
J. Robinson and
N. E. J. Dewhurst Exploiting Parallelism in Primitive
Operations on Bulk Data Types . . . . . 893
K. De Bosschere and
J.-M. Jacquet Comparative Semantics of Microlog . . . 911
G. Singh and
A. J. Bernstein A Framework for Parallel Composition of
Protocols . . . . . . . . . . . . . . . 927
S. Gorlatch Parallel Program Development for a
Recursive Numerical Algorithm . . . . . 945
F. Knabe A Distributed Protocol for Channel-Based
Communication with Choice . . . . . . . 947
S. Damy and
G. R. Perrin A Refinement of Communicating Processes 949
P. Caspi and
A. Girault Distributing Finite Transition Systems 951
R. Capobianchi and
R. Guerraoui and
A. Lanusse and
R. Roux Coping with the Process Proliferation
Problem in Concurrent Object-Based
Language Implementations . . . . . . . . 953
J. Gabarro and
R. Gavalda Correctness of Flat Data Parallel
Algorithms: An Axiomatic Approach and
Examples . . . . . . . . . . . . . . . . 955
Z. Chamski Generating Memory-Efficient Imperative
Data Structures from Systolic Programs 957
J.-P. Carrara and
J.-L. Basille and
J.-F. Larue and
D. Juvin Geometric Transforms on Parallel
Architecture . . . . . . . . . . . . . . 959
P. Kacsuk Implementing Cut in a Distributed Data
Driven OR-Parallel Prolog Environment 961
N. de Beaucoudrey and
A. Bellemain and
D. Phalippou and
P. Chavel and
D. Fortin and
I. Exman and
L. Rudolph and
J.-P. Schnell and
J.-P. Pocholle Optical Interconnects for Parallel
Systems: Demonstration of an Optical
Link with Multiple-Quantum-Well
Opto-Electronic Arrays . . . . . . . . . 963
S. F. Liu and
M. L. Soffa Parallel Task Assignment by Graph
Partitioning . . . . . . . . . . . . . . 965
A. Klingler and
V. Penner Parallelizing Recursive Logic Programs
Through Decomposition . . . . . . . . . 967
D. Houzet and
J.-L. Basille and
J.-Y. Latil Performance Analysis of the Network of
the GFLOPS Parallel Architecture . . . . 969
W. Weihl and
E. Brewer and
A. Colbrook and
Ch. Dellarocas and
W. Hsieh and
A. Joseph and
C. Waldspurger and
P. Wang PRELUDE: A System for Portable Parallel
Software . . . . . . . . . . . . . . . . 971
N. J. Dimopoulos and
M. Chowdhury and
R. Sivakumar and
V. Dimakopoulos Routing in Hypercycles. Deadlock Free
and Backtracking Stategies . . . . . . . 973
G. R. R. Justo and
P. H. Welch Serialisation as a Paradigm for the
Engineering of Parallel Programs . . . . 975
J. Perret and
Ph. Gautron SIMCDL: Simulating Parallel Programming
in a Sequential Environment . . . . . . 977
G. Karjoth XFSM: A Formal Model of Communicating
State Machines for Implementation
Specifications . . . . . . . . . . . . . 979
J. M. Nash and
P. M. Dew XPRAM Model and Programming Interface 981
D. E. Knuth Axioms and Hulls . . . . . . . . . . . . 1
Larry Wos The Impossibility of the Automation of
Logical Reasoning (Abstract) . . . . . . 1
Kurt Ammon Automatic Proofs in Mathematical Logic
and Analysis . . . . . . . . . . . . . . 4
Chou Shang-Ching and
Gao Xiao-Shan Proving Geometry Statements of
Constructive Type . . . . . . . . . . . 20
L. M. Hines The Central Variable Strategy of Strive 35
Franz Baader and
Klaus U. Schulz Unification in the Union of Disjoint
Equational Theories: Combining Decision
Procedures . . . . . . . . . . . . . . . 50
Tobias Nipkow and
Zhenyu Qian Reduction and Unification in Lambda
Calculi with Subtypes . . . . . . . . . 66
Daniel J. Dougherty and
Patricia Johann A Combinatory Logic Approach to
Higher-Order E-Unification . . . . . . . 79
Wolfgang Bibel and
Steffen Holldobler and
Jorg Wurtz Cycle Unification . . . . . . . . . . . 94
Katherine A. Yelick and
Stephen J. Garland A Parallel Completion Procedure for Term
Rewriting Systems . . . . . . . . . . . 109
David McAllester Grammar Rewriting . . . . . . . . . . . 124
Adam Cichon and
Pierre Lescanne Polynomial Interpretations and the
Complexity of Algorithms . . . . . . . . 139
Leonidas Fegaras and
Tim Sheard and
David Stemple Uniform Traversal Combinators:
Definition, Use and Properties . . . . . 148
Tomas E. Uribe Sorted Unification Using Set Constraints 163
Alan M. Frisch and
Anthony G. Cohn An Abstract View of Sorted Unification 178
Alexandre Boudet Unification in Order-Sorted Algebras
with Overloading . . . . . . . . . . . . 193
Raymond Smullyan Puzzles and Paradoxes . . . . . . . . . 208
William McCune and
Larry Wos Experiments in Automated Deduction with
Condensed Detachment . . . . . . . . . . 209
Owen L. Astrachan and
Mark E. Stickel Caching and Lemmaizing in Model
Elimination Theorem Provers . . . . . . 224
Vincent J. Digricoli and
Eugene Kochendorfer LIM+ Challenge Problems by RUE
Hyper-Resolution . . . . . . . . . . . . 239
Peter Jackson Computing Prime Implicates Incrementally 253
Geoff Sutcliffe Linear-Input Subset Analysis . . . . . . 268
Belaid Benhamou and
Lakhdar Sais Theoretical Study of Symmetries in
Propositional Calculus and Applications 281
David Basin and
Toby Walsh Difference Matching . . . . . . . . . . 295
Jane Hesketh and
Alan Bundy and
Alan Smaill Using Middle-Out Reasoning to Control
the Synthesis of Tail-Recursive Programs 310
Toby Walsh and
Alex Nunes and
Alan Bundy The Use of Proof Plans to Sum Series . . 325
Martin Protzen Disproving Conjectures . . . . . . . . . 340
Mathias Bauer An Interval-Based Temporal Logic in a
Multivalued Setting . . . . . . . . . . 355
Michael Fisher A Normal Form for First-Order Temporal
Formulae . . . . . . . . . . . . . . . . 370
Ricardo Caferra and
Stephane Demri Semantic Entailment in Non Classical
Logics Based on Proofs Found in
Classical Logic . . . . . . . . . . . . 385
Katsumi Inoue and
Miyuki Koshimura and
Ryuzo Hasegawa Embedding Negation as Failure into a
Model Generation Theorem Prover . . . . 400
Robert S. Boyer and
Yu Yuan Automated Correctness Proofs of Machine
Code Programs for a Commercial
Microprocessor . . . . . . . . . . . . . 416
Zhang Hantao and
Hua Xin Proving the Chinese Remainder Theorem by
the Cover Set Induction . . . . . . . . 431
Peter Madden Automatic Program Optimization Through
Proof Transformation . . . . . . . . . . 446
Grigori Mints Proof Search Theory and Practice in the
(former) USSR (tentative) . . . . . . . 461
Leo Bachmair and
Harald Ganzinger and
Christopher Lynch and
Wayne Snyder Basic Paramodulation and Superposition 462
Robert Nieuwenhuis and
Albert Rubio Theorem Proving with Ordering
Constrained Clauses . . . . . . . . . . 477
Zohar Manna and
Richard Waldinger The Special-Relation Rules Are
Incomplete . . . . . . . . . . . . . . . 492
Bernhard Beckert and
Reiner Hahnle An Improved Method for Adding Equality
to Free Variable Semantic Tableaux . . . 507
N. Shankar Proof Search in the Intuitionistic
Sequent Calculus . . . . . . . . . . . . 522
Frank Pfenning and
Ekkehard Rohwedder Implementing the Meta-Theory of
Deductive Systems . . . . . . . . . . . 537
Wilfred Z. Chen Tactic-Based Theorem Proving and
Knowledge-Based Forward Chaining: An
Experiment with Nuprl and Ontic . . . . 552
William M. Farmer and
Joshua D. Guttman and
F. Javier Thayer Little Theories . . . . . . . . . . . . 567
Jim Christian Some Termination Criteria for Narrowing
and E-Narrowing . . . . . . . . . . . . 582
Nachum Dershowitz and
Subrata Mitra and
G. Sivakumar Decidable Matching for Convergent
Systems . . . . . . . . . . . . . . . . 589
Delia Kesner Free Sequentiality in Orthogonal
Order-Sorted Rewriting Systems with
Constructors . . . . . . . . . . . . . . 603
R. C. Sekar and
I. V. Ramakrishnan Programming with Equations: A Framework
for Lazy Parallel Evaluation . . . . . . 618
Anthony G. Cohn A Many Sorted Logic with Possibly Empty
Sorts . . . . . . . . . . . . . . . . . 633
Andrei Voronkov Theorem Proving in Non-Standard Logics
Based on the Inverse Method . . . . . . 648
Konstantine Vershinin and
Igor Romanenko One More Logic with Uncertainty and
Resolution Principle for it . . . . . . 663
Li Dafa A Natural Deduction Automated Theorem
Proving System . . . . . . . . . . . . . 668
Tobias Nipkow and
Lawrence C. Paulson Isabelle-91 . . . . . . . . . . . . . . 673
Geoff Sutcliffe The Semantically Guided Linear Deduction
System . . . . . . . . . . . . . . . . . 677
Kurt Ammon The SHUNYATA System . . . . . . . . . . 681
Chou Shang-Ching A Geometry Theorem Prover for
Macintoshes . . . . . . . . . . . . . . 686
Hua Xin and
Zhang Hantao FRI: Failure-Resistant Induction in RRL 691
Zhang Hantao Herky: High Performance Rewriting in RRL 696
William M. Farmer and
Joshua D. Guttman and
F. Javier Thayer IMPS: System Description . . . . . . . . 701
Geoffrey D. Alexander and
David A. Plaisted Proving Equality Theorems with
Hyper-Linking . . . . . . . . . . . . . 706
Jawahar Chirimar and
Carl A. Gunter and
Myra VanInwegen Xpnet: A Graphical Interface to Proof
Nets with an Efficient Proof Checker . . 711
Dave Barker-Plummer and
Sidney C. Bailin and
Andrew S. Merrill and: Automated Natural Deduction . . . . 716
Tomas E. Uribe and
Alan M. Frisch and
Michael K. Mitchell An Overview of FRAPPS 2.0: A Framework
for Resolution-Based Automated Proof
Procedure Systems . . . . . . . . . . . 721
Dave Barker-Plummer and
Alex Rothenberg The GAZER Theorem Prover . . . . . . . . 726
Ewing L. Lusk and
William W. McCune and
John Slaney ROO: A Parallel Theorem Prover . . . . . 731
T. C. Wang and
Allen Goldberg RVF: An Automated Formal Verification
System . . . . . . . . . . . . . . . . . 735
Johann M. Ph. Schumann KPROP --- An AND-Parallel Theorem Prover
for Propositional Logic Implemented in
KL1 . . . . . . . . . . . . . . . . . . 740
K. Blackburn A Report on ICL HOL . . . . . . . . . . 743
S. Owre and
J. M. Rushby and
N. Shankar PVS: A Prototype Verification System . . 748
Wolfgang Reif The KIV System: Systematic Construction
of Verified Software . . . . . . . . . . 753
Bernhard Beckert and
Stefan Gerberding and
Reiner Hahnle and
Werner Kernig The Tableau-Based Theorem Prover
${}_{3T}^{\mbox {A P}}$ for
Multiple-Valued Logics . . . . . . . . . 758
Edmund Clarke and
Xudong Zhao Analytica --- A Theorem Prover in
Mathematica . . . . . . . . . . . . . . 761--765
Klaus Schneider and
Ramayya Kumar and
Thomas Kropf The FAUST-Prover . . . . . . . . . . . . 766
Dan Craigen and
Sentot Kromodimoeljo and
Irwin Meisels and
Bill Pase and
Mark Saaltink Eves System Description . . . . . . . . 771
Ryuzo Hasegawa and
Miyuki Koshimura and
Hiroshi Fujita MGTP: A Parallel Theorem Prover Based on
Lazy Model Generation . . . . . . . . . 776
Ewing L. Lusk and
Larry Wos Benchmark Problems in Which Equality
Plays the Major Role . . . . . . . . . . 781
D. A. Randell and
A. G. Cohn and
Z. Cui Computing Transivity Tables: A Challenge
for Automated Theorem Provers . . . . . 786
J. R. Anderson Intelligent Tutoring and High School
Mathematics . . . . . . . . . . . . . . 1
J. Breuker Generality Watching: ITS Caught Between
Science and Engineering . . . . . . . . 11
W. J. Clancey Guidon-Manage Revisited: A
Socio-Technical Systems Approach . . . . 21
B. Du Boulay Programming Environments for Novices . . 37
J. E. Greer Granularity and Context in Learning . . 38
A. M. Lesgold Going from Intelligent Tutors to Tools
for Learning . . . . . . . . . . . . . . 39
A. Bergeron Assisted Mathematics: The Case of
Discrete Probabilities . . . . . . . . . 40
S. Bhuiyan and
J. E. Greer and
G. I. McCalla Learning Recursion Through the Use of a
Mental Model-Based Programming
Environment . . . . . . . . . . . . . . 50
R. Chevallier STUDIA: un syst\`eme tutoriel
intelligent coopératif fondé sur la
négociation et sur un mod\`ele dynamique
de dialogue . . . . . . . . . . . . . . 58
C. Frasson and
M. Kaltenbach and
J. Gecsei and
J.-Y. Djamen An Iconic Intention-Driven ITS
Environment . . . . . . . . . . . . . . 66
T. Hirashima and
A. Kashihara and
J. Toyoda Providing Problem Explanation for ITS 76
M. Kurup and
J. E. Greer and
G. I. McCalla The Fawlty Article Tutor . . . . . . . . 84
C. Lamontagne and
J. Bourdeau Towards an Epistemology for Guided
Discovery Tutoring: The Popperian
Connection . . . . . . . . . . . . . . . 92
D. C. Merrill and
B. J. Reiser and
R. Beekelaar and
A. Hamid Making Process Visible: Scaffolding
Learning with Reasoning-Congruent
Representations . . . . . . . . . . . . 103
J. L. Moore Winch Simulation: Multiple, Linked
Representations of Linear Functions . . 111
J.-A. Sime and
R. Leitch A Learning Environment Based on Multiple
Qualitative Models . . . . . . . . . . . 116
A. Takeuchi and
S. Otsuki EXPITS: An Experimental Environment on
ITS . . . . . . . . . . . . . . . . . . 124
M. Yibin and
L. Jianxiang Intelligent Tutoring System for Symbolic
Calculation . . . . . . . . . . . . . . 132
T.-W. Chan Curriculum Tree: A Knowledge-Based
Architecture for Intelligent Tutoring
Systems . . . . . . . . . . . . . . . . 140
C. Choquet and
T. Mengelle and
G. Gouarderes and
B. Malsallez L'assistance \`a l'usager dans DIGITEF:
un mécanisme réutilisable . . . . . . . . 148
E. Chouraqui and
C. Inghilterra Résolution par analogie de probl\`emes
géometriques dans une perspective
tutorielle . . . . . . . . . . . . . . . 156
R. W. Chu and
Ch. M. Mitchell A Pedagogical Design and Architecture
for Intelligent Tutoring and Aiding in
Supervisory Control of Complex Systems 164
J. Girard and
G. Gauthier and
S. Levesque Une architecture multiagent . . . . . . 172
Ch. Herzog From Elementary Knowledge Schemes
Towards Heuristic Expertise ---
Designing an ITS in the Field of
Parallel Programming . . . . . . . . . . 183
D. D. Suthers Answering Student Queries: Functionality
and Mechanisms . . . . . . . . . . . . . 191
K.-K. Yum and
Th. J. Richards Instruction as Reasoning About Multiple
Objectives . . . . . . . . . . . . . . . 199
E. Gavignet and
M. Grandbastien Représentation des connaissances dans un
générateur de syst\`emes d'E.I.A.O . . . . 209
R. A. Khuwaja and
M. W. Evens and
A. A. Rovick and
J. A. Michael Knowledge Representation for an
Intelligent Tutoring System Based on a
Multilevel Causal Model . . . . . . . . 217
W. Sack Knowledge Base Compilation and the
Language Design Game . . . . . . . . . . 225
K. Van Marcke Instructional Expertise . . . . . . . . 234
T. Chan and
Y. S. Chee and
E. L. Lim COGNITIO: An Extended Computational
Theory of Cognition . . . . . . . . . . 244
M. P. Daniel and
L. Nicaud and
V. Prince and
M. P. Pery-Woodley Apport du style linguistique a la
modelisation cognitive d'un eleve . . . 252
L. Ghemri A Cognitive Framework for Second
Language Error Diagnosis . . . . . . . . 260
M. Kuzmycz and
G. I. Webb Evaluation of Feature Based Modelling in
Subtraction . . . . . . . . . . . . . . 269
A. Mayers and
B. Lefebvre Une modelisation de l'architecture
cognitive d'un étudiant pour un syst\`eme
tutoriel intelligent . . . . . . . . . . 277
B. B. Schwarz and
A. S. Kohn and
L. B. Resnick Bootstrapping Mental Constructions: A
Learning System About Negative Numbers 286
C. Mobus and
K. Pitschke and
O. Schroder Towards the Theory-Guided Design of Help
Systems for Programming and Modelling
Tasks . . . . . . . . . . . . . . . . . 294
C. Tattersall A New Architecture for Intelligent Help
Systems . . . . . . . . . . . . . . . . 302
H. Wang and
A. Kushniruk The UNIX Tutor . . . . . . . . . . . . . 317
R. Allen and
C. Desmoulins and
L. Trilling Tuteurs intelligents et intelligence
artificielle: probl\`emes posés en
construction de figures géométriques . . . 325
M. Baron and
P. Simonnet Génération d'exercices en alg\`ebre,
premi\`eres approches dans le cadre du
projet APLUSIX . . . . . . . . . . . . . 335
T. S. Gegg-Harrison ADAPT: Automated Debugging in an
Adaptive Prolog Tutor . . . . . . . . . 343
J.-F. Nicaud Reference Network: A Genetic Model for
Intelligent Tutoring Systems . . . . . . 351
G. Lessard and
M. Levison and
E. Girard and
D. Maher Form, Frequency, Markedness and
Strategies in Second Language
Performance Modelling . . . . . . . . . 360
R. Or-Bach and
E. Bar-On Why Should an ITS Bother with Students'
Explanations? . . . . . . . . . . . . . 372
M. M. Recker and
P. Pirolli Student Strategies for Learning
Programming from a Computational
Environment . . . . . . . . . . . . . . 382
Y. Wang and
R. Garigliano An Intelligent Language Tutoring System
for Handling Errors Caused by Transfer 395
P. Brna and
A. Caiger The Application of Cognitive Diagnosis
to the Quantitative Analysis of Simple
Electrical Circuits . . . . . . . . . . 405
A. T. Corbett and
J. R. Anderson Student Modeling and Mastery Learning in
a Computer-Based Programming Tutor . . . 413
P. Dion and
R. Lelouche Application de la méthodologie du traçage
de mod\`ele \`a un environnement
d'apprentissage utilisant une stratégie
pédagogique non directive . . . . . . . . 421
C. Frasson and
D. Ramazani Prédiction du niveau d'acquisition des
connaissances dans la modelisation de
l'étudiant . . . . . . . . . . . . . . . 435
X. Huang and
G. I. McCalla Instructional Planning Using Focus of
Attention . . . . . . . . . . . . . . . 443
Y. Kono and
M. Ikeda and
R. Mizoguchi To Contradict is Human --- Student
Modeling of Inconsistency . . . . . . . 451
P. Marcenac Mise en oeuvre d'un mod\`ele de
l'apprenant générique dans le syst\`eme
EDDI . . . . . . . . . . . . . . . . . . 459
N. Matsuda and
T. Okamoto Student Model Diagnosis for Adaptive
Instruction in ITS . . . . . . . . . . . 467
P. Nehemie A Systemic Approach for Student Modeling
in a Multi-Agent Aided Learning
Environment . . . . . . . . . . . . . . 475
M. Talbi and
M. Joab Diagnostic cognitif de l'apprenant par
apprentissage symbolique . . . . . . . . 483
M. Villano Probabilistic Student Models: Bayesian
Belief Networks and Knowledge Space
Theory . . . . . . . . . . . . . . . . . 491
P. L. Brusilovsky A Framework for Intelligent Knowledge
Sequencing and Task Sequencing . . . . . 499
C. Gutwin and
G. I. McCalla The Use of Pedagogic Misrepresentation
in Tutorial Dialogue . . . . . . . . . . 507
J.-M. Labat and
M. Futtersack and
M. Vivet Planification pédagogique: de l'expertise
humaine \`a sa modelisation dans un STI 515
N. Major and
H. Reichgelt COCA: A Shell for Intelligent Tutoring
Systems . . . . . . . . . . . . . . . . 523
P. Mohan and
J. E. Greer and
M. Jones Enhancing the Instructional Capabilities
of Intelligent Tutoring Systems . . . . 531
P. Pirolli and
M. Wilson Measuring Learning Strategies and
Understanding: A Research Framework . . 539
M. M. Sebrechts From Testing to Training: Evaluating
Automated Diagnosis in Statistics and
Algebra . . . . . . . . . . . . . . . . 559
T. Del Soldato Detecting and Reacting to the Learner's
Motivational State . . . . . . . . . . . 567
V. Aleven and
K. D. Ashley Automated Generation of Examples for a
Tutorial in Case-Based Argumentation . . 575
K. S. R. Anjaneyulu and
J. R. Anderson The Advantages of Data Flow Diagrams for
Beginning Programming . . . . . . . . . 585
T. Murray and
B. P. Woolf Tools for Teacher Participation in ITS
Design . . . . . . . . . . . . . . . . . 593
K. Valley Explanation in Expert System Shells: A
Tool for Exploration and Learning . . . 601
B. L. Bell and
R. G. Feifer Intelligent Tutoring with Dumb Software 615
E. Gutstein Using Expert Tutor Knowledge to Design a
Self-Improving Intelligent Tutoring
System . . . . . . . . . . . . . . . . . 625
R. Winkels and
J. Breuker Modeling Expertise for Educational
Purposes . . . . . . . . . . . . . . . . 633
T.-W. Chan and
I.-L. Chung and
R.-G. Ho and
W.-J. Hou and
G.-L. Lin Distributed Learning Companion System:
WEST Revisited . . . . . . . . . . . . . 643
P. Dillenbourg and
J. A. Self People Power: A Human-Computer
Collaborative Learning System . . . . . 651
A. Diaz-Ilarraza and
J. A. Elorriaga and
I. Fernandez-Castro and
J. Gutierrez-Serrano and
J. A. Vadillo-Zorita User Modeling and Architecture in
Industrial ITSs . . . . . . . . . . . . 661
A. A. Eggert and
C. H. Middlecamp and
A. T. Jacob CHEMPROF: The Chemical Literacy Problem 669
J. McKendree and
B. Radlinski and
M. E. Atwood The Grace Tutor: A Qualified Success . . 677
E. Best Esprit Basic Research Action 3148 DEMON
(design methods based on nets) --- aims,
scope and achievements . . . . . . . . . 1
E. Best and
R. Devillers and
J. G. Hall The box calculus: a new causal algebra
with multi-label communication . . . . . 21
M. Broy and
Th. Streicher Modular functional modelling of Petri
nets with individual tokens . . . . . . 70
I. Czaja and
R. J. van Glabbeek and
U. Goltz Interleaving semantics and action
refinement with atomic choice . . . . . 89
R. Devillers Maximality preservation and the ST-idea
for action refinements . . . . . . . . . 108
J. Fanchon A fifo-net model for processes with
asynchronous communication . . . . . . . 152
R. Hopkins and
J. Hall and
O. Botti A basic-net algebra for program
semantics and its application to OCCAM 179
N. W. Keesmaat and
H. C. M. Kleijn The effect of vector synchronization:
residue and loss . . . . . . . . . . . . 215
M. Koutny Modelling systems with dynamic
priorities . . . . . . . . . . . . . . . 251
B. Rozoy On distributed languages and models for
concurrency . . . . . . . . . . . . . . 267
W. Vogler Partial words versus processes: a short
comparison . . . . . . . . . . . . . . . 292
L. Bernardinello and
F. De Cindio A survey of basic net models and modular
net classes . . . . . . . . . . . . . . 304
J. Campos and
M. Silva Structural techniques and performance
bounds of stochastic Petri net models 352
P. Gastin and
A. Petit A survey of recognizable languages with
infinite traces . . . . . . . . . . . . 392
L. Pomello and
G. Rozenberg and
C. Simone A survey of equivalence notions for net
based systems . . . . . . . . . . . . . 410
M. P. Papazoglou and
J. Zeleznikow Introduction: The Next Generation of
Information Systems --- From
Intelligence to Distribution and
Cooperation . . . . . . . . . . . . . . 1
S. Danforth and
E. Simon A Data and Operation Model for Advanced
Database Systems . . . . . . . . . . . . 9
R. George and
B. P. Buckles and
F. E. Petry An Object-Oriented Data Model to
Represent Uncertainty in Coupled
Artificial Intelligence-Database Systems 37
I. E. Jelly and
J. P. Gray Common Architectures for Databases and
Knowledge-Based Systems . . . . . . . . 49
J. Debenham The Construction of Maintainable
Knowledge Bases . . . . . . . . . . . . 58
H. S. Yuen and
S. Ho and
J. Zeleznikow Adding Qualitative Reasoning to an
Organizational Database for Management
Decision Support . . . . . . . . . . . . 79
M. Stolze and
M. Gutknecht and
R. Pfeifer Building Human-Centred Intelligent
Cooperative Information Systems with
IKEA . . . . . . . . . . . . . . . . . . 104
T. Richards and
L. Richards Database Organization for Qualitative
Analysis: The NUDIST System . . . . . . 116
R. Bland and
J. Cowie and
T. Kane and
C. Rattray and
I. Wilson Using a Prolog Engine to Integrate
Multiple Knowledge Sources: The
KCM\slash Help-Desk Project . . . . . . 134
L. Marinos and
R. A. Smit From Relations to Objects: A Translation
Methodology for an Object-Oriented
Front-End to RDBMSs . . . . . . . . . . 148
J. Vittal and
B. Silver and
W. Frawley and
G. Iba and
T. Fawcett and
S. Dusseault and
J. Doleac A Framework for Cooperative Adaptable
Information Systems . . . . . . . . . . 169
S. Kirn and
A. Scherer and
G. Schlageter Problem Solving in Federative
Environments: The FRESCO Concept of
Cooperative Agents . . . . . . . . . . . 185
P. Bernus Heterogeneous Database Integration
Architecture Based on a Conversation
Theoretic Skeleton . . . . . . . . . . . 204
S. C. Laufmann Coarse-Grained Distributed Agents for
Transparent Access to Remote Systems . . 223
J. C. Weber A Forward-Chaining Information Framework 238
K. J. Werkman Using Negotiation and Coordination in
Multi-Agent Intelligent Cooperative
Information Systems . . . . . . . . . . 251
J. J.-P. Tsai and
R.-Y. Sheu A Distributed Cooperative Agents
Architecture for Software Development 271
D. Karagiannis and
F. J. Kurfeb and
H.-W. Schmidt Knowledge Selection in Large Knowledge
Bases . . . . . . . . . . . . . . . . . 291
Oscar Nierstrasz Towards an Object Calculus . . . . . . . 1
Kohei Honda and
Mario Tokoro On Asynchronous Communication Semantics 21
Michael Papthomas A Unifying Framework for Process
Calculus Semantics of Concurrent
Object-Oriented Languages . . . . . . . 53
D. A. Wolfram and
Joseph A. Goguen A Sheaf Semantics for FOOPS Expressions 81
Etsuya Shibayama Semantic Layers of Object-Based
Concurrent Computing . . . . . . . . . . 99
Pierre America Formal Techniques for Parallel
Object-Oriented Languages . . . . . . . 119
Vasco Vasconcelos and
Mario Tokoro Traces Semantics for Actor Systems . . . 141
Jean-Marc Andreoli and
Remo Pareschi and
Marc Bourgois Dynamic Programming as Multiagent
Programming . . . . . . . . . . . . . . 163
Ciaran McHale and
Bridget Walsh and
Sean Baker and
Alexis Donnelly Scheduling Predicates . . . . . . . . . 177
Hayssam Saleh and
Philippe Gautron A Concurrency Control Mechanism for C++
Objects . . . . . . . . . . . . . . . . 195
Satoshi Matsuoka and
Takuo Watanabe and
Yuuji Ichisugi and
Akinori Yonezawa Object-Oriented Concurrent Reflective
Architectures . . . . . . . . . . . . . 211
Thorsten Hartmann and
Ralf Jungclaus Abstract Description of Distributed
Object Systems . . . . . . . . . . . . . 227
Peter Wegner Design Issues for Object-Based
Concurrency . . . . . . . . . . . . . . 245
Anonymous Panel: What Is An Object? . . . . . . . 257
Stuart A. Kurtz and
John C. Mitchell and
Michael J. O'Donnell Connecting Formal Semantics to
Constructive Intuitions . . . . . . . . 1
James Lipton Kripke Semantics for Dependent Type
Theory and Realizability Interpretations 22
Scott F. Smith Reflective Semantics of Constructive
Type Theory: Preliminary Report . . . . 33
Simon Thompson Are Subsets Necessary in Martin-Löf Type
Theory? . . . . . . . . . . . . . . . . 46
Lu Jianguo and
Xu Jiafu Development Transformation Based on
Higher Order Type Theory . . . . . . . . 58
Chetan R. Murthy Classical Proofs as Programs: How, What,
and Why . . . . . . . . . . . . . . . . 71
Maria Napierala Classical Type Theory . . . . . . . . . 89
Sun Yong Axiomatization of Calculus of
Constructions . . . . . . . . . . . . . 108
Vipin Swarup and
Uday S. Reddy A Logical View of Assignments . . . . . 131
Michael R. Fellows and
Michael A. Langston Constructivity Issues in Graph
Algorithms . . . . . . . . . . . . . . . 150
Thierry Coquand Constructive Topology and Combinatorics 159
Jawahar Chirimar and
Douglas J. Howe Implementing Constructive Real Analysis:
Preliminary Report . . . . . . . . . . . 165
J. V. Tucker and
J. I. Zucker Examples of Semicomputable Sets of Real
and Complex Numbers . . . . . . . . . . 179
Newcomb Greenleaf Bringing Mathematics Education into the
Algorithmic Age . . . . . . . . . . . . 199
J. Paul Myers and
Ronald E. Prather The Type Structure of CAT . . . . . . . 218
Klaus Weihrauch and
P. Krolak A Simple and Powerful Approach for
Studying Constructivity, Computability,
and Complexity . . . . . . . . . . . . . 228
J. G. Hanko and
E. M. Kuerner and
J. D. Northcutt and
G. A. Wall Workstation Support for Time-Critical
Applications . . . . . . . . . . . . . . 4
K. Jeffay and
D. L. Stone and
F. D. Smith Kernel Support for Live Digital Audio
and Video . . . . . . . . . . . . . . . 10
C. W. Mercer and
H. Tokuda Priority Consistency in Protocol
Architectures . . . . . . . . . . . . . 22
D. Hehmann and
R. G. Herrtwich and
W. Schulz and
T. Schutt and
R. Steinmetz Implementing HeiTS Architecture and
Implementation Strategy of the
Heidelberg High-Speed Transport System 33
G. Coulson and
F. Garcia and
D. Hutchison and
D. Shepherd Protocol Support for Distributed
Multimedia Applications . . . . . . . . 45
L. Ruston and
G. Blair and
G. Coulson and
N. Davies Integrating Computing and
Telecommunications --- A Tale of Two
Architectures . . . . . . . . . . . . . 57
D. Ferrari Design and Applications of a Delay
Jitter Control Scheme for
Packet-Switching Internetworks . . . . . 72
N. Almeida and
J. Cabral and
A. Alves End-to-End Synchronization in
Packet-Switched Networks . . . . . . . . 84
P. Leydekkers and
B. Teunissen Synchronization of Multimedia Data
Streams in Open Distributed Environments 94
D. C. A. Bulterman and
R. van Liere Multimedia Synchronization and UNIX . . 108
T. D. C. Little and
A. Ghafoor Scheduling of Bandwidth-Constrained
Multimedia Traffic . . . . . . . . . . . 120
P. Hoepner Presentation Scheduling of Multimedia
Objects and Its Impact on Network and
Operating System Support . . . . . . . . 132
B. Field and
T. Znati Alpha-Channel --- A Network Level
Abstraction to Support Real-Time
Communication . . . . . . . . . . . . . 148
A. Banerjea and
B. A. Mah The Real-Time Channel Administration
Protocol . . . . . . . . . . . . . . . . 160
B. Wolfinger and
M. Moran A Continuous Media Data Transport
Service and Protocol for Real-Time
Communication in High-Speed Networks . . 171
R. Gusella and
M. Maresca Design Considerations for a Multimedia
Network Distribution Center . . . . . . 185
S. M. Stevens Next Generation Network and Operating
System Requirements for Continuous Time
Media . . . . . . . . . . . . . . . . . 197
S. Gutfreund and
J. Diaz-Gonzalez and
R. Sasnett and
V. Phuah Dynamicity Issues in Broadband Network
Computing . . . . . . . . . . . . . . . 209
R. Cordes and
D. Wybranietz and
R. Vautz Managing Multimedia Sessions on a
Private Broadband Communication System 217
D. P. Anderson and
P. Chan Toolkit Support for Multiuser
Audio/Video Applications . . . . . . . . 230
J. D. Northcutt and
E. M. Kuerner System Support for Time-Critical
Applications . . . . . . . . . . . . . . 242
S. Frey and
D. P. Ingold An Application Framework for Multimedia
Communication . . . . . . . . . . . . . 255
S. Gibbs and
C. Breiteneder and
L. Dami and
V. de Mey and
D. Tsichritzis A Programming Environment for Multimedia
Applications . . . . . . . . . . . . . . 265
G. Blakowski and
J. Hubel and
U. Langrehr Tools for Specifying and Executing
Synchronized Multimedia Presentations 271
R. Steinmetz and
J. C. Fritzsche Abstractions for Continuous-Media
Programming . . . . . . . . . . . . . . 283
J. G. Hanko and
D. Berry and
T. Jacobs and
D. Steinberg Integrated Multimedia at SUN
Microsystems . . . . . . . . . . . . . . 300
K. Meibner Architectural Aspects of Multimedia CD-I
Integration in UNIX/X-Windows
Workstations . . . . . . . . . . . . . . 314
B. Lamparter and
W. Effelsberg X-Movie Transmission and Presentation of
Digital Movies Under X . . . . . . . . . 328
J. Rosenberg and
G. Cruz and
T. Judd Presenting Multimedia Documents over a
Digital Network . . . . . . . . . . . . 346
R. Hinz The CCITT Communication Protocol for
Videophone Teleconferencing Equipment 358
U. Zolzer and
N. Kalff FDDI-Based Digital Audio Interfaces . . 368
B. Cousin Digital Video Transmission and the FDDI
Token Ring Protocol . . . . . . . . . . 375
E. W. Biersack A Performance Study of Forward Error
Correction in ATM Networks . . . . . . . 391
Anonymous Workshop Wrap-Up . . . . . . . . . . . . 403
R. Trappl AI: Introduction, Paradigms,
Applications (Including CBR), Impacts,
Visions . . . . . . . . . . . . . . . . 1
I. M. Havel Artificial Intelligence and
Connectionism: Some Philosophical
Implications . . . . . . . . . . . . . . 25
D. R. Gilbert and
C. J. Hogger Logic for Representing and Implementing
Knowledge about System Behaviour . . . . 42
O. Stepankova and
P. Stepanek Prolog: A Step towards the Future of
Programming . . . . . . . . . . . . . . 50
F. Kriwaczek An Introduction to Constraint Logic
Programming . . . . . . . . . . . . . . 82
J. Eder Logic and Databases . . . . . . . . . . 95
M. Kubat Introduction to Machine Learning . . . . 104
P. B. Brazdil Approaches to Inductive Logic
Programming . . . . . . . . . . . . . . 139
S. Moscatelli and
Y. Kodratoff Advanced Machine Learning Techniques for
Computer Vision . . . . . . . . . . . . 161
S. Steel Notes on Current Trends in AI Planning 198
G. Kelleher The Application of Reason Maintenance
Systems in Planning and Scheduling . . . 208
J. Lazansky Practical Applications of Planning Tasks 238
G. J. Klir The Role of Uncertainty Measures and
Principles in AI . . . . . . . . . . . . 245
R. Jirousek Introduction to Probabilistic Methods of
Knowledge Representation and Processing 255
P. Hajek and
D. Harmanec On Belief Functions . . . . . . . . . . 286
Z. Kouba Data Analysis and Uncertainty Processing 308
V. Marik and
T. Vlcek Some Aspects of Knowledge Engineering 316
N. V. Findler An Automatic Knowledge Acquisition Tool 338
J. Doran Distributed AI and its Applications . . 368
J. Cuena Architectures for Second Generation
Knowledge Based Systems . . . . . . . . 373
O. Stepankova An Introduction to Qualitative Reasoning 404
I. Mozetic Model-Based Diagnosis: An Overview . . . 419
I. Bratko Dynamic System Simulation with
Qualitative Differential Equations . . . 431
G. Dorffner An Introduction to Neurocomputing and
its Possible Role in AI . . . . . . . . 440
E. A. Edmonds and
B. S. Murray Intelligent Presentation and Dialogue
Management . . . . . . . . . . . . . . . 465
E. Hajicova Linguistic Aspects of Natural Language
Processing . . . . . . . . . . . . . . . 477
M. L. Brodie The Promise of Distributed Computing and
the Challenges of Legacy Systems . . . . 1
D. J. L. Gradwell Object-Oriented Requirements Capture and
Analysis --- The Orca Project . . . . . 29
S. R. Monk and
I. Sommerville A Model for Versioning of Classes in
Object-Oriented Databases . . . . . . . 42
E. Tuv and
A. Poulovassilis and
M. Levene A Storage Manager for the Hypernode
Model . . . . . . . . . . . . . . . . . 59
G. Saake and
R. Jungclaus Views and Formal Implementation in
Three-Level Schema Architecture for
Dynamic Objects . . . . . . . . . . . . 78
A. Holman The Meiko Computing Surface: A Parallel
and Scalable Open Systems Platform for
Oracle . . . . . . . . . . . . . . . . . 96
J. Page A Study of a Parallel Database Machine
and its Performance --- The NCR/Teradata
DBC/1012 . . . . . . . . . . . . . . . . 115
M. Unwalla and
J. Kerridge Control of a Large Massively Parallel
Database Machine Using SQL Catalogue
Extensions, and a DSDL in Preference to
an Operating System . . . . . . . . . . 138
D. R. Sutton and
P. J. H. King Integration of Modal Logic and the
Functional Data Model . . . . . . . . . 156
M. H. Kay and
P. J. Rivett and
T. J. Walters The Raleigh Activity Model: Integrating
Versions, Concurrency, and Access
Control . . . . . . . . . . . . . . . . 175
R. Cooper and
Z. Qin A Graphical Data Modelling Program with
Constraint Specification and Management 192
M. A. Qutaishat and
N. J. Fiddian and
W. A. Gray Association Merging in a Schema
Meta-Integration System for a
Heterogeneous Object-Oriented Database
Environment . . . . . . . . . . . . . . 209
O. Diaz and
S. M. Embury Generating Active Rules from High-Level
Specifications . . . . . . . . . . . . . 227
M. M. Fonkam and
W. A. Gray Employing Integrity Constraints for
Query Modification and Intensional
Answer Generation in Multi-Database
Systems . . . . . . . . . . . . . . . . 244
Ewa Orlowska Algebraic Aspects of the Relational
Knowledge Representation: Modal Relation
Algebras . . . . . . . . . . . . . . . . 1
Christian Schumacher A Logic for Memory . . . . . . . . . . . 23
Michael Morreau Actions with Preconditions and
Postconditions . . . . . . . . . . . . . 46
Jurgen Gehne Testclasses and Closed World Assumptions
for Non-Horn Theories . . . . . . . . . 56
David Pearce Reasoning with Negative Information, II:
Hard Negation, Strong Negation and Logic
Programs . . . . . . . . . . . . . . . . 63
Gerd Wagner Lindenbaum-Algebraic Semantics of Logic
Programs . . . . . . . . . . . . . . . . 80
Andre Fuhrmann Conditional Logics and Cumulative Logics 92
Heinrich Herre Semantics of Nonmonotonic Reasoning in
Logic Programming . . . . . . . . . . . 104
Heinrich Wansing Formulas-as-types for a Hierarchy of
Sublogics of Intuitionistic
Propositional Logic . . . . . . . . . . 125
Peter Schroeder-Heister Cut Elimination for Logics with
Definitional Reflection . . . . . . . . 146
D. A. Archangelsky and
M. A. Taitslin Modal Linear Logic . . . . . . . . . . . 1
G. Baliga and
J. Case and
S. Jain and
M. Suraj Machine Learning of Higher Order
Programs . . . . . . . . . . . . . . . . 9
R. Beigel and
M. Kummer and
F. Stephan Quantifying the Amount of Verboseness 21
P. N. Benton Strictness Logic and Polymorphic
Invariance . . . . . . . . . . . . . . . 33
A. L. Brown and
S. Mantha and
T. Wakayama Preference Logics and Non-Monotonicity
in Logic Programming . . . . . . . . . . 45
A. Calo and
J. A. Makowsky The Ehrenfeucht-Fraisse Games for
Transitive Closure . . . . . . . . . . . 57
K. Cerans Feasibility of Finite and Infinite Paths
in Data Dependent Programs . . . . . . . 69
L. Chen An Interleaving Model for Real-Time
Systems . . . . . . . . . . . . . . . . 81
S. Christensen A Logical Characterization of
Asynchronously Communicating Agents . . 93
P. de Groote Denotations for Classical Proofs ---
Preliminary Results . . . . . . . . . . 105
N. Dershowitz and
E. M. Reingold Ordinal Arithmetic with List Structures 117
A. Edalat Continuous I-Categories . . . . . . . . 127
M. Fitting Many-Valued Non-Monotonic Modal Logics 139
D. Galmiche and
G. Perrier Automated Deduction in Additive and
Multiplicative Linear Logic . . . . . . 151
B. Gamatie Intensionally Stable Functions . . . . . 163
A. Gupta A Constructive Proof that Trees Are
Well-Quasi-Ordered Under Minors . . . . 174
L. A. Hemachandra and
S. Jain and
N. K. Vereshchagin Banishing Robust Turing Completeness . . 186
S. Hirokawa Balanced Formulas, BCK-Minimal Formulas
and Their Proofs . . . . . . . . . . . . 198
R. Hoofman Non-Stable Models of Linear Logic . . . 209
A. King and
P. Soper Ordering Optimizations for Concurrent
Logic Programs . . . . . . . . . . . . . 221
P. M. W. Knijnenburg and
F. Nordemann A Categorical Interpretation of Partial
Function Logic and Hoare Logic . . . . . 229
N. K. Kossovsky and
A. B. Prokhoroff The Polynomial Complexity of Conjunctive
Normal Form Satisfiability, when the
Number of Conjunctions and Negations is
Limited . . . . . . . . . . . . . . . . 241
S. V. Kotov Typed lambda-Calculus with Recursive
Definitions . . . . . . . . . . . . . . 246
K. Lano Set Theoretic Foundations for Fuzzy Set
Theory, and Their Applications . . . . . 258
F. Lesske Constructive Specifications of Abstract
Data Types Using Temporal Logic . . . . 269
R. Li and
J. Carmo An Interval-Based Modal Logic for System
Specification . . . . . . . . . . . . . 281
Z. Luo A Unifying Theory of Dependent Types:
The Schematic Approach . . . . . . . . . 293
V. P. Makarov MSL --- A Mathematical Specification
Language . . . . . . . . . . . . . . . . 305
A. Megrelis Partial Algebra + Order-Sorted Algebra =
Galactic Algebra . . . . . . . . . . . . 314
A. Momigliano Minimal Negation and Hereditary Harrop
Formulae . . . . . . . . . . . . . . . . 326
J. Mullins Kleene Automata and Recursion Theory . . 336
A. Mycroft Incremental Polymorphic Type Checking
with Update . . . . . . . . . . . . . . 347
J. A. Plaza Operators on Lattices of omega-Herbrand
Interpretations . . . . . . . . . . . . 358
A. Pliuskeviciene Sequential Calculus for Proving the
Properties of Regular Programs . . . . . 370
R. Pliuskevicius Complete Sequential Calculi for the
First Order Symmetrical Linear Temporal
Logic with Until and Since . . . . . . . 382
A. Rabinovich Non Modularity and Expressibility for
Nets of Relations . . . . . . . . . . . 394
W. Reif Correctness of Generic Modules . . . . . 406
K. Sadi and
F. Meunier An And-Parallelism Cooperative Scheme
for Full Prolog Interpreters on a
Transputer-Based Architecture . . . . . 418
J. Sakalauskaite A Sequent Calculus for a First Order
Linear Temporal Logic with Equality . . 430
B.-H. Schlingloff On the Expressive Power of Modal Logics
on Trees . . . . . . . . . . . . . . . . 441
N. V. Shilov Propositional Dynamic Logic with Fixed
Points: Algorithmic Tools for
Verification of Finite State Machines 452
D. Spreen Effective Operators and Continuity
Revisited . . . . . . . . . . . . . . . 459
I. A. Stewart Logical Characterizations of Bounded
Query Classes I: Logspace Oracle
Machines . . . . . . . . . . . . . . . . 470
J. Tiuryn Solving Equational Constraints in
Polymorphic Types . . . . . . . . . . . 480
S. Tupailo Gentzen-Style and Novikov-Style
Cut-Elimination . . . . . . . . . . . . 493
W. van der Hoek and
J.-J. Ch. Meyer Graded Modalities in Epistemic Logic . . 503
A. V. Gerbessiotis and
L. G. Valiant Direct Bulk-Synchronous Parallel
Algorithms (Invited) . . . . . . . . . . 1
R. Freivalds and
C. H. Smith Memory Limited Inductive Inference
Machines . . . . . . . . . . . . . . . . 19
F. Fich and
M. Kowaluk and
K. Lory\'s and
M. Kutylowski and
P. Ragde Retrieval of Scattered Information by
EREW, CREW and CRCW PRAMs . . . . . . . 30--41
A. A. Razborov On Small Depth Threshold Circuits
(Invited) . . . . . . . . . . . . . . . 42
N. Pippenger An Elementary Approach to Some Analytic
Asymptotics . . . . . . . . . . . . . . 53
A. Czumaj An Optimal Parallel Algorithm for
Computing a Near-Optimal Order of Matrix
Multiplications . . . . . . . . . . . . 62
G. Kortsarz and
D. Peleg Generating Sparse 2-Spanners . . . . . . 73
B. Awerbuch and
B. Berger and
L. Cowen and
D. Peleg Low-Diameter Graph Decomposition is in
NC . . . . . . . . . . . . . . . . . . . 83
X. He Parallel Algorithm for Cograph
Recognition with Applications . . . . . 94
S. K. Ghosh and
A. Maheshwari Parallel Algorithms for All Minimum Link
Paths and Link Center Problems . . . . . 106
M. Kaufmann and
J. F. Sibeyn Optimal Multi-Packet Routing on the
Torus . . . . . . . . . . . . . . . . . 118
M. C. Pinotti and
G. Pucci Parallel Algorithms for Priority Queue
Operations . . . . . . . . . . . . . . . 130
P. F. Dietz Heap Construction in the Parallel
Comparison Tree Model . . . . . . . . . 140
J. Boyar and
K. S. Larsen Efficient Rebalancing of Chromatic
Search Trees . . . . . . . . . . . . . . 151
A. Jakoby and
R. Reischuk The Complexity of Scheduling Problems
with Communication Delays for Trees . . 165
F. d'Amore and
V. Liberatore The List Update Problem and the
Retrieval of Sets . . . . . . . . . . . 178
W. Cunto and
V. Yriarte GKD-Trees: Binary Trees that Combine
Multi-Dimensional Data Handling, Node
Size, and Fringe Reorganization . . . . 192
S. Sen Fractional Cascading Simplified . . . . 212
D. Giammarresi and
G. F. Italiano Dynamic 2- and 3-Connectivity on Planar
Graphs . . . . . . . . . . . . . . . . . 221
J. Hershberger and
M. Rauch and
S. Suri Fully Dynamic 2-Connectivity in Planar
Graphs . . . . . . . . . . . . . . . . . 233
C. McDiarmid and
B. Reed and
A. Schrijver and
B. Shepherd Non-Interfering Network Flows . . . . . 245
G. Kant and
H. L. Bodlaender Triangulating Planar Graphs While
Minimizing the Maximum Degree . . . . . 258
P. Bertolazzi and
R. F. Cohen and
G. Di Battista and
R. Tamassia and
I. G. Tollis How to Draw a Series-Parallel Digraph 272
M. Furer and
C. R. Subramanian Coloring Random Graphs . . . . . . . . . 284
T. Kloks and
H. Bodlaender Testing Superperfection of kappa-Trees 292
D. Fernandez-Baca and
G. Slutzki Parametric Problems on Graphs of Bounded
Tree-Width . . . . . . . . . . . . . . . 304
G. Gonnet Efficient Two-Dimensional Searching
(Invited) . . . . . . . . . . . . . . . 317
L. P. Chew and
K. Kedem Improvements on Geometric Pattern
Matching Problems . . . . . . . . . . . 318
D. Joseph and
J. Meidanis and
P. Tiwari Determining DNA Sequence Similarity
Using Maximum Independent Set Algorithms
for Interval Graphs . . . . . . . . . . 326
E. Welzl New Results on Linear Programming and
Related Problems (Invited) . . . . . . . 338
M. J. Golin Dynamic Closest Pairs --- A
Probabilistic Approach . . . . . . . . . 340
M. de Berg and
M. van Kreveld and
J. Snoeyink Two- and Three-Dimensional Point
Location in Rectangular Subdivisions . . 352
B. Chazelle and
L. Palios Decomposing the Boundary of a Nonconvex
Polyhedron . . . . . . . . . . . . . . . 364
J. Hershberger and
J. Snoeyink Convex Polygons Made from Few Lines and
Convex Decompositions of Polyhedra . . . 376
H.-P. Lenhof and
M. Smid Maintaining the Visibility Map of
Spheres While Moving the Viewpoint on a
Circle at Infinity . . . . . . . . . . . 388
G. Albers and
T. Roos Voronoi Diagrams of Moving Points in
Higher Dimensional Spaces . . . . . . . 399
J. Katajainen and
T. Pasanen Sorting Multisets Stably in Minimum
Space . . . . . . . . . . . . . . . . . 410
O. Petersson and
A. Moffat A Framework for Adaptive Sorting . . . . 422
A. Vob Foreword . . . . . . . . . . . . . . . . V
F. Schmalhofer Relations Between Knowledge Engineering
and Cognition . . . . . . . . . . . . . 3
G. Dallemagne and
G. Klinker and
D. Marques and
J. McDermott and
D. Tung Making Application Programming More
Worthwhile . . . . . . . . . . . . . . . 6
M. Manago and
N. Conruyt Using Information Technology to Solve
Real World Problems . . . . . . . . . . 23
N. Shadbolt Facts, Fantasies and Frameworks: The
Design of a Knowledge Acquisition
Workbench . . . . . . . . . . . . . . . 39
R. Pfeifer and
T. Rothenfluh and
M. Stolze and
F. Steiner Mapping Expert Behavior onto Task-Level
Frameworks: The Need for
``Eco-Pragmatic'' Approaches to
Knowledge Engineering . . . . . . . . . 59
D. Fensel Knowledge Acquisition and the
Interpretative Paradigm . . . . . . . . 78
D. Janetzko and
G. Strube Case-Based Reasoning and Model-Based
Knowledge Acquisition . . . . . . . . . 99
F. Schmalhofer and
Ch. Globig and
J. Thoben The Refitting of Plans by a Human Expert 115
R. Bergmann Knowledge Acquisition by Generating
Skeletal Plans from Real World Cases . . 125
S. Branskat Knowledge Acquisition from Cases . . . . 134
P. Reimann and
T. J. Shult Transforming Examples into Cases . . . . 139
K.-D. Althoff and
S. Web Case-Based Reasoning and Expert System
Development . . . . . . . . . . . . . . 146
G. Strube The Role of Cognitive Science in
Knowledge Engineering . . . . . . . . . 161
B. Schlenker and
Th. Wetter Knowledge Acquisition as an Empirically
Based Modelling Activity . . . . . . . . 175
M. Linster Shifting Positions: Moving from a
Cognitive Science Point of View to a
Knowledge Engineering Stance . . . . . . 183
F. Puppe and
U. Gappa Two Questions from Expert System
Developers to Cognitive Scientists . . . 190
J. B. Woodward and
M. L. G. Shaw and
B. R. Gaines The Cognitive Basis of Knowledge
Engineering . . . . . . . . . . . . . . 194
Th. Wetter A Comparative Assessment of Selected
Approaches in the Focal Area of
Knowledge Engineering and Cognition . . 225
M. Li and
P. M. B. Vitanyi Philosophical Issues in
KolmogorovComplexity . . . . . . . . . . 1
H. Straubing Circuit Complexity and the Expressive
Power of Generalized First-Order
Formulas . . . . . . . . . . . . . . . . 16
A. De Santis and
G. Persiano and
M. Yung One-Message Statistical Zero-Knowledge
Proofs and Space-Bounded Verifier . . . 28
V. Keranen Abelian Squares Are Avoidable on 4
Letters . . . . . . . . . . . . . . . . 41
J. Karhumaki and
W. Plandowski and
W. Rytter Polynomial Size Test Sets for
Context-Free Languages . . . . . . . . . 53
T. Y. Nishida Quasi-Deterministic OL Systems . . . . . 65
G. Buntrock and
K. Lorys On Growing Context-Sensitive Languages 77
J. Shallit Numeration Systems, Linear Recurrences,
and Regular Sets . . . . . . . . . . . . 89
D. Krob The Equality Problem for Rational Series
with Multiplicities in the Tropical
Semiring is Undecidable . . . . . . . . 101
M. Clerbout and
M. Latteux and
Y. Roos and
W. Zielonka Semi-Commutations and Rational
Expressions . . . . . . . . . . . . . . 113
O. H. Ibarra and
N. Q. Tran New Results Concerning Synchronized
Finite Automata . . . . . . . . . . . . 126
J. Engelfriet A Greibach Normal Form for Context-Free
Graph Grammars . . . . . . . . . . . . . 138
P. Peladeau and
A. Podelski On Reverse and General Definite Tree
Languages . . . . . . . . . . . . . . . 150
V. Arvind and
Y. Han and
L. Hemachandra and
J. Kobler and
A. Lozano and
M. Mundhenk and
M. Ogiwara and
U. Schoning and
R. Silvestri and
T. Thierauf Reductions to Sets of Low Information
Content . . . . . . . . . . . . . . . . 162
M.-J. Sheu and
T. J. Long UP and the Low and High Hierarchies: A
Relativized Separation . . . . . . . . . 174
Ph. Flajolet Analytic Analysis of Algorithms . . . . 186
P. Kirschenhofer and
H. Prodinger and
W. Szpankowski How to Count Quickly and Accurately . . 211
U. Schmid The Average CRI-Length of a Tree
Collision Resolution Algorithm in
Presence of Multiplicity-Dependent
Capture Effects . . . . . . . . . . . . 223
M. Dietzfelbinger and
J. Gil and
Y. Matias and
N. Pippenger Polynomial Hash Functions Are Reliable 235--246
R. C. Sekar and
R. Ramesh and
I. V. Ramakrishnan Adaptive Pattern Matching . . . . . . . 247
Y. Mansour Randomized Interpolation and
Approximation of Sparse Polynomials . . 261
H. L. Bodlaender and
M. R. Fellows and
T. J. Warnow Two Strikes Against Perfect Phylogeny 273
G.-Q. Zhang Disjunctive Systems and L-Domains . . . 284
A. Apostolico and
D. Breslauer and
Z. Galil Optimal Parallel Algorithms for Periods,
Palindromes and Squares . . . . . . . . 296
A. Z. Broder and
A. M. Frieze and
E. Shamir and
E. Upfal Near-Perfect Token Distribution . . . . 308
T. Hagerup and
M. Kutylowski Fast Integer Merging on the EREW PRAM 318
S. Khuller and
R. Thurimella Approximation Algorithms for Graph
Augmentation . . . . . . . . . . . . . . 330
J. Westbrook Fast Incremental Planarity Testing . . . 342
J. A. La Poutre Maintenance of Triconnected Components
of Graphs . . . . . . . . . . . . . . . 354
V. V. Vazirani and
M. Yannakakis Suboptimal Cuts: Their Enumeration,
Weight and Number . . . . . . . . . . . 366
B. Buchberger Gröbner Bases: An Introduction . . . . . 378
R. Bundgen Buchberger's Algorithm: The Term
Rewriter's Point of View . . . . . . . . 380
H. Comon Completion of Rewrite Systems with
Membership Constraints . . . . . . . . . 392
G. Rote A New Metric Between Polygons, and How
to Compute it . . . . . . . . . . . . . 404
M. S. Paterson and
F. F. Yao On Nearest-Neighbor Graphs . . . . . . . 416
J. Matousek and
R. Seidel A Tail Estimate for Mulmuley's Segment
Intersection Algorithm . . . . . . . . . 427
B. Chazelle and
B. Rosenberg Lower Bounds on the Complexity of
Simplex Range Reporting on a Pointer
Machine . . . . . . . . . . . . . . . . 439
P. G. Kolaitis and
M. Y. Vardi Infinitary Logic for Computer Science 450
E. Chang and
Z. Manna and
A. Pnueli Characterization of Temporal Property
Classes . . . . . . . . . . . . . . . . 474
C.-H. L. Ong Lazy Lambda Calculus: Theories, Models
and Local Structure Characterization . . 487
E. Laenens and
D. Vermeir and
C. Zaniolo Logic Programming Semantics Made Easy 499
S. K. Debray On the Complexity of Dataflow Analysis
of Logic Programs . . . . . . . . . . . 509
A. Cortesi and
G. File and
W. Winsborough Comparison of Abstract Interpretations 521
W. Phoa and
M. Fourman A Proposed Categorical Semantics for
Pure ML . . . . . . . . . . . . . . . . 533
Th. A. Henzinger and
Z. Manna and
A. Pnueli What Good Are Digital Clocks? . . . . . 545
F. Moller and
Ch. Tofts Behavioral Abstraction in TCCS . . . . . 559
C. Brown and
D. Gurr Timing Petri Nets Categorically . . . . 571
P. Gastin and
A. Petit Asynchronous Cellular Automata for
Infinite Traces . . . . . . . . . . . . 583
P. W. Hoogers and
H. C. M. Kleijn and
P. S. Thiagarajan A Trace Semantics for Petri Nets . . . . 595
W. Vogler Asynchronous Communication of Petri Nets
and the Refinement of Transitions . . . 605
U. Montanari and
D. Yankelevich A Parametric Approach to Localities . . 617
P. Degano and
C. Priami Proved Trees . . . . . . . . . . . . . . 629
E.-R. Olderog Interfaces Between Languages for
Communicating Systems . . . . . . . . . 641
D. Sannella and
A. Tarlecki Toward Formal Development of Programs
from Algebraic Specifications:
Model-Theoretic Foundations . . . . . . 656
L. Fix and
N. Francez and
O. Grumberg Program Composition via Unification . . 672
R. Milner and
D. Sangiorgi Barbed Bisimulation . . . . . . . . . . 685
A. Rabinovich Checking Equivalences Between Concurrent
Systems of Finite Agents . . . . . . . . 696
R. Cleaveland and
S. A. Smolka and
A. Zwarico Testing Preorders for Probabilistic
Processes . . . . . . . . . . . . . . . 708
Halina Przymusinska and
Teodor Przymusinski and
Hirohisa Seki Soundness and Completeness of Partial
Deductions for Well-Founded Semantics 1
Steffen Holldobler On Deductive Planning and the Frame
Problem . . . . . . . . . . . . . . . . 13
James Harland and
David Pym On Resolution in Fragments of Classical
Linear Logic . . . . . . . . . . . . . . 30
Didier Galmiche and
Guy Perrier A Procedure for Automatic Proof Nets
Construction . . . . . . . . . . . . . . 42
James Bowen and
Dennis Bahler Free Logic and Infinite Constraint
Networks . . . . . . . . . . . . . . . . 54
Beat Wuthrich Towards Probabilistic Knowledge Bases 66
Barrett R. Bryant and
Aiqin Pan Two-Level Grammar: A Functional/Logic
Query Language for Database and
Knowledge-Base Systems . . . . . . . . . 78
Burkhard Freitag Extending Deductive Database Languages
by Embedded Implications . . . . . . . . 84
Ewing L. Lusk Controlling Redundancy in Large Search
Spaces . . . . . . . . . . . . . . . . . 96
Matthias Baaz and
Christian G. Fermuller Resolution for Many-Valued Logics . . . 107
Peter Baumgartner An Ordered Theory Resolution Calculus 119
William McCune and
Larry Wos Application of Automated Deduction to
the Search for Single Axioms for
Exponent Groups . . . . . . . . . . . . 131
Ko Hai-Ping and
Mark E. Nadel Elementary Lower Bounds for the Lengths
of Refutations . . . . . . . . . . . . . 137
Uwe Egly Shortening Proofs by Quantifier
Introduction . . . . . . . . . . . . . . 148
Hakan Millroth Reform Compilation for Nonlinear
Recursion . . . . . . . . . . . . . . . 160
Ulrich Neumerkel Pruning Infinite Failure Branches in
Programs with Occur-Check . . . . . . . 172
Andrew Ireland The Use of Planning Critics in
Mechanizing Inductive Proofs . . . . . . 178
Michel Parigot lambdamu-Calculus: An Algorithmic
Interpretation of Classical Natural
Deduction . . . . . . . . . . . . . . . 190
Thierry Boy de la Tour and
Christoph Kreitz Building Proofs by Analogy via the
Curry--Howard Isomorphism . . . . . . . 202
Siani Baker and
Andrew Ireland and
Alan Smaill On the Use of the Constructive
Omega-Rule Within Automated Deduction 214
Wolfgang Ertel OR-Parallel Theorem Proving with Random
Competition . . . . . . . . . . . . . . 226
Christian B. Suttner Parallel Computation of Multiple
Sets-of-Support . . . . . . . . . . . . 238
Bogumil Hausman Towards Using the Andorra Kernel
Language for Industrial Real-Time
Applications . . . . . . . . . . . . . . 250
Christophe Ringeissen Unification in a Combination of
Equational Theories with Shared
Constants and its Application to Primal
Algebras . . . . . . . . . . . . . . . . 261
Leo Bachmair and
Harald Ganzinger Non-Clausal Resolution and Superposition
with Selection and Redundancy Criteria 273
Bernhard Gramlich Relating Innermost, Weak, Uniform and
Modular Termination of Term Rewriting
Systems . . . . . . . . . . . . . . . . 285
Maurizio Gabbrielli and
Giorgio Levi and
Daniele Turi A Two Step Semantics for Logic Programs
with Negation . . . . . . . . . . . . . 297
Chitta Baral Generalized Negation as Failure and
Semantics of Normal Disjunctive Logic
Programs . . . . . . . . . . . . . . . . 309
Mino Bai and
Howard A. Blair General Model Theoretic Semantics for
Higher-Order Horn Logic Programming . . 320
Jose Alberto Fernandez and
Jack Minker Disjunctive Deductive Databases . . . . 332
Alexander Voinov Netlog --- A Concept Oriented Logic
Programming Language . . . . . . . . . . 357
Michael Fischer and
Richard Owens From the Past to the Future: Executing
Temporal Logic Programs . . . . . . . . 369
Christoph Walther Computing Induction Axioms . . . . . . . 381
Valentin Antimirov and
Anatoli Degtyarev Consistency of Equational Enrichments 393
Paul Curzon A Programming Logic for a Verified
Structured Assembly Language . . . . . . 403
Gernot Salzer The Unification of Infinite Sets of
Terms and its Applications . . . . . . . 409
Michael Kohlhase Unification in Order-Sorted Type Theory 421
Andrea Sattler-Klein Infinite, Canonical String Rewriting
Systems Generated by Completion . . . . 433
Francis Alexandre and
Khaled Bsaies and
Jean Pierre Finance and
Alain Quere Spes: A System for Logic Program
Transformation . . . . . . . . . . . . . 445
Jean-Marc Andreoli and
Remo Pareschi Linear Objects: A Logic Framework for
Open System Programming . . . . . . . . 448
Bernhard Bauer and
Rolf Hennicker ISAR: An Interactive System for
Algebraic Implementation Proofs . . . . 451
Michael Beeson Mathpert: Computer Support for Learning
Algebra, Trig and Calculus . . . . . . . 454
Jorge Bocca and
Michael Dahmen and
Michael Freeston MegaLog --- A Platform for Developing
Knowledge Base Management Systems . . . 457
Adel Bouhoula and
Emmanuel Kounalis and
Michael Rusinowitch SPIKE, an Automatic Theorem Prover . . . 460
Li Dafa An Application to Teaching in Logic
Course of ATP Based on Natural Deduction 463
Mark Dawson A Generic Logic Environment . . . . . . 466
Michel Dorochevsky and
Li Liang-Liang and
Mike Reeve and
Kees Schuerman and
Andre Veron ElipSys. A Parallel Programming System
Based on Logic . . . . . . . . . . . . . 469
Mireille Ducasse Opium --- A High Level Debugging
Environment . . . . . . . . . . . . . . 472
Ulrich Fraus and
Heinrich Hussmann An Inductive Theorem Prover Based on
Narrowing . . . . . . . . . . . . . . . 475
Terry Gaasterland and
Parke Godfrey and
Jack Minker and
Lev Novik A Cooperative Answering System . . . . . 478
Javier Leach and
Susana Nieva MIZ-PR: A Theorem Prover for Polymorphic
and Recursive Functions . . . . . . . . 481
Pascal Manoury and
Michel Parigot and
Marianne Simonot ProPre. A Programming Language with
Proofs . . . . . . . . . . . . . . . . . 484
Julio Garcia Martin and
Juan Jose Moreno-Navarro FRIENDLY-WAM: An Interactive Tool to
Understand the Compilation of Prolog . . 487
Micha Meier SEPIA: A Basis for Prolog Extensions . . 490
Hans Nilsson The External Database in SICStus Prolog 493
Jacques Noye The KCM System: Speeding-up Logic
Programming Through Hardware Support . . 496
Igor Romanenko Logician's Workbench . . . . . . . . . . 499
Hajime Sawamura and
Toshiro Minami and
Kyoko Ohashi EUODHILOS: A General Reasoning System
for a Variety of Logics . . . . . . . . 501
Laurent Vielle and
Petra Bayer and
Volker Kuchenhoff and
Alexandre Lefebvre and
Rainer Manthey The EKS-VI System . . . . . . . . . . . 504
Mark Wallace and
Thierry Le Provost CHIP and Propia . . . . . . . . . . . . 507
W. (Walter) Vogler Introduction . . . . . . . . . . . . . . 1
W. (Walter) Vogler Petri Nets and Their Semantics . . . . . 9--32
W. (Walter) Vogler Parallel Composition and Deadlocking . . 33
W. (Walter) Vogler Behaviour Preserving Refinement of
Places and Transitions . . . . . . . . . 75--130
W. (Walter) Vogler Action Refinement and Interval Words . . 131--182
W. (Walter) Vogler Action Refinement and Bisimulation . . . 183--216
W. (Walter) Vogler Partial Order Semantics for Nets with
Capacities . . . . . . . . . . . . . . . 217--238
Y. Bargury and
J. Makowsky The expressive power of transitive
closure and 2-way multihead automata . . 1
Ch. Beierle and
E. Borger Correctness proof for the WAM with types 15
E. Best and
J. Esparza Model checking of persistent Petri nets 35
J. Chirimar and
J. Lipton Provability in TBLL: A decision
procedure . . . . . . . . . . . . . . . 53
E. Dahlhaus How to implement first order formulas in
local memory machine models . . . . . . 68
S. Feferman A new approach to abstract data types
II. Computation on ADTs as ordinary
computation . . . . . . . . . . . . . . 79
T. Fernando A primitive recursive set theory and
AFA: On the logical complexity of the
largest bisimulation . . . . . . . . . . 96
J. Flum On bounded theories . . . . . . . . . . 111
A. Goerdt The cutting plane proof system with
bounded degree of falsity . . . . . . . 119
J. C. Gonzalez Moreno and
M. T. Hortala Gonzalez and
M. Rodriguez Artalejo Denotational versus declarative
semantics for functional programming . . 134
E. Gradel On transitive closure logic . . . . . . 149
P. Heusch and
E. Speckenmeyer Some aspects of the probabilistic
behavior of variants of resolution . . . 164
J. Hirshfeld Safe queries in relational databases
with functions . . . . . . . . . . . . . 173
J. N. Hooker Logical inference and polyhedral
projection . . . . . . . . . . . . . . . 184
B. Hosli Stable logic . . . . . . . . . . . . . . 201
M. R. K. Krishna Rao and
D. Kapur and
R. K. Shyamasundar A transformational methodology for
proving termination of logic programs 213
D. Lehmann Plausibility logic . . . . . . . . . . . 227
H. Leiß Towards Kleene algebra with recursion 242
K. Meinke Equational specification of abstract
types and combinators . . . . . . . . . 257
D. Mundici Normal forms in infinite-valued logic:
The case of one variable . . . . . . . . 272
H. Oguztuzun A fragment of first order logic adequate
for observation equivalence . . . . . . 278
S. Pinchinat Ordinal processes in comparative
concurrency semantics . . . . . . . . . 293
G. R. Renardel de Lavalette Logical semantics of modularisation . . 306
U. R. Schmerl A cut-elimination procedure designed for
evaluating proofs as programs . . . . . 316
H. Schwichtenberg Minimal from classical proofs . . . . . 326
S. Seibert Quantifier hierarchies over word
relations . . . . . . . . . . . . . . . 329
E. Steffen Complexity results for the default-and
the autoepistemic logic . . . . . . . . 339
I. A. Stewart On completeness for NP via projection
translations . . . . . . . . . . . . . . 353
J. G. Thistle and
W. M. Wonham Control of omega-automata, Church's
problem, and the emptiness problem for
tree omega-automata . . . . . . . . . . 367
A. S. Troelstra Comparing the theory of representations
and constructive mathematics . . . . . . 382
J. Tyszkiewicz Infinitary queries and their asymptotic
probabilities I: Properties definable in
transitive closure logic . . . . . . . . 396
A. Voronkov On completeness of program synthesis
systems . . . . . . . . . . . . . . . . 411
A. Weiermann Proving termination for term rewriting
systems . . . . . . . . . . . . . . . . 419
J. Pustejovsky Introduction . . . . . . . . . . . . . . 1
S. Nirenburg and
L. Levin Syntax-Driven and Ontology-Driven
Lexical Semantics . . . . . . . . . . . 5
I. Meyer Knowledge Management for
Terminology-Intensive Applications:
Needs and Tools . . . . . . . . . . . . 21
J. Sowa Logical Structures in the Lexicon . . . 39
J. Martin Conventional Metaphor and the Lexicon 61
G. Burkert and
P. Forster Representation of Semantic Knowledge
with Term Subsumption Languages . . . . 75
N. Ostler and
B. T. S. Atkins Predictable Meaning Shift: Some
Linguistic Properties of Lexical
Implication Rules . . . . . . . . . . . 87
A. Copestake and
T. Briscoe Lexical Operations in a
Unification-Based Framework . . . . . . 101
P. Anick and
S. Bergler Lexical Structures for Linguistic
Inference . . . . . . . . . . . . . . . 121
W. Meijs and
P. Vossen In So Many Words: Knowledge as a Lexical
Phenomenon . . . . . . . . . . . . . . . 137
M. Macpherson Redefining the ``Level'' of the ``Word'' 155
J. S. White Lexical and World Knowledge: Theoretical
and Applied Viewpoints . . . . . . . . . 171
M. Herweg Aspectual Requirements of Temporal
Connectives: Evidence for a Two-Level
Approach to Semantics . . . . . . . . . 185
P. Gerstl A Model for the Interaction of Lexical
and Non-Lexical Knowledge in the
Determination of Word Meaning . . . . . 201
M. Evens and
others For the Lexicon that has Everything . . 219
N. Calzolari Acquiring and Representing Semantic
Information in a Lexical Knowledge Base 235
M. Palmer General Lexical Representation for an
Effect Predicate . . . . . . . . . . . . 245
K. Dahlgren The Autonomy of Shallow Lexical
Knowledge . . . . . . . . . . . . . . . 255
B. J. Door A Two-Level Knowledge Representation for
Machine Translation: Lexical Semantics
and Tense/Aspect . . . . . . . . . . . . 269
B. A. Onyshkevych and
S. Nirenburg Lexicon, Ontology, and Text Meaning . . 289
T. Matsukawa and
E. Yokota Development of the Concept Dictionary
--- Implementation of Lexical Knowledge 305--319
R. Mercer Presuppositions and Default Reasoning: A
Study in Lexical Pragmatics . . . . . . 321
G. (George) Vosselman Computer Vision and Matching . . . . . . 1--4
G. (George) Vosselman A classification of matching methods . . 5--34
G. (George) Vosselman Formal description of relational
matching . . . . . . . . . . . . . . . . 35--44
G. (George) Vosselman Problem definition and contributions of
the thesis . . . . . . . . . . . . . . . 45--50
G. (George) Vosselman Information theory: selected topics . . 51--66
G. (George) Vosselman Evaluation of mappings between
relational descriptions . . . . . . . . 67--87
G. (George) Vosselman Tree search methods and heuristics . . . 88--111
G. (George) Vosselman Relational image and model description 112--122
G. (George) Vosselman Evaluation function for object location 123--143
G. (George) Vosselman Strategy and performance of the tree
search for object location . . . . . . . 144--162
G. (George) Vosselman Mutual information between a continuous
signal and a discretized noisy
observation . . . . . . . . . . . . . . 181--184
G. (George) Vosselman Distribution of the coordinates of
points on a sphere . . . . . . . . . . . 185--186
G. (George) Vosselman Conditional probability density function
of the image line length . . . . . . . . 187--188
P. K. Agarwal and
J. Matousek On Range Searching with Semialgebraic
Sets . . . . . . . . . . . . . . . . . . 1
J. Diaz Graph Layout Problems . . . . . . . . . 14
K.-J. Lange and
P. Rossmanith and
W. Rytter Parallel Recognition and Ranking of
Context-Free Languages . . . . . . . . . 24
M. Mihail On the Expansion of Combinatorial
Polytopes . . . . . . . . . . . . . . . 37
P. Orponen Neural Networks and Complexity Theory 50
J. V. Tucker and
J. I. Zucker Theory of Computation over Stream
Algebras, and its Applications . . . . . 62
U. Vishkin Methods in Parallel Algorithmics . . . . 81
O. Watanabe On the Complexity of Small Description
and Related Topics . . . . . . . . . . . 82
J. Wiedermann Weak Parallel Machines: a New Class of
Physically Feasible Parallel Machine
Models . . . . . . . . . . . . . . . . . 95
A. Wigderson The Complexity of Graph Connectivity . . 112
H. Bast and
M. Dietzfelbinger and
T. Hagerup A Perfect Parallel Dictionary . . . . . 133
B. Becker and
J. Hartmann Some Remarks on the Test Complexity of
Iterative Logic Arrays . . . . . . . . . 142
H.-J. Burtschick and
A. Hoene The Degree Structure of 1-L Reductions 153
J. Cai and
L. A. Hemachandra and
J. Vyskoc Promise Problems and Access to
Unambiguous Computation . . . . . . . . 162
S. Chari and
D. Ranjan and
P. Rohatgi On the Complexity of Incremental
Computation . . . . . . . . . . . . . . 172
Ch. Choffrut and
M. Goldwurm Rational Transductions and Complexity of
Counting Problems . . . . . . . . . . . 181
H. Comon and
M. Fernandez Negation Elimination in Equational
Formulae . . . . . . . . . . . . . . . . 191
J. F. Costa and
A. Sernadas and
C. Sernadas and
H.-D. Ehrich Object Interaction . . . . . . . . . . . 200
P.-L. Curien and
T. Hardin and
A. Rios Strong Normalization of Substitutions 209
R. Daley and
B. Kalyanasundaram Probabilistic and Pluralistic Learners
with Mind Changes . . . . . . . . . . . 218
C. Damm and
M. Holzer and
K.-J. Lange Parallel Complexity of Iterated
Morphisms and the Arithmetic of Small
Numbers . . . . . . . . . . . . . . . . 227
D. Derencourt and
J. Karhumaki and
M. Latteux and
A. Terlutte On Computational Power of Weighted
Finite Automata . . . . . . . . . . . . 236
R. Feldmann and
P. Mysliwietz The Shuffle Exchange Network has a
Hamiltonian Path . . . . . . . . . . . . 246
P. Gastin and
A. Petit Poset Properties of Complex Traces . . . 255
A. Goerdt A Treshold for Unsatisfiability . . . . 264
R. Gold Dataflow Semantics for Petri Nets . . . 275
I. Guessarian and
M. Veloso-Peixoto About Boundedness for some DATALOG and
DATALOGsup neg Programs . . . . . . . . 284
T. Hagerup and
O. Petersson Merging and Sorting Strings in Parallel 298
P. Jancar and
F. Mraz and
M. Platek Characterization of Context-Free
Languages by Erasing Automata . . . . . 307
L. Kari Insertion and Deletion of Words:
Determinism and Reversibility . . . . . 315
F. Kascak Small Universal One-State Linear
Operator Algorithm . . . . . . . . . . . 327
C. Laneve and
U. Montanari Mobility in the CC-Paradigm . . . . . . 336
K.-J. Lange and
P. Rossmanith The Emptiness Problem for Intersections
of Regular Languages . . . . . . . . . . 346
H. Leung On Finite Automata with Limited
Nondeterminism . . . . . . . . . . . . . 355
I. Litovsky and
Y. Metivier and
E. Sopena Definitions and Comparisons of Local
Computations on Graphs . . . . . . . . . 364
B. Martin Efficient Unidimensional Universal
Cellular Automaton . . . . . . . . . . . 374
O. Maruyama and
S. Miyano Inferring a Tree from Walks . . . . . . 383
E. Mayordomo Almost Every Set in Exponential Time is
P-Bi-Immune . . . . . . . . . . . . . . 392
D. Murphy and
A. Poigne A Functorial Semantics for Observed
Concurrency . . . . . . . . . . . . . . 401
E. Ochmanski Modelling Concurrency with
Semi-Commutations . . . . . . . . . . . 412
J. Pedersen Decision Problems for Cellular Automata
and Their Semigroups . . . . . . . . . . 421
G. M. Pinna and
A. Poigne On the Nature of Events . . . . . . . . 430
W. Preilowski and
E. Dahlhaus and
G. Wechsung New Parallel Algorithms for Convex Hull
and Triangulation in 3- Dimensional
Space . . . . . . . . . . . . . . . . . 442
T. C. Przymusinski Two Simple Characterizations of
Well-Founded Semantics . . . . . . . . . 451
S. Ramesh Fully Abstract Semantics for Higher
Order Communicating Systems . . . . . . 463
N. Reimen Superposable Trellis Automata . . . . . 472
T. Roos and
G. Albers Maintaining Proximity in Higher
Dimensional Spaces . . . . . . . . . . . 483
A. Szilard and
S. Yu and
K. Zhang and
J. Shallit Characterizing Regular Languages with
Polynomial Densities . . . . . . . . . . 494
D. Wang A Strategy for Speeding-up the
Computation of Characteristic Sets . . . 504
C. Wrathall and
V. Diekert and
F. Otto One-Rule Trace-Rewriting Systems and
Confluence . . . . . . . . . . . . . . . 511
R. Milner Invited Lecture: The Polyadic
pi-Calculus . . . . . . . . . . . . . . 1
M. Boreale and
R. De Nicola Testing Equivalences for Mobile
Processes . . . . . . . . . . . . . . . 2
L. Jategaonkar and
A. Meyer Testing Equivalence for Petri Nets with
Action Refinement . . . . . . . . . . . 17
D. Sangiorgi and
R. Milner The Problem of ``Weak Bisimulation up
to'' . . . . . . . . . . . . . . . . . . 32
E. Brinksma On the Uniqueness of Fixpoints Modulo
Observation Congruence . . . . . . . . . 47
J. F. Groote and
F. Moller Verification of Parallel Systems via
Decomposition . . . . . . . . . . . . . 62
R. Gerth and
R. Kuiper and
J. Segers Interface Refinement in Reactive Systems 77
M. Hennessy Concurrent Testing of Processes . . . . 94
G. Boudol and
I. Castellani and
M. Hennessy and
A. Kiehn A Theory of Processes with Localities 108
O. Burkart and
B. Steffen Model Checking for Context-Free
Processes . . . . . . . . . . . . . . . 123
S. Christensen and
H. Huttel and
Colin Stirling Bisimulation Equivalence Is Decidable
for All Context-Free Processes . . . . . 138
S. Christensen Distributed Bisimularity Is Decidable
for a Class of Infinite State-Space
Processes . . . . . . . . . . . . . . . 148
A. Pnueli Invited Talk: How Vital Is Liveness?
Verifying Timing Properties of Reactive
and Hybrid Systems . . . . . . . . . . . 162
F. A. Stomp Preserving Specific Properties in
Program Development . . . . . . . . . . 176
D. Peled Sometimes ``Some'' Is as Good as ``All'' 192
R. Kaivola and
A. Valmari The Weakest Compositional Semantic
Equivalence Preserving Nexttime-Less
Linear Temporal Logic . . . . . . . . . 207
U. Goltz and
R. Kuiper and
W. Penczek Propositional Temporal Logics and
Equivalences . . . . . . . . . . . . . . 222
V. R. Pratt Invited Talk: The Duality of Time and
Information . . . . . . . . . . . . . . 237
E. Goubault and
T. P. Jensen Homology of Higher Dimensional Automata 254
A. Rensink Posets for Configurations! . . . . . . . 269
J. Meseguer and
U. Montanari and
V. Sassone On the Semantics of Petri Nets . . . . . 286
E. Badouel and
P. Darondeau Structural Operational Specifications
and Trace Automata . . . . . . . . . . . 302
N. Lynch and
B. Lampson and
J. Sògaard-Andersen Invited Talk: At-Most-Once Message
Delivery: A Case Study in Algorithm
Verification . . . . . . . . . . . . . . 317
N. Reingold and
D.-W. Wang and
L. D. Zuck Games I/O Automata Play . . . . . . . . 325
R. Alur and
C. Courcoubetis and
N. Halbwachs and
D. Dill and
H. Wong-Toi Minimization of Timed Transition Systems 340
J. Davies and
S. Schneider Using CSP to Verify a Timed Protocol
over a Fair Medium . . . . . . . . . . . 355
H. B. Weinberg and
L. D. Zuck Timed Ethernet: Real-Time Formal
Specification of Ethernet . . . . . . . 370
G. Karjoth Implementing LOTOS Specifications by
Communicating State Machines . . . . . . 386
J. C. M. Baeten and
J. A. Bergstra Invited Talk: Discrete Time Process
Algebra . . . . . . . . . . . . . . . . 401
S. Klusener The Silent Step in Time . . . . . . . . 421
F. Vaandrager and
N. Lynch Action Transducers and Timed Automata 436
K. G. Larsen and
A. Skou Compositional Verification of
Probabilistic Processes . . . . . . . . 456
J. C. M. Baeten and
J. A. Bergstra and
S. A. Smolka Axiomatizing Probabilistic Processes:
ACP with Generative Probabilities . . . 472
E. Shapiro Embeddings Among Concurrent Programming
Languages . . . . . . . . . . . . . . . 486
A. Rabinovich Logic of Trace Languages . . . . . . . . 504
J. Parrow and
P. Sjodin Multiway Synchronization Verified with
Coupled Simulation . . . . . . . . . . . 518
S. M. German Programming in a General Model of
Synchronization . . . . . . . . . . . . 534
F. Maraninchi Operational and Compositional Semantics
of Synchronous Automaton Compositions 550
G. Agha and
I. A. Mason and
S. Smith and
C. Talcott Towards a Theory of Actor Computation 565
M. Hanus Invited Lecture: Improving Control of
Logic Programs by Using Functional Logic
Languages . . . . . . . . . . . . . . . 1
H. Kuchen and
J. J. Moreno-Navarro and
M. V. Hermenegildo Independent AND-Parallel Implementation
of Narrowing . . . . . . . . . . . . . . 24
M. Dorochevsky and
A. Veron Binding Techniques and Garbage
Collection for OR-Parallel CLP Systems 39
C. K. Gomard and
P. Sestoft Path Analysis for Lazy Data Structures 54
K. R. Apt and
A. Pellegrini Why the Occur-Check is Not a Problem . . 69
I. Attali and
J. Chazarain and
S. Gilette Incremental Evaluation of Natural
Semantics Specifications . . . . . . . . 87
F. Barthelemy and
E. Villemonte de la Clergerie Subsumption-Oriented Push-Down Automata 100
S. Kahrs Unlimp, Uniqueness as a Leitmotiv for
Implementation . . . . . . . . . . . . . 115
M. Pennings and
D. Swierstra and
H. Vogt Using Cached Functions and Constructors
for Incremental Attribute Evaluation . . 130
M. Rosendahl Strictness Analysis for Attribute
Grammars . . . . . . . . . . . . . . . . 145
S. Saidi and
J.-F. Boulicaut Checking and Debugging of Two-Level
Grammars . . . . . . . . . . . . . . . . 158
A. Bossi and
N. Cocco and
S. Etalle On Safe Folding . . . . . . . . . . . . 172
T. Amtoft Unfold/Fold Transformations Preserving
Termination Properties . . . . . . . . . 187
F. Alexandre A Technique for Transforming Logic
Programs by Fold-Unfold Transformations 202
J. Henrard and
B. Le Charlier FOLON: An Environment for Declarative
Construction of Logic Programs . . . . . 217
W. Hans A Complete Indexing Scheme for WAM-Based
Abstract Machines . . . . . . . . . . . 232
A. Krall and
T. Berger Fast Prolog with a $ \mbox {VAM}_{1p} $
based Prolog Compiler . . . . . . . . . 245
C. Holzbaur Metastructures vs. Attributed Variables
in the Context of Extensible Unification 260
P. Cousot and
R. Cousot Invited Lecture: Comparing the Galois
Connection and Widening\slash Narrowing
Approaches to Abstract Interpretation 269
K. Verschaetse and
D. De Schreye Derivation of Linear Size Relations by
Abstract Interpretation . . . . . . . . 296
V. Englebert and
B. Le Charlier and
D. Roland and
P. Van Hentenryck Generic Abstract Interpretation
Algorithms for Prolog: Two Optimization
Techniques and Their Experimental
Evaluation . . . . . . . . . . . . . . . 311
A. Hui Bon Hoa A Bottom-Up Interpreter for a
Higher-Order Logic Programming Language 326
A. Muck CAMEL: An Extension of the Categorical
Abstract Machine to Compile
Functional/Logic Programs . . . . . . . 341
W. Hans and
R. Loogen and
S. Winkler On the Interaction of Lazy Evaluation
and Backtracking . . . . . . . . . . . . 355
M. Kamkar and
N. Shahmehri and
P. Fritzson Interprocedural Dynamic Slicing . . . . 370
H. Nilsson and
P. Fritzson Algorithmic Debugging of Lazy Functional
Languages . . . . . . . . . . . . . . . 385
M. Ducasse A General Trace Query Mechanism Based on
Prolog . . . . . . . . . . . . . . . . . 400
J. A. Plaza Fully Declarative Logic Programming . . 415
G. Lindstrom and
J. Maluszynski and
T. Ogi Our LIPS Are Sealed: Interfacing
Functional and Logic Programming Systems 428
M. Alpuente and
M. Falaschi and
F. Manzo Analyses of Inconsistency for
Incremental Equational Logic Programming 443
S. A. Rebelsky I/O Trees and Interactive Lazy
Functional Programming . . . . . . . . . 458
L. H. Hamel UCG-E: An Equational Logic Programming
System . . . . . . . . . . . . . . . . . 473
D. Cattrall and
C. Runciman A Relational Programming System with
Inferred Representations . . . . . . . . 475
H. Moura An Implementation of Action Semantics
(Summary) . . . . . . . . . . . . . . . 477
P. Tarau BinProlog: a Continuation Passing Style
Prolog Engine . . . . . . . . . . . . . 479
P. Thiemann LaToKi: A Language Toolkit for Bottom-Up
Evaluation of Functional Programs . . . 481
B. Reus Implementing Higher-Order Functions in
an Algebraic Specification Language with
Narrowing . . . . . . . . . . . . . . . 483
J. Vilo Implementing Attribute Grammars by
Computational Models . . . . . . . . . . 485
C. M. Li and
P. Y. Gloess ProQuery: Logical Access to an OODB . . 487
C. Solnon and
M. Rueher Inference of Inheritance Relationships
from Prolog Programs: a System Developed
with Prolog III . . . . . . . . . . . . 489
P. Barth CLP(PB), A Meta-Interpreter in CLP(R) 491
H. Ait-Kaci Outline of an object-oriented calculus
of higher type (invited talk) . . . . . 1
H. Ehrig and
F. Parisi-Presicce High-level-replacement systems for
equational algebraic specifications . . 3
P. Lescanne Termination of rewrite systems by
elementary interpretations . . . . . . . 21
I. Gnaedig Termination of order-sorted rewriting 37
B. Gramlich Generalized sufficient conditions for
modular termination of rewriting . . . . 53
K. R. Apt and
E. Marchiori and
C. Palamidessi A theory of first-order built-in's of
Prolog . . . . . . . . . . . . . . . . . 69
M. Gabbrielli and
M. C. Meo Fixpoint semantics for partial computed
answer substitutions and call patterns 84
R. Barbuti and
M. Codish and
R. Giacobazzi and
M. Maher Oracle semantics for Prolog . . . . . . 100
M. Hermann On the relation between primitive
recursion, schematization and divergence 115
B. Hoffmann Term rewriting with sharing and
memoization . . . . . . . . . . . . . . 128
S. Antoy Definitional trees . . . . . . . . . . . 143
J. Meseguer Multiparadigm logic programming (invited
talk) . . . . . . . . . . . . . . . . . 158
Hong Hoon Non-linear real constraints in
constraint logic programming . . . . . . 201
F.-J. Lopez-Fraguas A general scheme for constraint
functional logic programming . . . . . . 213
M. Hanus Incremental rewriting in narrowing
derivations . . . . . . . . . . . . . . 228
A. Middeldorp and
E. Hamoen Counterexamples to completeness results
for basic narrowing (Extended Abstract) 244
R. Echahed Uniform narrowing strategies . . . . . . 259
O. Lysne Proof by consistency in constructive
systems with final algebra semantics . . 276
R. Bundgen and
H. Eckhardt A fast algorithm for ground normal form
analysis . . . . . . . . . . . . . . . . 291
T. Hardin Eta-conversion for the languages of
explicit substitutions . . . . . . . . . 306
A. King and
P. Soper Serialisation analysis of concurrent
logic programs . . . . . . . . . . . . . 322
A. Giovini and
F. Morando and
A. Capani Implementation of a toolset for
prototyping algebraic specifications of
concurrent systems . . . . . . . . . . . 335
C. Laneve and
U. Montanari Axiomatizing permutation equivalence in
the lambda-calculus . . . . . . . . . . 350
M. Maher A CLP View of Logic Programming (invited
talk) . . . . . . . . . . . . . . . . . 364
C. Aravindan and
Minh Dung Phan Partial deduction of logic programs
w.r.t. well-founded semantics . . . . . 384
P. Balbiani The finiteness of logic programming
derivations . . . . . . . . . . . . . . 403
L. Bachmair and
H. Ganzinger and
U. Waldmann Theorem proving for hierarchic
first-order theories . . . . . . . . . . 420
R. Socher-Ambrosius A goal oriented strategy based on
completion . . . . . . . . . . . . . . . 435
A. Boudet and
E. Contejean On $n$-syntactic equational theories . . 446
D. Vakarelov A Modal Theory of Arrows. Arrow Logics I 1
C. MacNish Knowledge Without Modality: A Simplified
Framework for Chronological Ignorance 25
R. Pliuskevicius Design Complete Sequential Calculus for
Continuous Fixpoint Temporal Logic . . . 36
R. Muskens Logical Omniscience and Classical Logic 52
K. L. Kwast and
S. van Denneheuvel Weak Implication: Theory and
Applications . . . . . . . . . . . . . . 65
V. Royer and
J. J. Quantz Deriving Inference Rules for
Terminological Logics . . . . . . . . . 84
B. Fronhofer Linear Proofs and Linear Logic . . . . . 106
E. Weydert Relevance and Revision --- About
Generalizing Syntax-based Belief
Revision . . . . . . . . . . . . . . . . 126
H. Rott Modellings for Belief Change: Base
Contraction, Multiple Contraction, and
Epistemic Entrenchment . . . . . . . . . 139
C. Froidevaux and
J. Mengin A Framework for Default Logics . . . . . 154
A. Hunter A Conceptualization of Preferences in
Non-Monotonic Proof Theory . . . . . . . 174
G. Vreeswijk Reasoning with Defeasible Arguments:
Examples and Applications . . . . . . . 189
Ph. Besnard and
E. Gregoire About Deductive Generalization . . . . . 212
T. Fernando Transition Systems and Dynamic Semantics 232
M. S. Mircheva Declarative Semantics for Inconsistent
Database Programs . . . . . . . . . . . 252
O. Bittel Tableau-Based Theorem Proving and
Synthesis of Lambda-Terms in the
Intuitionistic Logic . . . . . . . . . . 262
H.-J. Goltz A Constructive Type System Based on Data
Terms . . . . . . . . . . . . . . . . . 279
N. Zabel An Ordered Resolution and Paramodulation
Calculus for Finite Many-Valued Logics 304
C. Prehofer An Efficient Constraint Language for
Polymorphic Order-Sorted Resolution . . 319
L. M. Pereira and
J. J. Alferes and
J. N. Aparicio Default Theory for Well Founded
Semantics with Explicit Negation . . . . 339
U. Furbach Computing Answers for Disjunctive Logic
Programs . . . . . . . . . . . . . . . . 357
C. Witteveen Expanding Logic Programs . . . . . . . . 373
H. Herre and
D. Pearce Disjunctive Logic Programming,
Constructivity and Strong Negation . . . 391
S. N. Bhatt and
F. R. K. Chung and
F. T. Leighton and
A. L. Rosenberg Tolerating Faults in Synchronization
Networks . . . . . . . . . . . . . . . . 1
P. Turdik On Incomplete Hypercubes . . . . . . . . 13
N. Hamanaka and
J. Nakagoshi and
T. Tanaka Reducing Network Hardware Quantity by
Employing Multi-Processor Cluster
Structure in Distributed Memory Parallel
Processors . . . . . . . . . . . . . . . 25
S. G. Ziavras Connection Machine Results for Pyramid
Embedding Algorithms . . . . . . . . . . 31
V. Hatz Interconnection Networks Based on Block
Designs . . . . . . . . . . . . . . . . 37
V. David and
C. Fraboul and
J. Y. Rousselot and
P. Siron Partitioning and Mapping Communication
Graphs on a Modular Reconfigurable
Parallel Architecture . . . . . . . . . 43
H. Munthe-Kaas Generalized Shuffle-Exchange Networks 49
E. Leu and
A. Shiper Execution Replay: A Mechanism for
Integrating a Visualization Tool with a
Symbolic Debugger . . . . . . . . . . . 55
A. Bauch and
T. Kosch and
E. Maehle and
W. Oberloer The Software-Monitor DELTA-T and Its Use
for Performance Measurements of Some
Farming Variants on the Multi-Transputer
System DAMP . . . . . . . . . . . . . . 67
T. Bemmerl and
P. Braun Visualization of Message Passing
Parallel Programs . . . . . . . . . . . 79
N. Mansour and
G. C. Fox Parallel Physical Optimization
Algorithms for Data Mapping . . . . . . 91
J. D. Becher and
K. L. Beck Profiling on a Massively Parallel
Computer . . . . . . . . . . . . . . . . 97
R. D. Hersch and
B. Tonelli and
B. Krummenacher A Multiprocessor Multiwindow
Visualization Subsystem . . . . . . . . 103
A. Beranek Data Race Detection Based on Execution
Replay for Parallel Applications . . . . 109
J. M. Adamo and
C. Bonello and
L. Trejo The CNET Programming Environment: An
Overview . . . . . . . . . . . . . . . . 115
M. Lemke and
D. Quinlan P++, a C++ Virtual Shared Grids Based
Programming Environment for
Architecture-Independent Development of
Structured Grid Applications . . . . . . 121
D. K. Arvind and
J. Knight Detection of Concurrency-Related Errors
in Joyce . . . . . . . . . . . . . . . . 127
C. Lavault Analysis of an Efficient Distributed
Algorithm for Mutual Exclusion
(Average-Case Analysis of Path Reversal) 133
J. Schepers Invariance Properties in Distributed
Systems . . . . . . . . . . . . . . . . 145
M. Makhaniok and
R. Manner Synchronization of Parallel Processes in
Distributed Systems . . . . . . . . . . 157
P. Moukeli Statistical Probabilistic Clock
Synchronization Algorithm . . . . . . . 163
W. L. Nowinski A SIMD Architecture for Medical Imaging 169
R. Lin and
S. Olariu Computing the Inner Product on
Reconfigurable Buses with Shift
Switching . . . . . . . . . . . . . . . 181
S. P. S. Lam A Novel Sorting Array Processor . . . . 193
G. Horton and
R. Knirsch and
H. Vollath The Time-Parallel Solution of Parabolic
Partial Differencial Equations Using the
Frequency-Filtering Method . . . . . . . 205
M. Griebel and
W. Huber and
U. Rude and
T. Stortkuhl The Combination Technique for Parallel
Sparse-Grid-Preconditioning or, Solution
of PDEs on Workstation Networks . . . . 217
M. Schafer and
M. M. Gutzmann and
M. Schwehm Comparing the DAP, Meiko and Suprenum
with a Fluid Dynamic Benchmark . . . . . 229
C. A. Kabakchiev and
V. P. Behar Parallel Detection Algorithm of Radar
Signals . . . . . . . . . . . . . . . . 241
R. Andonov and
P. Quinton Efficient Linear Systolic Array for the
Knapsack Problem . . . . . . . . . . . . 247
J. Xue On the Loading, Recovery and Access of
Stationary Data in Systolic Arrays . . . 259
J.-F. Myoupo and
A.-C. Fabret Designing Modular Linear Systolic Arrays
Using Dependence Graph Regular
Partitions . . . . . . . . . . . . . . . 265
B. Lang Reducing Symmetric Banded Matrices to
Tridiagonal Form --- A Comparison of a
New Parallel Algorithm with Two Serial
Algorithms on the IPSC/860 . . . . . . . 271
B. Wilkinson and
L. S. Mulholland An Implementation of the BLAS on the
i860: A RISC Approach to Software for
RISC Devices . . . . . . . . . . . . . . 283
P. Charrier and
J. Roman Partitioning and Mapping for Parallel
Nested Dissection on Distributed Memory
Architectures . . . . . . . . . . . . . 295
N.-K. Tsao On the Accuracy of Solving Triangular
Systems in Parallel-III . . . . . . . . 307
P. R. Amestoy and
M. J. Dayde and
I. S. Duff and
P. Morere Linear Algebra Calculations on the BBN
TC2000 . . . . . . . . . . . . . . . . . 319--330
G. Chen and
H. B. Keller and
S. H. Lui and
B. Roux Parallel Homotopy Algorithm for Large
Sparse Generalized Eigenvalue Problems:
Application to Hydrodynamic Stability
Analysis . . . . . . . . . . . . . . . . 331
P. Stpiczynski Parallel Algorithms for Solving Linear
Recurrence Systems . . . . . . . . . . . 343
I. Bar-On and
O. Munk A New Parallel Factorization A = DDsup t
BC for Band Symmetric Positive Definite
Matrices . . . . . . . . . . . . . . . . 349
L. C. Waring and
M. Clint Computation of the Eigenvalues of Real
Symmetric Matrices Using a Processor
Farm . . . . . . . . . . . . . . . . . . 355
J. M. Bull and
T. L. Freeman Numerical Performance of an Asynchronous
Jacobi Iteration . . . . . . . . . . . . 361
E. I. Milovanovic and
I. Z. Milovanovic and
M. K. Stojcev Matrix Inversion Algorithm for Linear
Array Processor . . . . . . . . . . . . 367
S. Petiton and
C. Weill-Duflos Massively Parallel Preconditioners for
the Sparse Conjugate Gradient Method . . 373
S. J. Thomas A Block Algorithm for Orthogonalization
in Elliptic Norms . . . . . . . . . . . 379
G. Lino de Campos Asynchronous Polycyclic Architecture . . 387
P. L. Bird and
N. P. Topham and
S. Manoharan A Comparison of Two Memory Models for
High Performance Computers . . . . . . . 399
A. B. Ruighaver A Decoupled Multicomputer Architecture
with Optical Full Interconnection . . . 405
A. Mzoughi and
M. Lalam and
D. Litaize Very High Speed Vectorial Processors
Using Serial Multiport Memory as Data
Memory . . . . . . . . . . . . . . . . . 411
J. A. Keane and
K. R. Mayes Resource Management on a Packet-Based
Parallel Graph Reduction Machine . . . . 417
R. Govindarajan and
S. S. Nemawarkar A Large Context Multithreaded
Architecture . . . . . . . . . . . . . . 423
H. Hellwagner On the Practical Efficiency of
Randomized Shared Memory . . . . . . . . 429
Z. Lahjomri and
T. Priol KOAN: A Shared Virtual Memory for the
iPSC/2 Hypercube . . . . . . . . . . . . 441
S. Murer and
P. Farber A Scalable Distributed Shared Memory . . 453
J. L. Roch and
A. Vermeerbergen and
G. Villard Cost Prediction for Load Balancing:
Application to Algebraic Computations 467
K. Shteiman and
D. Feitelson and
L. Rudolph and
I. Exman Envelopes in Adaptive Local Queues for
MIMD Load Balancing . . . . . . . . . . 479
E. Tarnvik Dynamo --- A Portable Tool for Dynamic
Load Balancing on Distributed Memory
Multicomputers . . . . . . . . . . . . . 485
J.-L. Levaire Semantics and Compilation of the
Data-Parallel Switch Statement . . . . . 491
H. Essafi and
M. Pic and
D. Juvin K-Project --- First Step: To Improve
Data Manipulations and Representations
on Parallel Computers . . . . . . . . . 503
V. B. Muchnick and
A. V. Shafarenko F-Code: A Portable Software Platform for
Data-Parallel Languages . . . . . . . . 509
M. Gengler and
G. Coray A Parallel Best-First B and B with
Synchronization Phases . . . . . . . . . 515
H. Wu On Tests of Uniform Tree Circuits . . . 527
J. Chen and
C. Levcopoulos Improved Parallel Sorting of Presorted
Sequences . . . . . . . . . . . . . . . 539
T. Duboux and
A. Ferreira and
M. Gastaldo MIMD Dictionary Machines: From Theory to
Practice . . . . . . . . . . . . . . . . 545
F. Klingspor and
D. Luhofer and
T. Rottke Parallel Searching for $3$D-Objects . . 551
J. L. Roch and
G. Villard Parallel gcd and Lattice Basis Reduction 557
S. G. Akl and
K. Qiu Parallel Minimum Spanning Forest
Algorithms on the Star and Pancake
Interconnection Networks . . . . . . . . 565
H. Embrechts and
D. Roose Parallel Algorithms for the Distance
Transformation . . . . . . . . . . . . . 571
R. van Kleij and
F. Kuijper A Multiprocessor System for Displaying
Quadric CSG Models . . . . . . . . . . . 583
S. Olariu and
J. L. Schwing and
J. Zhang Efficient Image Computations on
Reconfigurable Meshes . . . . . . . . . 589
J. L. Levaire and
S. Ubeda A Multiscale Parallel Thinning Algorithm 595
A. Gerasoulis and
T. Yang Static Scheduling of Parallel Programs
for Message Passing Architectures . . . 601
V. H. Van Dongen and
R. G. Gao and
Q. Ning A Polynomial Time Method for Optimal
Software Pipelining . . . . . . . . . . 613
F. Gasperoni and
U. Schwiegelshohn Scheduling Loops on Parallel Processors:
A Simple Algorithm with Close to Optimum
Performance . . . . . . . . . . . . . . 625
E. J. Kushner Automatic Parallelization of Grid-Based
Applications for the iPSC/860 . . . . . 637
P. David Semantic Analysis for Parallelizing C 647
H.-J. Yeh A Task Scheduling Algorithm for the
Parallel Expression Evaluation in a
Reconfigurable Fully Digit On-Line
Network . . . . . . . . . . . . . . . . 653
L. M. Barnett and
C. Lengauer Unimodularity Considered Non-Essential 659
M. M. Gutzmann and
K. Steffan PEPSIM-ST: A Simulator Tool for
Benchmarking . . . . . . . . . . . . . . 665
R. Pozo Performance Modeling of Sparse Matrix
Methods for Distributed Memory
Architectures . . . . . . . . . . . . . 677
T. Schnekenburger and
M. Friedrich and
A. Weininger and
T. Schoen ParSim: A Tool for the Analysis of
Parallel and Distributed Programs . . . 689
J.-Y. Berthou and
P. Klein Estimating the Effective Performance of
Program Parallelization on Shared Memory
MIMD Multiprocessors . . . . . . . . . . 701
J. Duprat and
M. Fiallos Aguilar On the Simulation of Pipelining of Fully
Digit On-Line Floating-Point Adder
Networks on Massively Parallel Computers 707
K. R. Tout and
D. J. Evans A Parallel Expert System Using a
Backward Chaining Strategy . . . . . . . 713
H. Paugam-Moisy Optimal Speedup Conditions for a
Parallel Back-Propagation Algorithm . . 719
H. Bourzoufi and
G. Goncalves and
B. Toursel A Time-Bounded Binding Access with Low
Task-Switching Cost in an OR-Parallel
Prolog . . . . . . . . . . . . . . . . . 725
T. Ungerer and
E. Zehendner Threads and Subinstruction Level
Parallelism in a Dataflow Architecture 731
B. Bonchev and
M. Iliev A Hybrid Dataflow Architecture with
Multiple Tokens . . . . . . . . . . . . 737
S. Kusakabe and
T. Hoshide and
R. I. Taniguchi and
M. Amamiya Parallelism Control Scheme in a Dataflow
Architecture . . . . . . . . . . . . . . 743
H. Unger and
K. Ben Achour A Petri-Net-Based Method to the Design
of Parallel Programs for a
Multiprocessor System . . . . . . . . . 749
F. A. Rabhi A Parallel Structure for Static
Iterative Transformation Algorithms . . 755
J. M. Boyle and
M. Clint and
S. Fitzpatrick and
T. J. Harmer The Construction of Numerical
Mathematical Software for the AMT DAP by
Program Transformation . . . . . . . . . 761
D. Gannon and
J. K. Lee and
S. Narayana On Using Object-Oriented Parallel
Programming to Build Distributed
Algebraic Abstractions . . . . . . . . . 769
V. Demian and
J.-C. Mignot Implementation of the Self-Organizing
Feature Map on Parallel Computers . . . 775
H. Kuchen and
H. Stoltze and
F. Lucking Candela --- A Topology Description
Language . . . . . . . . . . . . . . . . 777
B. Shukhman Parallelism in Generation of Sequences
for Monte Carlo Simulation . . . . . . . 779
C. Pin and
E. V. Krishnamurthy Data Parallel Evaluation-Interpolation
Algorithm for Solving Functional Matrix
Equations . . . . . . . . . . . . . . . 781
S. Ohring Dynamic Tree Embeddings into de Bruijn
Graphs . . . . . . . . . . . . . . . . . 783
R. Berrendorf Memory Access in Shared Virtual Memory 785
J. S. Weston and
M. Clint and
C. W. Bleakney Parallel Implementations of Jacobi's
Algorithm for the Eigensolution of Large
Matrices Using Array Processors . . . . 787
B. Schutz and
R. Rauscher A Parallel Architecture for a
VLSI-Hardware-Realization of a Numerical
Stable Variant of the Simplex-Method . . 789
L. Zhang and
M. Galindo and
D. Marquie and
Y. Raynaud Generating Physical Channel Access
Protocol Data Unit of CCSDS
Recommendation by Use of the Transputers
and OCCAM . . . . . . . . . . . . . . . 791
F. Arbab and
I. Herman and
P. Spilling Manifold: Concepts and Implementation 793
M. C. Eglin-Leclerc and
J. Julliand and
G. R. Perrin How to Compile Systems of Recurrence
Equations into Networks of Communicating
Processes . . . . . . . . . . . . . . . 795
M. Bahi Parallel Algorithms Simulation Applied
to Differential-Algebraic Systems and
Electrical Network Application . . . . . 797
Z. Mahjoub and
F. Karoui-Sahtout Optimal Performances and Scheduling for
Parallel Algorithms with Equal Cost
Tasks . . . . . . . . . . . . . . . . . 799
G. Tan and
W.-N. Chin Load Balancing in a Neighbourhood-Based
Multiprocessor . . . . . . . . . . . . . 801
D. Crookes and
A. P. McHale and
N. Beney A DAP-Based Implementation of a Portable
Parallel Image Processing Machine . . . 803
J. Gabarro The Design of a Parallel Algorithm to
Solve the Word Problem for the Free
Partially Commutative Groups . . . . . . 805
M. Vajtersic A VLSI Multigrid Poisson Solver Amenable
to Biharmonic Equation . . . . . . . . . 807
P. J. Kulkarni and
N. R. Phadnis and
V. Udpikar Monochrome Image Coding Using
Hierarchical Closed Loop Vector
Quantizer on a Multiprocessing System 809
S. Srinivas and
K. Dybvig Superscalar Floating-Point Vector
Computation in Scheme . . . . . . . . . 811
A. K. Datta and
R. K. Sen An Efficient Parallel Algorithm for
Maximal Matching . . . . . . . . . . . . 813
J. M. Adamo and
N. Alhafez Minimal, Adaptive and Deadlock-Free
Routing for Multiprocessors . . . . . . 815
F. Desprez and
B. Tourancheau A Theoretical Study of Reconfigurability
for Numerical Algorithms on a
Reconfigurable Network . . . . . . . . . 817
A. Fron Multiprocessor Simulation Using
Object-Oriented Programming . . . . . . 819
M. K. Stojcev and
I. Z. Milovanovic and
E. I. Milovanovic and
G. S. Jovanovic Real-Number Codes for Fault-Tolerant
Matrix Inversion on Processor Arrays . . 821
J. W. Meyer Automatic Mapping of Parallel Programs
onto Processor Networks . . . . . . . . 823
P. Zaversek and
P. Kolbezen Dynamic Allocation on the Transputer
Network . . . . . . . . . . . . . . . . 825
P. Arbenz and
M. Oettli Block Implementations of the Symmetric
QR and Jacobi Algorithms . . . . . . . . 827
R. Knirsch and
K. Hofmann An Improved Parallel Algorithm for the
Solution of Molecular Dynamics Problems
on MIMD Multiprocessors . . . . . . . . 829
N. J. Leite and
G. Bertrand Computational Models for Image
Processing: Towards a Concise Parallel
Language . . . . . . . . . . . . . . . . 831
J. Wu and
E. B. Fernandez Broadcasting in Faulty
Cube-Connected-Cycles with Minimum
Recovery Time . . . . . . . . . . . . . 833
E. G. Talbi and
P. Bessiere and
J. M. Ahuactzin and
E. Mazer Parallel Robot Motion Planning in a
Dynamic Environment . . . . . . . . . . 835
L. M. Mackenzie and
M. Ould-Khaoua and
R. J. Sutherland and
T. Kelly A Hypergraph-Based Interconnection
Network for Large Multicomputers . . . . 837
M. D. Grammatikakis and
J.-S. Jwo Greedy Permutation Routing on Caylay
Graphs . . . . . . . . . . . . . . . . . 839
J. M. Adamo and
L. Trejo Experimenting upon the CG Algorithm
Within the CNET Programming Environment 841
D. Barth An Algorithm of Broadcasting in the Mesh
of Trees . . . . . . . . . . . . . . . . 843
L. Zhou Complexity Estimation in the PIPS
Parallel Programming Environment . . . . 845
N. Anisimov and
A. Kovalenko and
P. Postupalski and
A. Simanchuk A Graphical Petri Net Based Editor for a
Visualization of Distributed and
Parallel Systems . . . . . . . . . . . . 847
B. Freisleben and
T. Kielmann Automatic Parallelization of
Divide-and-Conquer Algorithms . . . . . 849
R. Conradi and
C. Fernstrom and
A. Fuggetta and
B. Snowdon Towards a Reference Framework for
Process Concepts . . . . . . . . . . . . 3
G. Starke and
M. von der Beeck SA/CM/IM for Process Modelling . . . . . 18
K. Benali and
J. C. Derniame Software Process Modelling: What, Who
and When . . . . . . . . . . . . . . . . 21
A. Devarenne and
C. Ozanne The Need of a Process Engineering Method 26
I. Sommerville Introduction . . . . . . . . . . . . . . 33
J. Lonchamp Supporting Social Activities of Software
Process . . . . . . . . . . . . . . . . 34
I. Sommerville and
T. Rodden Understanding the Software Process as a
Social Process . . . . . . . . . . . . . 55
G. Engels and
L. P. J. Groenewegen Specification of Coordinated Behaviour
in the Software Development Process . . 58
R. Rockwell Software Development is a Communication
Process . . . . . . . . . . . . . . . . 61
C. Fernstrom Introduction . . . . . . . . . . . . . . 65
S. Bandinelli and
A. Fuggetta and
C. Ghezzi and
S. Grigolli Process Enactment in SPADE . . . . . . . 67
V. Ambriola and
C. Montangero OIKOS at the Age of Three . . . . . . . 84
W. Emmerich and
W. Schafer and
J. Welsh Suitable Database for Process-Centered
Environments Do not yet Exists . . . . . 94
L. Jaccheri and
S. Gai Initial Requirements for E3: An
Environment for Experimenting and
Evolving Software Process . . . . . . . 99
W. Schafer Introduction . . . . . . . . . . . . . . 105
J. Sa and
B. Warboys Integrating a Formal Specification
Method with PML . . . . . . . . . . . . 106
C. Hoffmann and
B. Kramer and
B. Dinler Multiparadigm Description of System
Development Processes . . . . . . . . . 123
R. M. Greenwood Using CSP and System Dynamics as Process
Engineering Tools . . . . . . . . . . . 138
A. T. Nakagawa Process Versus Product, Abstraction and
Formalism: A Personal Perspective . . . 146
N. Belkhatir and
W. L. Melo The Object Role Software Process Model 150
M. Bourdon Impact of the Supported Coordination
Levels on Process Modelling . . . . . . 153
J. Estublier Reusing Software Processes . . . . . . . 156
J. Favaro Process Modelling at the European Space
Agency . . . . . . . . . . . . . . . . . 159
B. Warboys Introduction . . . . . . . . . . . . . . 165
R. Conradi and
M. L. Jaccheri and
C. Mazzi and
M. N. Nguyen and
A. Aarsten Design, Use and Implementation of SPELL,
a language for Software Process
Modelling and Evolution . . . . . . . . 167
R. A. Snowdon An Example of Process Change . . . . . . 178
V. Gruhn and
R. Jegelka An Evaluation of FUNSOFT Nets . . . . . 196
S. Arbaoui and
S. Mouline and
F. Oquendo and
G. Tassart PEACE: Describing and Managing Evolving
Knowledge in the Software Process . . . 215
V. Gruhn and
A. Saalmann Software Process Validation Based on
FUNSOFT Nets . . . . . . . . . . . . . . 223
P. J. Kawalek The Process Modelling Cookbook:
Orientation, Description and Experience 227
J. Galle Applying Process Modelling . . . . . . . 230
I. C. Taylor Using SPL to Model ISO 9000 . . . . . . 237
R. K. Keller and
N. H. Madhavji A Comprehensive Process Model for
Discussing and Recording Scientific
Papers . . . . . . . . . . . . . . . . . 245
Robert Kowalski Theory and Practice in Logic Programming 1
Thom Fruhwirth and
Alexander Herold and
Volker Kuchenhoff and
Thierry Le Provost and
Pierre Lim and
Eric Monfroy and
Mark Wallace Constraint Logic Programming . . . . . . 3
Michel d'Andrea Scheduling and Optimisation in the
Automobile Industry . . . . . . . . . . 36
Owen V. Evans Factory Scheduling Using Finite Domains 45
Pierre-Joseph Gailly and
Sylvie Bescos and
Wolfgang Krautter and
Christophe Bisiere The Prince Project and Its Applications 54
Shalom Tsur A (Gentle) Introduction to Deductive
Databases . . . . . . . . . . . . . . . 64
Christoph Beierle Knowledge Based PPS Applications in
PROTOS-L . . . . . . . . . . . . . . . . 80
Carlo Chiopris The SECReTS Banking Expert System from
Phase 1 to Phase 2 . . . . . . . . . . . 91
John Fox Logic Engineering and Clinical Dilemmas 100
Edward H. Freeman A Knowledge-Based Approach to Strategic
Planning . . . . . . . . . . . . . . . . 109
Lutz Plumer Expert Systems in Mining . . . . . . . . 118
Michael Hess Natural and Formal Language Processing 127
Deborah A. Dahl Pundit --- Natural Language Interfaces 176
Thomas Grossi and
Didier Bronisz and
Francois Jean-Marie The ESTEAM-316 Dialogue Manager . . . . 186
Robert Kowalski Legislation as Logic Programs . . . . . 203
Udo Pletat Knowledge Representation for Natural
Language Processing . . . . . . . . . . 231
Peter Reintjes A Set of Tools for VHDL Design . . . . . 242
Alan Bundy Tutorial Notes: Reasoning About Logic
Programs . . . . . . . . . . . . . . . . 252
Abdel Ali Ed-Dbali and
Pierre Deransart Software Formal Specification by Logic
Programming: The Example of Standard
Prolog . . . . . . . . . . . . . . . . . 278
Peter Breuer The Art of Computer Un-Programming:
Reverse Engineering in Prolog . . . . . 290
Mireille Ducasse OPIUM --- An Advanced Debugging System 303
Fabio Baj and
Michael Rosner Automatic Theorem Proving Within the
Portable AI Lab . . . . . . . . . . . . 313
Paul R. Wilson Uniprocessor Garbage Collection
Techniques . . . . . . . . . . . . . . . 1
S. E. Abdullahi and
E. E. Miranda and
G. A. Ringwood Collection Schemes for Distributed
Garbage . . . . . . . . . . . . . . . . 43
Y. Bekkers and
O. Ridoux and
L. Ungaro Dynamic Memory Management for Sequential
Logic Programming Languages . . . . . . 82
N. C. Juul and
E. Jul Comprehensive and Robust Garbage
Collection in a Distributed System . . . 103
D. Plainfosse and
M. Shapiro Experience with a Fault-Tolerant Garbage
Collector in a Distributed Lisp System 116
N. Venkatasubramanian and
G. Agha and
C. Talcott Scalable Distributed Garbage Collection
for Systems of Active Objects . . . . . 134
I. Puaut Distributed Garbage Collection of Active
Objects with no Global Synchronisation 148
K. G. Langendoen and
H. L. Muller and
W. G. Vree Memory Management for Parallel Tasks in
Shared Memory . . . . . . . . . . . . . 165
T. Le Sergent and
B. Berthomieu Incremental Multi-Threaded Garbage
Collection on Virtually Shared Memory
Architectures . . . . . . . . . . . . . 179
J. Seward Generational Garbage Collection for Lazy
Graph Reduction . . . . . . . . . . . . 200
E. Chailloux A Conservative Garbage Collector with
Ambiguous Roots for Static Typechecking
Languages . . . . . . . . . . . . . . . 218
L. Mateu An Efficient Implementation for
Coroutines . . . . . . . . . . . . . . . 230
B. C. Heck and
D. S. Wise An Implementation of an Applicative File
System . . . . . . . . . . . . . . . . . 248
S. Duvvuru and
R. Sundararajan and
E. Tick and
A. V. S. Sastry and
L. Hansen and
X. Zhong A Compile-Time Memory-Reuse Scheme for
Concurrent Logic Programs . . . . . . . 264
B. Hayes Finalization in the Collector Interface 277
D. R. Edelson Precompiling C++ for Garbage Collection 299
A. D. Samples Garbage Collection-Cooperative C++ . . . 315
J. F. Pique Dynamic Revision of Choice Points During
Garbage Collection in Prolog [II/III] 330
P. Tarau Ecological Memory Management in a
Continuation Passing Prolog Engine . . . 344
S. Nettles and
J. O'Toole and
D. Pierce and
N. Haines Replication-Based Incremental Copying
Collection . . . . . . . . . . . . . . . 357
E. K. Kolodner and
W. E. Weihl Atomic Incremental Garbage Collection 365
R. L. Hudson and
J. E. B. Moss Incremental Collection of Mature Objects 388
M. S. Lam and
P. R. Wilson and
T. G. Moher Object Type Directed Garbage Collection
to Improve Locality . . . . . . . . . . 404
V. Delacour Allocation Regions and Implementation
Contracts . . . . . . . . . . . . . . . 426
N. Rojemo A Concurrent Generational Garbage
Collector for a Parallel Graph Reducer 440
P. Weemeeuw and
B. Demoen Garbage Collection in Aurora: An
Overview . . . . . . . . . . . . . . . . 454
S. C. Merrall and
J. A. Padget Collections and Garbage Collection . . . 473
T. Yuasa Memory Management and Garbage Collection
of an Extended Common Lisp System for
Massively Parallel SIMD Architecture . . 490
H. G. Baker NREVERSAL of Fortune --- The
Thermodynamics of Garbage Collection . . 507
A. F. Rocha Neural Nets: A Theory for Brains and
Machines . . . . . . . . . . . . . . . . 1
Reginald G. Golledge Do People Understand Spatial Concepts:
The Case of First-Order Primitives . . . 1
Richard T. Snodgrass Temporal Databases . . . . . . . . . . . 22
Helen Couclelis People Manipulate Objects (but Cultivate
Fields): Beyond the Raster-Vector Debate
in GIS . . . . . . . . . . . . . . . . . 65
Robbin R. Hough Time and Space: An Economic Model . . . 78
Keiichi Takeuchi The Changing Language of and Persisting
Patterns in the Urban Design of
Edo/Tokyo . . . . . . . . . . . . . . . 97
Albert Z. Guttenberg Toward a Behavioral Theory of
Regionalization . . . . . . . . . . . . 110
Bianca Falcidieno and
Caterina Pienovi and
Michela Spagnuolo Descriptive Modeling and Prescriptive
Modeling in Spatial Data Handling . . . 122
Daniel R. Montello The Geometry of Environmental Knowledge 136
Dimitris Papadias and
Timos Sellis Spatial Reasoning Using Symbolic Arrays 153
Christian Freksa Using Orientation Information for
Qualitative Spatial Reasoning . . . . . 162
Erland Jungert The Observer's Point of View: An
Extension of Symbolic Projections . . . 179
Max J. Egenhofer and
Khaled K. Al-Taha Reasoning About Gradual Changes of
Topological Relationships . . . . . . . 196
Christopher M. Gold The Meaning of ``Neighbour'' . . . . . . 220
Leila De Floriani and
Enrico Puppo A Hierarchical Triangle-Based Model for
Terrain Description . . . . . . . . . . 236
Thanasis Hadzilacos and
Nectaria Tryfona A Model for Expressing Topological
Integrity Constraints in Geographic
Databases . . . . . . . . . . . . . . . 252
A. Stewart Fotheringham and
Andrew Curtis Encoding Spatial Information: The
Evidence for Hierarchical Processing . . 269
Scott M. Freundschuh Is There a Relationship Between Spatial
Cognition and Environmental Patterns? 288
David M. Mark Counter-Intuitive Geographic `Facts':
Clues for Spatial Reasoning at
Geographic Scales . . . . . . . . . . . 305
Shaun Futch and
David N. Chin and
Matthew McGranaghan and
Jinn-Guey Lay Spatial-Linguistic Reasoning in LEI
(Locality and Elevation Interpreter) . . 318
Mikko Lindholm and
Tapani Sarjakoski User Models and Information Theory in
the Design of a Query Interface for GIS 328
Sabine Timpf and
Gary S. Volta and
David W. Pollock and
Max J. Egenhofer A Conceptual Model of Wayfinding Using
Multiple Levels of Abstraction . . . . . 348
Kazuo Hiraki and
Yuichiro Anzai Towards Acquiring Spatio-Temporal
Knowledge from Sensor Data . . . . . . . 368
A. Barbanente and
D. Borri and
F. Esposito and
P. Leo and
G. Maciocco and
F. Selicato Automatically Acquiring Knowledge by
Digital Maps in Artificial Intelligence
Planning Techniques . . . . . . . . . . 379
P. A. Whigham and
R. I. McKay and
J. R. Davis Machine Induction of Geospatial
Knowledge . . . . . . . . . . . . . . . 402
Ombretta Paladino Treatment of Qualitative Geographic
Information in Monitoring Environmental
Pollution . . . . . . . . . . . . . . . 418
Anonymous Keynote Address . . . . . . . . . . . . 1--2
Watts S. Humphrey Toward a Discipline for Software
Engineering . . . . . . . . . . . . . . 3
Anthony Hall Is Software Engineering? . . . . . . . . 5
Norm E. Gibbs Session 1: Software Engineering
Education in the 1990s . . . . . . . . . 9
Douglas D. Grant Software Engineering Education in the
1990s-- The Way Forward . . . . . . . . 11
David Garlan and
Mary Shaw and
Chris Okasaki and
Curtis M. Scott and
Roy F. Swonger Experience with a Course on
Architectures for Software Systems . . . 23
Terry Shepard and
Dan Hoffman On Teaching the Rational Design Process 44
Neal S. Coulter Session 2: University Perspective on
Industry-Oriented Courses and Software
Reuse . . . . . . . . . . . . . . . . . 63
Bernd Bruegge Teaching an Industry-oriented Software
Engineering Course . . . . . . . . . . . 65
A. Jefferson Offutt and
Roland H. Untch Integrating Research, Reuse, and
Integration into Software Engineering
Courses . . . . . . . . . . . . . . . . 88
Guttorm Sindre and
Even-Andre Karlsson and
Tor Stalhane Software Reuse in an Education
Perspective . . . . . . . . . . . . . . 99
Maribeth B. Carpenter Session 3: Panel Discussion . . . . . . 115
Timothy J. Lulofs Industry Requirements for Academic and
Continuing Education Programs in
Software Engineering . . . . . . . . . . 117
Keith R. Pierce Session 4: Formal Methods and
Engineering Instruction . . . . . . . . 119
Michael J. Lutz Formal Methods and the Engineering
Paradigm . . . . . . . . . . . . . . . . 121
David Garlan Formal Methods for Software Engineers:
Tradeoffs in Curriculum Design . . . . . 131
Richard Lai Teaching Protocol Engineering in Honours
Year . . . . . . . . . . . . . . . . . . 143
Nancy R. Mead Session 5: Panel Discussion . . . . . . 157
Peter H. Lutz Across the Wire: Teaching Software
Engineering at a Distance . . . . . . . 159
Gary Ford Session 6: Panel Discussion . . . . . . 161
Donald Gotterbarn Issues in Licensing Professional
Software Engineers . . . . . . . . . . . 163
Jorge Diaz-Herrera Session 7: Educating Practitioners . . . 165
David R. Luginbuhl and
James E. Cardow Teaching Software Verification and
Validation to Software Practitioners . . 167
Ilkka J. Haikala and
Jukka Marijarvi (Continuing) Education of Software
Professionals . . . . . . . . . . . . . 180
George M. Taulbee The Software Engineering --- Patent Law
Interface: A Practitioner's View . . . . 194
Anneliese von Mayrhauser Session 8: Integrating Software
Engineering with Computer Science . . . 245
Donn Epley A Joint Master's Level Software
Engineering Subtrack . . . . . . . . . . 247
James W. Hooper Planning for Software Engineering
Education Within a Computer Science
Framework at Marshall University . . . . 257
Raj Tewari and
Frank Friedman Integrating Object-Oriented Software
Engineering in the Computer Science
Curriculum . . . . . . . . . . . . . . . 270
Keith R. Pierce Session 9: Product and Practice Models
for the Engineering of Software . . . . 285
Richard S. D'Ippolito and
Kenneth J. Lee and
Charles P. Plinta and
Jeffrey A. Stewart and
Paul D. Bailor and
Thomas C. Hartrum Putting the Engineering into Software
Engineering . . . . . . . . . . . . . . 287
Linda Hutz Pesante Session 10: Panel Discussion . . . . . . 299
A. Winsor Brown Continuing Education and Training for
Software Process Improvement . . . . . . 301
Karen L. Powel Software Process Training: A Formal and
Informal Approach at McDonnell Douglas
Electronic Systems Company . . . . . . . 308
Neal S. Coulter Session 11: Laboratory and Project
Experiences . . . . . . . . . . . . . . 313
William M. Lively and
Mark Lease Undergraduate Software Engineering
Laboratory at Texas A&M University . . . 315
Manmahesh Kantipudi and
James S. Collofello and
Ken W. Collier and
Scott Medeiros Software Engineering Course Projects:
Failures and Recommendations . . . . . . 324
J. Kaye Grau and
Norman Wilde Use of the Individual Exchange Project
Model in an Undergraduate Software
Engineering Laboratory . . . . . . . . . 339
Maribeth B. Carpenter Session 12: Corporate Experience . . . . 349
Rich Pavlik and
Kathy Jacobs Creating a Software Engineering Training
Program in a Level I Organization . . . 351
Sandi Coker and
Bud Glick and
Lavon Green and
Anneliese von Mayrhauser Corporate Software Engineering Education
for Six Sigma: Course Development and
Assessment of Success . . . . . . . . . 360
Richard C. Linger and
R. Alan Spangler The IBM Cleanroom Software Engineering
Technology Transfer Program . . . . . . 380
Michael G. Christel Experiences with an Interactive Video
Code Inspection Laboratory . . . . . . . 395
Gary Ford Session 13: Funding, Practica, and
Principles . . . . . . . . . . . . . . . 413
Doris K. Lidtke and
Caroline E. Wardle Panel: Current Funding Opportunities
Through the National Science Foundation 415
William Junk and
Paul Oman The Influence of Software Engineering
Paradigms on Individual and Team Project
Results . . . . . . . . . . . . . . . . 417
Alfs T. Berztiss Engineering Principles and Software
Engineering . . . . . . . . . . . . . . 437
Josef Grosch Transformation of Attributed Trees Using
Pattern Matching . . . . . . . . . . . . 1
Jose Fortes Galvez Generating LR(1) Parsers of Small Size 16
Borivoj Melichar Syntax Directed Translation with LR
Parsing . . . . . . . . . . . . . . . . 30
Karel Muller Attribute-Directed Top-Down Parsing . . 37
Beate Baum Another Kind of Modular Attribute
Grammars . . . . . . . . . . . . . . . . 44
Tibor Gyimothy and
Zoltan Alexin and
Robert Szucs Integrated Graphic Environment to
Develop Applications Based on Attribute
Grammars . . . . . . . . . . . . . . . . 51
Arnd Poetzsch-Heffter Implementing High-Level Identification
Specifications . . . . . . . . . . . . . 59
Werner Abmann Another Solution of Scoping Problems in
Symbol Tables . . . . . . . . . . . . . 66
A. Dain Samples Compiler Implementation of ADTs Using
Profile Data . . . . . . . . . . . . . . 73
Gunter Riedewald The LDL --- Language Development
Laboratory . . . . . . . . . . . . . . . 88
Deryck F. Brown and
Hermano Moura and
David A. Watt ACTRESS: An Action Semantics Directed
Compiler Generator . . . . . . . . . . . 95
Christian Weber Creation of a Family of Compilers and
Runtime Environments by Combining
Reusable Components . . . . . . . . . . 110
Jens Knoop and
Bernhard Steffen The Interprocedural Coincidence Theorem 125
Bettina Buth and
K.-H. Buth and
M. Franzle and
B. von Karger and
Y. Lakhneche and
K. Langmaack and
M. Muller-Olm Provably Correct Compiler Development
and Implementation . . . . . . . . . . . 141
Mario Sudholt and
Christoph Steigner On Interprocedural Data Flow Analysis
for Object-Oriented Languages . . . . . 156
Helmut Emmelmann Testing Completeness of Code Selector
Specifications . . . . . . . . . . . . . 163
Laurie J. Hendren and
Guang R. Gao and
Erik R. Altman and
Chandrika Mukerji A Register Allocation Framework Based on
Hierarchical Cyclic Interval Graphs . . 176
Evelyn Duesterwald and
Rajiv Gupta and
Mary Lou Soffa Register Pipelining: An Integrated
Approach to Register Allocation for
Scalar and Subscripted Variables . . . . 192
M. Anton Ertl and
Andreas Krall Instruction Scheduling for Complex
Pipelines . . . . . . . . . . . . . . . 207
Jan Hoogerbrugge and
Henk Corporaal Comparing Software Pipelining for an
Operation-Triggered and a
Transport-Triggered Architecture . . . . 219
Robert Griesemer Scheduling Instructions by Direct
Placement . . . . . . . . . . . . . . . 229
Jan Vitek and
R. Nigel Horspool and
James S. Uhl Compile-Time Analysis of Object-Oriented
Programs . . . . . . . . . . . . . . . . 236
Lars Ole Andersen Partial Evaluation of C and Automatic
Compiler Generation . . . . . . . . . . 251
Mikael Pettersson A Term Pattern-Match Compiler Inspired
by Finite Automata Theory . . . . . . . 258
Jurgen Knopp Improving the Performance of Parallel
LISP by Compile Time Analysis . . . . . 271
Koen Langendoen and
Pieter H. Hartel FCG: A Code Generator for Lazy
Functional Languages . . . . . . . . . . 278
Andrei Mantsivoda and
Vyacheslav Petukhin Compiling Flang . . . . . . . . . . . . 297
Lars Viklund and
Johan Herber and
Peter Fritzson The Implementation of ObjectMath --- A
High-Level Programming Environment for
Scientific Computing . . . . . . . . . . 312
John Case and
Dayanand S. Rajan and
Anil M. Shende Representing the Spatial \slash
Kinematic Domain and Lattice Computers 1
Chen Zhixiang and
Wolfgang Maass A Solution of the Credit Assignment
Problem in the Case of Learning
Rectangles . . . . . . . . . . . . . . . 26
John J. Grefenstette Learning Decision Strategies with
Genetic Algorithms . . . . . . . . . . . 35
Nada Lavrac and
Saso Dzeroski Background Knowledge and Declarative
Bias in Inductive Concept Learning . . . 51
Rolf Wiehagen and
Thomas Zeugmann Too Much Information Can be Too Much for
Learning Efficiently . . . . . . . . . . 72
Kurt Ammon Some Experiments with a Learning
Procedure . . . . . . . . . . . . . . . 87
Kalvis Apsitis and
Rusins Freivalds and
Martins Krikis and
Raimonds Simanovskis and
Juris Smotrovs Unions of Identifiable Classes of Total
Recursive Functions . . . . . . . . . . 99
Ganesh Baliga and
Sanjay Jain and
Arun Sharma Learning from Multiple Sources of
Inaccurate Data . . . . . . . . . . . . 108
John Case and
Chen Keh-Jiann and
Sanjay Jain Strong Separation of Learning Classes 129
William W. Cohen Desiderata for Generalization-to-$N$
Algorithms . . . . . . . . . . . . . . . 140
Robert P. Daley and
Bala Kalyanasundaram and
Mahendran Velauthapillai The Power of Probabilism in Popperian
FINite Learning . . . . . . . . . . . . 151
Peter A. Flach An Analysis of Various Forms of `Jumping
to Conclusions' . . . . . . . . . . . . 170
Rusins Freivalds and
Achim G. Hoffmann An Inductive Inference Approach to
Classification . . . . . . . . . . . . . 187
William I. Gasarch and
Mahendran Velauthapillai Asking Questions Versus Verifiability 197
Bipin Indurkhya Predictive Analogy and Cognition . . . . 214
Efim Kinber Learning a Class of Regular Expressions
via Restricted Subset Queries . . . . . 232
Steffen Lange and
Thomas Zeugmann A Unifying Approach to Monotonic
Language Learning on Informant . . . . . 244
Yasuhito Mukouchi Characterization of Finite
Identification . . . . . . . . . . . . . 260
Scott O'Hara A Model of the Redescription Process in
the Context of Geometric Proportional
Analogy Problems . . . . . . . . . . . . 268
Foster John Provost and
Bruce G. Buchanan Inductive Strengthening: The Effects of
a Simple Heuristic for Restricting
Hypothesis Space Search . . . . . . . . 294
Yuji Takada and
Rani Siromoney On Identifying DNA Splicing Systems from
Examples . . . . . . . . . . . . . . . . 305
A. (Annegret) Habel General Introduction . . . . . . . . . . 1--4
A. (Annegret) Habel Hyperedges and Hypergraphs . . . . . . . 5--12
A. (Annegret) Habel Replacement of Hyperedges by Hypergraphs 13--16
A. (Annegret) Habel Hyperedge-Replacement Grammars . . . . . 17--23
A. (Annegret) Habel Modifications of HRG's . . . . . . . . . 24--30
A. (Annegret) Habel Related Concepts . . . . . . . . . . . . 31--41
A. (Annegret) Habel Bibliographic Note . . . . . . . . . . . 42--42
A. (Annegret) Habel Parallel Derivations . . . . . . . . . . 43--44
A. (Annegret) Habel A Context-Freeness Lemma . . . . . . . . 45--50
A. (Annegret) Habel Derivation Trees . . . . . . . . . . . . 51--52
A. (Annegret) Habel Bibliographic Note . . . . . . . . . . . 53--54
A. (Annegret) Habel Closure Properties . . . . . . . . . . . 55--62
A. (Annegret) Habel A Kleene-Type Characterization . . . . . 63--66
A. (Annegret) Habel A Fixed-Point Theorem . . . . . . . . . 67--68
A. (Annegret) Habel Bibliographic Note . . . . . . . . . . . 69--70
A. (Annegret) Habel Simplifications of HRG's . . . . . . . . 71--77
A. (Annegret) Habel A Pumping Lemma for HRL's . . . . . . . 78--86
A. (Annegret) Habel Applications of the Pumping Lemma . . . 87--93
A. (Annegret) Habel Parikh's Theorem for HRL's . . . . . . . 94--95
A. (Annegret) Habel Bibliographic Note . . . . . . . . . . . 96--96
A. (Annegret) Habel Graph-Generating Grammars of Small Order 97--100
A. (Annegret) Habel The Graph-Generating Power of HRG's . . 101--106
A. (Annegret) Habel String-Graph-Generating Grammars of
Small Order . . . . . . . . . . . . . . 107--109
A. (Annegret) Habel The String-Graph-Generating Power of
HRG's . . . . . . . . . . . . . . . . . 110--115
A. (Annegret) Habel Bibliographic Note . . . . . . . . . . . 116--116
A. (Annegret) Habel Some Compatible Graph-Theoretic
Properties . . . . . . . . . . . . . . . 117--127
A. (Annegret) Habel A General View of Compatible Predicates 128--132
A. (Annegret) Habel Efficient Analysis of Graph Properties 133--135
A. (Annegret) Habel A Metatheorem for Graph-Theoretic
Decision Problems . . . . . . . . . . . 136--138
A. (Annegret) Habel A Filter Theorem for HRL's . . . . . . . 139--140
A. (Annegret) Habel Non-Compatible Graph-Theoretic
Properties . . . . . . . . . . . . . . . 141--141
A. (Annegret) Habel Unsolvable Graph-Theoretic Decision
Problems . . . . . . . . . . . . . . . . 142--142
A. (Annegret) Habel Related Research . . . . . . . . . . . . 143--143
A. (Annegret) Habel Bibliographic Note . . . . . . . . . . . 144--144
A. (Annegret) Habel Some Compatible Graph-Theoretic
Functions . . . . . . . . . . . . . . . 145--155
A. (Annegret) Habel A General View of Compatible Functions 156--160
A. (Annegret) Habel A Metatheorem for Boundedness Problems 161--166
A. (Annegret) Habel Related Research . . . . . . . . . . . . 167--166
A. (Annegret) Habel Unsolvable Boundedness Problems . . . . 167--167
A. (Annegret) Habel Bibliographic Note . . . . . . . . . . . 168--168
A. (Annegret) Habel Hypergraph-Replacement Grammars . . . . 169--177
A. (Annegret) Habel Hypergraph-Replacement Grammars with
Application Conditions . . . . . . . . . 178--181
A. (Annegret) Habel Parallel Hyperedge-Replacement Grammars 182--182
A. (Annegret) Habel Figure-Generating Grammars Based on
Hyperedge Replacement . . . . . . . . . 183--191
A. (Annegret) Habel Bibliographic Note . . . . . . . . . . . 192--192
A. (Annegret) Habel Conclusion . . . . . . . . . . . . . . . 193--194
A. (Annegret) Habel Bibliography . . . . . . . . . . . . . . 195--206
Wojciech Szpankowski Probabilistic Analysis of Generalized
Suffix Trees . . . . . . . . . . . . . . 1
Mireille Regnier A Language Approach to String Searching
Evaluation . . . . . . . . . . . . . . . 15
Mikhail J. Atallah and
Philippe Jacquet and
Wojciech Szpankowski Pattern Matching with Mismatches: A
Probabilistic Analysis and a Randomized
Algorithm . . . . . . . . . . . . . . . 27
Yong Kim Jong and
John Shawe-Taylor Fast Multiple Keyword Searching . . . . 41
Guy Jacobson and
Vo Kiem-Phong Heaviest Increasing/Common Subsequence
Problems . . . . . . . . . . . . . . . . 52
James R. Knight and
Eugene W. Myers Approximate Regular Expression Pattern
Matching with Concave Gap Penalties . . 66
Pavel A. Pevzner and
Michael S. Waterman Matrix Longest Common Subsequence
Problem, Duality and Hilbert Bases . . . 77
Chang Chia-Hsiang and
Robert Paige From Regular Expressions to DFA's Using
Compressed NFA's . . . . . . . . . . . . 88
Vincent A. Fischetti and
Gad M. Landau and
Jeanette P. Schmidt and
Peter H. Sellers Identifying Periodic Occurrences of a
Template with Applications to Protein
Structure . . . . . . . . . . . . . . . 109
David Sankoff Edit Distance for Genome Comparison
Based on Non-Local Operations . . . . . 118
Daniel Fischer and
Ruth Nussinov and
Haim J. Wolfson $3$-D Substructure Matching in Protein
Molecules . . . . . . . . . . . . . . . 133
Zhang Kaizhong and
Dennis Shasha and
Jason T. L. Wang Fast Serial and Parallel Algorithms for
Approximate Tree Matching with VLDC's 148
Pekka Kilpelainen and
Heikki Mannila Grammatical Tree Matching . . . . . . . 159
William I. Chang and
Jordan Lampe Theoretical and Empirical Comparisons of
Approximate String Matching Algorithms 172
Ricardo A. Baeza-Yates and
Chris H. Perleberg Fast and Practical Approximate String
Matching . . . . . . . . . . . . . . . . 182
Dominique Revuz and
Marc Zipstein DZ: A Text Compression Algorithm for
Natural Languages . . . . . . . . . . . 190
Pavel A. Pevzner Multiple Alignment with Guaranteed Error
Bounds and Communication Cost . . . . . 202
Robert W. Irving and
Campbell B. Fraser Two Algorithms for the Longest Common
Subsequence of Three (or More) Strings 211
Lucas C. K. Hui Color Set Size Problem with Applications
to String Matching . . . . . . . . . . . 227
Dinesh P. Mehta and
Sartaj Sahni Computing Display Conflicts in String
and Circular String Visualization . . . 241
Amihood Amir and
Martin Farach and
Yossi Matias Efficient Randomized Dictionary Matching
Algorithms . . . . . . . . . . . . . . . 259
Ramana M. Idury and
Alejandro A. Schaffer Dynamic Dictionary Matching with Failure
Functions . . . . . . . . . . . . . . . 273
P. P. Chen ER vs. OO . . . . . . . . . . . . . . . 1
S. B. Navathe The Next Ten Years of Modeling,
Methodologies, and Tools . . . . . . . . 3
B. Thalheim Fundamentals of Cardinality Constraints 7
J. Zhou and
P. Baumann Evaluation of Complex Cardinality
Constraints . . . . . . . . . . . . . . 24
G. Kappel and
M. Schrefl Local Referential Integrity . . . . . . 41
O. Rauh and
E. Stickel Entity Tree Clustering --- A Method for
Simplifying ER Designs . . . . . . . . . 62
J. L. Hainaut A Temporal Statistical Model for
Entity-Relationship Schemas . . . . . . 79
W. W. Song and
P. Johannesson and
J. A. Bubenko Semantic Similarity Relations in Schema
Integration . . . . . . . . . . . . . . 97
S. Castano and
V. De Antonellis and
B. Zonta Classifying and Reusing Conceptual
Schemas . . . . . . . . . . . . . . . . 121
A.- W. Scheer Embedding Data Modelling in a General
Architecture for Integrated Information
Systems . . . . . . . . . . . . . . . . 139
P. Buitelaar and
R. van de Riet The Use of a Lexicon to Interpret ER
Diagrams: A LIKE Project . . . . . . . . 162
H.-M. Chen Garcia and
O. Liu R. Sheng An Entity-Relationship-Based Methodology
for Distributed Database Design: An
Integrated Approach Towards Combined
Logical and Distribution Designs . . . . 178
M. Gandhi and
E. L. Robertson A Specification-Based Data Model . . . . 194
F. Pirri and
C. Pizzuti Data Dictionary Design: A Logic
Programming Approach . . . . . . . . . . 210
T. Miura Nesting Quantification in a Visual Data
Manipulation Language . . . . . . . . . 226
N. Kehrer and
G. Neumann An EER Prototyping Environment and its
Implementation in a Datalog Language . . 243
T.-W. Ling and
M.-L. Lee A Theory for Entity-Relationship View
Updates . . . . . . . . . . . . . . . . 262
R. Herzig and
M. Gogolla Transforming Conceptual Data Models into
an Object Model . . . . . . . . . . . . 280
M. Tresch and
M. H. Scholl Meta Object Management and its
Application to Database Evolution . . . 299
C. Breiteneder and
S. Gibbs and
D. Tsichritzis Modelling of Audio/Video Data . . . . . 322
A. Auddino and
Y. Dennebouy and
Y. Dupont and
E. Fontana and
S. Spaccapietra and
Z. Tari SUPER-Visual Interaction with an
Object-Based ER Model . . . . . . . . . 340
G. Bono and
P. Ficorilli Natural Language Restatement of Queries
Expressed in a Graphical Language . . . 357
R. Elmasri and
V. Kouramajian A Temporal Query Language Based on
Conceptual Entities and Roles . . . . . 375
Z. Tari On the Design of Object-Oriented
Databases . . . . . . . . . . . . . . . 389
M. Halper and
J. Geller and
Y. Perl 'Part' Relations for Object-Oriented
Databases . . . . . . . . . . . . . . . 406
S. E. Bratsberg Unified Class Evolution by
Object-Oriented Views . . . . . . . . . 423
Gyula O. H. Katona Combinatorial and Algebraic Results for
Database Relations . . . . . . . . . . . 1
Jose Alberto Fernandez and
Jack Minker Semantics of Disjunctive Deductive
Databases . . . . . . . . . . . . . . . 21
Michail Sh. Tsalenko Database Theory in Russia (1979--1991) 51
Janos Demetrovics and
L. Ronyai and
nam Son Hua On the Composition and Decomposition of
Attributes and Tuples . . . . . . . . . 71
Jyrki Kivinen and
Heikki Mannila Approximate Dependency Inference from
Relations . . . . . . . . . . . . . . . 86
Chris Tuijn and
Marc Gyssens Views and Decompositions of Databases
from a Categorical Perspective . . . . . 99
Serge Abiteboul and
Moshe Vardi and
Victor Vianu Computing with Infinitary Logic . . . . 113
Stephane Grumbach and
Christophe Tollu Query Languages with Counters . . . . . 124
Val Breazu-Tannen and
Peter Buneman and
Limsoon Wong Naturally Embedded Query Languages . . . 140
Françoise Fabret and
Mireille Regnier and
Eric Simon Optimizing Incremental Computation of
Datalog Programs with Non-Deterministic
Semantics . . . . . . . . . . . . . . . 155
Serge Abiteboul and
Allen Van Gelder Optimizing Active Databases Using the
Split Technique . . . . . . . . . . . . 171
Marcelo Finger and
Dov M. Gabbay Updating Atomic Information in Labelled
Database Systems . . . . . . . . . . . . 188
Han Wong Man and
D. Agrawal Context-Specific Synchronization for
Atomic Data Types . . . . . . . . . . . 201
Alan Fekete and
Nancy Lynch and
William E. Weihl Hybrid Atomicity for Nested Transactions 216
Dean Kuo Model and Verification of a Data Manager
Based on ARIES . . . . . . . . . . . . . 231
Monica D. Barback and
Jorge Lobo and
James J. Lu Minimizing Indefinite Information in
Disjunctive Deductive Databases . . . . 246
Françoise Gire Well-Founded Semantics and Stable
Semantics of Semi-Strict Programs . . . 261
Christos H. Papadimitriou and
Martha Sideri On Finding Extensions of Default
Theories . . . . . . . . . . . . . . . . 276
Guozhu Dong and
Rodney Topor Incremental Evaluation of Datalog
Queries . . . . . . . . . . . . . . . . 282
Tomas Feder and
Yatin Saraiya Decidability and Undecidability of
Equivalence for Linear Datalog with
Applications to Normal-Form
Optimizations . . . . . . . . . . . . . 297
Stephane Grumbach A Paradox in Database Theory . . . . . . 312
Jan Van den Bussche and
Dirk Van Gucht A Hierarchy of Faithful Set Creation in
Pure OODBs . . . . . . . . . . . . . . . 326
Klaus-Dieter Schewe and
Joachim W. Schmidt and
Ingrid Wetzel Identification, Genericity and
Consistency in Object-Oriented Databases 341
Domenico Beneventano and
Sonia Bergamaschi Subsumption for Complex Object Data
Models . . . . . . . . . . . . . . . . . 357
Marie Duzi Semantic Information Connected with Data 376
Piero Bonatti and
Sarit Kraus and
V. S. Subrahmanian Declarative Foundations of Secure
Deductive Databases . . . . . . . . . . 391
Hakan Jakobsson On Materializing Views and On-Line
Queries . . . . . . . . . . . . . . . . 407
Anatoly P. Pinchuk and
Konstantin V. Shvachko Maintaining Dictionaries: Space-Saving
Modifications of B- Trees . . . . . . . 421
Natraj Arni and
Sergio Greco and
Domenico Sacca Set-Term Matching in Logic Programming 436
John A. Bull and
Gong Li and
Karen R. Sollins Towards Security in an Open Systems
Federation . . . . . . . . . . . . . . . 3
Udo Kelter Type-Level Access Controls for
Distributed Structurally Object-Oriented
Database Systems . . . . . . . . . . . . 21
Volker Kessler On the Chinese Wall Model . . . . . . . 41
He Jingsha and
Virgil D. Gligor Formal Methods and Automated Tool for
Timing-Channel Identification in TCB
Source Code . . . . . . . . . . . . . . 57
Marie-Jeanne Toussaint Separating the Specification and
Implementation Phases in Cryptology . . 77
Andrew J. I. Jones and
Marek Sergot Formal Specification of Security
Requirements using the Theory of
Normative Positions . . . . . . . . . . 103
Yvo Desmedt Breaking the Traditional Computer
Security Barriers . . . . . . . . . . . 125
Ralf C. Hauser and
E. Stewart Lee Verification and Modelling of
Authentication Protocols . . . . . . . . 141
Refik Molva and
Gene Tsudik and
Els Van Herreweghen and
Stefano Zatti KryptoKnight Authentication and Key
Distribution System . . . . . . . . . . 155
Anas Tarah and
Christian Huitema Associating Metrics to Certification
Paths . . . . . . . . . . . . . . . . . 175
Jean-Charles Fabre and
Brian Randell An Object-Oriented View of Fragmented
Data Processing for Fault and Intrusion
Tolerance in Distributed Systems . . . . 193
Michael Wang and
Andrzej Goscinski The Development and Testing of the
Identity-Based Conference Key
Distribution System for the RHODOS
Distributed System . . . . . . . . . . . 209
Gene Tsudik Policy Enforcement in Stub Autonomous
Domains . . . . . . . . . . . . . . . . 229
Lam Kwok-Yan and
Dieter Gollmann Freshness Assurance of Authentication
Protocols . . . . . . . . . . . . . . . 261
Colin Boyd A Formal Framework for Authentication 273
Lam Kwok-Yan and
Thomas Beth Timely Authentication in Distributed
Systems . . . . . . . . . . . . . . . . 293
Ravi S. Sandhu and
Sushil Jajodia Polyinstantiation for Cover Stories . . 307
Iwen E. Kang and
Thomas F. Keefe On Transaction Processing for Multilevel
Secure Replicated Databases . . . . . . 329
Gunther Pernul Security Constraint Processing in
Multilevel Secure AMAC Schemata . . . . 349
Bruno d'Ausbourg and
Jean-Henri Llareus Msup 2 S: A Machine for Multilevel
Security . . . . . . . . . . . . . . . . 373
Christel Calas GDoM: a Multilevel Document Manager . . 393
Ross J. Anderson UEPS --- A Second Generation Electronic
Wallet . . . . . . . . . . . . . . . . . 411
Joan Daemen and
Rene Govaerts and
Joos Vandewalle A Hardware Design Model for
Cryptographic Algorithms . . . . . . . . 419--434
Naji Habra and
Baudouin Le Charlier and
Abdelaziz Mounji and
Isabelle Mathieu ASAX: Software Architecture and
Rule-Based Language for Universal Audit
Trail Analysis . . . . . . . . . . . . . 435
P. Gardenfors Belief Revision: A Vademecum . . . . . . 1
L. Farinas Del Cerro and
A. Herzig Meta-Programming Through Intensional
Deduction: Some Examples . . . . . . . . 11
K. Konolige An Autoepistemic Analysis of Metalevel
Reasoning in Logic Programming . . . . . 26
J. Komorowski An Introduction to Partial Deduction . . 49
D. De Schreye and
K. Verschaetse Tutorial on Termination of Logic
Programs . . . . . . . . . . . . . . . . 70
F. van Harmelen Definable Naming Relations in Metalevel
Systems . . . . . . . . . . . . . . . . 89
A. Brogi and
P. Mancarella and
D. Pedreschi and
F. Turini Meta for Modularizing Logic Programming 105
S. K. Debray Compiler Optimizations for Lowlevel
Redundancy Elimination: An Application
of Metalevel Prolog Primitives . . . . . 120
S. Costantini and
P. Dell'Acqua and
G. Lanzarone Reflective Agents in Metalogic
Programming . . . . . . . . . . . . . . 135
I. Cervesato and
G. F. Rossi Logic Meta-Programming Facilities in Log 148
R. Bahgat The Pandora Deadlock Handler Metalevel
Relation . . . . . . . . . . . . . . . . 162
K. Benkerimi and
P. M. Hill Object-Oriented Programming in Godel: An
Experiment . . . . . . . . . . . . . . . 177
D. De Schreye and
B. Martens A Sensible Least Herbrand Semantics for
Untyped Vanilla Meta-Programming and its
Extension to a Limited Form of
Amalgamation . . . . . . . . . . . . . . 192
H. Christiansen A Complete Resolution Method for Logical
Meta-Programming Languages . . . . . . . 205
P. Bonatti Model Theoretic Semantics for Demo . . . 220
F. Giunchiglia and
L. Serafini and
A. Simpson Hierarchical Meta-Logics: Intuitions,
Proof-Theory, and Semantics . . . . . . 235
G. A. Wiggins Negation and Control in Automatically
Generated Logic Programs . . . . . . . . 250
A. Bossi and
N. Cocco and
S. Etalle Transforming Normal Programs by
Replacement . . . . . . . . . . . . . . 265
J. L. Traff and
S. D. Prestwich Meta-Programming for Reordering Literals
in Deductive Databases . . . . . . . . . 280
M. Bruynooghe and
G. Janssens Propagation: A New Operation in a
Framework for Abstract Interpretation of
Logic Programs . . . . . . . . . . . . . 294
F. Mesnard and
J.-G. Ganascia CLP(Q) for Proving Interargument
Relations . . . . . . . . . . . . . . . 308
A. Hamfelt and
A. Hansson Representation of Fragmentary
Multilayered Knowledge . . . . . . . . . 321
J. Grabowski Metaprograms for Change, Assumptions,
Objects, and Inheritance . . . . . . . . 336
U. Vishkin Methods in Parallel Algorithmics and Who
May Need to Know Them? . . . . . . . . . 1
D. T. Lee Rectilinear Paths Among Rectilinear
Obstacles . . . . . . . . . . . . . . . 5
M. H. Chen and
S. L. Lee Linear Time Algorithms for $k$-Cutwidth
Problem . . . . . . . . . . . . . . . . 21
T. Watanabe and
T. Mashita and
S. Taoka The $k$-Edge-Connectivity Augmentation
Problem of Weighted Graphs . . . . . . . 31
S. Patkar and
H. Narayanan Principal Lattice of Partitions of
Submodular Functions on Graphs: Fast
Algorithms for Principal Partition and
Generic Rigidity . . . . . . . . . . . . 41
R. Z. Hwang and
R. C. T. Lee The Application of the Searching over
Separators Strategy to Solve Some
NP-Complete Problems on Planar Graphs 51
M. Halldorsson Parallel and On-Line Graph Coloring
Algorithms . . . . . . . . . . . . . . . 61
T. Matsumoto Competitive Analysis of the Round Robin
Algorithm . . . . . . . . . . . . . . . 71
B. C. Chien and
R. J. Chen and
W. P. Yang Competitive Analysis of the On-Line
Algorithms for Multiple Stacks Systems 78
T. W. Lai Self-Adjusting Augmented Search Trees 88
T. F. Gonzalez and
T. Murayama Algorithms for a Class of Min-Cut and
Max-Cut Problem . . . . . . . . . . . . 97
J. M. Ho and
M. T. Ko and
T. H. Ma and
T. Y. Sung Algorithms for Rectilinear Optimal
Multicast Tree Problem . . . . . . . . . 106
T. Kloks and
H. Bodlaender Approximating Treewidth and Pathwidth of
some Classes of Perfect Graphs . . . . . 116
S. Ueno and
M. Yamazaki and
Y. Kajitani Graph Spanners and Connectivity . . . . 126
O. Berkman and
Y. Matias and
U. Vishkin Randomized Range-Maxima in
Nearly-Constant Parallel Time . . . . . 135
Y. Han and
Y. Igarashi and
K. Kanai and
K. Miura Fault-Tolerant Broadcasting in Binary
Jumping Networks . . . . . . . . . . . . 145
K. Iwama and
E. Miyano and
Y. Kambayashi Routing Problems on the Mesh of Buses 155
S. Jimbo and
A. Maruoka Selection Networks with 8n logsub 2 n
Size and O(log n) Depth . . . . . . . . 165
R. Book Relativizations of the $ \mbox {P} = ?
\mbox {NP} $ and Other Problems: Some
Developments in Structural Complexity
Theory . . . . . . . . . . . . . . . . . 175
M. Paterson Boolean Circuit Complexity (Abstract) 187
A. Symvonis and
S. Tragoudas Searching a Solid Pseudo 3-Sided
Orthoconvex Grid . . . . . . . . . . . . 188
N. D. Dendris and
I. A. Kalafatis and
L. M. Kirousis An Efficient Parallel Algorithm for
Geometrically Characterizing Drawings of
a Class of $3$-D Objects . . . . . . . . 198
K. Sugihara Topologically Consistent Algorithms
Related to Convex Polyhedra . . . . . . 209
S. H. Choi and
S. Y. Shin and
K. Y. Chwa Characterizing and Recognizing
Visibility Graphs of Funnel-Shaped
Polygons . . . . . . . . . . . . . . . . 219
T. Itoh and
K. Horikawa On the Complexity of Composite Numbers 229
K. Kobayashi On Malign Input Distributions for
Algorithms . . . . . . . . . . . . . . . 239
V. Arvind and
J. Kobler and
M. Mundhenk Lowness and the Complexity of Sparse and
Tally Descriptions . . . . . . . . . . . 249
J. Wang and
J. Belanger Honest Iteration Schemes of Randomizing
Algorithms . . . . . . . . . . . . . . . 259
H. S. Lee and
R. C. Chang Approximating Vertices of a Convex
Polygon with Grid Points in the Polygon 269
T. Akutsu Algorithms for Determining the
Geometrical Congruity in Two and Three
Dimensions . . . . . . . . . . . . . . . 279
E. Jennings and
A. Lingas On the Relationships Among Constrained
Geometric Structures . . . . . . . . . . 289
K. Madlener and
F. Otto and
A. Sattler-Klein Generating Small Convergent Systems Can
Be Extremely Hard . . . . . . . . . . . 299
M. Ogawa Chew's Theorem Revisited --- Uniquely
Normalizing Property of Nonlinear Term
Rewriting Systems . . . . . . . . . . . 309
D. Bolignano and
M. Debabi Higher Order Communicating Processes
with Value-Passing, Assignment and
Return of Results . . . . . . . . . . . 319
W. Pijls and
A. de Bruin Searching Informed Game Trees . . . . . 332
M. Iri How to Generate Realistic Sample
Problems for Network Optimization . . . 342
S. Martello and
P. Toth Generalized Assignment Problems . . . . 351
E. Guevremont and
J. Snoeyink Recognizing an Envelope of Lines in
Linear Time . . . . . . . . . . . . . . 370
W. S. Chan and
F. Chin Approximation of Polygonal Curves with
Minimum Number of Line Segments . . . . 378
M. Sarrafzadeh and
D. Wagner and
F. Wagner and
K. Weihe Wiring Knock-Knee Layouts: A Global
Approach . . . . . . . . . . . . . . . . 388
J. Takahashi and
H. Suzuki and
T. Nishizeki Algorithms for Finding Non-Crossing
Paths with Minimum Total Length in Plane
Graphs . . . . . . . . . . . . . . . . . 400
L. Longpre and
O. Watanabe On Symmetry of Information and
Polynomial Time Invertibility . . . . . 410
R. Beigel and
J. Tarui and
S. Toda On Probabilistic ACC Circuits with an
Exact-Threshold Output Gate . . . . . . 420
K. Kurosawa and
O. Watanabe Computational and Statistical
Indistinguishabilities . . . . . . . . . 430
B. Fu and
H. Z. Li On Symmetric Differences of NP-Hard Sets
with Weakly-P- Selective Sets . . . . . 439
M. Sarrafzadeh and
D. T. Lee Restricted Track Assignment with
Applications . . . . . . . . . . . . . . 449
W. L. Hsu A Simple Test for the Consecutive Ones
Property . . . . . . . . . . . . . . . . 459
K. Hakata and
H. Imai The Longest Common Subsequence Problem
for Small Alphabet Size Between Many
Strings . . . . . . . . . . . . . . . . 469
T. W. Lam and
K. H. Lee The Implicit Dictionary Problem
Revisited . . . . . . . . . . . . . . . 479
K. Reinhardt Sorting In-Place with a Worst Case
Complexity of $ n \log n $ --- $ 1.3 n +
{O}(\log n) $ Comparisons and $ \epsilon
n \log n + {O}(1) $ Transports . . . . . 489
A. Moffat and
O. Petersson and
N. C. Wormald Sorting and/by Merging Finger Trees . . 499
Ron Koymans Specifying Message Passing and
Time-Critical Systems with Temporal
Logic . . . . . . . . . . . . . . . . . 1
A. Pnueli System Specification and Refinement in
Temporal Logic . . . . . . . . . . . . . 1
M. Dam Fixed Points of Buchi Automata . . . . . 39
Y. S. Ramakrishna and
L. K. Dillon and
L. E. Moser and
P. M. Melliar-Smith and
G. Kutty An Automata-Theoretic Decision Procedure
for Future Interval Logic . . . . . . . 51
P. Granger Improving the Results of Static Analyses
of Programs by Local Decreasing
Iterations . . . . . . . . . . . . . . . 68
P. K. Agarwal and
M. van Kreveld Implicit Point Location in Arrangements
of Line Segments with an Application to
Motion Planning . . . . . . . . . . . . 80
S. Jadhav and
A. Mukhopadhyay and
B. Bhattacharya An Optimal Algorithm for the
Intersection Radius of a Set of Convex
Polygons . . . . . . . . . . . . . . . . 92
C. Levcopoulos and
A. Lingas C-Sensitive Triangulations Approximate
the MinMax Length Triangulation . . . . 104
H. Buhrman and
S. Homer Superpolynomial Circuits, Almost Sparse
Oracles and the Exponential Hierarchy 116
R. Schuler and
T. Yamakami Structural Average Case Complexity . . . 128
V. Arvind and
J. Kobler and
M. Mundhenk On Bounded Truth-Table, Conjunctive, and
Randomized Reductions to Sparse Sets . . 140
K. Ganesan One-Way Functions and Isomorphism
Conjecture . . . . . . . . . . . . . . . 152
R. Agarwala and
D. Fernandez-Baca Solving the Lagrangian Dual when the
Number of Constraints Is Fixed . . . . . 164
L. V. S. Lakshmanan and
D. A. Nonen Superfiniteness of Query Answers in
Deductive Databases: An
Automata-Theoretic Approach . . . . . . 176
J. Steinbach Proving Polynomials Positive . . . . . . 191
R. Sundararajan and
J. S. Conery An Abstract Interpretation Scheme for
Groundness, Freeness, and Sharing
Analysis of Logic Programs . . . . . . . 203
B. Monsuez Polymorphic Typing by Abstract
Interpretation . . . . . . . . . . . . . 217
G. Huet The Gallina Specification Language: A
Case Study . . . . . . . . . . . . . . . 229
W. Reif Verification of Large Software Systems 241
V. K. Garg and
B. Waldecker Detection of Unstable Predicates in
Distributed Programs . . . . . . . . . . 253
S. Patkar and
H. Narayanan Fast Sequential and Randomized Parallel
Algorithms for Rigidity and Approximate
Min $k$-Cut . . . . . . . . . . . . . . 265
R. Ravi and
B. Raghavachari and
P. Klein Approximation Through Local Optimality:
Designing Networks with Small Degree . . 279
S. Abramsky Games and Full Completeness for
Multiplicative Linear Logic (Extended
Abstract) . . . . . . . . . . . . . . . 291
J. C. Godskesen and
K. G. Larsen Real-Time Calculi and Expansion Theorems 302
D. Caucal Branching Bisimulation for Context-Free
Processes . . . . . . . . . . . . . . . 316
M. Mukund and
M. Nielsen CCS, Locations and Asynchronous
Transition Systems . . . . . . . . . . . 328
L. Christoff and
I. Christoff Reasoning About Safety and Liveness
Properties for Probabilistic Processes 342
S. Muthukrishnan and
H. Ramesh String Matching Under a General Matching
Relation . . . . . . . . . . . . . . . . 356
C. Martel and
R. Subramonian On the Complexity of Certified Write All
Algorithms . . . . . . . . . . . . . . . 368
J. I. Munro and
V. Raman Selection from Read-Only Memory and
Sorting with Optimum Data Movement . . . 380
B. Ravikumar Some Observations on 2-Way Probabilistic
Finite Automata . . . . . . . . . . . . 392
K. Mehlhorn Recent Developments in Algorithms for
the Maximum Flow Problem (Abstract) . . 404
J. L. Lions Inaugural Conference: World mathematical
year 2,000 and computer sciences . . . . 3
M. O. Rabin Dependable parallel computing by
randomization . . . . . . . . . . . . . 19
B. Randell System dependability . . . . . . . . . . 21
J. H. Saltzer Technology, networks, and the library of
the year 2,000 . . . . . . . . . . . . . 51
C. L. Seitz Mosaic C: an experimental fine-grain
multicomputer . . . . . . . . . . . . . 69
J. D. Ullman New frontiers in database system
research . . . . . . . . . . . . . . . . 87
R. L. Constable Formal theories and software systems:
fundamental connections between computer
science and logic . . . . . . . . . . . 105
Z. Manna and
A. Pnueli Time for concurrency . . . . . . . . . . 129
F. P. Preparata and
G. Bilardi Horizons of parallel computation . . . . 155
R. Sethi and
R. Campbell and
S. Dorward and
A. Iyengar and
C. Kalmanek and
G. Murakami and
Shieh Ce-Kuen and
Tan See-Mong Control software for virtual-circuit
switches: call processing . . . . . . . 175
R. J. Brachman What is knowledge representation, and
where is it going? . . . . . . . . . . . 189
J. M. Carroll Creating a design science of
human-computer interaction . . . . . . . 205
J. M. Brady Sensing robots . . . . . . . . . . . . . 219
J. J. Koenderink Fundamentals of bicentric perspective 233
A. N. Netravali Digital HDTV: a technical challenge . . 253
K. J. Astrom Autonomous control . . . . . . . . . . . 267
R. W. Brockett Analog and digital computing . . . . . . 279
W. H. Fleming Stochastic control and large deviations 291
H. J. Sussmann Differential-geometric methods: a
powerful set of new tools for optimal
control . . . . . . . . . . . . . . . . 301
P. Varaiya Coordinating vehicles in an automated
highway . . . . . . . . . . . . . . . . 315
A. S. Willsky Opportunities and challenges in signal
processing and analysis . . . . . . . . 331
E. Wong Neural computing and stochastic
optimization . . . . . . . . . . . . . . 339
F. Brezzi and
C. Baiocchi and
L. D. Marini Stabilization of Galerkin methods and
applications to domain decomposition . . 345
T. J. R. Hughes and
Z. Johan An efficient implementation of the
spectral partitioning algorithm on
connection machine systems . . . . . . . 357
F. Charot and
P. Frison and
E. Gautrin and
D. Lavenier and
P. Quinton and
C. Wagner From Equations to Hardware: Towards
Systematic Mapping of Algorithms onto
Parallel Architectures . . . . . . . . . 1
K. Fukushima Visual Pattern Recognition with Neural
Networks . . . . . . . . . . . . . . . . 16
J. Weng and
T. S. Huang and
N. Ahuja Object Recognition by a Self-Organizing
Neural Network which Grows Adaptively
(Abstract) . . . . . . . . . . . . . . . 32
P. S. P. Wang Intelligent Pattern Recognition and
Applications (Summary) . . . . . . . . . 34
K. Aizawa and
A. Nakamura Path-Controlled Graph Grammars for
Syntactic Pattern Recognition . . . . . 37
V. Cantoni and
L. Cinque and
C. Guerra and
S. Levialdi and
L. Lombardi Describing Objects by a Multi-Resolution
Syntactic Approach . . . . . . . . . . . 54
V. Chaudhary and
K. Kamath and
P. Arunachalam and
J. K. Aggarwal Parallel Manipulations of Octrees and
Quadtrees . . . . . . . . . . . . . . . 69
C. Coutelle and
C. Fortunel and
M. Eccher and
B. Zavidovique Vision Reflex Operators . . . . . . . . 87
M. Crochemore and
W. Rytter Note on Two-Dimensional Pattern Matching
by Optimal Parallel Algorithms . . . . . 100
P. Graham and
S. S. Iyengar and
S.-Q. Zheng An Efficient Line Drawing Algorithm for
Parallel Machines . . . . . . . . . . . 113
K. Inoue and
I. Takanami A Characterization of Recognizable
Picture Languages . . . . . . . . . . . 133
A. Ito and
K. Inoue and
I. Takanami Constant Leaf-Size Hierarchy of
Two-Dimensional Alternating Turing
Machines . . . . . . . . . . . . . . . . 144
K. Kakusho and
S. Dan and
N. Abe and
T. Kitahashi Shape Recovery and Error Correction
Based on Hypothetical Constraints by
Parallel Network for Energy Minimization 159
K. Kobara and
T. Kanaoka and
K. Munechika and
Y. Hamamoto and
S. Tomita Use of Gradated Patterns in an
Associative Neural Memory for Invariant
Pattern Recognition . . . . . . . . . . 179
P. Laroche and
M. Nivat and
A. Saoudi Context-Sensitivity of Puzzle Grammars 195
K. Morita and
S. Ueno Parallel Generation and Parsing of Array
Languages Using Reversible Cellular
Automata . . . . . . . . . . . . . . . . 213
A. Saoudi Parallel Recognition of Multidimensional
Images Using Regular Tree Grammars . . . 231
A. Saoudi and
M. Nivat Optimal Parallel Algorithms for
Multidimensional Image Template Matching
and Pattern Matching . . . . . . . . . . 240
R. Siromoney and
L. Mathew and
K. G. Subramanian and
V. R. Dare Learning of Recognizable Picture
Languages . . . . . . . . . . . . . . . 247
R. Siromoney and
K. G. Subramanian and
V. R. Dare Circular DNA and Splicing Systems . . . 260
Y. Takada Learning Even Equal Matrix Languages
Based on Control Sets . . . . . . . . . 274
G. V. Thang Parallel Dynamic Programming Algorithms
for Image Recognition Based on Its
Contour . . . . . . . . . . . . . . . . 290
J.-X. Wang and
M. Nakamura and
T. Jimbo and
M. Umeno Neural Model for Pattern Recognition . . 296
P. S. P. Wang Three-Dimensional Sequential/Parallel
Universal Array Grammars and Object
Pattern Analysis . . . . . . . . . . . . 305