Copy Link
Add to Bookmark
Report
AIList Digest Volume 6 Issue 073
AIList Digest Thursday, 21 Apr 1988 Volume 6 : Issue 73
Today's Topics:
News - Investigation of Fraud in Government-Funded Science,
AI Tools - Boyer and Moore's Theorem Prover,
Bindings - Tech-Concepts & Ag-Exp-L,
Bibliographies - Monthly Abstracts in AI & Search Bibliography
----------------------------------------------------------------------
Date: Mon, 18 Apr 88 11:05:50 MST
From: John B. Nagle <jbn@glacier.stanford.edu>
Subject: Investigation of fraud in Government-funded science underway
The Subcommitee on Human Resources and Intergovermental Relations
of the U.S. House of Representatives is investigating fraud in government-
supported research. Public hearings are being held, and are being broadcast
on C-SPAN. After hearing testimony concerning scientists who'd allegedly
doctored their research data, Rep. John Conyers proposed that criminal
penalties be imposed for such offences where Federal funds are involved.
Rep. Ted Weiss commented "It is not a question of too many watchdogs. We
seem to have no watchdogs at all in this situation." Further details
should be available when the hearing transcripts are printed, in a few
weeks. It is not known if the AI field was mentioned in the hearings.
However, it is something that people in the field should be aware of.
John Nagle
------------------------------
Date: Mon, 18 Apr 88 16:22:13 CDT
From: Robert S. Boyer <boyer@CLI.COM>
Subject: Availability of Boyer and Moore's Theorem Prover
A Common Lisp version of our theorem-prover is now available under the
usual conditions: no license, no copyright, no fee, no support. The
system runs well in three Common Lisps: KCL, Symbolics, and Lucid.
There are no operating system or dialect conditionals, so the code may
well run in other implementations of Common Lisp.
Included as sample input is the work of Hunt on the FM8501
microprocessor and of Shankar on Goedel's incompleteness theorem and
the Church-Rosser theorem.
To get a copy follow these instructions:
1. ftp to Arpanet/Internet host cli.com.
(cli.com currently has Internet numbers
10.8.0.62 and 192.31.85.1)
2. log in as ftp, password guest
3. get the file /pub/nqthm/README
4. read the file README and follow the directions it gives.
Inquiries concerning tapes may be sent to:
Computational Logic, Inc., Suite 290
1717 W. 6th St.
Austin, Texas 78703
A comprehensive manual is available. For information on obtaining a
copy, write to the address above.
Bob Boyer J Moore
boyer@cli.com moore@cli.com
It seems possible that on May 1, 1988 all of Austin, Texas will be
disconnected from the Internet/Arpanet, for a while anyway. So
connections to cli.com may be very difficult starting May 1.
------------------------------
Date: Mon, 18 Apr 88 12:12:00 EST
From: Brendan Reilly <reilly@wharton.upenn.edu>
Subject: New mailing list
There is a new mailing list at the Franklin Institute
(tech-concepts@fi.edu) discussing the concepts of modern technology.
The purpose of the list is to collect all of the concepts which the
public should learn about in dealing with computing, robotics, and
artificial intelligence in the coming years.
Any suggestions ranging from concepts to exhibits are welcome. The
Institute is opening up exhibits on energy, space, and health as well.
Comments and suggestions are welcome on all of these topics.
Mail requests for address changes to:
tech-concepts-request@fi.edu
Brendan Reilly
------------------------------
Date: Tue, 19 Apr 88 10:00:38 CDT
From: ND HECN E-mail Postmaster <INFO%NDSUVM1.BITNET@CUNYVM.CUNY.EDU>
Subject: AG-EXP-L@NDSUVM1 for Expert Systems in Agriculture
We have set up a new list as described below. We would appreciate it
if you could include at least the brief description in your various lists
of lists, etc. Thank you.
Description of AG-EXP-L:
AG-EXP-L - Discusses the use of Expert Systems in Agricultural
production and management. Primary emphasis is for practitioners,
Extension personnel and Experiment Station researchers in the land
grant system.
Procedures for AG-EXP-L:
BITNET, EARN, or NetNorth subscribers can join by sending the SUB
command with your name:
<- Listserv Command ->
For example, SEND LISTSERV@NDSUVM1 SUB AG-EXP-L Jon Doe
or TELL LISTSERV AT NDSUVM1 SUB AG-EXP-L Joan Doe
To be removed from the list, <- Listserv Command ->
SEND LISTSERV@NDSUVM1 SIGNOFF AG-EXP-L
TELL LISTSERV AT NDSUVM1 SIGNOFF AG-EXP-L
Those without interactive access may send the Listserv Command
portion of the above lines as the first TEXT line of RFC822 standard
mail (after the blank line - NOT in the subject). For example:
SUB AG-EXP-L Joan Doe
would be the only line in the body (text) of mail to LISTSERV@NDSUVM1.
Monthly public logs of mail to AG-EXP-L are kept on LISTSERV for a
few months. For a list of files send the 'Index AG-EXP-L' command
to LISTSERV@NDSUVM1.
NOTE VERY WELL!!! All commands for listserv should be sent to
LISTSERV@NDSUVM1 and NOT to the list itself!
To MAKE CONTRIBUTIONS to the list, BitNet, EARN, and Netnorth users
should send mail to AG-EXP-L@NDSUVM1. Others may send via the
appropriate BITNET gateway (for example, from the Internet mail
to the LIST would go to AG-EXP-L%NDSUVM1.Bitnet@CUNYVM.CUNY.EDU for
example.
For more information on LISTSERV you may send it the INFO command
(eg. TELL LISTSERV AT NDSUVM1 INFO or whatever).
Coordinator: Sandy Sprafka - NU020746@NDSUVM1
or NU020746%NDSUVM1.Bitnet@CUNYVM.CUNY.EDU
| | Note the two ZERO digits!
------------------------------
Date: Mon, 18 Apr 88 12:21:55 bst
From: Robin Boswell <robin%aiva.edinburgh.ac.uk@NSS.Cs.Ucl.AC.UK>
Subject: Monthly Abstracts in AI
TURING INSTITUTE PRODUCT ANNOUNCEMENT - MONTHLY ABSTRACTS IN AI
Each issue contains 200 items selected from the latest conference
proceedings, research reports, journals and books on AI and related
topics, divided into 16 categories:
Expert Systems
Applications
Logic Programming
Advanced Computer Vision
Advanced Robotics
Pattern-Recognition
Programming Languages and Software
Automatic Programming
Human-Computer Interaction
Hardware
Machine Learning
Natural Language
Cognitive Modelling
Knowledge Representation
Search control and Planning
General
For a free sample copy and further information, please contact:
robin@turing.ac.uk
or
Jon Ritchie
Turing Institute
George House
36 North Hanover St.
Glasgow G1 2AD
U.K.
Tel: (041) 552-6400
------------------------------
Date: Wed, 13 Apr 88 17:18:22 PDT
From: rshu%meridian@ads.com (Richard Shu)
Subject: Search bibliography
Dickson,
I just discovered that a colleague of mine had this bibliography on search.
BACHANT, J. AND McDERMOTT, J. R1 revisited: four years in the trenches.
AI Magazine 5#3 (1984).
BANNERJI, R.B. A comarison of three problem solving methods. Proc 5th IJCAI
(1977), 442ff.
BANNERJI, R.B. AND ERNST, C.W. A theory for the complete mechanization of
a GPS-type problem solver. Proc 5th IJCAI (1977), 450ff.
BARNETT, J.A. How much is control knowledge worth? a primitive
example. Artif Intel 22 (1984), 77-89.
BARTON, G.E. A multiple-context equality-based reasoning system.
AI Lab TR-715, MIT (1983).
BENOIT, J.W. A use of ATMS in hierarchical planning. Proc DARPA Knowledge
Based Planning Workshop, Austin TX (Dec 1987).
BERLINER, H.A. Search vs. knowledge: an analysis from the domain of games.
Tech Report CMU-CS-82-104, Department of Computer Science, Carnegie-Mellon
University. { search reduction vs goal recognition }
BOBROW, D.G. AND WEGBREIT, B. A model and stack implementation of multiple
environments. Comm ACM 16 (1973), 591-603.
BORNING, A. ThingLab -- an object-oriented system for building simulations
using constraints. Proc 5th IJCAI (1977), 497-498.
BOTVINNIK, M.M. Decision making and computers. Computer Chess 3 (198X), 169ff.
CHURCH, K.W. Coordinate squares: a solution to many chess pawn endgames.
Proc 6th IJCAI (1979), 149ff. { back-tracking, knowl util, frame problem }
DAVIS, M. The mathematics of non-monotonic reasoning. Artificial
Intelligence 13 (1980), 73ff.
DECHTER, R. Learning while searching in constraint-satisfaction problems.
Proc AAAI (1986), 178ff.
DECHTER, R. AND PEARL, J. Network-based heuristics for constraint
satisfaction problems. Artif Intel 34 (1988), 1ff.
DeKLEER, J., DOYLE, J., STEELE, G.L. AND SUSSMAN, G.J. AMORD: explicit
control of reasoning. SIGART Newsletter 64 (Aug 1977), 116-125.
DeKLEER, J., DOYLE, J., STEELE, G.L.Jr. AND SUSSMAN, G.J. Explicit control
of reasoning. ACM SIGPLAN Notices Vol 12, Proc Symp on Artificial Intelligence
and Programming Languages (Aug 1977), 116ff.
DeKLEER, J., DOYLE, J., RICH, C., STEELE, G.L.Jr. AND SUSSMAN, G.J. AMORD, a
deductive procedure system. MIT AI Memo 435 (Jan 1978).
DeKLEER, J. AND SUSSMAN, G.J. Propagation of constraints applied
to circuit synthesis. Circuit Theory and Applications 8 (1980).
DeKLEER, J. Choices without backtracking. Proc AAAI (1984).
DeKLEER, J. An assumption-based TMS. Artif Intel 28 (1986), 127ff.
DeKLEER, J. Extending the ATMS. Artif Intel 28 (1986), 163ff.
DeKLEER, J. Problem solving with the ATMS. Artif Intel 28 (1986), 197ff.
DeKLEER, J. AND WILLIAMS, B.C. Back to backtracking: controlling the ATMS.
Proc AAAI (1986), 910ff.
DHAR, V. An approach to dependency directed backtracking using domain
specific knowledge. Proc 9th IJCAI (1985), 188ff.
DOYLE, J. Truth maintenance systems for problem solving. Proc 5th IJCAI
(1977), 247.
DOYLE, J. Truth maintenance systems for problem solving. Tech Rept
419, AI Lab, MIT (Jan 1978).
DOYLE, J. A glimpse of truth maintenance. Proc 6th IJCAI (1979), 232ff.
DOYLE, J. A truth maintenance system. Artificial Intelligence 12 (1979),
231ff.
DOYLE, J. AND LONDON, P. A selected descriptor-indexed bibliography to the
literature on belief revision. Memo 568, AI Lab, MIT (1980).
DOYLE, J. Methodological simplicity in expert system construction -- the
case of judgments and reasoned assumptions. Tech Rept CMU-CS-83-114, Dept
of CS, CMU (1983).
EAVARONE, D. AND ERNST, G. A program that generates good
difference orderings and tables of connections for GPS. Proc IEEE
Systems Science and Cybernetics Conf, Pittsburgh, PA (Oct 1970), 226ff.
ERNST, G. Sufficient conditions for the success of GPS. J ACM 16
(Oct 1969), 517ff.
FEIGENBAUM, E.A. The art of artificial intelligence: 1. themes and case
studies of knowledge engineering. Proc 5th IJCAI (1977), 1014ff. { generate &
test in expert systems }
FOX, M.S. Constraint-directed search: a case study of job-shop
scheduling. PhD thesis, Rept CMU-CS-83-161, Carnegie Mellon Univ
(Dec 1983).
FOX, M.S., ALLEN, B. AND STROHM, G. Job-shop scheduling: an
investigation of constraint-directed reasoning. Proc AAAI (1982), 155ff.
GASCHNIG, J. A general backtrack algorithm that eliminates most redundant
tests. Proc 5th IJCAI (1977), 457ff.
HARALICK, R.M. AND ELLIOTT, G.L. Increasing tree search efficiency
for constraint satisfaction problems. Proc 6th IJCAI (1979), 356ff.
HARRIS, D. A hybrid structured-object and constraint representation
language. Proc AAAI (1986), 986ff.
HAYES, P.J. A representation for robot plans. Proc 4th IJCAI (1975).
HEWITT, C. How to use what you know. Proc 4th IJCAI (1975), 189ff.
KASIF, S. On the parallel complexity of some constraint satisfaction
problems. Proc AAAI (1986), 349ff.
KELLY, V. The CRITTER system: automated critiquing of digital hardware
designs. TR WP-13, AI/VLSI project, Rutgers (1983). Also in Proc Design
Automation Conf (1984).
KELLY, V. The CRITTER system: an AI approach to digital circuit design
critiquing. PhD thesis, Rutgers University, New Brunswick, NJ (Jan 1985).
KIBLER, D. AND MORRIS, P. Don't be stupid. Proc 7th IJCAI (1981), 345ff.
{ use of negative heuristics (checks?) }
KLINE, P. The superiority of relative criteria in partial matching and
generalization. Proc 7th IJCAI (1981).
KORNFELD, W.A. The use of parallelism to implement a heuristic
search. Proc 7th IJCAI (1981), 575ff.
LAIRD, J.E. AND NEWELL, A. A universal weak method. TR 83-141, Dept of
Computer Science, CMU (1983).
LAIRD, J.E. AND NEWELL, A. A universal weak method: summary of results.
Proc 8th IJCAI (1983).
LAIRD, J.E. Universal subgoaling. PhD thesis, Dept of Computer Science,
CMU (1983).
LONDON, P. A dependency-based modelling mechanism for problem solving.
TR-589, Dept of CS, U of Maryland, College Park (Sep 1978).
LONDON, P. Dependency networks as a representation for modelling in
general problem solvers. PhD thesis, Tech Rept 698, Dept of CS, U of
Maryland at College Park (1978).
MACKWORTH, A.K. Consistency in networks of relations.
Artificial Intelligence 8 (1977), 99ff.
MARTINS, J.P. AND SHAPIRO, S.C. Reasoning in multiple belief
spaces. Proc 8th IJCAI (1983).
MATWIN, S. AND PIETRZYKOWSKI, T. Intelligent backtracking in plan-based
deduction. IEEE Trans PAMI 7 #6 (Nov 1985), 682ff.
MATWIN, S. AND PIETRZYKOWSKI, T. Exponential improvement of efficient
backtracking: a strategy for plan-based deduction. Proc 7th Conf on Auto
Deduction.
McALLESTER, D.A. A three-valued truth maintenance system. MIT Artificial
Intelligence Laboratory, Memo 473 (1978).
McALLESTER, D. An outlook on truth maintenance. AI Lab Memo 551, MIT (1980).
McALLESTER, D. Reasoning Utility Package users' manual. AIM-667, AI Lab,
MIT (1982).
McDERMOTT, D. Contexts and data dependencies: a synthesis. IEEE Trans PAMI
5/3 (1983), 237ff.
MITTAL, S. AND FRAYMAN, F. Making partial choices in contraint reasoning
problems. Proc AAAI (1987), 631ff.
MORRIS, P.H. AND NADO, R. Representing actions with an ATMS. Proc AAAI
(1986), 13ff.
NEVINS, A.J. A human-oriented logic for automatic theorem proving.
J ACM 21 (1974), 606ff. { case analysis }
O'RORKE, P. Constraint posting and propagation in explanation-based
learning. Working Paper 70, AI Group, Coordinated Science Lab, U of Illinois
at Urbana-Champaign (1986).
PIETRZYKOWSKI, T. AND MATWIN, S. Exponential improvement of exhaustive
backtracking: data structure and implementation. Proc 7th Conf on Auto
Deduction.
POST, E.L. Formal reductions of the general combinatorial decision
problem. Amer J of Mathematics 65 (1943), 197ff.
PURDOM, P.W.Jr. Solving satisfiability with less searching. IEEE Trans
PAMI 6 #4 (July 1984), 510ff.
RIVEST, R. On self-organizing sequential search heuristics. CACM 19/2
(1976), 63ff.
SEIDEL, R. A new method for solving constraint satisfaction problems.
Proc 7th IJCAI (1981), 338ff.
SMITH, R.G. Applications of the contract net: search. Proc 3rd
CSCSI Conf (May 1980).
STALLMAN, R.M. AND SUSSMAN, G.J. Forward reasoning and dependency-directed
backtracking in a system for computer-aided circuit analysis. Artificial
Intelligence 9 (1978), 135ff.
STEELE, G.L. The definition and implementation of a computer
programming language based on constraints. AI Lab TR-595, MIT (1979).
STEINBERG, L.I. Design as refinement plus constraint propagation: the VEXED
experience. Proc AAAI (1987), 830ff.
SUSSMAN, G.J. AND STALLMAN, R.M. Heuristic techniques in computer-aided
circuit analysis. IEEE Trans Circuits & Systems CAS-22 (Nov 1975).
SUSSMAN, G.J. SLICES: at the boundary between analysis and synthesis.
Memo 433, AI Lab, MIT (July 1977).
SUSSMAN, G.J. AND STEELE, G.L. CONSTRAINTS: a language for
expressing almost-hierarchical descriptions. Artif Intel 14 (1980).
WILLIAMS, C. ART - the advanced reasoning tool - conceptual
overview. Inference Corp (1984).
Foo, Norman Y., & Anand S. Rao (1987) "Open world and closed world
negations," Report RC 13122, IBM T. J. Watson Research Center.
Foo, Norman Y., & Anand S. Rao (in preparation) "Semantics of
dynamic belief systems."
Foo, Norman Y., & Anand S. Rao (in preparation) "Belief and ontology
revision in a microworld.
Rao, Anand S., & Norman Y. Foo (1987) "Evolving knowledge and logical
omniscience," Report RC 13155, IBM T. J. Watson Research Center.
Rao, Anand S., & Norman Y. Foo (1987) "Evolving knowledge and
autoepistemic reasoning," Report RC 13155, IBM T. J. Watson Research
Center.
Rao, Anand S., & Norman Y. Foo (1986) "Modal horn graph resolution,"
Proceedings of the First Australian AI Congress, Melbourne.
Rao, Anand S., & Norman Y. Foo (1986) "DYNABELS -- A dynamic belief
revision system," Report 301, Basser Dept. of Computer Science,
University of Sydney.
Sowa, John F. (1984) Conceptual Structures: Information Processing in
Mind and Machine, Addison-Wesley, Reading, MA.
Way, Eileen C. (1987) Dynamic Type Hierarchies: An Approach to
Knowledge Representation through Metaphor, PhD dissertation,
Systems Science Dept., SUNY at Binghamton.
For copies of the IBM reports, write to Distribution Services 73-F11;
IBM T. J. Watson Research Center; P.O. Box 218; Yorktown Heights,
NY 10598.
For the report from Sydney, write to Basser Dept. of Computer Science;
University of Sydney; Sydney, NSW 2006; Australia.
For the dissertation by Eileen Way, write to her at the Department
of Philosophy; State University of New York; Binghamton, NY 13901.
Richard Shu
RSHU@ADS.COM
------------------------------
End of AIList Digest
********************
