Practical Aspects of Declarative Languages

Biological and biomedical databases have become a primary application area for data mining. Such databases commonly involve multiple relational tables and a variety of data types, as in the biological databases that formed the basis for the KDD Cup 2001 and 2002 competitions. The diversity of such “multi-relational” data is likely to increase dramatically in the near future. For example, patient records at major medical institutions are being augmented to include a variety of genetic data, including data on single-nucleotide polymorphisms (SNPs) and mRNA levels from gene expression microarrays, in addition to clinical data. Data mining tools based on declarative languages are able to naturally integrate data of diverse types, from multiple tables, to arrive at novel discoveries. V. Dahl and P. Wadler (Eds.): PADL 2003, LNCS 2562, p. 1, 2003. c © Springer-Verlag Berlin Heidelberg 2003 The Continue Server (or, How I Administered PADL 2002 and 2003) Shriram Krishnamurthi Computer Science Department Brown University Providence, RI, USA

[1]  Sergio Greco,et al.  A Logic Programming Approach to the Integration, Repairing and Querying of Inconsistent Databases , 2001, ICLP.

[2]  V. S. Subrahmanian,et al.  Theory of Generalized Annotated Logic Programming and its Applications , 1992, J. Log. Program..

[3]  Justin Zobel,et al.  Nu-prolog reference manual , 1990 .

[4]  Barbara Liskov,et al.  Program Development in Java - Abstraction, Specification, and Object-Oriented Design , 1986 .

[5]  Warren Teitelman,et al.  The interlisp reference manual , 1974 .

[6]  Konstantinos Sagonas,et al.  XSB as an efficient deductive database engine , 1994, SIGMOD '94.

[7]  Lee Naish,et al.  Negation and Quantifiers in NU-Prolog , 1986, ICLP.

[8]  Jonas Barklund,et al.  Prolog with arrays and bounded quantifications , 1996, J. Program. Lang..

[9]  Robert A. Kowalski,et al.  Predicate Logic as Programming Language , 1974, IFIP Congress.

[10]  P. Hill,et al.  Extending Gg Odel for Expressing Restricted Quantiications and Arrays , 1995 .

[11]  Victor W. Marek,et al.  Revision Programming , 1998, Theor. Comput. Sci..

[12]  Pascal Van Hentenryck.  The OPL optimization programming language , 1999 .

[13]  Krzysztof R. Apt,et al.  UvA-DARE ( Digital Academic Repository ) Arrays , Bounded Quantification and Iteration in Logic and Constraint Logic Programming , 2003 .

[14]  Gottlob Frege,et al.  Begriffsschrift, eine der arithmetischen nachgebildete Formelsprache des reinen Denkens , 1879 .

[15]  Sergio Greco,et al.  Programming with non-determinism in deductive databases , 2004, Annals of Mathematics and Artificial Intelligence.

[16]  Bjarne Stroustrup,et al.  C++ : programovací jazyk : The C++ programming language (Orig.) , 1997 .

[17]  Michael Kifer,et al.  A logic for reasoning with inconsistency , 1992, Journal of Automated Reasoning.

[18]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[19]  Francesco Scarcello,et al.  Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation , 1997, Inf. Comput..

[20]  Philip Wadler,et al.  Deforestation: Transforming Programs to Eliminate Trees , 1988, Theoretical Computer Science.

[21]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[22]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.