Copy Link
Add to Bookmark
Report
IRList Digest Volume 2 Number 42
IRList Digest Tuesday, 9 September 1986 Volume 2 : Issue 42
Today's Topics:
Call for Papers - 1st Int'l Conf. of AI and Law
Abstracts - Recent abstracts (from SMU)
News addresses are ARPANET: fox%vt@csnet-relay.arpa BITNET: foxea@vtvax3.bitnet
CSNET: fox@vt UUCPNET: seismo!vtisr1!irlistrq
----------------------------------------------------------------------
Date: 13 Aug 86 20:36:33 EDT
From: MCCARTY@RED.RUTGERS.EDU
Subject: Conference on AI and Law
[Forwarded from: PROLOG Digest Tuesday, 19 Aug 1986 V.4: Issue 39 - Ed]
CALL FOR PAPERS:
First International Conference on
ARTIFICIAL INTELLIGENCE AND LAW
May 27-29, 1987
Northeastern University
Boston, Massachusetts, USA
In recent years there has been an increased interest in the
applications of artificial intelligence to law. Some of this interest
is due to the potential practical applications: A number of
researchers are developing legal expert systems, intended as an aid to
lawyers and judges; other researchers are developing conceptual legal
retrieval systems, intended as a complement to the existing full-text
legal retrieval systems. But the problems in this field are very
difficult. The natural language of the law is exceedingly complex,
and it is grounded in the fundamental patterns of human common sense
reasoning. Thus, many researchers have also adopted the law as an
ideal problem domain in which to tackle some of the basic theoretical
issues in AI: the representation of common sense concepts; the process
of reasoning with concrete examples; the construction and use of
analogies; etc. There is reason to believe that a thorough
interdisciplinary approach to these problems will have significance
for both fields, with both practical and theoretical benefits.
The purpose of this First International Conference on Artificial
Intelligence and Law is to stimulate further collaboration between AI
researchers and lawyers, and to provide a forum for the latest
research results in the field. The conference is sponsored by the
Center for Law and Computer Science at Northeastern University. The
General Chair is: Carole D. Hafner, College of Computer Science,
Northeastern University, 360 Huntington Avenue, Boston MA 02115,
USA; (617) 437-5116 or (617) 437-2462; hafner.northeastern@csnet.
Authors are invited to contribute papers on the following topics:
- Legal Expert Systems
- Conceptual Legal Retrieval Systems
- Automatic Processing of Natural Legal Texts
- Computational Models of Legal Reasoning
In addition, papers on the relevant theoretical issues in AI are also
invited, if the relationship to the law can be clearly demonstrated.
It is important that authors identify the original contributions
presented in their papers, and that they include a comparison with
previous work. Each submission will be reviewed by at least three
members of the Program Committee (listed below), and judged as to its
originality, quality and significance.
Authors should submit six (6) copies of an Extended Abstract (6 to 8
pages) by January 15, 1987, to the Program Chair: L. Thorne McCarty,
Department of Computer Science, Rutgers University, New Brunswick NJ
08903, USA; (201) 932-2657; mccarty@rutgers.arpa. Notification of
acceptance or rejection will be sent out by March 1, 1987. Final
camera-ready copy of the complete paper (up to 15 pages) will be due
by April 15, 1987.
Conference Chair: Carole D. Hafner Northeastern University
Program Chair: L. Thorne McCarty Rutgers University
Program Donald H. Berman Northeastern University
Committee: Michael G. Dyer UCLA
Edwina L. Rissland University of Massachusetts
Marek J. Sergot Imperial College, London
Donald A. Waterman The RAND Corporation
------------------------------
Date: Sun, 31 Aug 86 18:38:39 edt
From: E1AR0002%SMUVM1.BITNET@WISCVM.WISC.EDU
Subject: recent abstracts (from SMU)
%A Michael Lebowitz
%T Researcher: An Experimental Intelligent Information Systems
%R CUCS-171-85
%I Columbia University
%C New York City
%K AI02 AA14
%H TR85-037
%A Cary G. deBessonet
%A George R. Cross
%T Distinguishing Legal Language-Types for Conceptual Retrieval
%R LSU Computer Science Technical Report TR85-037
%K AA24 AA14 AI02
%A Michael Lesk
%T Writing to be Searched: A Workshop on Document Generation Principles
%J SIGIR Forum
%V 19
%N 1-4
%D WINTER 1986
%P 9-14
%K Cucumber Information Knowledge Systems AI02 A08 AA14
%X "It is now possible to design full-text retrieval systems that accept
conventional docuements and questions in natural English, and then retrieve
documents or passages from documents that probably answer the questions."
Cucumber Information Systems and Knowledge Systems, Inc. sell such systems.
A high degree of grammatical variation does not seem important to produce
natural effects in short paragraphs (as evidenced by Karen Kukich's
stock market report generator)" "Syntax is much less important
for retrieval than semantics; you need to know what the words mean more
than you need to know their relationship." "Editing manuals to make
them suitable for machine translation, requiring simple translation, has
turned out to make them better in the original language as well."
%A Susanne M. Humphrey
%T Automated Classification and Retrieval Program: Indexing Aid Project
%J SIGIR Forum
%V 19
%N 1-4
%D WINTER 1986
%P 16-17
%K AA14 AI02 AA01
%X Lister Hill Center of the National Library of Medicine is
developing this system to generate indices consistent with
those normally used by MEDLINE. They are using a frame based system.
%A N. Fuhr
%A G. E. Knorz
%T Retrieval Test Evaluation of a Rule Based Automatic Indexing
(AIR/PHYS)
%K AI01 AA14
%B Proceedings of the Third Joint BCS and ACM Symposium
%E C. J. van Rijsbergen
%I Cambridge University Press
%D 1984
%A W. S. Cooper
%T Bridging the Gap between AI and IR
%B Proceedings of the Third Joint BCS and ACM Symposium
%E C. J. van Rijsbergen
%I Cambridge University Press
%D 1984
%K AI01 AA14
%A M. Balaban
%T Knowledge Representation and Inferencing in a Musical Database
%R TR 85-11
%I State University of New York at Albany, Computer Science Department
%K frames AA25 AA14 T02
%R 127
%A J. K. Cipolaro
%A N. V. Findler
%T MARSHA, the daughter of ELIZA \- a simple
program for information retrieval in
natural language
%I SUNY Buffalo Computer Science
%K AA02 AA14
%R 141
%A N. V. Findler
%T A heuristic information retrievalsystem based on
associative networks
%D February 1978
%I SUNY Buffalo Computer Science
%K AI12 AA14
%A John W. Lloyd
%T An Introduction to Deductive Database Systems
%R Technical Report 81/3
%I Department of Computer Science, University of Melbourne
%D April 1981 (revised April 1983)
%P 24
%K T02 AA14 AA09
%O also in Australian Computer Journal, vol.15, 1983
%X
This paper gives a tutorial introduction to deductive database systems.
Such systems have developed largely from the combined application of the
ideas of logic programming and relational databases. The elegant theoretical
framework for deductive database systems is provided by first order logic.
Logic is used as a uniform language for data, programs, queries, views
and integrity constraints. It is stressed that it is possible to build
practical and efficient database systems using these ideas.
%A John W. Lloyd
%T Implementing Clause Indexing for Deductive Database Systems
%R Technical Report 81/4
%I Department of Computer Science, University of Melbourne
%D October 1981
%P 22
%K AA14 AA09
%X
The paper presents a file design for handling partial-match
queries which has wide application to knowledge-based artificial
intelligence systems and relational database systems. The
advantages of the design are simplicity of implementation, the
ability to cope with dynamic files and the ability to optimize
performance with respect to the average number of disk access
required to answer a query.
%A Lee Naish
%A James A. Thom
%T The MU-Prolog Deductive Database
%R Technical Report 83/10
%I Department of Computer Science, University of Melbourne
%D November 1983
%P 16
%K muprolog, partial match retrieval, unix T02 AA09 AA14
%X
This paper describes the implementation and an application of a
deductive database being developed at the University of Melbourne.
The system is implemented by adding a partial match retrieval system
to the MU-PROLOG interpreter.
%A Rodney W. Topor
%A Teresa Keddis
%A Derek W. Wright
%T Deductive Database Tools
%R Technical Report 84/7
%I Department of Computer Science, University of Melbourne
%D June 1984 (revised August 1985)
%P 27
%K database management, deductive database, query language,
integrity constraint, logic programming, T02 AA14 AA09 T02
AI10
%O also in Australian Computer Journal, vol.?, 1985
%X
A deductive database is a database in which data can be represented
both explicitly by facts and implicitly by general rules. The use of
typed first order logic as a definition and manipulation language for
such deductive databases is advocated and illustrated by examples.
Such a language has a well-understood theory and provides a uniform
notation for data, queries, integrity constraints, views and programs.
We present algorithms for implementing domains, for using atoms with
named attributes, for evaluating queries, and for checking static and
transition integrity constraints. The implementation is by translation
into Prolog and can be performed using a standard Prolog system. The
paper assumes some familiarity with relational databases, logic and Prolog.
%A John W. Lloyd
%A Rodney W. Topor
%T Making Prolog More Expressive
%R Technical Report 84/8
%I Department of Computer Science, University of Melbourne
%D June 1984
%P 22
%K first order logic, programming in logic, deductive databases,
query language AI10 AA14 AA09
%O also in Journal of Logic Programming, vol.4, 1984
%X This paper introduces extended programs and extended goals for logic
programming. A clause in an extended program can have an arbitrary first
order formula as its body. Similarly, an extended goal can have an arbitrary
first order formula as its body. The main results of the paper are the
soundness of the negation as failure rule and SLDNF-resolution for extended
programs and goals. We show how the increased expressibility of extended
programs and goals can be easily implemented in any PROLOG system which has
a sound implementation of the negation as failure rule. We also show how
these ideas can be used to implement first order logic as a query language
in a deductive database system. An application to integrity constraints in
deductive database systems is also given.
%A John W. Lloyd
%A Rodney W. Topor
%T A Basis for Deductive Database Systems
%R Technical Report 85/1
%I Department of Computer Science, University of Melbourne
%D February 1985 (revised April 1985)
%P 22
%K logic programming, first order logic, soundness, integrity constraints
AA14 AA09 T02
%X
This paper provides a theoretical basis for deductive database systems.
A deductive database consists of closed typed first order logic formulas
of the form A<-W, where A is an atom and W is a typed first order formula.
A typed first order formula can be used as a query and a closed typed first
order formula can be used as an integrity constraint. Functions are allowed
to appear in formulas. Such a deductive database system can be implemented
using a PROLOG system. The main results are the soundness of the query
evaluation process, the soundness of the implementation of integrity
constraints, and a simplification theorem for implementing integrity
constraints. A short list of open problems is also presented.
%A John W. Lloyd
%A Rodney W. Topor
%T A Basis for Deductive Database Systems II
%R Technical Report 85/6
%I Department of Computer Science, University of Melbourne
%D February 1985 (revised April 1985)
%P 17
%K AI10 first order logic, soundness, integrity constraints,
query evaluation AA09 AA14
%X
This paper is the third in a series providing a theoretical basis for
deductive database systems. A deductive database consists of closed typed
first order logic formulas of the form A<-W, where A is an atom and W is a
typed first order formula. A typed first order formula can be used as a
query and a closed typed first order formula can be used as an integrity
constraint. Functions are allowed to appear in formulas. Such a deductive
database system can be implemented using a PROLOG system. The main results
of this paper are concerned with the non-floundering and completeness of
query evaluation. We also introduce an alternative query evaluation process
and show that corresponding versions of the earlier results can be obtained.
Finally, we summarize the results of the three papers and discuss the
attractive properties of the deductive database system approach based on
first order logic.
%A B. R. Boyce
%T Questions Natural Language Examples in Caduceus
%J OnLine
%V 10
%N 2
%D MAR 1986
%P 54-76
%K AA01 AI01 AI02 AA14
%A Viswanath Subramanian
%A Gautam Biswas
%A James C. Bezdek
%T Document Retrieval Using a Fuzzy Knowledge Based System
%J MAG24
%P 445-455
%K AA14 O04
------------------------------
END OF IRList Digest
********************
