Browse

ftp://ftp.cs.city.ac.uk (451)

	ftp://ftp.cs.city.ac.uk/papers/89/cs89-28.ps.Z, 19920210 TOPSY: AN EXTENSIBLE UNIX MULTICOMPUTER Phil Winterbottom and Peter Osmon Computer Science Department, City University UK. 1 Introduction Topsy is a new message passing multicomputer architecture. It comprises a distributed Unix compatible kernel resting on a message software system which in turn relies
	ftp://ftp.cs.city.ac.uk/papers/90/cs90-13.ps.Z, 19920210 Meshix: A Unix like operating system for distributed machines Phil Winterbottom and Tim Wilkinson Department of Computer Science, City University, Northampton Square, London EC1V 0HB
	ftp://ftp.cs.city.ac.uk//papers/91/cs91-36.ps.Z, 19920210 Using a Wafer-Scale Component to Create an Ef cient Distributed Shared Memory Aarron Gull City University London UK aarron@uk.ac.city.cs
	ftp://ftp.cs.city.ac.uk//papers/91/cs91-40.ps.Z, 19920210 The Meshnet Multi-stage Communications Network Tim Wilkinson, Andy Whitcroft, Phil Winterbottomy and Peter Osmon Department of Computer Science, City University, Northampton Square, London EC1V 0HB yPresent address AT&T Bell Labs, Murray Hill, New Jersey
	ftp://ftp.cs.city.ac.uk//papers/91/cs91-25.ps.Z, 19920210 BIC - Buffer Interface Controller Preliminary data sheet February 1988 1 Features ffl High bandwidth (12M bytes/sec maximum) ffl Standard DMA style interface ffl Asynchronous data communications protocol ffl Provides a simple interface to Network Control Units ffl Fabricated in 2 CMOS gate array ffl 84
	ftp://ftp.cs.city.ac.uk//papers/91/cs91-24.ps.Z, 19920210 Angel: a proposed multiprocessor operating system kernel (Extended Abstract) T.Wilkinson, T.Stiemerling and P.Osmon Computer Science Department, City University, Northampton Square, London EC1V 0HB, UK. A.Saulsbury and P.Kelly Department of Computing, Imperial College, 180 Queens Gate, London SW7 2BZ,
	ftp://ftp.cs.city.ac.uk//papers/92/cs92-6.ps.Z, 19920210 Implementing DVSM on the TOPSY multicomputer T.Stiemerling and T.Wilkinson Computer Science Department, City University, Northampton Square, London EC1V 0HB, UK. A.Saulsbury Department of Computing, Imperial College, 180 Queens Gate, London SW7 2BZ,UK. ftrs,tim,ansg@uk.ac.city.cs
	ftp://ftp.cs.city.ac.uk//papers/92/sarc92-6.ps.Z, 19920210 The Topsy project: a position paper Peter Osmon Tom Stiemerling Andy Whitcroft Tony Whittaker Tim Wilkinson Nick Williams Department of Computer Science, City University, Northampton Square, London EC1V 0HB, ENGLAND
	ftp://ftp.cs.city.ac.uk//papers/90/cs90-14.ps.Z, 19920213 NCU - Network Control Unit Preliminary data sheet December 1987 1 Features ffl High bandwidth (12M bytes/sec maximum) ffl Byte wide communication ports ffl Asynchronous communications protocol ffl Automatic routing of messages ffl Provides guaranteed deadlock free communications ffl Two independent
	ftp://ftp.cs.city.ac.uk/papers/92/cs92-10.ps.Z, 19920427 Angel: a proposed multiprocessor operating system kernel T. Wilkinson, T. Stiemerling and P. Osmon Computer Science Department, City University, Northampton Square, London EC1V 0HB, UK. A. Saulsbury and P. Kelly Department of Computing, Imperial College, 180 Queens Gate, London SW7 2BZ, UK.
	ftp://ftp.cs.city.ac.uk//papers/92/cs92-10.ps.Z, 19920427 Angel: a proposed multiprocessor operating system kernel T. Wilkinson, T. Stiemerling and P. Osmon Computer Science Department, City University, Northampton Square, London EC1V 0HB, UK. A. Saulsbury and P. Kelly Department of Computing, Imperial College, 180 Queens Gate, London SW7 2BZ, UK.
	ftp://ftp.cs.city.ac.uk//papers/92/sarc92-5.ps.Z, 19920501 The CBIC: Architectural support for message passing Andy Whitcroft Peter Osmon Systems Architecture Research Centre Department of Computer Science, City University, Northampton Square, London EC1V 0HB, ENGLAND
	ftp://ftp.cs.city.ac.uk//papers/92/sarc92-7.ps.Z, 19920818 Evaluating MESHIX A UNIX Compatible Micro-Kernel Operating System TomStiemerling trs@cs.city.ac.uk Andy Whitcroft andy@cs.city.ac.uk TimWilkinson tim@cs.city.ac.uk Nick Williams njw@cs.city.ac.uk Peter Osmon p.osmon@cs.city.ac.uk Systems Architecture Research Centre, City University, Northampton Square
	ftp://ftp.cs.city.ac.uk//papers/92/sarc92-2.ps.Z, 19920821 ooo: Object Oriented Language Compilation for Fine Grained Targets Matthew G Sillitoe Systems Architecture Research Centre, City University, London EC1V 0HB, UK matt@cs.city.ac.uk y 14 August 1992
	ftp://ftp.cs.city.ac.uk//su2sg/docs/modules.ps.Z, 19921021 1 Modules: Providing a Flexible User Environment John L. Furlani June 29, 1991
	ftp://ftp.cs.city.ac.uk/papers/92/sarc92-4.ps.Z, 19930126 The CBIC: Architectural support for message passing or shared memory Andy Whitcroft Peter Osmon Systems Architecture Research Centre Department of Computer Science, City University, Northampton Square, London EC1V 0HB, ENGLAND 1 Introduction This paper is concerned with the data passing performance of a
	ftp://ftp.cs.city.ac.uk//su2sg/docs/ag100393.ps.Z, 19930222 SU2SG AGENDA Wednesday 10th March 1993 1. Apologies for absence. 2. Minutes of 3rd meeting. 3. Presentation by CIL. 4. Site Reports. 5. Details of next meeting. 6. Any other business.
	ftp://ftp.cs.city.ac.uk//su2sg/docs/min201092.ps.Z, 19930222 Small Unix Systems Services Group Minutes of 3rd meeting February 19, 1993 Chair: Paul Kentish Head of Computer Services Wye College, University of London Wye, Ashford, KENT TN25 5AH 0233 812401 x397 P.Kentish@uk.ac.lon.wye Secretary: Nigel Mitchem System Manager Department of Computer Science City
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/brim-temporal-modal.ps.gz, 19930224 Modal Logics in Timed Process Algebras Lubo<=s Brim Department of Computing Science, Masaryk University Brno, Czechoslovakia
	ftp://ftp.cs.city.ac.uk//papers/91/cs91-33.ps.Z, 19930312 Deriving logic programs from observations David Gilbert City University, London U.K. Christopher Hogger Imperial College, London U.K.
	ftp://ftp.cs.city.ac.uk//papers/91/cs91-27.ps.Z, 19930312 SILCS { Specification In Logic of Concurrent Systems David Gilbert Department of Computer Science City University U.K.
	ftp://ftp.cs.city.ac.uk/papers/87/cs87-27.ps.Z, 19930312 PARLOG: a tutorial introduction. David Gilbert Department of Computing Imperial College 180, Queen'sGate London SW7 2BZ UK
	ftp://ftp.cs.city.ac.uk/papers/90/cs90-18.ps.Z, 19930312 Specifying and Reasoning about Concurrent Systems in Logic David Roger Gilbert Department of Computer Science City University London U.K. 1990 Specifying and Reasoning about Concurrent Systems in Logic David Roger Gilbert A thesis submitted to the University of London for the degree of Doctor of
	ftp://ftp.cs.city.ac.uk//papers/92/cs92-11.ps.Z, 19930312 SILCS { a constructive specification language for concurrent systems David Gilbert Department of Computer Science City University U.K. email: drg@cs.city.ac.uk March 4, 1993
	ftp://ftp.cs.city.ac.uk//papers/92/sarc92-8.ps.Z, 19930319 SMURFS: A Happy Filesystem Nick Williams PRIMA group, SARC 6 December, 1992 1 Introduction Within SARC, we have produced a UN*X operating system known as Meshix which runs on multiprocessor Topsy machines. With new demands placed on these machines\|larger hardware configurations, more I/O intensive
	ftp://ftp.cs.city.ac.uk//papers/92/sarc92-3.ps.Z, 19930319 Network Shared Memory Peter Osmon, Kevin Murray, Andy Whitcroft, Tim Wilkinson, Nick Williams Systems Architecture Research Centre, City University October 1992
	ftp://ftp.cs.city.ac.uk//papers/93/sarc93-3.ps.Z, 19930319 Experiences with Distributed Shared Memory Systems Architecture Research Centre Department of Computer Science City University Northampton Square London EC1V 0HB
	ftp://ftp.cs.city.ac.uk//papers/93/sarc93-1.ps.Z, 19930329 Compiling for a 64-Bit Single Address Space Architecture Tim Wilkinson , Ashley Saulsbury , Tom Stiemerling and Kevin Murray Systems Architecture Research Centre City University, London, ENGLAND. Swedish Institute of Computer Science Stockholm, SWEDEN. 29 Mar. 1993
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/ciancarini-log-prog-in-sw-eng.ps.gz, 19930504 What is Logic Programming good for in Software Engineering Paolo Ciancarini Giorgio Levi Technical Report UBLCS-93-9 April 1993 Laboratory for Computer Science University of Bologna Piazza di Porta S. Donato, 5 40127 Bologna (Italy) The University of Bologna Laboratory for Computer Science Research
	ftp://ftp.cs.city.ac.uk//papers/92/cs92-7.ps.Z, 19930507 A DVSM server for MESHIX Ashley Saulsbury Department of Computing, Imperial College, 180 Queens Gate, London SW7 2BZ, UK. and Tom Stiemerling Computer Science Department, City University, Northampton Square, London EC1V 0HB, UK.
	ftp://ftp.cs.city.ac.uk/papers/92/cs92-15.ps.Z, 19930527 Some empirical results in planning speed-up using combinations of on-line adaption techniques T.L. McCluskey email: lee@uk.ac.city.cs Department of Computer Science City University Northampton Square London EC1V OHB, U.K. J.M.Porteous email: julie@uk.ac.city.cs Department of Computer Science City
	ftp://ftp.cs.city.ac.uk//su2sg/docs/ag140693.ps.Z, 19930604 SU2SG AGENDA Monday 14th June 1993 1. Apologies for absence. 2. Minutes of 4th meeting. 3. Presentation by Andrew Findlay from Brunel University. 4. Site Reports. 5. Details of next meeting. 6. Any other business.
	ftp://ftp.cs.city.ac.uk//su2sg/docs/min100393.ps.Z, 19930604 Small Unix Systems Services Group Minutes of 4th meeting June 4, 1993 Chair: Paul Kentish Head of Computer Services Wye College, University of London Wye, Ashford, KENT TN25 5AH 0233 812401 x397 P.Kentish@uk.ac.lon.wye Secretary: Nigel Mitchem System Manager Department of Computer Science City
	ftp://ftp.cs.city.ac.uk//papers/93/sarc93-7.ps.Z, 19930607 ooo: Compilation for Parallel Targets Matthew G Sillitoe Systems Architecture Research Centre, City University, London EC1V 0HB, UK Tel: +44 71 477 8000 x3722 Fax: +44 71 477 8587 Email: matt@cs.city.ac.uk 1 June 1993 Submitted to HICSS-27 minitrack Issues and Problems in Compiling for Distributed
	ftp://ftp.cs.city.ac.uk//papers/93/sarc93-8.ps.Z, 19930607 Multi-processor File-System Performance Modelling Julie A. McCann Tony Valsamidis, David Bolton, Nick Williams, Xiaoding Zhao Department of computer Science, CITY University, Northampton Square, LONDON, EC1V 0HB, ENGLAND 071 477 8551 jam@city.cs.ac.uk ABSTRACT The introduction of parallelism has brought
	ftp://ftp.cs.city.ac.uk//papers/93/sarc93-5.ps.Z, 19930607 PRIMA1 : A Parallel Relational Database Machine Architecture David Bolton Julie McCann Peter Osmon Tony Valsamidis Nick Williams Xiaoding Zhao Systems Architecture Research Centre, City University, Northampton Square, London EC1V 0HB Tel: +44 71 477 8551, Fax: +44 71 477 8587 Email: prima@cs.city.ac.uk
	ftp://ftp.cs.city.ac.uk//papers/93/sarc93-4.ps.Z, 19930607 Angel: Resource Uniocation in a 64-bit Micro-Kernel Kevin Murray , Tom Stiemerling , Tim Wilkinson and Paul Kelly Systems Architecture Research Centre, Department of Computer Science, City University, Northampton Square, London EC1V 0HB, ENGLAND. Department of Computing, Imperial College, London,
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/borning-UW-CSE-93-01-02a.ps.gz, 19930611 Hierarchical Constraint Logic Programming Molly Wilson and Alan Borning Technical Report 93-01-02a Department of Computer Science and Engineering University of Washington May 1993
	ftp://ftp.cs.city.ac.uk//su2sg/docs/AFslides.ps.Z, 19930617 Andrew.Findlay@brunel.ac.uk June 1993 Campus-wide networked services 1 7500 users 200+ workstations 500+ DOS PCs 25 staff 3 Systems and networks 2 PC Support 6 User and package support 9 Operations and reception ffl ffl ffl ffl The size of the problem 2 Each user wants One username and password One Home
	ftp://ftp.cs.city.ac.uk//su2sg/docs/AFpaper.ps.Z, 19930617 Campus-wide networked services Andrew Findlay Computer Centre Brunel University Uxbridge UK Andrew.Findlay@brunel.ac.uk June 1993
	ftp://ftp.cs.city.ac.uk/papers/93/sarc93-9.ps.Z, 19930707 Design and Implementation of an Object-Orientated 64-bit Single Address Space Microkernel Kevin Murray, Tim Wilkinson, Peter Osmon { SARC, City University Ashley Saulsbury { Swedish Institute of Computer Science Tom Stiemerling, Paul Kelly { Imperial College
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/prosser-forward-check-backmrk.ps.gz, 19930713 Forward Checking with Backmarking Technical Report AISL-48-93 June 1993 Patrick Prosser Department of Computer Science University of Strathclyde Glasgow G1 1XH Scotland pat@cs.strath.ac.uk
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/meyer-DFKI-lookahead-engdes.ps.gz, 19930713 DFKI Research Report 93-22 Weak Looking-Ahead and its Application to Computer-Integrated Process Planning Manfred A. Meyer and J org P. M uller April 1993 Deutsches Forschungszentrum f ur K unstliche Intelligenz GmbH Erwin-Schr odinger-Strasse D-6750 Kaiserslautern, Germany Tel.: + 49 (631) 302-3211
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/le-provost-wallace-generlsd.ps.gz, 19930713 technical report ECRC{92{1 Generalised Constraint Propagation Over the CLP Scheme Thierry Le Provost Mark Wallace EUROPEAN COMPUTER-INDUSTRY RESEARCH CENTRE ECRC GMBH, ARABELLASTR. 17 D-8000 M UNCHEN 81, GERMANY - TEL +49 89/926 99 - FAX 926 99 170 - TLX 521 6910 c European Computer-Industry Research
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/fruhwirth-ecrc-clp-intro.ps.gz, 19930713 technical report ECRC{93{5 Constraint Logic Programming An Informal Introduction Thom Fr uhwirth, Alexander Herold, Volker K uchenhoff, Thierry Le Provost, Pierre Lim, Eric Monfroy, Mark Wallace EUROPEAN COMPUTER-INDUSTRY RESEARCH CENTRE ECRC GMBH, ARABELLASTR. 17 D-8000 M UNCHEN 81, GERMANY - TEL +49
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/meyer-DFKI-hclp-engdes.ps.gz, 19930713 DFKI Research Report 92-35 Using Hierarchical Constraint Satisfaction for Lathe-Tool Selection in a CIM Environment Manfred Meyer August 1992 Deutsches Forschungszentrum f ur K unstliche Intelligenz GmbH Erwin-Schr odinger-Strasse D-6750 Kaiserslautern, Germany Tel.: + 49 (631) 302-3211 Fax: + 49 (631)
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/kirchner-cstrnt-finite-alg.ps.gz, 19930719 A constraint solver in finite algebras and its combination with unification algorithms H el ene Kirchner & Christophe Ringeissen CRIN-CNRS & INRIA-Lorraine BP 239, 54506 Vandoeuvre-l es-Nancy Cedex, France fhkirchner,ringeissg@loria.fr
	ftp://ftp.cs.city.ac.uk//papers/93/sarc93-10.ps.Z, 19930719 Nomads: The future of personal computing services (Revision : 1:3) Andy Whitcroft, Tim Wilkinson and Nick Williams Systems Architecture Research Centre, Department of Computer Science, City University, Northampton Square, London EC1V 0HB, ENGLAND. 13 July 1993 1 Introduction With the advent of
	ftp://ftp.cs.city.ac.uk//papers/93/sarc93-11.ps.Z, 19930721 Implementing Fault Tolerance in a 64-bit Distributed Operating System Timothy James Wilkinson Systems Architecture Research Centre City University July 1993 This thesis is submitted as part of the requirements for a Ph.D. in Computer Science, in the Department of Computer Science of City University,
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/sontag-neural-nets-control.ps.gz, 19930727 Some Topics in Neural Networks and Control Eduardo D. Sontag Some Topics in Neural Networks and Control Eduardo D. Sontag Department of Mathematics, Rutgers University New Brunswick, NJ 08903 July 6, 1993 Report Number LS93-02
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/minas-temporal-constrnt-nets.ps.gz, 19930729 MODELLING AND MONITORING REAL-TIME SYSTEMS WITH TEMPORAL CONSTRAINT NETS Mark Minas Lehrstuhl f ur Programmiersprachen Universit at Erlangen-N urnberg Martensstr. 3, W-8520 Erlangen Germany
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/stuckey-constructive-negation.ps.gz, 19930803 Constructive Negation for Constraint Logic Programming Peter J. Stuckey Department of Computer Science University of Melbourne Parkville, 3052, Australia pjs@cs.mu.oz.au
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/covington-efficient-prolog.ps.gz, 19930810 Research Report AI-1989-08 Artificial Intelligence Programs The University of Georgia Athens, Georgia 30602 Available by ftp from aisun1.ai.uga.edu (128.192.12.9) Series editor: Michael Covington mcovingt@aisun1.ai.uga.edu 1 Covington -- Efficient Prolog Efficient Prolog: A Practical Guide Michael A.
	ftp://ftp.cs.city.ac.uk//papers/93/sarc93-12.ps.Z, 19930813 Cherub: A Hardware Distributed Single Shared Address Space Memory Architecture Aarron Gull Systems Architecture Research Centre City University March 1993 This thesis is submitted as part of the requirements for a Ph.D. in Computer Science, in the Department of Computer Science of City University,
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/heintze-clpr-elec-eng.ps.gz, 19930816 CLP(R) and Some Electrical Engineering Problems Nevin Heintze Spiro Michaylov School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, U.S.A. Peter Stuckey IBM Thomas J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598, U.S.A. November 25, 1991
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/garcia-banda-herm-indep-clp.ps.gz, 19930816 Proceedings of the 1993 International Logic Programming Symposium, MIT Press Independence in Constraint Logic Programs M. Garc a de la Banda M. Hermenegildo Facultad de Inform atica Universidad Polit ecnica de Madrid (UPM) 28660-Boadilla del Monte, Madrid - Spain fmaria,hermeg@fi.upm.es K. Marriott
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/freeman-benson-kaleidoscope.ps.gz, 19930816 The Design and Implementation of Kaleidoscope'90, A Constraint Imperative Programming Language Bjorn N. Freeman-Benson Alan Borning University of Victoria Department of Computer Science Department of Computer Science and Engineering, FR-35 Box 3055 University of Washington Victoria, B.C. V8W 3P6
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/sannella-deltablue-user-int.ps.gz, 19930816 Multi-way versus One-way Constraints in User Interfaces: Experience with the DeltaBlue Algorithm Michael Sannella, John Maloney, Bjorn Freeman-Benson, and Alan Borning Technical Report 92-07-05a Dept. of Computer Science and Engineering University of Washington May 1993
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/abadi-polymorphic-SRC-109.ps.gz, 19930817 Page 1 Formal Parametric Polymorphism Mart n Abadi Luca Cardelli Pierre-Louis Curien Digital Equipment Corporation Digital Equipment Corporation CNRS Systems Research Center Systems Research Center Ecole Normale Sup rieure
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/hayes-jones-nicholls-VDM-Z.ps.gz, 19930820 Computer ScienceUniversity of Manchester Understanding the differences between VDM and Z I. J. Hayes, C. B. Jones and J. E. Nicholls Technical Report UMCS 93 8 1 Understanding the differences between VDM and Z I. J. Hayes Department of Computer Science University of Queensland e-mail:
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/sloman-penrose-review.ps.gz, 19930824 To appear in: ecnegilletnIlaicfiitrA The Emperor's Real Mind ,namolSnoraA School of Computer Science mahgnimriBfoytisrevinUehT :foweiveR Roger Penrose The Emperor's New Mind: Concerning Computers, Minds and the Laws of Physics 664+iiix;)9891,dnalgnE,PD62XO,drofxO,teertSnotlaW,sserPytisrevinUdrofxO(
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/heintze-set-cons-analysis.ps.gz, 19930826 Set Constraints in Program Analysis NEVIN HEINTZE School of Computer Science Carnegie Mellon University July 1993 Set constraints provide a mechanism for analyzing programs that is based on the intuition of treating program variables as sets of values . This paper presents an overview of how set
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/heintze-ml-analysis.ps.gz, 19930826 Set Based Analysis of ML Programs (Extended Abstract) NEVIN HEINTZE School of Computer Science Carnegie Mellon University July 28, 1993 Reasoning about a program by treating program variables as sets of values leads to a simple, accurate and intuitively appealing notion of program approximation. This
	ftp://ftp.cs.city.ac.uk//sarc/booklet.ps, 19930903 SARC Systems Architecture Research Centre Department of Computer Science City University Northampton Square London EC1V 0HB Phone 071 477 8551 Fax 071 477 8587 Email sarc@cs.city.ac.uk SARC is an affiliated laboratory of the London Parallel Applications Centre. Introduction to SARC SARC, City
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/whitley-genetic-algs-tutorial.ps.gz, 19930909 Department of Computer Science A Genetic Algorithm Tutorial Darrell Whitley Technical Report CS-93-103 (Revised) August 25, 1993 Colorado State University A Genetic Algorithm Tutorial Darrell Whitley Computer Science Department, Colorado State University Fort Collins, CO 80523 whitley@cs.colostate.edu
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/leo-time-vary-k-short-paths.ps.gz, 19930910 Time-Varying K Shortest Paths Algorithm John Leo Matsushita Communication Industrial, Ltd. January 14, 1993 1 Introduction We examine a particular algorithm that finds the k shortest paths between a given source node and destination node of a directed graph with non-negative edge weights. The algorithm
	ftp://ftp.cs.city.ac.uk//incoming/hicss.ps.Z, 19930910 Angel: Resource Unification in a 64-bit Microkernel Kevin Murray, Tim Wilkinson Tom Stimerling, Paul Kelly City University, UK. Imperial College, UK.
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/brqnd-securities-valuation.ps.gz, 19930915 PARIS RESEARCH LABORATORY digital March 1993 26 J er ome Barraquand Numerical Valuation of High Dimensional Multivariate European Securities 26 Numerical Valuation of High Dimensional Multivariate European Securities J er ome Barraquand March 1993 Publication Notes c Digital Equipment Corporation 1993
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/hertzberg-cons-relax-boltzman.ps.gz, 19930923 Transforming Constraint Relaxation Networks into Boltzmann Machines Joachim Hertzberg Hans Werner Guesgen German National Research Center for Computer Science (GMD) Schloss Birlinghoven, D-5205 Sankt Augustin 1, F.R.G.
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/mandel-semantics-cons-lambda.ps.gz, 19931018 The Semantics of the Untyped Constrained Lambda Calculus Luis Mandel Ludwig-Maximilians-Universit t M nchen Institut f r Informatik Bericht 9319 Oktober 1993 The Semantics of the Untyped Constrained Lambda Calculus Luis Mandel mandel@forwiss.tu-muenchen.de Bayerisches Forschungszentrum F r
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/crossley-constrained-lambda.ps.gz, 19931018 Untyped Constrained Lambda Calculus John N. Crossley, Luis Mandel and Martin Wirsing Ludwig-Maximilians-Universit t M nchen Institut f r Informatik Bericht 9318 September 1993 Untyped Constrained Lambda Calculus John N. Crossley1 Monash University, Melbourne, Australia jnc@bruce.cs.monash.edu.au Luis
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/valdez-peres-sci-comp-sci.ps.gz, 19931109 A Scientific Basis for Computational Science Ra ul E. Vald es-P erez May 1993 CMU-CS-93-162 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/mcdonald-stuckey-yap-redund.ps.gz, 19931115 Redundancy of Variables in CLP(R) Andrew D. Macdonald, Peter J. Stuckey, Roland H.C. Yap Department of Computer Science University of Melbourne Parkville 3052, Australia fandrewdm,pjs,rolandg@cs.mu.oz.au
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/marriott-three-rs.ps.gz, 19931115 The 3 R's of Optimizing Constraint Logic Programs: Refinement, Removal and Reordering Kim Marriott IBM - T.J. Watson Research Center Yorktown Heights, NY 10598, U.S.A. Peter J. Stuckey Department of Computer Science University of Melbourne Parkville 3052, Australia
	ftp://ftp.cs.city.ac.uk//papers/93/cs93-6.ps.Z, 19931130 Technical Report Department of Computer Science October 1993 From specifications to programs { an extrinsic approach (Technical report) David Gilbert City University, London, U.K. Christopher Hogger Imperial College, London, U.K. Ji<=r Zlatu<=ska Masaryk University, Brno, Bohemia TCU/CS/1993/7
	ftp://ftp.cs.city.ac.uk//papers/93/sarc93-14.ps, 19931130 SIMULATING PERFORMANCE OF PARALLEL DATABASE SYSTEMS Julie A. McCann* Department of computer Science, CITY University, Northampton Square, LONDON, EC1V 0HB, ENGLAND jam@cs.city.ac.uk
	ftp://ftp.cs.city.ac.uk/papers/93/cs93-6.ps.Z, 19931130 Technical Report Department of Computer Science October 1993 From specifications to programs { an extrinsic approach (Technical report) David Gilbert City University, London, U.K. Christopher Hogger Imperial College, London, U.K. Ji<=r Zlatu<=ska Masaryk University, Brno, Bohemia TCU/CS/1993/7
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/bruynooghe-abstract-int-tut.ps.gz, 19931203
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/wellman-market-flows-jair.ps.gz, 19931206 Journal of Artificial Intelligence Research 1 (1993) 1-23 Submitted 5/93; published 8/93 A Market-Oriented Programming Environment and its Application to Distributed Multicommodity Flow Problems Michael P. Wellman wellman@engin.umich.edu University of Michigan, Dept. of Electrical Engineering and
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/baader-defaults-termin.ps.gz, 19931206 How to Prefer More Specific Defaults in Terminological Default Logic Franz Baader and Bernhard Hollunder German Research Center for AI (DFKI) Stuhlsatzenhausweg 3, 6600 Saarbr ucken 11, Germany E-mail: hlast namei@dfki.uni-sb.de
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/kowalski-models.ps.gz, 19931208 Logic without Model Theory Robert Kowalski
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/hogger-kotzamanidis-failure.ps.gz, 19931208 Aspects of Failure Analysis in a CLP(<) system Chris Hogger and Antonis Kotzamanidis Imperial College Department of Computing 180, Queen's Gate London SW7 2BZ Internal Report June 1993 Contents 1 Introduction 2 2 Motivation 3 3 An Extended Example 5 4 Conventions 8 5 Representation of Constraints 9 6
	ftp://ftp.cs.city.ac.uk//outgoing/thesis.ps.Z, 19931217 The Analysis and Acquisition of Proper Names for Robust Text Understanding Sam Coates-Stephens Department of Computer Science City University October 1992 This thesis is submitted as part of the requirements for a Ph.D. in Computer Science in the Department of Computer Science of City University,
	ftp://ftp.cs.city.ac.uk//pub/sasos/projects/Angel.ps, 19931220 The Angel Project - A Brief Overview Authors TimWilkinson (tim@cs.city.ac.uk) AshleySaulsbury (ans@sics.se) TomStiemerling Kevin Murray (kam@cs.city.ac.uk) Paul Kelley (phjk@doc.ic.ac.uk) Peter Osmon Introduction This project was prompted by earlier work at City University on a message passing
	ftp://ftp.cs.city.ac.uk/papers/93/cs93-4.ps.Z, 19931222 CITY University Technical Report Department of Computer Science School of Informatics December 1993 Logic Programming with Fuzzy Sets Lud<=ek Matyska TCU/CS/1993/4 Department of Computer Science, City University, Northampton Square, London, EC1V 0HB, England. The author on leave from the Institute of
	ftp://ftp.cs.city.ac.uk//papers/93/cs93-4.ps.Z, 19931222 CITY University Technical Report Department of Computer Science School of Informatics December 1993 Logic Programming with Fuzzy Sets Lud<=ek Matyska TCU/CS/1993/4 Department of Computer Science, City University, Northampton Square, London, EC1V 0HB, England. The author on leave from the Institute of
	ftp://ftp.cs.city.ac.uk//papers/93/sarc93-15.ps, 19940110 Report on Distributed File System Migration and Caching Julie A. McCann August 1993 The following report wishes to addresses the 2 fundamental questions regarding file system migration and caching strategies i.e.: 1. Is there a need for file system migration 2. If there is a need, will remote requests
	ftp://ftp.cs.city.ac.uk//papers/93/sarc93-13.ps, 19940110 The Angel Project - A Brief Overview Authors TimWilkinson (tim@cs.city.ac.uk) AshleySaulsbury (ans@sics.se) TomStiemerling Kevin Murray (kam@cs.city.ac.uk) Paul Kelley (phjk@doc.ic.ac.uk) Peter Osmon Introduction This project was prompted by earlier work at City University on a message passing
	ftp://ftp.cs.city.ac.uk//papers/93/sarc93-17.ps, 19940110 Report on Distributed File System Migration and Caching III Julie A. McCann November 1993 The following report yet again wishes to addresses questions regarding file system migration and caching strategies now that it has been established that migration is necessary and that remote caching is not
	ftp://ftp.cs.city.ac.uk//papers/94/sarc94-1.ps, 19940110 Report on Distributed File System Migration and Caching IV Julie A. McCann December 1993 Major Question. How many remote requests to a data block constitutes it to be a candidate for migration and what is the ideal migration block size at that point Experiment 1 Migration Threshold In this set of
	ftp://ftp.cs.city.ac.uk//papers/93/sarc93-16.ps, 19940110 Report on Distributed File System Migration and Caching II Julie A. McCann September 1993 The following report wishes to addresses questions regarding file system migration and caching strategies now that it has been established that migration is necessary and that remote caching is not necessary. Now
	ftp://ftp.cs.city.ac.uk//su2sg/docs/ag170194.ps.Z, 19940111 SU2SG AGENDA Monday 17th January 1994 1. Apologies for absence. 2. Minutes of 6th meeting. 3. Site Reports. 4. Details of next meeting. 5. Any Other business.
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/andrews-foundational-clp.ps.gz, 19940121 Foundational Issues in Implementing Constraint Logic Programming Systems James H. Andrews Dept. of Computing Science Simon Fraser University Burnaby, BC, Canada V5A 1S6 jamie@cs.sfu.ca
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/abdallah-292-paper.ps.gz, 19940209 Kernel knowledge versus belt knowledge in default reasoning: a logical approach M.A. Nait Abdallah Department of Computer Science University of Western Ontario London, Ontario, Canada
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/abdallah-291-paper.ps.gz, 19940209 An extended framework for default reasoning M.A. Nait Abdallah Department of Computer Science University of Western Ontario London, Ontario, Canada June 2, 1991
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/sloman-prolegomena-affect.ps.gz, 19940216 Prolegomena to a Theory of Communication and Affect Aaron Sloman School of Cognitive and Computing Sciences University of Sussex (Birmingham University from August 1991) October 13, 1992
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/sloman-silicon-souls.ps.gz, 19940216 May 1992 Silicon Souls 1 SILICON SOULS HOW TO DESIGN A FUNCTIONING MIND Inaugural lecture, 18 May 1992: The University of Birmingham Aaron Sloman A brief introduction to Artificial Intelligence (the core of Cognitive Science) Based on the simple idea that a mind is a sophisticated self-modifying control
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/sloman-mind-control.ps.gz, 19940216 April 1993 1 The mind as a control system To appear in Proceedings of the 1992 Royal Institute of Philosophy Conference Philosophy and the Cognitive Sciences , (eds) C. Hookway and D.Peterson, Cambridge University Press THE MIND AS A CONTROL SYSTEM Aaron Sloman School of Computer Science The University
	ftp://ftp.cs.city.ac.uk//papers/94/cs94-1.ps, 19940217 Technical Report Department of Computer Science February 1994 Learning Regular Expressions by Pattern Matching Alvis Br azma City University, London, U.K. TCU/CS/1994/1 Institute of Mathematics and Computer Science, University of Latvia
	ftp://ftp.cs.city.ac.uk//papers/91/cs91-41.ps.Z, 19940301 University of London Imperial College of Science, Technology and Medicine Department of Computing
	ftp://ftp.cs.city.ac.uk/papers/91/cs91-41.ps.Z, 19940301 University of London Imperial College of Science, Technology and Medicine Department of Computing
	ftp://ftp.cs.city.ac.uk//su2sg/docs/min270993.ps.Z, 19940307 Small Unix Systems Services Group Minutes of 6th meeting March 7, 1994 Chair: Paul Kentish Head of Computer Services Wye College, University of London Wye, Ashford, KENT TN25 5AH 0233 812401 x397 P.Kentish@uk.ac.lon.wye Secretary: Nigel Mitchem System Manager Department of Computer Science City
	ftp://ftp.cs.city.ac.uk//su2sg/docs/ag270993.ps.Z, 19940307 SU2SG AGENDA Monday 27th September 1993 1. Apologies for absence. 2. Minutes of 5th meeting. 3. Election of officers. 4. Presentation by Peter Bromwich from Xanadu Systems. 5. Site Reports. 6. Details of next meeting. 7. Any other business.
	ftp://ftp.cs.city.ac.uk//su2sg/docs/min140693.ps.Z, 19940307 Small Unix Systems Services Group Minutes of 5th meeting March 7, 1994 Chair: Paul Kentish Head of Computer Services Wye College, University of London Wye, Ashford, KENT TN25 5AH 0233 812401 x397 P.Kentish@uk.ac.lon.wye Secretary: Nigel Mitchem System Manager Department of Computer Science City
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/kerr-slany-fuzzy-sched.ps.gz, 19940318 DRAFT Wed Mar 9 14:31 1994 :: riacifs.dvi RESEARCH ISSUES AND CHALLENGES IN FUZZY SCHEDULING Roger Kerr { Wolfgang Slany Christian Doppler Laboratory for Expert Systems E184/2, TU Wien, Paniglg. 16, A-1040 Vienna, Austria, Europe Phone: +43{1{58801/f6123j6124j6127g Fax: +43{1{5055304 E-Mail:
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/le-provost-wallace-domain-ind.ps.gz, 19940321 Domain Independent Propagation Thierry Le Provost, Mark Wallace ECRC, Arabellastr 17 8000 M unchen 81, Germany fthierry j markg@ecrc.de
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/fruhwirth-temporal-94-05.ps.gz, 19940321 Technical Report ECRC-94-05 February 16, 1994 Temporal Reasoning with Constraint Handling Rules Thom Fr uhwirth thom@ecrc.de European Computer-Industry Research Centre GmbH Arabellastr. 17, D-81925 M unchen Germany
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/fruhwirth-terminolog-94-06.ps.gz, 19940321 Technical Report ECRC-94-06 February 16, 1994 Terminological Reasoning with Constraint Handling Rules Thom Fr uhwirth, ECRC and Philipp Hanschke, DFKI thom@ecrc.de European Computer-Industry Research Centre GmbH Arabellastr. 17, D-81925 M unchen Germany
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/phd-student-supervisor.ps.gz, 19940406 How to Be a Good Graduate Student Advisor Marie desJardins marie@erg.sri.com March 1994
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/estonia-drg-cad-etc.ps.gz, 19940407 Languages, Tools and Methods for Conceptual Modelling Technical Report CS61/93 Jaan Penjam Ahto Kalja Mihail Matskin Hele-Mai Haav Mait Harf Rein L~ougas Monika Perkmann Benjamin Volo<=z Merik Meriste Uno Kaljulaid Andrus J arg Vahur Kotkas Kaur Kiisler Computer Science Department Institute of
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/janson-haridi-intro-akl.ps.gz, 19940415 An Introduction to AKL A Multi-Paradigm Programming Language Sverker Janson and Seif Haridi Swedish Institute of Computer Science Box 1263, S-164 28 KISTA, Sweden E-mail sverker@sics.se, seif@sics.se December 14, 1993 1 Introduction AKL is a multi-paradigm programming language based on a concurrent
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/orgun-temporal-modal.ps.gz, 19940422 An Overview of Temporal and Modal Logic Programming Mehmet A. Orgun1 and Wanli Ma2 1 Department of Computing, Macquarie University, Sydney, NSW 2109, Australia 2 Computer Sciences Laboratory, RSISE, The Australian National University, Canberra, ACT 0200, Australia
	ftp://ftp.cs.city.ac.uk//pub/sasos/papers/KeyKOS/ConfusedDeputy.ps.Z, 19940505 capability to the statistics file. Instead of referring to the name of the file, the compiler would merely designate that capability when depositing the statistics. The capability both identifies the file and authorizes the compiler to write there. When producing the debugging output the compiler would
	ftp://ftp.cs.city.ac.uk//pub/sasos/papers/KeyKOS/MicroKernelPaper.ps.Z, 19940505 The KeyKOSfi Nanokernel Architecture Alan C. Bomberger Norman Hardy A. Peri Frantz Charles R. Landau William S. Frantz Jonathan S. Shapiro Ann C. Hardy
	ftp://ftp.cs.city.ac.uk//pub/sasos/papers/KeyKOS/OSRpaper.ps.Z, 19940505 Eighth Edition (December 1990) This paper was written by Norman Hardy and appeared in a slightly different form in Operating Systems Review, September, 1985. Key Logic 5200 Great America Parkway Santa Clara, CA 95054-1108 (408) 255-9496 Copyright 1985, 1987, 1988, 1990 Key Logic. All rights reserved.
	ftp://ftp.cs.city.ac.uk//pub/sasos/papers/KeyKOS/WhyArch.ps.Z, 19940505 Norman Hardy, 1994. Ph: 415 851 2582 e mail: norm@netcom.com This is a collection of discussions of why the Keykos architecture is as it is. The issues range from religious to engineering from complexity of code to complexity of explanation. Generalities: Why Capabilities The file OS History is a start
	ftp://ftp.cs.city.ac.uk//pub/galactic-guide/images/printout.ps, 19940505 A long long time ago (1991) in a place far far away (alt.fan.douglas-adams) some people said "Why don't we write our own Guide to the Galaxy " And we looked upon this idea and saw that it was good. Then someone asked "Can we write about Gallifrey, and The Heart of Gold, and The Death Star, and
	ftp://ftp.cs.city.ac.uk/papers/94/cs94-4.ps, 19940505 A Tangled Web of Deceit Andy Whitcroft Support Group Computer Science Department City University Tim Wilkinson Systems Architecture Research Centre City University
	ftp://ftp.cs.city.ac.uk//pub/sasos/papers/KeyKOS/KeyTXF.ps.Z, 19940505 Object Oriented Transaction Processing in the KeyKOS Microkernel William S. Frantz Charles R. Landau Periwinkle Computer Consulting Tandem Computers Inc. 16345 Englewood Ave. 19333 Vallco Pkwy, Loc 3-22 Los Gatos, CA USA 95032 Cupertino, CA USA 95014 frantz@netcom.com landau_charles@tandem.com
	ftp://ftp.cs.city.ac.uk//papers/94/sarc94-2.ps, 19940506 Experiences in Writing a WYSIWYG Editor for HTML Nick Williams Tim Wilkinson Systems Architecture Research Centre City University April 15, 1994
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/lee-neural-clp.ps.gz, 19940602 Towards the Integration of Artificial Neural Networks and Constraint Logic Programming J.H.M. Lee and V.W.L. Tam Department of Computer Science The Chinese University of Hong Kong Hong Kong Email: fjlee,wltamg@cs.cuhk.hk Phone: +852 609 8426 Fax: +852 603 5024
	ftp://ftp.cs.city.ac.uk//su2sg/docs/min170194.ps.Z, 19940607 Small Unix Systems Services Group Minutes of 7th meeting Chair: Paul Kentish Head of Computer Services Wye College, University of London Wye, Ashford, KENT TN25 5AH 0233 812401 x397 P.Kentish@uk.ac.lon.wye Secretary: Nigel Mitchem System Manager Department of Computer Science City University Northampton
	ftp://ftp.cs.city.ac.uk//su2sg/docs/ag090594.ps.Z, 19940607 SU2SG AGENDA Monday 9th May 1994 1. Apologies for absence. 2. Minutes of 7th meeting. 3. Site Reports. 4. Details of next meeting. 5. Any Other business.
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/borning-hclp-iclp89.ps.gz, 19940613 Constraint Hierarchies and Logic Programming Alan Borningy, Michael Maherz, Amy Martindaley, and Molly Wilsony yComputer Science Dept, FR-35 zIBM T.J. Watson Research Ctr. University of Washington P.O. Box 704 Seattle, WA 98195 Yorktown Heights, NY 10598 internet: borning@cs.washington.edu, mjm@ibm.com,
	ftp://ftp.cs.city.ac.uk//incoming/dvsm-proj.ps, 19940615 DISTRIBUTED VIRTUAL SHARED MEMORY (DVSM) PERFORMANCE ANALYSIS AND IMPROVEMENT by A. M. CHANGAROTH PROJECT FOR THE DEGREE OF B.ENG (Hons) IN COMPUTER SYSTEMS ENGINEERING Supervisor: Dr. Kevin Murray Department of Computer Science CITY UNIVERSITY April 1994 i No: DISTRIBUTED VIRTUAL SHARED MEMORY (DVSM)
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/cosmadakis-kuper-exprssv-clp.ps.gz, 19940616 technical report ECRC{94{13 Expressiveness of First-Order Constraint Languages Stavros S. Cosmadakis IBM T.J. Watson Research Center Gabriel M. Kuper ECRC EUROPEAN COMPUTER-INDUSTRY RESEARCH CENTRE ECRC GMBH, ARABELLASTR. 17, D-81925 M UNCHEN, GERMANY - TEL +49 89/926 99 - FAX 926 99 170 - TLX 521 6910
	ftp://ftp.cs.city.ac.uk//papers/92/cs92-27.ps, 19940620 Tracking Image Features Using A Parallel Computational Model T. J. Ellis , M. Mirmehdiy and G. R. Dowlingy Machine Vision Group, City University, London, EC1V 0HB yDepartment of Computer Science, City University, London, EC1V 0HB
	ftp://ftp.cs.city.ac.uk/papers/94/cs94-7.ps, 19940621 Tracking using colour information Simon A. Brock-Gunn, Geoff R. Dowling and Tim J. Ellis Department of Computer Science City University, London EC1V OHB U.K. email: G.R.Dowling@city.ac.uk
	ftp://ftp.cs.city.ac.uk//papers/94/cs94-6.ps, 19940621 Locating a Building Inspection Robot on a Tower Block using Visual Methods Alastair M. Paterson, Geoff R. Dowling and Denis A. Chamberlain Department of Computer Science City University, London EC1V OHB U.K. email: A.M.Paterson@city.ac.uk
	ftp://ftp.cs.city.ac.uk//papers/91/cs91-44.ps, 19940621 1 Label Inspection using the Hough Transform on Transputer Networks M. Mirmehdi, G. A. W. West1, G. R. Dowling City University, London EC1V 0HB. email: majid@uk.ac.city.cs
	ftp://ftp.cs.city.ac.uk//papers/91/cs91-45.ps, 19940621 Braille Translation using Augmented Transition Networks Jose Cabrera Molina & Geoff Dowling The City University, London, England EC1V 0HB
	ftp://ftp.cs.city.ac.uk//papers/94/cs94-5.ps, 19940621 Identifying Key Features in a Building Using a Single Uncalibrated Camera Alastair M. Paterson, Geoff R. Dowling, Denis A. Chamberlain Construction Robotics Unit The City University, London, England EC1V 0HB email: A.M.Paterson@city.ac.uk
	ftp://ftp.cs.city.ac.uk//outgoing/amdref.ps, 19940623 Amd The 4.4 BSD Automounter Reference Manual Jan-Simon Pendry and Nick Williams Last updated March 1991 Documentation for software revision 5.3 Alpha Copyright c 1989 Jan-Simon Pendry Copyright c 1989 Imperial College of Science, Technology & Medicine Copyright c 1989 The Regents of the University of
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/estonia-participants.ps.gz, 19940624 List of participants Nicolaos ANGELOPOULOS Imperial College Dept. of Computing Huxley Building 180 Queens Gate London SW7-2BZ UNITED KINGDOM Email: na3@doc.ic.ac.uk Francisco A. AZEVEDO Universidade Nova de Lisboa FCT Dpto. de Informatica 2825 Monte Caparica PORTUGAL Fax: +351 1 295 5641 Email:
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/fages-preferences-clp.ps.gz, 19940627 Handling preferences in Constraint Logic Programming with Relational Optimization Fran cois Fages1;2, Julian Fowler1 and Thierry Sola1 1 Thomson-CSF/LCR, 91404 Orsay Cedex, France. 2 LIENS CNRS,Ecole Normale Sup erieure, 45 rue d'Ulm, 75005 Paris, France.
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/fruhwirth-annotate-ecrc-94-22.ps.gz, 19940701 Annotated Constraint Logic Programming Applied to Temporal Reasoning Thom Fr uhwirth ECRC-94-22 technical report ECRC-94-22 Annotated Constraint Logic Programming Applied to Temporal Reasoning Thom Fr uhwirth European Computer-Industry Research Centre GmbH (Forschungszentrum) Arabellastrasse 17 D-81925
	ftp://ftp.cs.city.ac.uk//papers/94/cs94-8.ps, 19940705 Approximate String Matching PATRICK A. V. HALL and GEOFF R. DOWLING SCICON Consultancy International Ltd Department of Computer Science Sanderson House The City University 49 Berners Street Northampton Square London WIP 4AQ, England. London EC1V OHB, England.
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/matyska-clp-overview-softsem.ps.gz, 19940707 SOFSEM '93 Hrdo nov, Sumava, Bohemia, 21. 11. 3. 12. 1993 Constraint Logic Programming An Overview Lud ek Matyska Institute of Computer Science Masaryk University Bure sova 20 602 00 Brno Czech Republic E-mail: ludek@muni.cz
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/chaitin.ps.gz, 19940713 THE LIMITS OF MATHEMATICS G. J. Chaitin IBM, P O Box 704 Yorktown Heights, NY 10598 chaitin@watson.ibm.com Draft July 7, 1994 To Fran coise Preface In a remarkable development, I have constructed a new definition for a self-delimiting universal Turing machine (UTM) that is easy to program and runs very
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/jampel-fair-hierarchies.ps.gz, 19940714 Technical Report Department of Computer Science School of Informatics July 1994 Fair Hierarchical Constraint Logic Programming Michael Jampel jampel@cs.city.ac.uk David Gilbert drg@cs.city.ac.uk TCU/CS/1994/ Department of Computer Science, School of Informatics, City University, Northampton Square,
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/wilson-thesis-93-05-01.ps.gz, 19940718 1 Hierarchical Constraint Logic Programming (Ph.D. Dissertation) Molly Ann Wilson Technical Report 93-05-01 Dept. of Computer Science and Engineering University of Washington May 1993 2 University of Washington
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/schiex-possibilistic-csp.ps.gz, 19940722 Possibilistic Constraint Satisfaction Problems or How to handle soft constraints Proceedings of the Eighth Conference of Uncertainty in Artificial Intelligence, USA, Stanford (CA), Juillet 1992, pp. 269 275 Thomas Schiex CERT ONERA (DERA GIA) 2, Av. Edouard Belin, BP 4025 31055 Toulouse Cedex FRANCE
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/smith-boulanger-knowledge-ocs.ps.gz, 19940725 A knowledge representation for preliminary stages of engineering tasks 1 I.F.C. Smith, Artificial Intelligence Laboratory (LIA) S. Boulanger, ICOM (Steel Structures) Swiss Federal Institute of Technology (EPFL) CH-1015 Lausanne, Switzerland
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/dupin-lang-schiex-penalty-log.ps.gz, 19940725 Penalty logic and its link with Dempster-Shafer theory Florence Dupin de Saint-Cyr, J er^ome Lang IRIT - Universit e Paul Sabatier 118 Route de Narbonne 31062 Toulouse Cedex France f dupin, lang g @irit.fr Thomas Schiex CERT-ONERA 2 Avenue Edouard Belin - BP 4025 31055 Toulouse Cedex France
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/lim-schimpf-conservative-meta.ps.gz, 19940726 A Conservative Approach to Meta-Programming in Constraint Logic Programming Pierre Lim and Joachim Schimpf European Computer-Industry Research Centre Arabellastrasse 17, 81925 M unchen, Germany fpierre,joachimg@ecrc.de
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/bakker-tmplmn-over-constr.ps.gz, 19940726 Diagnosing and solving over-determined constraint satisfaction problems R.R. Bakker F. Dikker F. Tempelman P.M. Wognum University of Twente, Department of Computer Science, P.O. Box 217, 7500 AE Enschede, The Netherlands, Tel. + 31 53 89 3690, Fax. +31 53 33 9605, E-mail:
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/santos-lin-constraint-abduct.ps.gz, 19940727 A Linear Constraint Satisfaction Approach for Abductive Reasoning Eugene Santos Jr. Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-24 April 1992 A Linear Constraint Satisfaction Approach for Abductive Reasoning1 Eugene Santos Jr. Ph.D. Dissertation Department of
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/santos-lin-constraint-cyclic.ps.gz, 19940727 A Linear Constraint Satisfaction Approach to Cyclicity Eugene Santos Jr. Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-03 January 1992 A Linear Constraint Satisfaction Approach to Cyclicity1 Eugene Santos Jr. Department of Computer Science Box 1910, Brown
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/kanellakis-cnstr-query-94-31.ps.gz, 19940727 Constraint Programming and Database Query Languages Paris C Kanellakis and Dina Q Goldin Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-31 June 1994 Constraint Programming and Database Query Languages Paris C Kanellakis and Dina Q Goldin Brown University,
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/sloman-explorations.ps.gz, 19940727 Explorations in Design Space Aaron Sloman and the Cognition and Affect Group 1
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/krose-smagt-neural-nets-book.ps.gz, 19940804 Ben J. A. Krose.. An introduction to Networks Neural P. Patrick van der Smagt Fifth edition January 1993 2 c 1993 The University of Amsterdam. Permission is granted to distribute single copies of this book for non-commercial use, as long as it is distributed as a whole in its original form, and the
	ftp://ftp.cs.city.ac.uk//incoming/hpca95.ps.gz, 19940809 Simple Cache Only Memory Architecture Ashley Saulsbury, Tim Wilkinson , John Cartery, Anders Landin z Swedish Institute of Computer Science Box 1263, S-164 28 Kista, Sweden July 31, 1994
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/michaylov-skeleton-technique.ps.gz, 19940815 Skeletons and Techniques for the Systematic Development of Constraint Logic Programs Technical Report OSU-CISRC-6/94-TR30 Spiro Michaylov Department of Computer and Information Science, The Ohio State University, 228 Bolz Hall, 2036 Neil Avenue Mall, Columbus, OH 43210-1277, U.S.A.,
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/cayrol-schiex-non-mon-entail.ps.gz, 19940831 On the Complexity of Non-Monotonic Entailment in Syntax-Based Approaches Claudette Cayrol and Marie-Christine Lagasquie-Schiex Institut de Recherche en Informatique de Toulouse 118 route de Narbonne 31062 Toulouse Cedex France e-mail: ftestemal, lagasqg@irit.fr
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/tsang-mapping.ps.gz, 19940908 Department of Computer Science, University of Essex Technical Report CSM-198 December 15, 1993 page 1 of 11 Mapping Constraint Satisfaction Problems to Algorithms and Heuristics Edward Tsang Alvin Kwan Department of Computer Science University of Essex Colchester CO4 3SQ tel: 0206 872774, 0206 872138
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/brown-mantha-w-relax-horn.ps.gz, 19940908 Relaxable Horn Clauses: Constraint Optimization using Preference Logics Allen L. Brown, Jr. Surya Mantha Toshiro Wakayama Webster Research Center Xerox Corporation August 30, 1993
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/marriott-stuckey-approx-inter.ps.gz, 19940912 Approximating interaction between linear arithmetic constraints (Extended Abstract) Kimbal Marriott Department of Computer Science Monash University Clayton 3168, Australia marriott@cs.monash.edu.au Peter J. Stuckey Department of Computer Science The University of Melbourne Parkville 3052, Australia
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/tsutsumi-efficient-hierarchy.ps.gz, 19940914 An Efficient algorithm of Logic Programming with Constraint Hierarchy TSUTSUMI, Fujio Communication & Information Research Laboratory, CRIEPI 2-11-1, Iwado Kita, Komae-shi, TOKYO 201, JAPAN Phone: +81 3 3480-2111 FAX: +81 3 5497-0318 E-mail: tutumi@denken.or.jp
	ftp://ftp.cs.city.ac.uk//pub/sasos/papers/lifetime-sasos.ps.Z, 19940915 The Expected Lifetime of Single-Address-Space" Operating Systems David Kotz and Preston Crow Dartmouth College Department of Mathematics and Computer Science Hanover, NH 03755-3510 fdfk,crowg@cs.dartmouth.edu
	ftp://ftp.cs.city.ac.uk//outgoing/prima/DOCS/mascots.ps, 19940929 Dynamic File Migration to Support Parallel Database Systems J.A. McCann, N.J. Williams, P. Osmon Systems Architecture Research Centre, CITY University, Northampton Square, LONDON, EC1V 0HB, ENGLAND jam@cs.city.ac.uk njw@cs.city.ac.uk
	ftp://ftp.cs.city.ac.uk//outgoing/prima/DOCS/eursim.ps, 19940929 SIMULATING PERFORMANCE OF PARALLEL DATABASE SYSTEMS Julie A. McCann, D. A. Bell* Department of computer Science, CITY University, Northampton Square, LONDON, EC1V 0HB, ENGLAND jam@cs.city.ac.uk
	ftp://ftp.cs.city.ac.uk//outgoing/prima/DOCS/ctspe.ps, 19940929 MULTI-PROCESSOR FILE-SYSTEM PERFORMANCE MODELLING Julie A. McCann, (with D. Bolton, T. Valsamidis, N. Williams, X. Zhao) PRIMA project, City University, London, EC1V 0HB
	ftp://ftp.cs.city.ac.uk//outgoing/prima/DOCS/vldb.ps, 19940929 Parallel Relational Information Machine Architecture PRIMA Peter Osmon David Bolton Julie McCann Nick Williams Tony Valsamidis Xiaoding Zhao Partners: LPAC - London Parallel Applications Centre City University Systems Architecture Research Centre, LONDON askINGRES Limited to produce a scaleable and cost
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/allis-search-games-thesis.ps.gz, 19941004 Searching for Solutions in Games and Artificial Intelligence Louis Victor Allis Version 8.0 of July 1, 1994 Searching for Solutions in Games and Artificial Intelligence ii Voor Petra en Cindy iv Searching for Solutions in Games and Artificial Intelligence PROEFSCHRIFT ter verkrijging van de graad van
	ftp://ftp.cs.city.ac.uk//outgoing/prima/DOCS/prima_report_summary.ps, 19941005 PRIMA Parallel Relational Information Management Architecture Final Report September 1994
	ftp://ftp.cs.city.ac.uk//outgoing/prima/DOCS/prima_report_detailed.ps, 19941005 PRIMA Parallel Relational Information Management Architecture Final Report September 1994
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/bel-schiex-abstract.ps.gz, 19941005 Representation and practical handling of flexibility in constrained problems Projet de recherche PRC-GDR en intelligence artificielley October 1992 1 Presentation of the project This paper is a synthesis of the first exchanges and studies within a French Artificial Intelligence Research Project on the
	ftp://ftp.cs.city.ac.uk//incoming/tmrproposal.ps, 19941121 Memo From: Anthony Finkelstein Subject: Project Proposal Date: 17/11/94 I am seeking your involvement in the definition and organisation of a project for submission to the new programme for Training and Mobility of Researchers (TMR). I understand this will now be called at the same time as the rest of
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/ridoux-clp-alpha-irisa-PI876.ps.gz, 19941122 IRISAINSTITUTDERECHERCHEENINFORMATIQUEETSYST MESAL ATOIRESP U B L I C A T I O NI N T E R N ENoI R I S A CAMPUS UNIVERSITAIRE DE BEAULIEU - 35042 RENNES CEDEX - FRANCE ISSN 1166-8687876 IMAGINING CLP( , ) OLIVIER RIDOUX INSTITUT DE RECHERCHE EN INFORMATIQUE ET SYSTE MES ALE ATOIRES Campus de Beaulieu
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/coupet-grimal-rid-irisa-PI878.ps.gz, 19941122 IRISAINSTITUTDERECHERCHEENINFORMATIQUEETSYST MESAL ATOIRESP U B L I C A T I O NI N T E R N ENoI R I S A CAMPUS UNIVERSITAIRE DE BEAULIEU - 35042 RENNES CEDEX - FRANCE ISSN 1166-8687878 ON THE USE OF ADVANCED LOGIC PROGRAMMING LANGUAGES IN COMPUTATIONAL LINGUISTICS SOLANGE COUPET-GRIMAL ET OLIVIER RIDOUX
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/wilson-borning-extnd-89-05-04.ps.gz, 19941124 Extending Hierarchical Constraint Logic Programming: Nonmonotonicity and Inter-Hierarchy Comparison Molly Wilson and Alan Borning Technical Report 89-05-04 Department of Computer Science and Engineering University of Washington July 1989
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/lamport-tla.ps.gz, 19941130 Processes are in the Eye of the Beholder Leslie Lamport Sat 26 Nov 1994
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/tick-clpr-financial-swaps.ps.gz, 19941207 Designing Financial Swaps with CLP(<) Evan Tick CIS-TR{94{21 November 1994
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/montanari-rssi-srswt-cc-indet.ps.gz, 19941212 CC Programs with both In- and Non-determinism: A Concurrent Semantics Ugo Montanari Francesca Rossi Vijay Saraswat University of Pisa Computer Science Department Corso Italia 40, 56100 Pisa, Italy. E-mail: fugo,rossig@di.unipi.it. Xerox PARC 3333 Coyote Hill Road, Palo Alto, CA 94304. E-mail:
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/hermenegildo-rossi-indep.ps.gz, 19941213 J. LOGIC PROGRAMMING 1993:12:1{199 1 STRICT AND NON-STRICT INDEPENDENT AND-PARALLELISM IN LOGIC PROGRAMS: CORRECTNESS, EFFICIENCY, AND COMPILE-TIME CONDITIONS MANUEL V. HERMENEGILDO AND FRANCESCA ROSSI > This paper presents some fundamental properties of independent and-parallelism and extends its
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/rossi-conc-abstr-machine.ps.gz, 19941213 An Abstract Machine for Concurrent Modular Systems: CHARM Andrea Corradini Ugo Montanari Francesca Rossi University of Pisa Computer Science Department Corso Italia 40, 56100 Pisa, Italy fandrea,ugo,rossig@di.unipi.it
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/marek-logical-constraints.ps.gz, 19941219 On logical constraints in Logic Programming (Preliminary results) V. Wiktor Marek Department of Computer Science University of Kentucky Lexington, KY 40506, U.S.A. marek@cs.uky.edu Anil Nerode Mathematical Sciences Institute Cornell University Ithaca, NY 14853, U.S.A. anil@math.cornell.edu Jeffrey B.
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/abadi-logical-compos.ps.gz, 19950103 86 A Logical View of Composition Mart n Abadi and Gordon D. Plotkin May 1, 1992 Systems Research Center DEC's business and technology objectives require a strong research program. The Systems Research Center (SRC) and three other research laboratories are committed to filling that need. SRC began
	ftp://ftp.cs.city.ac.uk//su2sg/docs/ag160195.ps.Z, 19950112 SU2SG AGENDA 10th meeting Monday 16th January 1995 1. Apologies for absence. 2. Minutes of 9th meeting. 3. Site Reports. 4. Any other business. 5. Details of next meeting.
	ftp://ftp.cs.city.ac.uk//su2sg/docs/min090594.ps.Z, 19950112 Small Unix Systems Services Group Minutes of 8th meeting Chair: Paul Kentish Head of Computer Services Wye College, University of London Wye, Ashford, KENT TN25 5AH 0233 812401 x397 P.Kentish@uk.ac.lon.wye Secretary: Nigel Mitchem System Manager Department of Computer Science City University Northampton
	ftp://ftp.cs.city.ac.uk//su2sg/docs/ag200994.ps.Z, 19950112 SU2SG AGENDA Tuesday 20th September 1994 1. Apologies for absence. 2. Minutes of 8th meeting. 3. Election of officers. 4. Presentation. 5. Site Reports. 6. Any other business. 7. Details of next meeting.
	ftp://ftp.cs.city.ac.uk//su2sg/docs/min200994.ps.Z, 19950113 Small Unix Systems Services Group Minutes of 9th meeting Chair: Paul Kentish Head of Computer Services Wye College, University of London Wye, Ashford, KENT TN25 5AH 0233 812401 x397 P.Kentish@wye.lon.ac.uk Secretary: Nigel Mitchem Technical Support Administrator School of Informatics City University
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/wetzel-sched-new-clp.ps.gz, 19950117 Imperial College of Science, Technology and Medicine (University of London) Department of Computing Scheduling in a New Constraint Logic Programming Framework by Gerhard Wetzel Submitted in partial fulfilment of the requirements for the MSc degree in Engineering of the University of London, and the
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/rensink-determ-pomset-HIB3094.ps.gz, 19950117 HILDESHEIMER INFORMATIK- BERICHTE UNIVERSIT T HILDESHEIM Postfach 10 13 63 31113 Hildesheim Institut f r Informatik Dieser Bericht ist herausgegeben vom Arend Rensink Deterministic Pomsets 30/94 (November 1994) ISSN 941-3014 (this page intentionally left blank) Deterministic Pomsets Arend Rensink
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/kowalski-wetzel-toni-towards.ps.gz, 19950118 Towards a declarative and efficient glass-box CLP language Robert A. Kowalski Francesca Toni Gerhard Wetzel Department of Computing Imperial College, London SW7 2BZ, UK frak,ft,gw1g@doc.ic.ac.uk Introduction This short paper is a preliminary report on ongoing research and will focus on motivating a new
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/gibbons-intro-bmf.ps.gz, 19950124 An Introduction to the Bird-Meertens Formalism Jeremy Gibbons Department of Computer Science University of Auckland Private Bag 92019, Auckland, New Zealand. Email: jeremy@cs.auckland.ac.nz
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/day-oc-scheduling-negotiation.ps.gz, 19950127 Over-Constrained Scheduling Model: Negotiation among Peers William B. Day Department of Computer Science & Engineering Auburn University, AL 36849-5347
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/caseau-laburthe-improv-sched.ps.gz, 19950130 Improved CLP Scheduling with Task Intervals Yves Caseau Fran ois Laburthe Bellcore, 445 South Street, Ecole Normale Sup rieure Morristown NJ 07960, USA. 45, rue d Ulm, 75005 PARIS caseau@bellcore.com laburthe@clipper.ens.fr
	ftp://ftp.cs.city.ac.uk//pub/constraints/ferences/marseille-ocs-wkshp-sep-95.ps.Z, 19950202 Call for Papers CP95 Workshop on OVER-CONSTRAINED SYSTEMS September 18, 1995 At CP95, the First International Conference on Principles and Practice of Constraint Programming (Sept. 19{22, 1995) Cassis / Marseilles, France Workshop Chair: Michael Jampel Department of Computer Science City University
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/beck-fox-conflict-recov-relax.ps.gz, 19950203 Mediated Conflict Recovery by Constraint Relaxation J. Christopher Beck1 Mark S. Fox chris@cs.utoronto.ca msf@ie.utoronto.ca (416) 978-7321 (416) 978-6823 Department of Computer Science, University of Toronto 10 King s College Rd., Toronto, CANADA, M5S 1A4 fax: (416) 978-3453
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/beck-fox-supply-chain-relax.ps.gz, 19950203 Supply Chain Coordination via Mediated Constraint Relaxation J. Christopher Beck1 & Mark S. Fox Department of Computer Science University of Toronto Toronto, Ontario, M5S 1A4 chris@cs.utoronto.ca msf@ie.utoronto.ca
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/beck-relaxation-msc-thesis.ps.gz, 19950203 A Schema for Constraint Relaxation with Instantiations for Partial Constraint Satisfaction and Schedule Optimization by John Christopher Beck A thesis submitted in conformity with the requirements for the degree of Master of Science Graduate Department of Computer Science University of Toronto Copyright
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/podelski-smolka-opertnal-clp.ps.gz, 19950213 Operational Semantics of Constraint Logic Programs with Coroutining Andreas Podelski Max-Planck-Institut Informatik Im Stadtwald D-6123 Saarbr ucken, Germany podelski@mpi-sb.mpg.de Gert Smolka Programming Systems Lab German Research Center for Artificial Intelligence (DFKI) Stuhlsatzenhausweg 3 D-66123
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/nadathur-miller-high-order-lp.ps.gz, 19950220 CS-1994-38 Higher-Order Logic Programming Gopalan Nadathur Dale Miller Department of Computer Science Duke University Durham, North Carolina 27708{0129 December 1994 Higher-Order Logic Programmingy Gopalan Nadathur z Computer Science Department, Duke University Durham, NC 27706 gopalan@cs.duke.edu
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/ginsberg-holbrook-deflts-hier.ps.gz, 19950220 What Defaults can do that Hierarchies Can't Matthew L. Ginsberg CIRL Department of Computer and Information Science Department of Computer Science University of Oregon Eugene, OR 97403 Hugh W. Holbrook Department of Computer Science Stanford University Stanford, CA 94305
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/sannella-skyblue-uist-94.ps.gz, 19950222 SkyBlue: A Multi-Way Local Propagation Constraint Solver for User Interface Construction Michael Sannella Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 E-mail: sannella@cs.washington.edu
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/borning-hclp-lisp.ps.gz, 19950222 LISP AND SYMBOLIC COMPUTATION: An International Journal, 5, 223{270, 1992 c 1992 Kluwer Academic Publishers { Manufactured in The Netherlands Constraint Hierarchies ALAN BORNING (borning@cs.washington.edu) Department of Computer Science and Engineering, FR-35, University of Washington, Seattle,
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/oscar/o30.ps.gz, 19950228 THE OSCAR PROJECT February, 1995 The OSCAR Manual Operating manual and annotated code for OSCAR the general-purpose defeasible reasoner and architecture for a rational agent. John L. Pollock Department of Philosophy University of Arizona Tucson, Arizona 85721 (e-mail: pollock@ccit.arizona.edu) John L.
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/oscar/OSCAR_Manual.ps.gz, 19950228 THE OSCAR PROJECT February, 1995 The OSCAR Manual Operating manual and annotated code for OSCAR the general-purpose defeasible reasoner and architecture for a rational agent. John L. Pollock Department of Philosophy University of Arizona Tucson, Arizona 85721 (e-mail: pollock@ccit.arizona.edu) John L.
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/oscar/o90.ps.gz, 19950228 # 1 A given maximal-degree-of-support: 1 undefeated-degree-of-support: 1 # 2 B given maximal-degree-of-support: 1 undefeated-degree-of-support: 1 # 3 C given maximal-degree-of-support: 1 undefeated-degree-of-support: 1 Retrieving # from the inference-queue. # 1 interest: J This is of
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/hentenryck-mcallester-kapur.ps.gz, 19950228 Solving Polynomial Systems Using a Branch and Prune Approach P. Van Hentenryck Brown University Box 1910 Providence, RI 02912 pvh@cs.brown.edu D. McAllester MIT AI Lab Technology Square, 545 Cambridge, USA dam@ai.mit.edu D. Kapur SUNY at Albany Dep. of Computer Science Albany, NY-12222
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/oscar/o60.ps.gz, 19950228 3 instances of #10 18.24 sec ( 260.57) 64 assignments 4 instances of #10 310.67 sec ( 4438.14) 256 assignments 1 2 3 4 5 6 7 8 9 10 11 12 Figure 10. Four-way collective-defeat. There is a better way of doing the computation. The different parts of the composite problem are really separate subproblems,
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/imbert-AIMSA94.ps.gz, 19950301 SOLVED FORMS FOR LINEAR CONSTRAINTS IN CLP LANGUAGES. Jean-Louis J. IMBERT Laboratoire d'Informatique de Clermont{Ferrand Les Cezeaux F{63177 AUBIERE Cedex (France) Email: imbert@gia.univ-mrs.fr
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/imbert-PPCPMITbook.ps.gz, 19950301 1 Fourier's Elimination: Which to Choose Jean-Louis Imbert
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/pika-aaai93.ps.gz, 19950308 Real-Time Self-Explanatory Simulation Franz G. Amador and Adam Finkelstein and Daniel S. Weld Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 franz, adam, weld@cs.washington.edu
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/circuit_simulator.ps.gz, 19950308 Csim - a Simple HP48 Circuit Simulator for Educational Purposes Per Stenius Circuit Theory Laboratory CT-11 January 1992
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/moreno-lazy-functional-diseq.ps.gz, 19950321 Implementing a Lazy Functional Logic Language with Disequality Constraints Herbert Kuchen RWTH Aachen, Lehrstuhl f ur Informatik II, Ahornstrasse 55 D-5100 Aachen, Germany, herbert@zeus.informatik.rwth-aachen.de Francisco Javier L opez-Fraguas UCM Madrid, Dep. Inform atica y Autom atica, Av. Complutense
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/perron-cc-kernel.ps.gz, 19950321 cc(M), an kernel for implementing cc languages Laurent Perron Ecole Normale Sup erieure 45, Rue d'Ulm, 75005 Paris France perron@aloes.ens.fr January 16, 1995
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/aiken-heintze-analysis-popl.ps.gz, 19950321 POPL '95 A. Aiken and N. Heintze Constraint-Based Program Analysis Alex Aiken University of California, Berkeley Nevin Heintze Carnegie Mellon University URL http://http.cs.berkeley.edu/~aiken/popl95.ps.Z 1 POPL '95 A. Aiken and N. Heintze What is This Talk About ffl Part technical overview. { Survey of
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/moreno-tuple-inheritance.ps.gz, 19950321 Tuple Inheritance: A New Kind of Inheritance for (Constraint) Logic Programming Juan Jos e Moreno-Navarro U. Polit ecnica, Facultad de Inform atica, Campus de Montegancedo, Boadilla del Monte, 28660 Madrid, Spain, jjmoreno@fi.upm.es
	ftp://ftp.cs.city.ac.uk//papers/95/cs95-2.ps, 19950328 Poster for Graph Drawing 94 10-12 October 1994 Princeton, New Jersey TRIVIAL: Refocusing in Cooperative Diagrams with Ductile Space David Dodson Computer Science Department, City University, Northampton Square, London EC1V 0HB, UK Phone: UK +71 477 8445 Internet: dcd@cs.city.ac.uk A 'Ductile Space'
	ftp://ftp.cs.city.ac.uk/papers/95/cs95-4.ps, 19950328 A User Guide to ICD-Edit for Applications Developers Rob Scott, David Dodson and Hugh Reeves Computer Science Department, City University, Northampton Square, London EC1V 0HB, UK email: frbs,dcd,lhrg@cs.city.ac.uk phone: UK +44 (0)171 477 8445/9 March 28, 1995 Contents 1 Introduction 2 1.1 Aims of this
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/anderson-why-crypto-fail.ps.gz, 19950329 Why Cryptosystems Fail Ross Anderson University Computer Laboratory Pembroke Street, Cambridge CB2 3QG Email: rja14@cl.cam.ac.uk
	ftp://ftp.cs.city.ac.uk//papers/95/cs95-3.ps, 19950329 Poster for Graph Drawing 94 10-12 October 1994 Princeton, New Jersey N-Dimensional RSPs, Right Multilayered Diagrams and Prolog David Dodson Computer Science Department, City University, Northampton Square, London EC1V 0HB, UK Phone: UK +71 477 8445 Internet: dcd@cs.city.ac.uk This poster defines RSPs,
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/carlton-two-page-prolog-intro.ps.gz, 19950329 The 2-page Introduction to Prolog Mike Carlton UNIVERSITY OF CALIFORNIA Department of Electrical Engineering and Computer Sciences Computer Science Division 1. Introduction This is a very quick introduction to Prolog, designed to get you up to speed in basic Prolog. I will not explain all of Prolog, but
	ftp://ftp.cs.city.ac.uk//su2sg/docs/ag030495.ps.Z, 19950403 SU2SG AGENDA 11th meeting Monday 3rd April 1995 1. Apologies for absence. 2. Minutes of 10th meeting. 3. Site Reports. 4. Any other business. 5. Details of next meeting.
	ftp://ftp.cs.city.ac.uk//su2sg/docs/min160195.ps.Z, 19950403 Small Unix Systems Services Group Minutes of 10th meeting Chair: Adam S. Nealis Information Systems Division London Business School Sussex Place, Regent's Park, LONDON NW1 4SA +44 (0)171 262 5050 x3352 adam@lbs.lon.ac.uk Secretary: Nigel Mitchem Technical Support Administrator School of Informatics City
	ftp://ftp.cs.city.ac.uk//papers/93/sarc93-6.ps.Z, 19950405 The Wide Area Data Space Andy Whitcroft andy@cs.city.ac.uk Nick Williams njw@cs.city.ac.uk Peter Osmon peter@cs.city.ac.uk Systems Architecture Research Centre City University Northampton Square London EC1V 0HB ENGLAND
	ftp://ftp.cs.city.ac.uk//outgoing/dre.ps, 19950411 Page 1 Distributed Requirements Engineering within NATURE N.A.M. Maiden1, H.W. Nissen2, P. Assenova3, J. Bubenko3, P. Constantopoulos4, R. Doemges2, G. Grosz5, S. Hakkarainen3, M. Jarke2, P. Johanneson3, V. Phlion5, K. Pohl2, C. Rolland5, S. Sisaid5, G. Spanoudakis4, A.G. Sutcliffe1, C. N. Taylor1, D.
	ftp://ftp.cs.city.ac.uk//papers/95/cs95-1.ps, 19950411 Poster for Graph Drawing 94 10-12 October 1994 Princeton, New Jersey ICD-EDIT: A Server for 23/4-D Interactive Connection Diagram Graphics with Prolog Clients David Dodson, Hugh Reeves and Rob Scott Computer Science Department, City University, Northampton Square, London EC1V 0HB, UK Phone: UK +71 477
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/voudouris-tsang-tunneling.ps.gz, 19950412 The Tunneling Algorithm for Partial CSPs and Combinatorial Optimization Problems Chris Voudouris VOUDCX@ESSEX.AC.UK Edward Tsang EDWARD@ESSEX.AC.UK Department of Computer Science, University of Essex, Colchester, C04 3SQ, UK
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/toni-scheduling.ps.gz, 19950412 A theorem-proving approach to job- shop scheduling Francesca Toni Logic Programming Section Technical Report Department of Computing, Imperial College 180 Queen's Gate, London SW7 2BZ, UK March 1994
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/frisch-page-building-ijcai95.ps.gz, 19950424 Building Theories into Instantiation Alan M. Frisch Department of Computer Science University of York York Y01 5DD United Kingdom C. David Page Jr.y Oxford University Computing Laboratory Wolfson Building, Parks Road Oxford OX1 3QD United Kingdom
	ftp://ftp.cs.city.ac.uk/papers/95/cs95-8.ps, 19950426 A Simple and Precise Module Concept: solving a real problem in software development Gillian Hill
	ftp://ftp.cs.city.ac.uk//papers/95/cs95-9.ps, 19950427 The Configuration of Complex Systems Gillian Hill Department of Computing, Imperial College of Science, Technology and Medicine Department of Computer Science, City University, London, Great Britain
	ftp://ftp.cs.city.ac.uk//papers/95/cs95-10a.ps, 19950427 Constructing Specifications and Modules in a KZ-doctrine Gillian Hill
	ftp://ftp.cs.city.ac.uk//papers/95/cs95-11a.ps, 19950427 Category Theory for the Configuration of Complex Systems Gillian Hill Department of Computing, Imperial College of Science and Technology and Department of Computer Science, City University, London, Great Britain
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/sloman-ijcai95.ps.gz, 19950428 In Proceedings 14th International Joint Conference on AI Montreal, August 1995 A Philosophical Encounter Aaron Sloman School of Computer Science & Cognitive Science Research Centre The University of Birmingham, B15 2TT, England A.Sloman@cs.bham.ac.uk, http://www.cs.bham.ac.uk/~axs
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/giacobazzi-gen-semantics-clp.ps.gz, 19950503 J. LOGIC PROGRAMMING 1994:19, 20:1{679 1 GENERALIZED SEMANTICS AND ABSTRACT INTERPRETATION FOR CONSTRAINT LOGIC PROGRAMS ROBERTO GIACOBAZZI, SAUMYA K. DEBRAY, AND GIORGIO LEVI . We present a simple and powerful generalized algebraic semantics for constraint logic programs that is parameterized with
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/chu-beasley-genetic-alg-set.ps.gz, 19950510 A Genetic Algorithm for the Set Partitioning Problem P.C. Chu and J.E. Beasley The Management School Imperial College London SW7 2AZ, England p.chu@ic.ac.uk and j.beasley@ic.ac.uk http://mscmga.ms.ic.ac.uk/pchu/pchu.html http://mscmga.ms.ic.ac.uk/jeb/jeb.html April 1995
	ftp://ftp.cs.city.ac.uk//papers/94/sarc94-4.ps, 19950515 Extensible, flexible and secure services in Angel, a single address space operating system Tim Wilkinson and Kevin Murray Systems Architecture Research Centre, City University, Northampton Square, London EC1V 0HB, UK
	ftp://ftp.cs.city.ac.uk//papers/95/sarc95-2.ps, 19950515 Extensible, flexible and secure services in Angel, a single address space operating system Tim Wilkinson and Kevin Murray Systems Architecture Research Centre, City University, Northampton Square, London EC1V 0HB, UK tim@sarc.city.ac.uk kam@sarc.city.ac.uk
	ftp://ftp.cs.city.ac.uk//users/acwf/rtqual.ps.gz, 19950523 POSITION PAPER Modelling the Contribution Structure Underlying Requirements Orlena C. Z. Gotel & Anthony C.W. Finkelstein Imperial College of Science, Technology & Medicine Department of Computing 180 Queen's Gate London SW7 2BZ (oczg; acwf@doc.ic.ac.uk)
	ftp://ftp.cs.city.ac.uk//users/acwf/tracing.ps.gz, 19950523 Tracing Back from Requirements Anthony Finkelstein Imperial College, Department of Computing 180 Queens Gate, London SW7 2BZ. acwf@doc.ic.ac.uk The problem of achieving traceability from a design, and its associated documentation, back to a requirements specification has been the subject of a
	ftp://ftp.cs.city.ac.uk//users/acwf/rtprob.ps.gz, 19950523 An Analysis of the Requirements Traceability Problem Orlena C. Z. Gotel & Anthony C. W. Finkelstein Imperial College of Science, Technology & Medicine Department of Computing, 180 Queen's Gate London SW7 2BZ (oczg; acwf@doc.ic.ac.uk)
	ftp://ftp.cs.city.ac.uk//users/acwf/media.ps.gz, 19950523 Development of multiple media documents S.J. Morris, A.C.W. Finkelstein Imperial College, Department of Computing, 180 Queen s Gate, London SW7 2BZ, UK
	ftp://ftp.cs.city.ac.uk//users/acwf/multi.ps.gz, 19950523 Proc. 5th International Workshop on Software Specification & Design (1989, IEEE CS Press) Multi-party Specification Anthony Finkelstein & Hugo Fuks Imperial College of Science and Technology (University of London)
	ftp://ftp.cs.city.ac.uk//users/acwf/tse94.icse.ps.gz, 19950523 - 1 - A Framework for Expressing the Relationships Between Multiple Views in Requirements Specification Bashar Nuseibeh Jeff Kramer Anthony Finkelstein Department of Computing, Imperial College 180 Queen s Gate, London, SW7 2BZ, UK Email: {ban, jk, acwf}@doc.ic.ac.uk.
	ftp://ftp.cs.city.ac.uk//users/acwf/videoconference.ps.gz, 19950523 Live, Audio-Visual Communication Systems for Distance Learning: Experience, Heuristics and ISDN MARTIN COLBERT Ergonomics Unit, University College London, 26 Bedford Way, London, WC1H 0AP, U.K; m.colbert@ucl.ac.uk. CATHERINE VOGLIMACCI Hexacom, 1 Place Paul Bec, 34000 Montpellier, France. ANTHONY
	ftp://ftp.cs.city.ac.uk//users/acwf/tse94.esec.ps.gz, 19950523 - 1 - Inconsistency Handling in Multi-Perspective Specifications A. Finkelstein D. Gabbay A. Hunter J. Kramer B. Nuseibeh Department of Computing Imperial College of Science, Technology and Medicine 180 Queen s Gate, London, SW7 2BZ, UK Email: {acwf, dg, abh, jk, ban}@doc.ic.ac.uk IEEE Transactions on
	ftp://ftp.cs.city.ac.uk//users/acwf/write.ps.gz, 19950523 A Scheme for Review, Annotation and Correction of Specifications Anthony Finkelstein Imperial College of Science, Technology & Medicine, Department of Computing acwf@doc.ic.ac.uk
	ftp://ftp.cs.city.ac.uk//users/acwf/ijseke92.ps.gz, 19950523 - 1 - Viewpoints: A Framework for Integrating Multiple Perspectives in System Development A. Finkelsetin J. Kramer B. Nuseibeh L. Finkelstein M. Goedicke (In) International Journal of Software Engineering and Knowledge Engineering 2(1):31-58, March 1992, World Scientific Publishing Co. - 2 - Viewpoints:
	ftp://ftp.cs.city.ac.uk//users/acwf/vose90.ps.gz, 19950523 ViewPoint Oriented Software Development Anthony Finkelstein, Jeff Kramer, Michael Goedicke Imperial College of Science, Technology & Medicine (University of London)
	ftp://ftp.cs.city.ac.uk//users/acwf/icse17.ps.gz, 19950523 Decentralised Process Enactment in a Multi-Perspective Development Environment Ulf Leonhardt Jeff Kramer Bashar Nuseibeh Dept. of Computing, Imperial College, 180 Queen's Gate, London SW7 2BZ, UK ful, jk, bang@doc.ic.ac.uk Anthony Finkelstein Dept. of Computer Science, City University, Northampton
	ftp://ftp.cs.city.ac.uk//users/acwf/cc92.ps.gz, 19950523 IEE Computing & Control Engineering Journal, 3(6): 259-265, November 1992. Technology Transfer: Software Engineering and Engineering Design A. Finkelstein, B. Nuseibeh Department of Computing Imperial College of Science, Technology & Medicine 180 Queen s Gate London, SW7 2BZ Email: {acwf,
	ftp://ftp.cs.city.ac.uk//users/acwf/case92.ps.gz, 19950523 IEEE Proc. of Int. Workshop on CASE (CASE 92), 6-10th July 1992, Montreal, Canada, pp.50-60. ViewPoints: A Vehicle for Method and Tool Integration Bashar Nuseibeh Anthony Finkelstein Department of Computing Imperial College, London, SW7 2BZ Email: ban@doc.ic.ac.uk
	ftp://ftp.cs.city.ac.uk//users/acwf/immaturity.ps.gz, 19950523 A Software Process Immaturity Model Anthony Finkelstein Imperial College, 180 Queens Gate, London SW7 The software process maturity model (Humphrey, Kitson & Kasse 1989) is now well established, and together with the associated assessment approaches, has been the focus of considerable attention from
	ftp://ftp.cs.city.ac.uk//users/acwf/iwssd7.ps.gz, 19950523 (to appear in) Proceedings of 7th International Workshop on Software Specification and Design (IWSSD-7), Redondo Beach, California, USA, 6-7th December 1993, IEEE CS Press. Fine-Grain Process Modelling Bashar Nuseibeh Anthony Finkelstein Jeff Kramer Department of Computing, Imperial College 180 Queen s
	ftp://ftp.cs.city.ac.uk//users/acwf/education.ps.gz, 19950523 AN ADVANCED COURSE ON SOFTWARE DEVELOPMENT ENVIRONMENTS ANTHONY FINKELSTEIN Imperial College, Department of Computing, 180 Queens Gate, London SW7 2BZ acwf@doc.ic.ac.uk This paper will describe an advanced course on Software Development Environments. The paper will detail the content of the course and
	ftp://ftp.cs.city.ac.uk//users/acwf/icse15.ps.gz, 19950523 - 1 - Proceedings of 15th International Conference on Software Engineering, Baltimore, USA, May 1993, IEE CS Press (to appear) Expressing the Relationships Between Multiple Views in Requirements Specification Bashar Nuseibeh Jeff Kramer Anthony Finkelstein Department of Computing, Imperial College 180
	ftp://ftp.cs.city.ac.uk//users/acwf/sei.ps.gz, 19950523 Proc. of 10th IEEE ICDCS, Paris, May 1990. A Constructive Approach to the Design of Distributed Systems Jeff Kramer Jeff Magee Anthony Finkelstein Department of Computing, Imperial College of Science, Technology and Medicine, 180 Queen's Gate, London SW7 2BZ, UK.
	ftp://ftp.cs.city.ac.uk//users/acwf/tara.ps.gz, 19950523 TARA: Tool Assisted Requirements Analysis Anthony Finkelstein & Jeff Kramer Imperial College, Department of Computing, UK
	ftp://ftp.cs.city.ac.uk//users/acwf/case91.ps.gz, 19950523 A Configurable Framework for Method and Tool Integration Jeff Kramer and Anthony Finkelstein Department of Computing, Imperial College of Science, Technology and Medicine, 180 Queen's Gate, London SW7 2BZ, UK. jk@doc.ic.ac.uk , acwf @doc.ic.ac.uk
	ftp://ftp.cs.city.ac.uk//users/acwf/ewspt95.ps.gz, 19950523 - 1 - Decentralised Process Modelling* Bashar Nuseibeh Jeff Kramer Anthony Finkelstein Ulf Leonhardt Department of Computing Imperial College 180 Queen s Gate London, SW7 2BZ, UK Email: {ban, jk, acwf, ul}@doc.ic.ac.uk
	ftp://ftp.cs.city.ac.uk//users/acwf/esec93.ps.gz, 19950523 - 1 - Inconsistency Handling in Multi-Perspective Specifications Anthony Finkelstein Dov Gabbay Anthony Hunter Jeff Kramer Bashar Nuseibeh Proceedings of Fourth European Software Engineering Conference (ESEC 93), 13-17th September 1993, Garmisch, Germany, Springer-Verlag (to appear). Also Technical
	ftp://ftp.cs.city.ac.uk//users/acwf/measurement1.ps.gz, 19950523 (In) Measurement Journal, Vol 10, No 2, Apr-Jun 1992, pp.79-86. Using Software Specification Methods for Measurement Instrument Systems Part 1: Structured Methods L. Finkelstein(), J. Huang(), A.C.W. Finkelstein(+) and B. Nuseibeh(+) (*) School of Engineering, City University, London EC1V 0HB, UK (+)
	ftp://ftp.cs.city.ac.uk//users/acwf/measurement2.ps.gz, 19950523 (In) Measurement Journal, Vol 10, No 2, Apr-Jun 1992, pp.87-92. Using Software Specification Methods for Measurement Instrument Systems Part 2: Formal Methods L.Finkelstein(), J.Huang(), A.C.W.Finkelstein(+) and B.Nuseibeh(+) (*) School of Engineering, City University, London EC1V 0HB, UK (+)
	ftp://ftp.cs.city.ac.uk//users/acwf/iee.coll.ps.gz, 19950523 A Viewpoint-based Framework for Software Development Environments1 Anthony Finkelstein, Jeff Kramer & Bashar Nuseibeh2
	ftp://ftp.cs.city.ac.uk//users/acwf/promodcrit.ps.gz, 19950523 Process Modelling: a critical analysis Anthony Finkelstein, Jeff Kramer & Matthew Hales Imperial College, Department of Computing, 180 Queens Gate, London SW7 2BZ.
	ftp://ftp.cs.city.ac.uk//users/acwf/dra.ps.gz, 19950523 1 Requirements Engineering Through Viewpoints Anthony Finkelstein, Steve Easterbrook1, Jeff Kramer & Bashar Nuseibeh Imperial College Department of Computing 180 Queen s Gate, London SW7 2BZ acwf@doc.ic.ac.uk
	ftp://ftp.cs.city.ac.uk//users/acwf/cera.ps.gz, 19950523 - 1 - Co-ordinating Distributed ViewPoints: the anatomy of a consistency check STEVE EASTERBROOK School of Cognitive & Computing Sciences, University of Sussex, Falmer, Brighton, BN1 9QH easterbrook@cogs.susx.ac.uk ANTHONY FINKELSTEIN, JEFF KRAMER & BASHAR NUSEIBEH Department of Computing, Imperial
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/chic-final-report-management.ps.gz, 19950526 2 February 1995 Final Management Report E r i k T i d e n ( e d . )
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/kokeny-order-sorted-domains.ps.gz, 19950526 Constraint Satisfaction Problems with Order-Sorted Domains Tibor K ok eny LIRMM UMR 9928 UNIVERSITE MONTPELLIER II/CNRS 161, Rue Ada 34392 Montpellier cedex 5 France email: kokeny@lirmm.fr May 21, 1995
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/regin-filter-alg-difference.ps.gz, 19950526 M O N T P E L L I E R L I R M Laboratoire d'Informatique, de Robotique et de Micro electronique de Montpellier Unit e Mixte CNRS - Universit e Montpellier II C 09928 RAPPORT DE RECHERCHE A filtering algorithm for constraints of difference in CSPs A paraitre dans les actes de AAAI-94 Jean-Charles R EGIN
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/bellicha-partial-order-domain.ps.gz, 19950526 CSP techniques using partial orders on domain values Amit Bellicha Christian Capelle Michel Habib Tibor K ok eny Marie-Catherine Vilarem LIRMM - UMR 9928 UNIVERSITE MONTPELLIER II/CNRS, 161, Rue Ada 34392 Montpellier cedex 5 France email: fbellicha,capelle,habib,kokenyg@lirmm.fr
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/benhamou-older-applying-jlp.ps.gz, 19950526 Applying Interval Arithmetic to Real, Integer and Boolean Constraints Fr ed eric Benhamou William J. Oldery benhamouuniv-orleans.fr, wolderbnr.ca Bell Northern Research Accepted for publication in JLP 94/95
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/older-vellino-extend-prolog.ps.gz, 19950526 Extending Prolog with Constraint Arithmetic on Real Intervals William Older Andr e Vellino Computing Research Laboratory Bell-Northern Research P.O. Box 3511, Station C K1Y 4H7, Ottawa, Ontario
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/chamard-etal-chic-methodology.ps.gz, 19950526 fifl ffl AEo AEo ffl ! AE>=AEaeAE # o>=O$ oe O>= ooss ss <= ae O #33#5,4 6+#4+/. =0#24'-'.4 oe.4',,+)'.%' 24+(+%+',,' oe.(/2-#4+15' 6#.%=' ffiffl 15#+ AE#2%', #33#5,4 ff #+.4 >=,/5& 2#.%' -#+, ;%#-#2& (+3%,'2< !#5,4 #6+/. (2 #8 ffffi fi ffl AEoessossOE" oAE%! ff"sso ">= " o>=O$ ff"ssaeae ">= <=5,,
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/older-intervals-odes.ps.gz, 19950526 Application of Relational Interval Arithmetic to Ordinary Differential Equations William J. Older Computing Research Laboratory Bell Northern Research wolder@bnr.ca August 1994
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/older-vellino-const-arith.ps.gz, 19950526 Constraint Arithmetic on Real Intervals William Older Andr e Vellino
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/bessiere-untractable-cons.ps.gz, 19950526 1 Some Untractable Classes of Constraint Networks Christian BESSIERE LIRMM, University of Montpellier II, 161, rue Ada, 34392 Montpellier cedex 5, France Phone: (33) 67 14 85 79 Email: bessiere@lirmm.fr
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/chic-final-report-technology.ps.gz, 19950526 CHIC Report 7 February 1995 CHIC Final Technical Report Alexander Herold (ed.)
	ftp://ftp.cs.city.ac.uk//users/acwf/contrib.ps.gz, 19950531 - 1 - Contribution Structures ORLENA GOTEL ANTHONY FINKELSTEIN oczg@doc.ic.ac.uk acwf@doc.ic.ac.uk Imperial College of Science, Technology and Medicine Department of Computing, 180 Queen's Gate, London SW7 2BZ
	ftp://ftp.cs.city.ac.uk//papers/95/cs95-5.ps, 19950531 A Compositional Theory of Constraint Hierarchies Technical Report TCU/CS/1995/5 Department of Computer Science City University Michael Jampel jampel@cs.city.ac.uk 24 March 1995
	ftp://ftp.cs.city.ac.uk//users/acwf/rereview.ps.gz, 19950531 Requirements Engineering: a review and research agenda Anthony Finkelstein City University, Department of Computer Science, London EC1V 0HB acwf@cs.city.ac.uk
	ftp://ftp.cs.city.ac.uk/papers/95/cs95-5.ps, 19950531 A Compositional Theory of Constraint Hierarchies Technical Report TCU/CS/1995/5 Department of Computer Science City University Michael Jampel jampel@cs.city.ac.uk 24 March 1995
	ftp://ftp.cs.city.ac.uk//papers/95/cs95-13.ps, 19950601 A Mathematical Workspace for System Configuration Gillian Hill
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/bekkers-tarau-LP-with-monads.ps.gz, 19950605 Logic Programming with Monads and Comprehensions Yves Bekkers Paul Tarau y
	ftp://ftp.cs.city.ac.uk//users/gespan/esec93.ps.Z, 19950613 Requirements Engineering: An Integrated View of Representation, Process, and Domain* Matthias Jarke, Klaus Pohl, Stephan Jacobs, Hans W. Nissen,1 Janis Bubenko, Petia Assenova, Peter Holm, Benkt Wangler,2 Colette Rolland, Veronique Plihon, Jean-Roch Schmitt,3 Alistair Sutcliffe, Sara Jones, Neil Maiden,
	ftp://ftp.cs.city.ac.uk//users/gespan/icse94.ps.Z, 19950613 -- 1 -- Applying AI Techniques to Requirements Engineering: The NATURE Prototype* Klaus Pohl1 , Petia Assenova2 , Ralf Doemges1, Paul Johannesson2, Neil Maiden3 , Veronique Plihon4 , Jean-Roch Schmitt4, Giwrgos Spanoudakis5
	ftp://ftp.cs.city.ac.uk//users/gespan/ecai94.ps.Z, 19950613 Similarity for Analogical Software Reuse: A Computational Model George Spanoudakis and Panos Constantopoulos 1
	ftp://ftp.cs.city.ac.uk//users/gespan/dexa94.ps.Z, 19950613 On Evidential Feature Salience George Spanoudakis and Panos Constantopoulos Department of Computer Science, University of Crete and, Institute of Computer Science Foundation of Research and Technology, Hellas
	ftp://ftp.cs.city.ac.uk//users/gespan/seke94.ps.Z, 19950613 Measuring Similarity Between Software Artifacts George Spanoudakis Panos Constantopoulos Department of Computer Science University of Crete and Institute of Computer Science Foundation of Research and Technology, Hellas
	ftp://ftp.cs.city.ac.uk//users/gespan/wpaper12.ps.Z, 19950613 Similarity Analysis: An Empirical Evaluation George Spanoudakis, Panos Constantopoulos Foundation of Research and Technology - Hellas Institute of Computer Science Information Systems and Software Technology Group Working Paper No #12 Final 1/9/1994
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/ginsberg-modal.ps.gz, 19950626 Bilattices and Modal Operators Matthew L. Ginsberg Computer Science Department Stanford University Stanford, California 94305
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/ginsberg-multi-valued-logic.ps.gz, 19950628 Multivalued Logics: A Uniform Approach to Inference in Artificial Intelligence Matthew L. Ginsberg Department of Computer Science Stanford University Stanford, California 94305 (415) 723-1239 Multivalued Logics: A Uniform Approach to Inference in Artificial Intelligence
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/sloman-semantics.ps.gz, 19950711 Invited paper for Information and understanding session at British Academy and Royal Society conference April 13th-14th 1994 on: Artificial Intelligence and The Mind: New Breakthroughs Or Dead Ends To appear in Philosophical Transactions of the Royal Society Semantics in an intelligent control system
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/smolka-oz-model.ps.gz, 19950712 The Oz Programming Model Gert Smolka Programming Systems Lab German Research Center for Artificial Intelligence (DFKI) Stuhlsatzenhausweg 3, 66123 Saarbr ucken, Germany email: smolka@dfki.uni-sb.de July 11, 1995
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/daskalopulu-sergot-constraints-legal-contracts.ps.gz, 19950714 A Constraint-Driven System for Contract Assembly Aspassia Daskalopulu Marek Sergot Department of Computing Imperial College of Science, Technology and Medicine 180 Queen s Gate, London SW7 2BZ e-mail: {ad4,mjs}@doc.ic.ac.uk
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/meyer-thesis.ps.gz, 19950720 Finite Domain Constraints: Declarativity meets Efficiency Theory meets Application Vom Fachbereich Informatik der Universit at Kaiserslautern zur Verleihung des akademischen Grades Doktor der Naturwissenschaften (Dr. rer. nat.) genehmigte Dissertation von Dipl.-Inform. Manfred Meyer Berichterstatter:
	ftp://ftp.cs.city.ac.uk//papers/94/sarc94-3.ps, 19950724 An Argument for Simple COMA Ashley Saulsbury, Tim Wilkinson , John Cartery, and Anders Landin zSwedish Institute of Computer Science Box 1263, S-164 28 Kista, Sweden
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/jampel-compositional-theory.ps.gz, 19950731 A Compositional Theory of Constraint Hierarchies (Operational Semantics) Michael Jampel jampel@cs.city.ac.uk Department of Computer Science City University, Northampton Square London EC1V 0HB, U.K.
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/lucas-constraints-structural.ps.gz, 19950801 Constraint-Based Reasoning for Structural Concrete Design and Detailing Warren K. Lucas, W.M. Kim Roddis and Frank M. Brown The University of Kansas SUMMARY Concrete used as an engineering material offers a great deal of flexibility to a potential owner, construction contractor and design engineer. This
	ftp://ftp.cs.city.ac.uk//pub/games/crossfire/www/crossfire/tome-of-magic.ps, 19950812 Level 1 spell: armour level: 1 sp cost: 8 speed: 2.00 range: touch duration: special description: Armour creates a magical field around you which gives you an ac level of 2 + (level+2)/3, with a maximum of six. This is not additive, so if you are wearing plate mail (ac level of 5) and your armour spell
	ftp://ftp.cs.city.ac.uk//pub/games/crossfire/www/crossfire/spoiler.ps.Z, 19950812 Crossfire in vital numbers Crossfire v0.91.1 August 5, 1994 General This guide is intended to present the player to his opponents and the ools" of his trade. The tables in this guide are generated completely from the crossfire source, so you may sometimes see monsters or items here before they can be
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/bayardo-miranker-space-time.ps.gz, 19950904
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/bing-liu-increasing-functional-constraints.ps.gz, 19950904 Increasing Functional Constraints Need to Be Checked Only Once Bing Liu Department of Information Systems and Computer Science National University of Singapore Lower Kent Ridge Road, Singapore 0511 Republic of Singapore
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/smith-grant-sparse-ijcai.ps.gz, 19950906 Sparse Constraint Graphs and Exceptionally Hard Problems Barbara M. Smith and Stuart A. Grant Division of Artificial Intelligence School of Computer Studies University of Leeds Leeds LS2 9JT, U.K. e-mail: fbms,stuartgg@scs.leeds.ac.uk
	ftp://ftp.cs.city.ac.uk//users/gespan/sch2.ps, 19950907 Chapter sch2: Similarity Analysis by George Spanoudakis and Panos Constantopoulos sch2.1 Overview Similarity analysis is carried out by metric functions, which measure conceptual distances between specifications with respect to three semantic modelling abstractions used for describing them, namely the
	ftp://ftp.cs.city.ac.uk//users/gespan/seke95.ps.Z, 19950908 Computational Mechanisms for Distributed Requirements Engineering N.A.M. Maiden1, P. Assenova2, P. Constantopoulos4, M. Jarke3, P. Johanneson2, H.W. Nissen3, G. Spanoudakis4 & A.G. Sutcliffe1 1Centre for Human-Computer Interface Design, City University, London 2Swedish Institute for Software
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/hamscher-crosby-financial.ps.gz, 19950911 CROSBY: Financial Data Interpretation as Model-based Diagnosis Walter Hamscher Price Waterhouse Technology Centre 68 Willow Rd, Menlo Park, CA 94025 hamscher@tc.pw.com To appear in Annals of Mathematics and AI January 1994
	ftp://ftp.cs.city.ac.uk//pub/constraints/ferences/marseille-hard-workshop-program.ps.gz, 19950914 CP'95 Workshop { Studying and Solving Really Hard Problems 1995 PROGRAM 9H { 9H20 J. Culberson, A. Beacham and D. Papp Hiding our Colors" 9H20 { 9H40 R. Rodosek Combining Heuristics for Constraint Satisfaction Problems" 9H40 { 10H D. Pothos and B. Richards An Empirical Study of Min-Conflicts Hill
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/meisels-et-al-timetable-rules.ps.gz, 19951002 Employee Timetabling, Constraint Networks and Knowledge-based Rules: A mixed approach Amnon Meisels, Ehud Gudes and Gadi Solotorevsky Dept. of Mathematics and Computer Science Ben-Gurion University of the Negev Beer-Sheva, 84-105, Israel, Tel.: 972-57-461627 Email: am@bengus.bgu.ac.il
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/cheeseman-really-hard-ijcai91.ps.gz, 19951005 Where the Really Hard Problems Are Peter Cheeseman RIACS Bob Kanefsky Sterling Software Artificial Intelligence Research Branch NASA Ames Research Center, Mail Stop 244-17 Moffett Field, CA 94035, USA Email: @ptolemy.arc.nasa.gov William M. Taylor Sterling Software Peter Cheeseman, Bob
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/ward-thesis-meta-constraint.ps.gz, 19951006 A Propositional Meta-Constraint System: Specification, Application and Implementation by Paul A.S. Ward A thesis presented to the University of Waterloo in fulfilment of the thesis requirement for the degree of Master of Applied Science in Computer Engineering Waterloo, Ontario, Canada, 1993 c Paul A.S.
	ftp://ftp.cs.city.ac.uk//users/gespan/asej95.ps.Z, 19951017 Integrating Specifications: A Similarity Reasoning Approach GEORGE SPANOUDAKIS Department of Computer Science, City University e-mail: gespan@cs.city.ac.uk PANOS CONSTANTOPOULOS Institute of Computer Science, Foundation for Research and Technology-Hellas e-mail: panos@ics.forth.gr
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/biasizzo-novak-methodology.ps.gz, 19951018 A METHODOLOGY FOR MODEL-BASED DIAGNOSIS OF ANALOG CIRCUITS Anton Biasizzo, Franc Novak Jo ef Stefan Institute Jamova 39, 61111 Ljubljana, Slovenia phone: +386 61 1773 900 fax: +386 61 219 385 email: franc.novak@ijs.si
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/biasizzo-novak-model-bsd-diag.ps.gz, 19951018 MODEL-BASED DIAGNOSIS OF ANALOG CIRCUITS WITH CLP(<) Anton Biasizzo, Franc Novak Jo ef Stefan Institute Jamova 39, 61111 Ljubljana, Slovenia phone: +386 61 1773 900 email: franc.novak@ijs.si
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/smolka-survey-oz.ps.gz, 19951020 A Survey of Oz Gert Smolka Programming Systems Lab German Research Center for Artificial Intelligence (DFKI) Stuhlsatzenhausweg 3, 66123 Saarbr ucken, Germany email: smolka@dfki.uni-sb.de June 19, 1995 Oz is a high-level programming language designed for concurrent symbolic computation. It is based on a
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/selman-et-al-local-dimacs.ps.gz, 19951031 DIMACS Series in Discrete Mathematics and Theoretical Computer Science Volume 00, 0000 Local Search Strategies for Satisfiability Testing BART SELMAN, HENRY KAUTZ, AND BRAM COHEN Jan 22, 1995
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/mitchell-selman-levesque-hard.ps.gz, 19951031 Hard and Easy Distributions of SAT Problems David Mitchell Dept. of Computing Science Simon Fraser University Burnaby, Canada V5A 1S6 mitchell@cs.sfu.ca Bart Selman AT&T Bell Laboratories Murray Hill, NJ 07974 selman@research.att.com Hector Levesque Dept. of Computer Science University of Toronto
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/selman-et-al-new-gsat.ps.gz, 19951031 A New Method for Solving Hard Satisfiability Problems Bart Selman AT&T Bell Laboratories Murray Hill, NJ 07974 selman@research.att.com Hector Levesque Dept. of Computer Science University of Toronto Toronto, Canada M5S 1A4 hector@ai.toronto.edu David Mitchell Dept. of Computing Science Simon Fraser
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/rossi-equivalence-csp.ps.gz, 19951113 On the Equivalence of Constraint Satisfaction Problems Francesca Rossi1 Charles Petrie MCC 3500 W. Balcones Cntr. Dr. Austin, Texas 78759 rossi, petrie@mcc.com Vasant Dhar2 Dept. of Information Systems New York University 40 West 4th Street NY, NY 10003 dhar@vx1.gba.nyu.edu 1On leave from the Computer
	ftp://ftp.cs.city.ac.uk//pub/games/crossfire/incoming/spoiler_0.92.1.ps.gz, 19951116 Crossfire in vital numbers Crossfire v0.92.1 November 16, 1995 General This guide is intended to present the player to his opponents and the ools" of his trade. The tables in this guide are generated completely from the crossfire source, so you may sometimes see monsters or items here before they can
	ftp://ftp.cs.city.ac.uk//pub/requirements/lascase0.9.ps.gz, 19951130 Report of the Inquiry Into The London Ambulance Service (February 1993) International Workshop on Software Specification and Design Case Study Electronic Version prepared by Anthony Finkelstein acwf@cs.city.ac.uk With kind permission from The Communications Directorate, South
	ftp://ftp.cs.city.ac.uk//pub/requirements/lasnodiags0.9.ps.gz, 19951130 Report of the Inquiry Into The London Ambulance Service (February 1993) International Workshop on Software Specification and Design Case Study Electronic Version prepared by Anthony Finkelstein acwf@cs.city.ac.uk With kind permission from The Communications Directorate, South
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/kotzaminidis-phd.ps.gz, 19951204 Imperial College of Science Technology and Medicine (University of London) Department of Computing Intelligent Backtracking in Logic Programming with Constraints over the Real Numbers by Antonis Kotzamanidis Submitted in partial fulfilment of the requirements for the Doctor of Philosophy degree in
	ftp://ftp.cs.city.ac.uk//papers/95/cs95-15.ps, 19951208 CITY University Technical Report Department of Computer Science May 1995 A Process Algebra for Synchronous Concurrent Constraint Programming Lubo<=s Brim Department of Computer Science Masaryk University, Brno Czech Republic David Gilbert Department of Computer Science City University, London, U.K.
	ftp://ftp.cs.city.ac.uk//papers/94/cs94-10.ps, 19951208 CITY University Technical Report Department of Computer Science July 1994 Transforming Specifications of Observable Behaviour into Programs1 David Gilbert City University, London, U.K. Christopher Hogger Imperial College, London, U.K. Ji<=r Zlatu<=ska Masaryk University, Brno, Czech republic
	ftp://ftp.cs.city.ac.uk//papers/95/cs95-11.ps, 19951208 CITY University Technical Report Department of Computer Science May 1995 A Pattern Language for Molecular Biology Alvis Br azma Institute of Mathematics and Computer Science, University of Latvia 1 David Gilbert Department of Computing Science, City University, London 2 TCU/CS/1995/11
	ftp://ftp.cs.city.ac.uk//users/acwf/package.ps.gz, 19951212 Software Package Requirements & Procurement Anthony Finkelstein & George Spanoudakis Department of Computer Science, City University, UK {acwf, gespan@cs.city.ac.uk} Mark Ryan School of Computer Science, University of Birmingham, UK {m.d.ryan@cs.bham.ac.uk}
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/hong-clp-complex-functions.ps.gz, 19951213 RISC-CLP(CF) Constraint Logic Programming over Complex Functions Hoon Hong Research Institute for Symbolic Computation Johannes Kepler University A-4040 Linz, Austria e-mail: hhong@risc.uni-linz.ac.at
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/shankar-gilbert-jampel-trans.ps.gz, 19951214 1 Transient Analysis of Linear Circuits using Constraint Logic Programming Archana Shankar, David Gilbert, Michael Jampel {shankar,drg,jampel}@cs.city.ac.uk Department of Computer Science, City University London EC1V 0HB, UK
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/schiex-etal-valued-csp-ijcai.ps.gz, 19951220 Valued Constraint Satisfaction Problems: Hard and Easy Problems Thomas Schiex INRA Chemin de Borde Rouge 31326 Castanet-Tolosan Cedex France tschiex@toulouse.inra.fr He le ne Fargier IRIT 118, Route de Narbonne 31068 Toulouse Cedex France fargier@irit.fr Ge rard Verfaillie CERT-ONERA 2 Av. E douard
	ftp://ftp.cs.city.ac.uk//users/acwf/viewfaq.ps.gz, 19960102 The Viewpoints FAQ Anthony Finkelstein City University, Department of Computer Science, Northampton Square, LONDON EC1V 0HB, UK Ian Sommerville Department of Computing, Lancaster University, LANCASTER LA1 4YR, UK The structure of this brief paper follows an
	ftp://ftp.cs.city.ac.uk//users/acwf/case.ps.gz, 19960117 A Comedy of Errors: the London Ambulance Service case study Anthony Finkelstein & John Dowell School of Informatics, City University, UK {acwf@soi.city.ac.uk, johnd@soi.city.ac.uk}
	ftp://ftp.cs.city.ac.uk//users/gespan/aaij96.ps.Z, 19960124 Analogical Reuse of Requirements Specifications: A Computational Model George Spanoudakis Department of Computer Science, City University Northampton Square, London EC1V 0HB, UK e-mail: gespan@cs.city.ac.uk Panos Constantopoulos Department of Computer Science, University of Crete and Institute of
	ftp://ftp.cs.city.ac.uk//papers/95/cs95-10.ps, 19960126 CITY University Technical Report Department of Computer Science May 1995 New versions of ask and tell for synchronous communication in concurrent constraint programming Lubo<=s Brim Department of Computer Science, Masaryk University, Bure<=sova 20, 60200 Brno, Czech Republic, email: brim@dcs.muni.cz
	ftp://ftp.cs.city.ac.uk//users/gespan/jiis96.ps.Z, 19960131 Elaborating Analogies from Conceptual Models George Spanoudakis Department of Computer Science, The City University, U.K Email: gespan@cs.city.ac.uk Panos Constantopoulos Department of Computer Science, University of Crete, Greece and Institute of Computer Science, Foundation for Research and
	ftp://ftp.cs.city.ac.uk//users/gespan/text5.ps.Z, 19960306 179 Chapter 5 Implementation and Evaluation of the Model 5.1 Introduction This chapter presents a prototype implementation of the similarity model, an analysis of the computational complexity of the algorithms involved and the results of a preliminary experiment of evaluation. The similarity model is
	ftp://ftp.cs.city.ac.uk//users/gespan/textL.ps.Z, 19960306 315 Bibliography Agassi J., Analogies Hard and Soft, Analogical Reasoning: Perspectives of Artificial Intelligence, Cognitive Science and Philosophy, (ed) Helman D.H., Kluwer Academic Pub., Dordrecht, The Netherlands, 1988 Ashworth C., Goodland M., SSADM A Practical Approach, McGraw Hill,
	ftp://ftp.cs.city.ac.uk//users/gespan/text63.ps.Z, 19960306 269 6.5 Similarity Analysis for Viewpoint Integration 6.5.1 The Problem of Viewpoints Integration Another application of similarity analysis regards the problem of viewpoint integration. Viewpoints are specifications of requirements, which are elicited and modeled from different
	ftp://ftp.cs.city.ac.uk//users/gespan/tables.ps.Z, 19960306 List of Tables Chapter 2: Elaboration of Analogies .............. 13 2.1 Representation of Analogs in Models of Analogical Reasoning .............. 26 2.2 Mapping Criteria .............. 27/28 2.3 Salience Estimation .............. 29 2.4 Aptness Evaluation .............. 30 Chapter 3: Distance and
	ftp://ftp.cs.city.ac.uk//users/gespan/text8.ps.Z, 19960306 299 Chapter 8 Conclusions and Future Research This thesis proposes a model for elaborating analogies based on an analysis of conceptual models of objects. Our proposal realizes the importance of analogical reasoning as a non deductive form of reasoning, concentrates on the elaboration of analogies,
	ftp://ftp.cs.city.ac.uk//users/gespan/text3.ps.Z, 19960306 55 Chapter 3 Distance and Similarity Functions 3.1 Introduction In this chapter we define and discuss the properties of the distance and similarity functions which operationalize the conceptual modeling approach of the similarity model. An absolute and a relative function are introduced for each of the
	ftp://ftp.cs.city.ac.uk//users/gespan/text62.ps.Z, 19960306 254 6.3.2 Example 2: Similarity Based Modeling of Specifications Our next example illustrates how similarity and prototypicality may be utilized in modeling specifications by reuse. Assume that we need to specify a software system for a university library. This system could be specified as an
	ftp://ftp.cs.city.ac.uk//users/gespan/text1.ps.Z, 19960306 Chapter 1 Overview of Analogical Similarity The remarkable ability of humans to understand novel situations by analogy to familiar ones and, to solve new problems by remembering solutions to already solved analogous problems, has motivated the study of analogical reasoning as a non deductive paradigm of
	ftp://ftp.cs.city.ac.uk//users/gespan/text7.ps.Z, 19960306 285 Chapter 7 Comparison with General Models of Analogical Reasoning 7.1 Introduction In this chapter we compare the similarity model with other models of analogical reasoning. Comparisons concern only general models. Purpose-driven models(i.e. models of analogical problem solving or understanding) were
	ftp://ftp.cs.city.ac.uk//users/gespan/text4.ps.Z, 19960306 111 Chapter 4 Salience Functions 4.1 The Problem of Salience The distinction between salient and non-salient features is critical for successful analogi- cal reasoning. This is because only analogies between salient features may lead to con- sistent and pragmatically useful(i.e. resolving problems)
	ftp://ftp.cs.city.ac.uk//users/gespan/figures.ps.Z, 19960306 List of Figures Chapter 2: Elaboration of Analogies .............. 13 2.1 A Taxonomy of Models of Analogical Reasoning .............. 16 2.2 Analogies in Searching Programs .............. 34 2.3 The Solar and the Atom Systems of Rutherford's Analogy .............. 36 2.4 An Alternative Modeling of
	ftp://ftp.cs.city.ac.uk//users/gespan/contents.ps.Z, 19960306 Contents Chapter 1: Overview of Analogical Similarity .............. 1 1.1 Computational Study of Analogical Reasoning: An Open Challenge .............. 3 1.2 Main Approaches to Analogical Reasoning .............. 5 1.3 Proposal: A Conceptual Modeling Approach .............. 7 1.4 Main Contributions
	ftp://ftp.cs.city.ac.uk//users/gespan/text61.ps.Z, 19960306 235 Chapter 6 Illustrative Applications 6.1 Introduction In this chapter, we present illustrative applications of similarity analysis in requirements engineering. In particular, we show how it may be used in : g modeling and eliciting requirements specifications for software systems by reusing analogous
	ftp://ftp.cs.city.ac.uk//users/gespan/abstract.ps.Z, 19960306 Analogical Similarity of Objects: A Conceptual Modeling Approach George E. Spanoudakis Doctoral Dissertation Department of Computer Science University of Crete
	ftp://ftp.cs.city.ac.uk//users/gespan/text2.ps.Z, 19960306 13 Chapter 2 Elaboration of Analogies 2.1 Introduction Analogical reasoning has been described by an abstract process model including four stages: (1) recognition (or retrieval) of a candidate source given a target analog; (2) elaboration of a mapping between the analogous characteristics
	ftp://ftp.cs.city.ac.uk//pub/constraints/bibliography/clp2.ps.gz, 19960308 Constraint (Logic) Programming: A Bibliography This version prepared by Michael Jampel City University, London based on one from Spiro Michaylov Ohio State University 8 March 1996 References Ilya Abdrakhimov and Andrei Mantsivoda. Intelligent backtracking in Flang. In Manfred Meyer, editor,
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/hosobe.ps.gz, 19960309 Locally Simultaneous Constraint Satisfaction Hiroshi Hosobe y Ken Miyashitay Shin Takahashiy Satoshi Matsuokaz Akinori Yonezaway yDepartment of Information Science, University of Tokyo zDepartment of Mathematical Engineering, University of Tokyo
	ftp://ftp.cs.city.ac.uk//users/patty/diplomka.ps, 19960312 Ch a r l e s U n i v e r s i t y , P r a g u e Mathematics and Physics Faculty Department of Software Engineering Processor Allocation in Tightly Coupled Multiprocessors Master Thesis Patricie Kostkov a April 1995 Thesis supervisor: RNDr. Jan Pavelka, CSc I declare that I have worked out this thesis by
	ftp://ftp.cs.city.ac.uk//sarc/ooirsc.ps, 19960327 Object Oriented Integrity, Concurrency, Security and Recovery J.A McCann OO Integrity Object oriented programming languages ignore corruption caused by faulty programs because of non-persistence Strongly typed systems guarantee a high degree of integrity and consistency Some systems require more -
	ftp://ftp.cs.city.ac.uk//sarc/future.ps, 19960327 DATABASE SYSTEMS c Julie A. McCann 1970's early '80s late '80s 19951990 Relational DBMS Distributed DBMS Global Appliance Data Warehousing OO systems DBMS Powerful PCs Parallel DBMS Hierarchical Client/Server Past, Present and Future yawnyawnyawn Distributed Database Systems facility to process data
	ftp://ftp.cs.city.ac.uk//sarc/prodev.ps, 19960327 1 Database Management I PRODUCT EVALUATION user requirements software and hardware evaluation performance evaluation and benchmarking 2 Product Evaluation DBMS and System acquisition is a considerable investment both user and vendor must understand goals: must meet current user needs/requirements have
	ftp://ftp.cs.city.ac.uk//sarc/dbmsarch.ps, 19960327 Architectures for Relational & Object Oriented DATABASE SYSTEMS c Dr Julie A. McCann Relational DBMS Implementation Internal level in ANSI-SPARC System Architecture of DB2 Relational Log Manager Data Data Manager Media Manager Services Buffer Manager Relational Data Services maps internal view to
	ftp://ftp.cs.city.ac.uk//sarc/dbmsarco.ps, 19960327 1 Architectures for Relational & Object Oriented DATABASE SYSTEMS c Dr Julie A. McCann 2 Relational DBMS Implementation Internal level in ANSI-SPARC System Architecture of DB2 Relational Log Manager Data Data Manager Media Manager Services Buffer Manager 3 Relational Data Services maps internal view to
	ftp://ftp.cs.city.ac.uk//users/acwf/tcsproposal.ps.gz, 19960410 September 95 1 IN CONFIDENCE TCS PROGRAMME: PROPOSAL FORM OVERVIEW INDUSTRIAL PARTNER (Note 1) Company name:* Quality Systems & Software Ltd Number of employees: 21 Company turnover: 1219 ('000s pa) Company business:* Systems Engineering Software and Consultancy ACADEMIC PARTNER (Note 2) Institution
	ftp://ftp.cs.city.ac.uk//users/gespan/anse96.ps.Z, 19960412 Reconciling Requirements: a method for managing interference, inconsistency and conflict George Spanoudakis & Anthony Finkelstein Department of Computer Science, City University Northampton Square, London EC1V 0HB, UK email: {gespan \| acwf @cs.city.ac.uk}
	ftp://ftp.cs.city.ac.uk//users/gespan/ngcs96.ps.Z, 19960417 Next-Generation Viewpoint-based Environments Wolfgang Emmerich, George Spanoudakis and Anthony Finkelstein Dept. of Computer Science, The City University, Northampton Square, London EC1V 0HB, UK femmerich\|gespan\|acwfg@cs.city.ac.uk
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/rossi-redundant-vars.ps.gz, 19960425 Redundant Hidden Variables in Finite Domain Constraint Problems Francesca Rossi Computer Science Department University of Pisa Pisa, Italy E-mail: rossi@di.unipi.it
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/jampel-integrated-ecai96.ps.gz, 19960429 A General Framework for Integrating HCLP and PCSP Michael Jampel , Jean-Marie Jacquety mja,jmj@info.fundp.ac.be Institut d'Informatique F.U.N.D.P. rue Grandgagnage 21 B-5000 Namur, Belgium David Gilbert drg@cs.city.ac.uk Dept. of Computer Science City University Northampton Square London EC1V 0HB, U.K.
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/meier-debugging-cp95.ps.gz, 19960501 Debugging Constraint Programs Micha Meier ECRC- ECRC-95-15 technical report ECRC- ECRC-95-15 Debugging Constraint Programs Micha Meier European Computer-Industry Research Centre GmbH (Forschungszentrum) Arabellastrasse 17 D-81925 Munich Germany Tel. +49 89 9 26 99-0 Fax. +49 89 9 26 99-170 Tlx. 52 69 10
	ftp://ftp.cs.city.ac.uk//users/drg/workshops/alpuk93/ramirez.ps.gz, 19960507 A New Concurrent Programming Language based on Temporal Constraints Rafael Ramirez Dept. of Computer Science University of Bristol ramirez@cs.bris.ac.uk November 1993
	ftp://ftp.cs.city.ac.uk//users/drg/chapters/wiley-constructing93.ps.gz, 19960507 1 Deriving Logic Programs from Observations DAVID GILBERT, CHRISTOPHER HOGGER This chapter describes a method for deriving logic programs from observations that can be made of the progress of a computation. Such observations can be regarded as extrinsic specifications, and can be represented as directed
	ftp://ftp.cs.city.ac.uk//users/drg/chapters/seda1.ps.gz, 19960507 Curriculum development in Informatics in Lithuania David Gilbert Department of Computer Science School of Informatics City University London EC1V 0HB drg@cs.city.ac.uk 28 July 1994 1. Introduction This paper describes the setting up and initial operation of an ongoing project to update the teaching of
	ftp://ftp.cs.city.ac.uk//users/drg/techreports/drg_95_17.ps.gz, 19960507 Department of Computer Science, School of Informatics, City University Northampton Square, London EC1V OHB, U.K. CITY UNIVERSITY TECHNICAL REPORT DEPARTMENT OF COMPUTER SCIENCE SCHOOL OF INFORMATICS NOVEMBER 95 TRANSIENT ANALYSIS OF LINEAR CIRCUITS USING CONSTRAINT LOGIC PROGRAMMING By ARCHANA SHANKAR
	ftp://ftp.cs.city.ac.uk//users/drg/conferences/pact96.ps.gz, 19960507 Transient Analysis of Linear Circuits using Constraint Logic Programming Archana Shankar, David Gilbert, Michael Jampel {shankar,drg,jampel}@cs.city.ac.uk Department of Computer Science, City University London EC1V 0HB, UK
	ftp://ftp.cs.city.ac.uk//users/drg/workshops/alpuk93/zlatuska.ps.gz, 19960507 Concurrent Logic Programming in Linear Logic Ji r Zlatu ska Institute of Computer Science, Masaryk University Bure sova 20, 602 00 Brno, Czech Republic zlatuska@muni.cz
	ftp://ftp.cs.city.ac.uk//users/drg/techreports/drg_95_18.ps.gz, 19960507 CITY University Technical Report Department of Computer Science December 1995 Approaches to the automatic discovery of patterns in biosequences. Alvis Br azma Department of Computer Science, University of Helsinki, Finland Inge Jonassen, Ingvar Eidhammer Department of Informatics, University of Bergen,
	ftp://ftp.cs.city.ac.uk//users/drg/workshops/alpuk93/proceedings.ps.gz, 19960507 ALP-UK Workshop on Concurrency in Computational Logic Department of Computer Science City University London United Kingdom edited by D R Gilbert J-M Jacquet 13 December 1993 Contents Session: Semantics and Theory T Janowski Bisimulation and Fault-Tolerance 1 D Gilbert, M K<=ret nsk y, L Brim Operational
	ftp://ftp.cs.city.ac.uk//users/drg/techreports/drg_88_35.ps.Z, 19960507 Speci cation and implementation of concurrent systems using PARLOG David Gilbert Department of Computer Studies Loughborough University of Technology Loughborough LE113TU UK email: drg@uk.ac.lut.cs-vaxa
	ftp://ftp.cs.city.ac.uk//users/drg/techreports/drg_88_34.ps.Z, 19960507 ALOTOS to PARLOG Translator David Gilbert PARLOG Group Imperial College London SW7 2BZ U.K. email: drg@doc.ic.ac.uk Atranslator from a subset LOTOS into PARLOG is described, and the process of its development charted. The use of the software is described, and comments made on the dif culties of
	ftp://ftp.cs.city.ac.uk//users/drg/workshops/alpuk93/jmj.ps.gz, 19960507 Composing Concurrent Processes J.-M. Jacquet Department of Computer Science Namur University rue Grandgagnage 21 5000 Namur Belgium jmj@info.fundp.ac.be December 8, 1993
	ftp://ftp.cs.city.ac.uk//users/drg/workshops/alpuk93/gilbert-brim-kretinsky.ps.gz, 19960507 Operational semantics of logical concurrent systems David Gilbert Department of Computer Science City University, London U.K. email: drg@cs.city.ac.uk Mojm r K<=ret nsk y Department of Computer Science Masaryk University, Brno Czech Republic email: mojmir@dcs.muni.cz Lubo<=s Brim Department of Computer
	ftp://ftp.cs.city.ac.uk//users/drg/workshops/tempus95-drg.ps.gz, 19960507 Curriculum development of modular degree courses in Informatics { the experience at City University David Gilbert Department of Computer Science School of Informatics City University London EC1V 0HB, UK August 1995
	ftp://ftp.cs.city.ac.uk//users/drg/techreports/drg_95_10.ps.Z, 19960507 CITY University Technical Report Department of Computer Science May 1995 New versions of ask and tell for synchronous communication in concurrent constraint programming Lubo<=s Brim Department of Computer Science, Masaryk University, Bure<=sova 20, 60200 Brno, Czech Republic, email: brim@dcs.muni.cz
	ftp://ftp.cs.city.ac.uk//users/drg/conferences/lopstr94.ps.gz, 19960507 Transforming Specifications of Observable Behaviour into Programs David Gilbert1, Christopher Hogger2, Ji<=r Zlatu<=ska3 1 City University, Northampton Square, London EC1V 0HB, U.K. drg@cs.city.ac.uk 2 Imperial College, 180 Queens Gate, London SW7 2BZ, U.K. cjh@doc.ic.ac.uk 3 Masaryk University,
	ftp://ftp.cs.city.ac.uk//users/drg/conferences/cp96-transformations.ps.gz, 19960507 Transformations between HCLP and PCSP Michael Jampel , Jean-Marie Jacquety mja,jmj@info.fundp.ac.be Institut d'Informatique F.U.N.D.P. rue Grandgagnage 21 B-5000 Namur, Belgium David Gilbert, Sebastian Hunt drg,seb@cs.city.ac.uk Dept. of Computer Science City University Northampton Square London EC1V
	ftp://ftp.cs.city.ac.uk//users/drg/techreports/drg_87-26.ps.Z, 19960507 Executable LOTOS: Using PARLOG to implement an FDT David Gilbert PARLOG Group Department of Computing Imperial College of Science and Technology 180, Queen'sGate LONDON SW7 2BZ UK Net mail: drg@doc.ic.ac.uk Apractical investigation of the feasibility of implementing core constructs of the LOTOS speci
	ftp://ftp.cs.city.ac.uk//users/drg/workshops/alpuk93/janowski.ps.gz, 19960507 Bisimulation and Fault-Tolerance Tomasz Janowski Department of Computer Science University of Warwick, Coventry CV4 7AL, UK tomasz@dcs.warwick.ac.uk November 30, 1993
	ftp://ftp.cs.city.ac.uk//users/drg/workshops/alpuk93/jones.ps.gz, 19960507 Modelling Garbage Collection Algorithms Howard Bowman, John Derrick & Richard Jones. email: hb5@ukc.ac.uk, jd1@ukc.ac.uk and rej@ukc.ac.uk. December 1, 1993 Keywords: Concurrency, garbage collection, temporal logic, CCS. 1 Introduction The memorymanagement of simple static programming languages, such as
	ftp://ftp.cs.city.ac.uk//users/drg/workshops/ecai94.ps.gz, 19960507 Technical Report Department of Computer Science July 1994 Fair Hierarchical Constraint Logic Programming Michael Jampel jampel@cs.city.ac.uk David Gilbert drg@cs.city.ac.uk TCU/CS/1994/9 Department of Computer Science, School of Informatics, City University, Northampton Square, London, EC1V 0HB, UK.
	ftp://ftp.cs.city.ac.uk//users/drg/techreports/simulator1.ps.gz, 19960507 The City University Department of Computer Science Technical Report 1995 A Simulator for Prolog Norie Chiba and David Gilbert Date: 17/08/95 Prolog Simulator Page 2
	ftp://ftp.cs.city.ac.uk//users/drg/workshops/alpuk93/wang.ps.gz, 19960507 Distributed Object Oriented Programming in Parlog Tzone I Wang Keith L. ClarK Logic Programming Section, Department of Computing, Imperial College London SW7 2BZ tiw@doc.ic.ac.uk klc@doc.ic.ac.uk December 7, 1993
	ftp://ftp.cs.city.ac.uk//users/drg/posters/ilps95-poster.ps.gz, 19960507 Synchronisation in Scc Lubo<=s Brim Masaryck University, Czech Republic David Gilbert City University, United Kindgom Jean-Marie Jacquet University of Namur, Belgium Mojm r K<=ret nsk y Masaryck University, Czech Republic
	ftp://ftp.cs.city.ac.uk//pub/fp4/tmr/rtg/b0298enw.ps.Z, 19960510 EUROPEAN COMMISSION Science Research Development MARIE CURIE RESEARCH TRAINING GRANTS Training and Mobility of Researchers Industrial Materials and Technologies Standards, Measurements and Testing Environment and Climate Marine Sciences and Technologies Biotechnology Biomedicine and Health Agriculture
	ftp://ftp.cs.city.ac.uk//pub/fp4/tmr/rtg/b0299enw.ps.Z, 19960510 ANNEXES TABLE OF CONTENTS Annex A Proposal Form Annex B Checklist for Proposals Annex C Information on Research-industry Task Forces Annex D Less Favoured Regions Annex E Fixed Contribution Contract for Training through Research Annex A Internet Proposal Form Marie Curie Research Training Grants NOTES
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/economist-immigration.ps.gz, 19960515 The xenophobic tendency Britons tend to think of immigration as a drain on the state. The evidence suggests that the opposite is true "THANK God we are Saxons!" trumpeted The Economist in 1843. "Flanked by the savage Celt on the one side and the flighty Gaul on the other--the one a slave to his
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/hent-source-source.ps.gz, 19960520 Source to Source Optimizations of CLP(
	ftp://ftp.cs.city.ac.uk//users/gespan/ecai96v1.ps.gz, 19960529 Reconciliation: Managing Interference in Software Development George Spanoudakis1 and Anthony Finkelstein1
	ftp://ftp.cs.city.ac.uk//users/gespan/ecai96.ps.gz, 19960529 Reconciliation: Managing Interference in Software Development George Spanoudakis1 and Anthony Finkelstein1
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/decline-unfettered-goodstein-crunch.ps.gz, 19960602 The Big Crunch by David Goodstein NCAR 48 Symposium, Portland, OR September 19, 1994 According to modern cosmology, the Universe began about 10 or 15 billion years ago in an event known as the Big Bang. It has been expanding ever since. What we do not know is whether it will go on expanding forever. If
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/meier-schimpf-control-ecrc-95-07.ps.gz, 19960603 Control in ECLiPSe Micha Meier Joachim Schimpf ECRC-ECRC-95-07 technical report ECRC-ECRC-95-07 Control in ECLiPSe Micha Meier Joachim Schimpf European Computer-Industry Research Centre GmbH (Forschungszentrum) Arabellastrasse 17 D-81925 Munich Germany Tel. +49 89 9 26 99-0 Fax. +49 89 9 26 99-170 Tlx.
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/meier-schimpf-arch-ecrc-95-06.ps.gz, 19960603 An Architecture for Prolog Extensions Micha Meier Joachim Schimpf ECRC-ECRC-95-06 technical report ECRC-ECRC-95-06 An Architecture for Prolog Extensions Micha Meier Joachim Schimpf European Computer-Industry Research Centre GmbH (Forschungszentrum) Arabellastrasse 17 D-81925 Munich Germany Tel. +49 89 9
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/meier-compile-ground-ecrc-95-12.ps.gz, 19960603 Compilation of Compound Terms in Prolog Micha Meier ECRC-ECRC-95-12 technical report ECRC-ECRC-95-12 Compilation of Compound Terms in Prolog Micha Meier European Computer-Industry Research Centre GmbH (Forschungszentrum) Arabellastrasse 17 D-81925 Munich Germany Tel. +49 89 9 26 99-0 Fax. +49 89 9 26
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/wallace-practical-applications.ps.gz, 19960619 , , 1{32 () c Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Practical Applications of Constraint Programming MARK WALLACE mgw@doc.ic.ac.uk William Penney Laboratory, Imperial College, London SW7 2AZ, UK Received May 1, 1991 Editor:
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/shankar-transient-inap.ps.gz, 19960621 Transient Analysis and Synthesis of Linear Circuits using Constraint Logic Programming Archana Shankar, David Gilbert, Michael Jampel {shankar,drg,jampel}@cs.city.ac.uk Department of Computer Science, City University London, UK In this paper describes the design of a transient analysis program for
	ftp://ftp.cs.city.ac.uk//users/drg/workshops/tempus96-drg.ps.gz, 19960628 Web support for Informatics teaching David Gilbert Department of Computer Science City University, UK drg@cs.city.ac.uk http://www.cs.city.ac.uk/~drg JEP06032 1 Outline * we didn't realise... * trendy or useful * the present situation * taking up the challenge * what is possible * pointers to the future
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/ladkin-maddux-binary-jacm94.ps.gz, 19960705 On Binary Constraint Problems Peter B. Ladkin Institut f ur Informatik Universit at Bern L angassstrasse 51 CH-3012 Bern Switzerland Roger D. Maddux y Department of Mathematics 400 Carver Hall Iowa State University Ames, IA 50011 USA March 1994 Appeared in: Journal of the ACM, May 1994.
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/kids-constraint-propagation-fig.ps.gz, 19960705 split cut cut cut cut split prune off subspace (contains no feasible solutions) fixpoint of the cutting process
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/kids-cutting-constraints-fig.ps.gz, 19960705 feasible solutions global search subspace cutting constraints
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/kids-scheduling-slide-1.ps.gz, 19960705 Kestrel is exploring the transformational development of high-performance transportation schedulers. We are developing tools to provide generic support for (1) modeling the transportation domain, (2) specifying scheduling problems, (3) representing and applying problem-solving knowledge from AI
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/pepper-smith-high-level-kids.ps.gz, 19960705 A High-level Derivation of Global Search Algorithms (with Constraint Propagation) Peter Pepper Douglas R. Smith February 23, 1996
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/smith-know-kids-costas.ps.gz, 19960705 1 1 In Automating Software Design, M. Lowry & R. McCartney, Eds. AAAI/MIT Press, 1991, 483-514. KIDS - A Knowledge-Based Software Development System Douglas R. Smith Kestrel Institute 3260 Hillview Avenue Palo Alto, California 94304 31 August 1990
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/smith-constructing-morphisms-jsc-93.ps.gz, 19960705 J. Symbolic Computation (1993) 15, 571{606 Constructing Specification Morphisms Douglas R. Smith Kestrel Institute, 3260 Hillview Avenue, Palo Alto, California 94304 USA (Received 23 April 1992) Specification morphisms underlie the refinement of algebraic specifications and provide the logical
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/smith-parra-transformational.ps.gz, 19960705 Transformational Approach to Transportation Scheduling Douglas R. Smith and Eduardo A. Parra Kestrel Institute 3260 Hillview Avenue Palo Alto, California 94304
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/borning-et-al-indigo.ps.gz, 19960705 Indigo: A Local Propagation Algorithm for Inequality Constraints Alan Borning and Richard Anderson Dept. of Computer Science & Engineering University of Washington PO Box 352350 Seattle, WA 98195, USA 1-206-543-6678 fborning,andersong@cs.washington.edu Bjorn Freeman-Benson Object Technology
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/kids-scheduling-slide-2.ps.gz, 19960705 C5 C141 KC10 Tankers Ro -Ro Container applied design tactics for: developed a domain theory and specification seconds seconds seconds seconds 500 3000 8000 15500 0.4 8 27 71 movement record problem in movement record problem in movement record problem in movement record problem in solved solved solved
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/guesgen-ladkin-algebraic.ps.gz, 19960705 An Algebraic Approach to General Boolean Constraint Problems Hans-Werner G usgen Dept. of Computer Science University of Auckland New Zealand hans@cs.auckland.ac.nz Peter B. Ladkin Technische Fakult at Universit at Bielefeld D-33501 Bielefeld ladkin@techfak.uni-bielefeld.de April 23, 1995 A preliminary
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/donovan-gilber-economic-clp-inap.ps.gz, 19960705 Economic Modelling using Constraint Logic Programming Nelson Donovan & David Gilbert Computer Science Department City University Northhampton Square London EC1V OHB Tel: + 44 171 477 8444 Fax: + 44 171 477 8587 Email: {be140, drg}@soi.city.ac.uk
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/tarau-dahl-continuations.ps.gz, 19960708 Logic Programming and Logic Grammars with Binarization and First-order Continuations Paul Tarau1 and Veronica Dahl2 1 Universit e de Moncton D epartement d'Informatique Moncton, N.B. Canada E1A 3E9, tarau@info.umoncton.ca 2 Logic Programming Group Department of Computing Sciences Simon Fraser University
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/sloman-real-possibility.ps.gz, 19960710 D R A F T C O M M E N T S -- W E L C O M E ACTUAL POSSIBILITIES Aaron Sloman School of Computer Science The University of Birmingham Birmingham, B15 2TT, England A.Sloman@cs.bham.ac.uk Phone: +44-21-414-4775 Keywords: possibilities, percepts, beliefs, representation, causation, virtual machines
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/erlang-PAP.ps.gz, 19960710 Published in:The Practical Application of Prolog - 1 { 3 April 1992. Institute of Electrical Engineers, London Use of Prolog for developing a new programming language J. L. Armstrong, S. R. Virding, M. C. Williams Computer Science Laboratory Ellemtel Telecommunications Systems Laboratory Box 1505 S -
	ftp://ftp.cs.city.ac.uk//users/drg/techreports/1996-03.ps.gz, 19960712 Computer Science Technical Reports Technical Report No. 1996/03 New versions of ask and tell for synchronous communication in concurrent constraint programming Lubo<=s Brim, David Gilbert, Jean-Marie Jacquet and Mojm r K<=ret nsk y July 1996 ISSN 1364-4009 City University Dept. of Computer Science
	ftp://ftp.cs.city.ac.uk//users/gespan/VPverlage.ps, 19960712
	ftp://ftp.cs.city.ac.uk//users/drg/techreports/1996-06.ps.gz, 19960712 Computer Science Technical Reports Technical Report No. 1996/06 A Process Algebra for Synchronous Concurrent Constraint Programming Lubo<=s Brim, David Gilbert, Jean-Marie Jacquet and Mojm r K<=ret nsk y July 1996 ISSN 1364-4009 City University Dept. of Computer Science Northampton Square London EC1V
	ftp://ftp.cs.city.ac.uk//pub/games/crossfire/incoming/handbook_noicon.ps.gz, 19960712 Player's Handbook for Crossfire Version 0.0 (prototype doc) authored and compiled by Brian Thomas thomas@astro.psu.edu Contents List of Tables v 1 Introduction 1 1.1 What is Crossfire : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 1.1.1 What is included in this document : : : : : : : : : : : :
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/neumannSenate.PS.gz, 19960714 Security Risks in the Computer-Communication Infrastructure Peter G. Neumann Computer Science Laboratory, SRI International Menlo Park, California 94025-3493 Telephone: 1-415-859-2375 Neumann@CSL.SRI.com (Peter G. Neumann) 25 June 1996 Written testimony for the U.S. Senate Permanent Subcommittee on
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/gilbert-acm96.ps.gz, 19960730 Can computational logic provide a paradigm for both the specification and implementation of concurrent systems y David Gilbert, City University, London UK drg@cs.city.ac.uk Most computational systems in use today comprise a strong element of concurrency, often within a framework of distribution over
	ftp://ftp.cs.city.ac.uk//users/drg/conferences/alp96.ps.gz, 19960730 A Process Algebra for Synchronous Concurrent Constraint Programming Lubo<=s Brim Jean-Marie Jacquetz David Gilberty Mojm r K<=ret nsk y
	ftp://ftp.cs.city.ac.uk//users/drg/conferences/inap96-shankar.ps.gz, 19960730 Transient Analysis and Synthesis of Linear Circuits using Constraint Logic Programming Archana Shankar, David Gilbert, Michael Jampel {shankar,drg,jampel}@cs.city.ac.uk Department of Computer Science, City University London, UK In this paper describes the design of a transient analysis program for
	ftp://ftp.cs.city.ac.uk//users/drg/conferences/inap96-kambi.ps.gz, 19960730 -1- Timetabling in Constraint Logic Programming Maria Kambi, David Gilbert e-mail: {cb173, drg}@cs.city.ac.uk tel: +44 171 477 8444 fax: +44 171 477 8587 Department of Computer Science The City University Northampton Square London, EC1V 0HB UK
	ftp://ftp.cs.city.ac.uk//users/drg/journals/acm96.ps.gz, 19960829 Can computational logic provide a paradigm for both the specification and implementation of concurrent systems y David Gilbert, City University, London UK drg@cs.city.ac.uk Most computational systems in use today comprise a strong element of concurrency, often within a framework of distribution over
	ftp://ftp.cs.city.ac.uk//users/gespan/VPread.ps.Z, 19960909 Generating Direct Manipulation Program Editors within the MultiView Programming Environment Michael Read and Chris Marlin Department of Computer Science, The Flinders University of South Australia, G.P.O. Box 2100, Adelaide, S.A. 5001, fread,marling@cs.flinders.edu.au
	ftp://ftp.cs.city.ac.uk//users/gespan/VPderrick.ps, 19960909 Issues in multiparadigm viewpoint specification Eerke Boiten, Howard Bowman, John Derrick and Maarten Steen Computing Laboratory, University of Kent, Canterbury, CT2 7NF, UK. (Email: J.Derrick@ukc.ac.uk.)
	ftp://ftp.cs.city.ac.uk//users/gespan/VPgraham.ps.Z, 19960909 Viewpoints Supporting the Development of Interactive Software T.C. Nicholas Graham Department of Computer Science York University 4700 Keele St., North York Canada M3J 1P3 graham@cs.yorku.ca
	ftp://ftp.cs.city.ac.uk//users/gespan/VPmarlin.ps, 19960909 Multiple views based on unparsing canonical representations the MultiView architecture Chris Marlin Department of Computer Science Flinders University Adelaide, South Australia Australia marlin@cs.flinders.edu.au
	ftp://ftp.cs.city.ac.uk//users/gespan/VPsorenson.ps, 19960909 Supporting Viewpoints in Metaview Paul G. Sorenson, Piotr S. Findeisen Department of Computing Science University of Alberta fsorenson,findg@cs.ualberta.ca J. Paul Tremblay Department of Computer Science University of Saskatchewan Fax: (306) 966-4884
	ftp://ftp.cs.city.ac.uk//users/gespan/VPminsky.ps, 19960909 Providing Multiple Views for Objects by Means of Surrogates Naftaly H. Minsky minsky@cs.rutgers.edu 908-445-2085 Partha pratim Pal partha@cs.rutgers.edu 908-445-3999 Department of Computer Science Rutgers University New Brunswick, NJ 08903 USA (FAX: 908-445-0537) July 1, 1996 1 Introduction One often
	ftp://ftp.cs.city.ac.uk//users/gespan/VPjackson.ps, 19960909 as an initiate-call event. 5 Summary Different viewpoints are related and tied together by shared designated phenomena. Choosing which phenomena are to be designated and which are shared is a fundamental decision about how we think the world fits together, how our descriptions fit together, and how
	ftp://ftp.cs.city.ac.uk//users/gespan/VPavrilionis.ps, 19960909 1 Introduction The goal of process support technology is to provide tools for capture, definition, representation, instantiation and enaction (execution) of process models . In the early stages of research on this domain, a relatively simplistic definition of the processes had to be taken in order
	ftp://ftp.cs.city.ac.uk//users/gespan/VPperusel.ps.Z, 19960909 viewpoints perussel@univ-tlse1.fr
	ftp://ftp.cs.city.ac.uk//users/gespan/VPpreface.ps, 19960909 Relating Viewpoints: a preface to Viewpoints 96 Anthony Finkelstein Dept. of Computer Science, City University, Northampton Square, London EC1V 0HB, UK acwf@cs.city.ac.uk Outline & Objectives These Proceedings constitute the starting point for Viewpoints 96, subtitled the International Workshop on
	ftp://ftp.cs.city.ac.uk//users/gespan/VProbinson.ps, 19960909
	ftp://ftp.cs.city.ac.uk//users/gespan/VPbertino.ps.Z, 19960909 ffl ffl Elisa Bertino Giovanna Guerrini Viewpoints in Object Database Systems bertino@hermes.mc.dsi.unimi.it guerrini@disi.unige.it
	ftp://ftp.cs.city.ac.uk//users/gespan/VPfeather.ps, 19960909 Modularized Exception Handling Martin S. Feather JPL - Mail Stop 125-233, 4800 Oak Grove Drive, Pasadena CA 91109-8099, USA Email: feather@jpl.nasa.gov (This work was performed while at USC/Information Sciences Institute)
	ftp://ftp.cs.city.ac.uk//users/gespan/VPbashar.ps, 19960909 Towards a framework for managing inconsistency between multiple views Bashar Nuseibeh Department of Computing, Imperial College 180 Queen s Gate, London SW7 2BZ, UK Email: ban@doc.ic.ac.uk Supporting multiple views in software development in general and requirements engineering in particular is
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/wallace-jlp-completions.ps.gz, 19960909 Journal of Logic Programming, Vol 15, 1992 Tight, Consistent and Computable Completions For Unrestricted Logic Programs Mark Wallace mark@ecrc.de
	ftp://ftp.cs.city.ac.uk//users/gespan/VPmehand.ps, 19960909 Viewpoints-based software for management problem-solving interventions Nikolay Mehandjiev Dept of Management Systems and Sciences, University of Hull HULL HU6 7RX, England e-mail N.D.Mehandjiev@msd.hull.ac.uk 1 Overview This paper discusses the applicability of viewpoint-based software to management
	ftp://ftp.cs.city.ac.uk//users/gespan/VPpoon.ps, 19960909 Consistency Management for Multiple Perspective Software Development Wai Leung Poon Anthony Finkelstein Dept. of Computing, Dept. of Computer Science, Imperial College, City University, 180 Queen's Gate, Northampton Square, London SW7 2BZ, UK London EC1V 0HB, UK wlp@doc.ic.ac.uk acwf@cs.city.ac.uk
	ftp://ftp.cs.city.ac.uk//users/gespan/VPwileden.ps, 19960909 A Convergent Systems Viewpoint on Viewpoints Jack C. Wileden Alan Kaplan Convergent Computing Systems Laboratory Computer Science Department University of Massachusetts Amherst, MA 01003 USA E-mail: fwileden,kaplang@cs.umass.edu 1 Introduction For the last several years, we have been investigating
	ftp://ftp.cs.city.ac.uk//users/gespan/VPpiwetz.ps.Z, 19960909
	ftp://ftp.cs.city.ac.uk//users/gespan/VPcastro.ps, 19960909 Tool Support for Requirements Formalisation Jaelson F. B. Castro, Christian J. Gautreau, Marco A. Toranzo Departamento de Inform atica, UFPE Caixa Postal 7851, Recife CEP 50732-970 Brazil E-mail: fjbc, cg, matcg@di.ufpe.br Keywords: requirements, case tool
	ftp://ftp.cs.city.ac.uk//users/gespan/VPjacobs.ps, 19960909 Multiple view software process support using the MultiView architecture David Jacobs Chris Marlin Department of Computer Science, Flinders University of South Australia GPO Box 2100 Adelaide, S.A. 5001, Australia Email: (jacobs, marlin)@cs.flinders.edu.au Motorola Australia Software Centre, 2 Second
	ftp://ftp.cs.city.ac.uk//users/gespan/VPmullery.ps.Z, 19960909 Tool Support For Multiple Viewpoints Geoff Mullery, Systemic Methods Ltd. A Personal Viewpoint Methods and tools in current use for development work only up to medium sized products. They are insular, fail to recognise the number, diversity and connectivity of views to be considered and make overcoming
	ftp://ftp.cs.city.ac.uk//users/gespan/vp96.ps.Z, 19960909 Managing Interference Anthony Finkelstein, George Spanoudakis & David Till Department of Computer Science, City University Northampton Square, London EC1V 0HB, UK email: {acwf \| gespan\| till@cs.city.ac.uk}
	ftp://ftp.cs.city.ac.uk//users/gespan/VPdelugach.ps.Z, 19960909 An Approach To Conceptual Feedback In Multiple Viewed Software Requirements Modeling Harry S. Delugach Computer Science Department Univ. of Alabama in Huntsville Huntsville, AL 35899 phone: (205) 895-6614 fax: (205) 895-6239 Email: delugach@cs.uah.edu WWW: http://www.cs.uah.edu/~delugach 1. INTRODUCTION
	ftp://ftp.cs.city.ac.uk//users/gespan/VPbelkhouche.ps, 19960909 Multiple View Analysis of Designs Boumediene Belkhouche and Cuauht emoc Lemus June 28, 1996
	ftp://ftp.cs.city.ac.uk//users/gespan/VPleite.ps, 19960909 Viewpoints on Viewpoints Julio Cesar Sampaio do Prado Leite Departamento de Inform atica, PUC-Rio R. Marqu^es de S. Vicente 225 Rio de Janeiro 22453-900 Brasil julio@inf.puc-rio.br
	ftp://ftp.cs.city.ac.uk//users/gespan/VPemmerich.ps.gz, 19960910 An Architecture for Viewpoint Environments based on OMG/CORBA Wolfgang Emmerich Dept. of Computer Science, City University Northampton Square, London EC1V 0HB, U.K. we@city.ac.uk
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/wallace-jlp-postscript.ps.gz, 19960913 Journal of Logic Programming, Vol 15, 1992 Tight, Consistent and Computable Completions For Unrestricted Logic Programs Mark Wallace mark@ecrc.de
	ftp://ftp.cs.city.ac.uk//pub/constraints/papers/jampel-thesis.ps.gz, 19960919 Over-Constrained Systems in CLP and CSP Michael Benjamin Jampel Ph.D. Thesis Department of Computer Science City University 19 September 1996 Contents List of figures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vi Acknowledgements . . . . . . . . . . . . . . . . . . . . . . .
	ftp://ftp.cs.city.ac.uk//users/gespan/annals97.ps.Z, 19960923 Reconciling Requirements: a method for managing interference, inconsistency and conflict George Spanoudakis & Anthony Finkelstein Department of Computer Science, City University Northampton Square, London EC1V 0HB, UK email: {gespan \| acwf @cs.city.ac.uk}
	ftp://ftp.cs.city.ac.uk//users/drg/workshops/compulog96.ps.gz, 19961004 A universal interpreter for nondeterministic concurrent programming languages A.A.Letichevsky (let@d105.icyb.kiev.ua) Glushkov Institute of Cybernetics National Academy of Sciences of Ukraine D.R.Gilbert (drg@soi.city.ac.uk) Department of Computer Science City University, UK September 1996
	ftp://ftp.cs.city.ac.uk//users/gespan/VPaxel.ps.Z, 19961007 gramming Languages and Systems 9(2), Apr. 87, 198-234. A. Finkelstein and H. Fuks, Multi-party Specification , Proceedings 5th International Workshop on Software Specification and Design (Pittsburgh, Pa.), IEEE, May 1989, 185-195. A.N. Habermann, C. Krueger, B. Pierce, B. Staudt, and J.