@make(PublicationOrderForm,Number 20,AnnouncementDate "January 1983")
@begin(center)
List Number 20
@end(center)
@Entry(Code "STAN-CS-82-944",
        Title "The WEB System of Structured Documentation",
        Author "Donald E. Knuth",
        Price "$7.90",
        Mprice "$2.00",
        Note "196 pages",
        Date "October 1982")

This memo describes how to write programs in the WEB language; and it also           
includes the full WEB documentation for WEAVE and TANGLE, the programs
that read WEB input and produce TeX and PASCAL output, respectively.  The
philosophy behind WEB is that an experienced system programmer, who wants
to provide the best possible documentation of his or her software
products, needs two things simultaneously:  a language like TeX for
formatting, and a language like PASCAL for programming.  Neither type of 
language can provide the best documentation by itself; but when both are
appropriately combined, we obtain a sustem that is much more useful than
either language separately.

@Entry(Code "STAN-CS-82-945",
	Title "TeXware",
	Author "Donald E. Knuth",
	Price "$5.25",              
	Mprice "$2.00",
	Note "142 pages",
	Date "October 1982")

This report contains four programs that should be helpful to anybody
who is installing the portable version of TeX:  (1) POOLtype lists the
contents of a string pool file output by TANGLE; (2) TFtoPL converts
a TeX font metric font metric file to property list format; (3) PLtoTF 
goes the other way, to make font metric files; (4) DVItype lists the 
contents of a device-independent output file and illustrates DVI-reading
programs in general.  All four programs are examples of the WEB
documentation system.


@Entry(Code "STAN-CS-82-946",
	Title "A Test File for TeX",
	Author "Donald E. Knuth",
	Price "$5.90",
	Mprice "$2.00",
	Note "130 pages",
 	Date "October 1982")

Programs that claim to be implementations of TeX82 are supposed to be able
to process the test routine contained in this report, producing the 
outputs contained in this report.  A previously unpublished diagnostic method 
that the author has used successfully for over twenty years is described and
illustrated here.

  
@Entry(Code "STAN-CS-82-947", 
	Title "Modelling Degrees of Item Interest for a General   
              Database Query System",
	Author "Neil C. Rowe",     
	Price "$3.10",
	Mprice "$2.00",
	Note "37 pages",
	Date "October l982",)

Many databases support decision-making.  Often this means choices between
alternatives according to partly subjective or conflicting criteria. 
Database query languages are generaally designed for precise, logical
specification of the data of interest, and tent to be awkward in the 
aforementioned circumstances.  Information retrieval research suggests
several solutions, but there are obstacles to generalizing these ideas
to most databases.

To address this problem we propose a methodology for automatically 
deriving and monitoring "degrees of interest" among alternatives for
a user of a database system.  This includes (a) a decision theory model 
of the value of information to the user, and (b) inference mechanisms, 
based in part on ideas from artificial intelligence, that can tune the 
model to observed user behavior.  This theory has important applications
to improving efficiency and cooperativeness of the interface between a 
decision-maker and a database system.


@Entry(Code "STAN-CS-82-948",
        Title "Three Papers on Rule-Based Estimation of Statistics
               on Databases",
        Author "Neil C. Rowe",
	Price "$3.10",
	Mprice "$2.00",
	Note "38 pages",
	Date "October 1982")

This report contains three papers on rule-based estimation of statistics on
a database:  an overview, followed by two moe specialized papers.  The first,
"Rule-based Statistical Calculations on a Database Abstract," is addressed
to a general database audience, and was presented at the First LBL Workshop 
on Statistical Database Management, Menlo Park, Califoria, December 1981.
The second, "Inheritance of Statistical Properties,," is addressd to an
artificial intelligence audience, and was presented at the National Conference 
of the American Associaiton for Artificial Intelligence, Pittsburgh, 
Pennsylvania, August 1982.  The third, "Diophantine Compromise of a
Statistical Database," is addressed to an audience of database theorists.

@Entry(Code "STAN-CS-82-949",
	Title "The @i[r]-Stirling numbers",
        Author "Andrei Z. Broder",
	Price "$2.70",
	Mprice "$2.00",
	Note "22 pages",
    	Date "November 1982")

The @i[r]-Stirling numbers of the first and second kind count restricted
permutations and respectively restricted partitions, the restrictions being
that the first @i[r] elements must be in distinct cycles and respectively
distinct subsets.  The combinatorial and algebraic properties of these 
numbers, which in most cases generalize similar properties of the regular
Stirling numbers, are explored starting from the above definition.


@Entry(Code "STAN-CS-82-950",
	Title "Learning Physical Descriptions from Functional Definitions,
        Examples, and Precedents",
	Author "P. Winston, T. Binford, B. Katz, M. Lowry",
	Price "Not available",
	Mprice "Not available",
        Note ""
        Date "November 1982")


Copies of this report were not yet available as this abstract was being
published.  It is hoped that it will be included in the subsequent
listing of department publications.

@Entry(Code "STAN-CS-82-951",
	Title "Five Paradigm Shifts in Programming Language Design  
               and Their Realization in Viron, A Dataflow Programmming
               Environment",
	Author "Vaughan Pratt",
	Price "$2.30",
	Mprice "$2.00",
	Note "9 pages",
	Date "July 1982")

We describe five paradigm shifts in programming language design, some old 
and some relatively new, namely Effect to Entity, Serial to Parallel, Partition 
Types to Predicate Types, Computable to Definable, and Syntactic Consistency 
to Semantic Consistency.  We argue for the adoption of each.  We exhibit
a programming language, Viron, that capitaizes on these shifts.


@Entry(Code "STAN-CS-82-952",
	Title "A Temporal Logic for Multi-Level Reasoning about
              Hardware",
	Author "Ben Moszkowski",
	Price "$2.75",
	Mprice "$2.00",
	Note "25 pages",
	Date "November 1982")

This paper describes a logical notation for reasoning about digital circuits.
The formalism provides a rigorous and natural basis for device specification
as well as for providing properties such as correctness of implementation.
Conceptual levels of circuit operation ranging from detailed quantitative
timing and signal propagation up to functional behavior are integrated in
a unified way.

A temporal predicate calculus serves as the formal core of the notation, 
resulting in a versatile tool that has more descriptive power than any
conventional hardware specification language.  The logic has been applied
to specifying and proving numerous properties of circuits ranging from delay 
elements up to the Am2901 ALU bit slice.  Presentations of a delay model
and a multiplication circuit illustrate various features of the notation.


@Entry(Code "STAN-CS-82-953",
   	Title "Partial Bibliography of Work on Expert Systems",
	Author "Bruce G. Buchanan",
	Price "$2.45",
	Mprice "$2.00",
	Note "15 pages",
	Date "December 1982")

Since 1971 many publications on expert systems have appeared in 
conference proceedings and the technical literature.  Over 200
titles are listed in the bibliography.  Many relevant publications
are omitted because they overlap publication on the list; others
should be called to my attention.


@Entry(Code "STAN-CS-82-954",
	Title "How to Cook a Temporal Proof System for Your Pet Language",
	Author "Zohar Manna and Amir Pnueli",
	Price "$2.45",
	Mprice "$2.00",
	Note "14 pages",
	Date "December 1982")

An abstract temporal proof system is presented whose program-dependent part
has a high-level interface with the programming language actually studied.
Given a new language, it is sufficient to define the interface notions of
atomic transitions, justice, and fairness in order to obtain a full temporal
proof system for this language. This construction is particularly useful for
the analysis of concurren systems.  We illustrate the construction on the
shared-variable model and on CSP.  The generic proof system is shown to be
relatively complete with respect to pure first-order temporal logic.


@Entry(Code "STAN-CS-82-955",
	Title "Design of an Interactive Manipulator Programming Environmnt",
 	Author "Ron Goldman",
	Price "$6.50",
	Mprice "$2.00",
	Note "90 pages",
	Date "December 1982")

This dissertation examines both the problems unique to manipulator programming
that arise from including the physical world as a part of the programming
environment and also the consequent problems of programming in this environment.
Some specific issues discussed include object definition, motion control, use
of force and compliance, error recovery, and parallelism.  Requirements for a
successful manipulator programming environment are formulated in light of these
and other problems.


@Entry(Code "STAN-CS-82-956",
	Title "Artificial Intelligence:  Cognition as Computation",
	Author "Avron Barr",
	Price "$2.85",
	Mprice "$2.00",
	Note "28 pages",
     	Date "August 1982")

The ability and compulsion to @i[know] are as characteristic of our human
nature as are our physical posture and our languages.  Knowledge and 
intelligence, as scientific concepts, are used to describe how an organism's
experience appears to mediate its behavior.  This report discusses the relation
between artificial intelligence (AI) research in computer science and the
approaches of other disciplines that study the nature of intelligence, cognition,
and mind.  The state of AI after 25 years of work in the field is reviewed, as
are the views of its practioners about its relation to cognate disciplines.
The report concludes with a discussion of some possible effects on our scientific
work of emerging commercial applications of AI technology, that is, machines that
can know and can take part in human cognitive activities.


@Entry(Code "STAN-CS-83-957",
        Title "Vertical Partitioning for Physical and Distributed Design
        of Databases",
        Author "S. Navathe, S. Ceri, G. Wiederhold, and J. Dou",
        Price "$3.00",
        Mprice "$2.00",
        Note "33 pages",
        Date "January 1983")

This paper first describes a technique for the veritcal partioning of 
a logical record or relation into non-overlapped or overlapped fragments.
Then a classification of the problems in physical design of a database
is proposed, to which our result can be applied.  Each problem is 
considered individually, and a methodology for its solution is suggested.  
For each case, an itertive partitioning procedure, the computation of cost
factors, and the measure of the advantage of the vertical partitioning
is presented.  Examples of applications of the proposed technique in
different environments are given.

 
@send(order <@b{@\Sub-totals@\@Ux(@hsp(.5 inch))@\@Ux(@hsp(.5 inch))}>)
@send(order <@b{@\Publications total@\@Ux(@hsp(.5 inch))}>)
@send(order <@b{@\Sales tax@\@Ux(@hsp(.5 inch))}>)
@send(order <@b{@\Total enclosed@\@Ux(@hsp(.5 inch))}>)