SearchBrowse

close this section of the libraryftp://duck.dfki.uni-sb.de (227)
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/LR-53.ps.Z, 19911125
LILOG Report 53, October 1988, IBM Deutschland, Stuttgart, Germany Definite Relations over Constraint Languages Markus H ohfeldy and Gert Smolkaz y FB Informatik, Universit at Kaiserslautern, West Germany z WT LILOG, IBM Deutschland, West Germany
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/LR-33.ps.Z, 19911211
A Feature Logic with Subsorts Gert Smolka German Research Center for Artificial Intelligence and Universitat des Saarlandes Stuhlsatzenhausweg 3, 6600 Saarbrucken 11, Germany smolka@dfki.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/PhD-Treinen.ps.Z, 19911220
Modulare Datentypdefinitionen und ihre Beziehungen zur Logik erster Stufe Dissertation zur Erlangung des Grades des Doktors der Naturwissenschaften der Technischen Fakultat der Universitat des Saarlandes von Ralf Treinen Saarbrucken 1991 Tag des Kolloquiums: 5. Dezember 1991 Vorsitzender: Prof.
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/DFKI-others/RR-91-34.ps.Z, 19920123
On the Computational Complexity of Temporal Projection and some Related Problems y Bernhard Nebel German Research Center for Artificial Intelligence (DFKI) Stuhlsatzenhausweg 3, D-6600 Saarbrucken 11, Germany e-mail: nebel@dfki.uni-sb.de Christer Backstrom Department of Computer and Information
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/DFKI-others/RR-91-11.ps.Z, 19920123
Belief Revision and Default Reasoning: Syntax-Based Approaches Bernhard Nebel German Research Center for Artificial Intelligence (DFKI) Stuhlsatzenhausweg 3 D-6600 Saarbrucken 11, Germany e-mail: nebel@dfki.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/MT-Henz.ps.Z, 19920713
TERM REWRITING IN ASSOCIATIVE COMMUTATIVE THEORIES WITH IDENTITIES a thesis presented by Martin Joachim Henz to The Graduate School in partial fulfillment of the requirements for the degree of master of science in computer science State University of New York at Stony Brook December 1991 State
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/DFKI-others/RR-92-48.ps.Z, 19921215
Plan Modification versus Plan Generation: A Complexity-Theoretic Perspective Bernhard Nebel Jana Koehler German Research Center for Artificial Intelligence (DFKI) Stuhlsatzenhausweg 3, D-6600 Saarbrucken 11, Germany phone: +49 (681) 302-5254/-5259 e-mail: fnebeljkoehlerg@dfki.uni-sb.de November 25,
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/DFKI-others/RR-92-16.ps.Z, 19921215
An Empirical Analysis of Terminological Representation Systems Jochen Heinsohn, Daniel Kudenko, Bernhard Nebel, and Hans-Jurgen Profitlich German Research Center for Artificial Intelligence (DFKI) Stuhlsatzenhausweg 3 W-6600 Saarbrucken, Germany e-mail: hlast namei@dfki.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/DFKI-others/RR-93-03.ps.Z, 19930120
An Empirical Analysis of Optimization Techniques for Terminological Representation Systems or: Making KRIS get a move on Franz Baader, Bernhard Hollunder, Bernhard Nebel, Hans-Jurgen Profitlich German Research Center for AI (DFKI) Stuhlsatzenhausweg 3, 6600 Saarbrucken 11, Germany e-mail: hlast
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/lfp92.ps.gz, 19930318
Parametric Type Classes (Extended Abstract) Kung Chen, Paul Hudak, Martin Odersky Yale University, Department of Computer Science, Box 2158 Yale Station, New Haven, CT 06520 ACM Conf. on LISP and Functional Programming, June 1992
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/DFKI-others/RR-93-11.ps.Z, 19930406
Reasoning about Temporal Relations: A Maximal Tractable Subclass of Allen's Interval Algebra Bernhard Nebel and Hans-Jurgen Burckert German Research Center for Artificial Intelligence (DFKI) Stuhlsatzenhausweg 3, D-6600 Saarbrucken 11, Germany fnebeljhjbg@dfki.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/DFKI-others/RR-91-33.ps.Z, 19930428
Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures Franz Baader DFKI Postfach 2080 6750 Kaiserslautern, Germany baader@dfki.uni-kl.de Klaus U. Schulz CIS (CIS) University Munich, Leopoldstr. 139 8000 Munchen 40, Germany schulz@cis.uni-muenchen.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/DFKI-others/RR-93-10.ps.Z, 19930428
Decidable Reasoning in Terminological Knowledge Representation Systems Martin Buchheit German Research Center for Artificial Intelligence (DFKI) Stuhlsatzenhausweg 3, D-6600 Saarbrucken, Germany e-mail: buchheit@dfki.uni-sb.de Francesco M. Donini, Andrea Schaerf Dipartimento di Informatica e
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/ICLP93WS-Proceedings.ps.Z, 19930622
170 Succi, Marino, Bergamini, Dondina, Vernazza & Colla A. Nair. Compilation of Subset-Logic Programs, December 1988. University of North Carolina at Chapel Hill Master Thesis. E. Schonberg, R. Dewar, A. Grand, S. Liu, and J. Schwartz. Programming by Refinement as Exemplified by the SETL
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/smithT.ps.Z, 19930705
CONSTRAINT-BASED LANGUAGES FOR SCIENTIFIC DATABASE AND MODELING SYSTEMS. Terence R. Smith and Keith Park. 22nd January, 1993. 1 GOAL We focus our attention on the manner in which constraint programming (CP) may serve as a basis for languages that support the modeling and database activities of a large
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/rounds.ps.Z, 19930705
Constraints in Nonmonotonic Reasoning William C. Rounds and Guo-Qiang Zhang Artificial Intelligence Laboratory University of Michigan Ann Arbor, MI 48109 (rounds, gqz)@engin.umich.edu
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/ward.ps.Z, 19930705
Set-based Concurrent Engineering Allen C. Ward Assistant Professor Department of Mechanical Engineering and Applied Mechanics University of Michigan Ann Arbor, MI 48109-2125 alward@um.cc.umich.edu
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/ait-kaci.ps.Z, 19930705
Entailment and Disentailment of Order-Sorted Feature Constraints (Summary) Hassan A t-Kaci Andreas Podelski Digital Equipment Corporation Paris Research Laboratory 85, avenue Victor Hugo 92500 Rueil-Malmaison, France fhak,podelskig@prl.dec.com
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/smithD.ps.Z, 19930705
Synthesis of Constraint Algorithms Douglas R. Smith Kestrel Institute 3260 Hillview Avenue Palo Alto, California 94304 smith@kestrel.edu 1 Introduction Constraint propagation is one of the key operations on constraints in Constraint Programming. In a constraint program, a constraint set partially
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/haridi.ps.Z, 19930705
Concurrent Constraint Programming at SICS with the Andorra Kernel Language (Extended Abstract) Seif Haridi Sverker Janson Johan Montelius Torkel Franz en Per Brand Kent Boortz Bj orn Danielsson Bj orn Carlson Torbj orn Keisu Dan Sahlin Thomas Sj oland SICS, Box 1263, S-164 28 KISTA Tel +46-8-752 15 00,
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/fruehwirth.ps.Z, 19930705
Terminological Reasoning with Constraint Handling Rules Thom Fruhwirth ECRC, Arabellastrasse 17 D-W-8000 Munich 81, Germany thom@ecrc.de Philipp Hanschkey DFKI, Postfach 2080 D-W-6750 Kaiserslautern, Germany hanschke@dfki.uni-kl.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/savor.ps.Z, 19930705
A Real-Time Extension to Logic Programming Based on the Concurrent Constraint Logic Programming Paradigm Tony Savor, Paul Dasiewicz (tsavor@vlsi.uwaterloo.ca, dasiewic@vlsi.uwaterloo.ca) Department of Electrical and Computer Engineering University of Waterloo Waterloo, Ontario, Canada N2L 3G1
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/michaylov.ps.Z, 19930705
Higher-Order Logic Programming as Constraint Logic Programming Spiro Michaylov Department of Computer and Information Science The Ohio State University Columbus, OH 43210-1277, U.S.A. spiro@cis.ohio-state.edu Frank Pfenning School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213-3891,
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/cruz.ps.Z, 19930705
Using a Visual Constraint Language for Data Display Specification Isabel F. Cruz Department of Computer Science Brown University Providence, RI 02912-1910 ifc@cs.brown.edu
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/donikian.ps.Z, 19930705
Constraint Management in a Declarative Design Method for 3D Scene Sketch Modeling St ephane Donikian IRISA Campus de Beaulieu 35042 Rennes Cedex, FRANCE donikian@irisa.fr G erard H egron Ecole des Mines de Nantes 3 rue Marcel Sembat 44049 Nantes cedex 04, FRANCE hegron@emn.fr
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/kasif.ps.Z, 19930705
Local Consistency in Parallel Constraint-Satisfaction Networks Simon Kasif Department of Computer Science The Johns Hopkins University Baltimore, MD 21218 kasif@cs.jhu.edu Arthur L. Delcher Computer Science Department Loyola College in Maryland Baltimore, MD 21210 delcher@loyola.edu
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/major.ps.Z, 19930705
Constraint Satisfaction in Functional Programming Fran cois Major National Center for Biotechnology Information National Library of Medicine National Institutes of Health Bethesda, MD 20894 major@ncbi.nlm.nih.gov Marcel Turcotte and Guy Lapalme D epartement d'Informatique et de Recherche Op erationnelle
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/montanari.ps.Z, 19930705
Constraint Satisfaction, Constraint Programming, and Concurrency Ugo Montanari and Francesca Rossi University of Pisa Computer Science Department Corso Italia 40, 56100 Pisa, Italy fugo,rossig@di.unipi.it
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/zippel.ps.Z, 19930705
A Constraint Based Scientific Programming Language Richard Zippel Cornell University Ithaca, NY 14853 rz@cs.cornell.edu February 15, 1993 Scientific programs tend to be quite large and complex, and their creation is quite error prone. We have been pursuing a program transformation approach to the
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/johnson.ps.Z, 19930705
Memoization in Constraint Logic Programming Mark Johnson Department of Cognitive and Linguistic Sciences, Box 1978 Brown University mj@cs.brown.edu
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/brown.ps.Z, 19930705
Mantha, S. First-order preference theories and their applications. Tech. rep., Dept. of Computer Science, University of Utah, 1992. Reiter, R. A logic for default reasoning. In Readings in Nonmonotonic Reasoning, M. Ginsburg, Ed. Morgan Kaufmann Publishers, Los Altos California 94022, 1987.
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/dube.ps.Z, 19930705
The Geometry in Constraint Logic Programs Thomas Dub e dube@cs.nyu.edu Chee-Keng Yap y yap@cs.nyu.edu Courant Institute of Mathematical Sciences New York University 251 Mercer Street New York, New York, 10012
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/keirouz.ps.Z, 19930705
Exploiting Constraint Dependency Information For Debugging and Explanation Walid T. Keirouz, Glenn A. Kramer, Jahir Pabon Schlumberger Laboratory for Computer Science 8311 North RR 620 PO Box 200015 Austin, TX 78720-0015 fwalid,gak,jahirg@austin.slcs.slb.com
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/fernando.ps.Z, 19930705
A higher-order extension of constraint programming in discourse analysis Tim Fernando Centre for Mathematics and Computer Science P.O. Box 4079, 1009 AB Amsterdam, The Netherlands fernando@cwi.nl
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/mcaloon.ps.Z, 19930705
1 2lp: Linear Programming and Logic Programming Ken McAloon and Carol Tretkoff Logic Based Systems Lab CUNY Graduate Center and Brooklyn College 2900 Bedford Avenue Brooklyn, NY 11210 mcaloon@sci.brooklyn.cuny.edu tretkoff@sci.brooklyn.cuny.edu The 2lp system is a step in the Operatica Program, a
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/fages.ps.Z, 19930705
On the Semantics of Optimization Predicates in CLP languages Fran cois Fages LIENS-CNRS, and LCR Thomson-CSF, Ecole Normale Sup erieure, Domaine de Corbeville, 45 rue d'Ulm, 91404 Orsay Cedex, 75005 Paris, France France. fages@dmi.ens.fr
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/zhang.ps.Z, 19930705
Constraint Programming in Constraint Nets Ying Zhang Department of Computer Science University of British Columbia Vancouver, B.C. Canada V6T 1Z2 zhang@cs.ubc.ca Alan K. Mackworth Department of Computer Science University of British Columbia Vancouver, B.C. Canada V6T 1Z2 mack@cs.ubc.ca
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/sannella.ps.Z, 19930705
The SkyBlue Constraint Solver and Its Applications Michael Sannella Department of Computer Science and Engineering, FR-35 University of Washington Seattle, WA 98195 sannella@cs.washington.edu
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/freuder.ps.Z, 19930705
A Disjunctive Decomposition Control Schema for Constraint Satisfaction* Eugene C. Freuder Paul D. Hubbe Department of Computer Science University of New Hampshire Durham, NH 03824, U.S.A. ecf@cs.unh.edu pdh@cs.unh.edu
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/brodsky.ps.Z, 19930705
Separability of Polyhedra and a New Approach to Spatial Storage (Extended Abstract) Alexander Brodsky Catherine Lassez I.B.M. Thomas J. Watson Research Center P.O. Box 704 Yorktown Heights, NY 10598 Efficient storage and access methods for large amounts of spatial objects are key issues in Geographic
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/gleicher.ps.Z, 19930705
Practical Issues in Graphical Constraints Michael Gleicher School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 gleicher@cs.cmu.edu
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/menezes.ps.Z, 19930705
An Incremental Hierarchical Constraint Solver Francisco Menezes Pedro Barahona (fm@fct.unl.pt) (pb@fct.unl.pt) Departamento de Inform atica, Universidade Nova de Lisboa 2825 Monte da Caparica, PORTUGAL Philippe Codognet (codognet@minos.inria.fr) INRIA-Rocquencourt BP 105, 78153 Le Chesnay, FRANCE
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/imbert.ps.Z, 19930705
Fourier's Elimination: Which to Choose Jean-Louis Imbert1 G.I.A. Parc Scientifique et Technologique de Luminy 163, Avenue de Luminy, case 901 F-13288 Marseille cedex 9 (France) Email: imbert@gia.univ-mrs.fr
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/kuper.ps.Z, 19930705
Aggregation in Constraint Databases (Preliminary Report) Gabriel M. Kuper ECRC Arabellastr. 17 D-8000 Munchen 81 Germany.
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/gao.ps.Z, 19930705
A Powerful Evaluation Strategy For CLP Programs Hong Gao Department of Computer Science State University of New York Stony Brook, NY 11794 gaohong@cs.sunysb.edu David S. Warren Department of Computer Science State University of New York Stony Brook, NY 11794 warren@cs.sunysb.edu
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/older.ps.Z, 19930705
Programming in CLP(BNR) William J. Older Bell Northern Research Computing Research Laboratory PO Box 3511, Station C K1Y 4H7 Ottawa, Ontario, Canada Fr ed eric Benhamou Groupe Intelligence Artificielle Facult e des Sciences de Luminy case 901,163, avenue de Luminy 13288 Marseille Cedex 9 France
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/kirchner.ps.Z, 19930705
Implementing Computational Systems with Constraints Claude Kirchner H el ene Kirchner Marian Vittek INRIA-Lorraine & CRIN 615, rue du Jardin Botanique, BP 101 54602 Villers-les-Nancy Cedex FRANCE E-mail: kirchner@loria.fr, vittek@loria.fr
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/meyers.ps.Z, 19930705
Constraining the Structure and Style of Object-Oriented Programs Scott Meyers Dept. of Computer Science Brown University, Box 1910 Providence, RI 02912 sdm@cs.brown.edu Carolyn K. Duby Cadre Technologies, Inc. 222 Richmond Street Providence, RI 02903 ckd@cadre.com Steven P. Reiss Dept. of Computer
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP93/pai.ps.Z, 19930705
Robot Programming and Constraints Dinesh K. Pai Computer Science Department University of British Columbia pai@cs.ubc.ca
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/sangiorgi/thesis-part1.ps.gz, 19930707
Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms Davide Sangiorgi Doctor of Philosophy University of Edinburgh 1992 graduation date: February 1993
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/sangiorgi/thesis-part4.ps.gz, 19930707
Chapter 6. An Investigation into Functions as Processes 151 with processes which are in a format admissible for R (what is left of Outnhq; qr; T rm1; :::; T rmni is the parallel composition of processes in the same format as the processes Ri of the definition of R ). Case (e) The action comes from an
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/sangiorgi/thesis-part2.ps.gz, 19930707
Chapter 3. Barbed Bisimulation 51 The corresponding of ccs in the weak case, called weak bisimulation, is denoted by ssccs. Both ccs and ssccs are also congruences. For the latter, ssccs is preserved by + because we only allow guarded sums (however Theorem 3.3.2 remains valid if this restriction on sum
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/sangiorgi/thesis-part3.ps.gz, 19930707
Chapter 5. The Representability of HOss in ss-calculus 101 2. the converse, i.e. F ] 0 ! P 00 implies there exists P , s.t. P ! P and P 00 = F ], 0 = F ]. Proof: Another easy induction on the structure of P , both for (1) and for (2). Again, we consider the most significant cases. ffl P =
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/RR-1778.ps.gz, 19930713
UNIT E DE RECHERCHE INRIA-ROCQUENCOURT Institut National de Recherche en Informatique et en Automatique Domaine de Voluceau Rocquencourt B.P. 105 78153 Le Chesnay Cedex France T el.:(1)39 63 55 11 Rapports de Recherche Nffi1778 Programme 2 Calcul symbolique, Programmation et G enie logiciel POLYMORPHIC
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/ECRC-92-16.ps.gz, 19930715
technical report ECRC 92 16 A Distributed Protocol for Channel-Based Communication with Choice Frederick Knabe EUROPEAN COMPUTER-INDUSTRY RESEARCH CENTRE ECRC GMBH, ARABELLASTR. 17 D-8000 MUNCHEN 81, GERMANY - TEL +49 89/926 99 - FAX 926 99 170 - TLX 521 6910 c European Computer-Industry Research
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/ECRC-92-32.ps.gz, 19930715
technical report ECRC{92{32 Some Issues in the Semantics of Facile Distributed Programming Bent Thomsen, Lone Leth & Alessandro Giacalone EUROPEAN COMPUTER-INDUSTRY RESEARCH CENTRE ECRC GMBH, ARABELLASTR. 17 D-8000 MUNCHEN 81, GERMANY - TEL +49 89/926 99 - FAX 926 99 170 - TLX 521 6910 c European
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/DFKI-others/UnificationTheory.ps.Z, 19930716
To appear in D.M. Gabbay, C.J. Hogger, and J.A. Robinson (ed.) Handbook of Logic in Artificial Intelligence and Logic Programming, Oxford University Press. Unification Theory Franz Baader and Jorg H. Siekmann German Research Center for AI (DFKI) and Universitat des Saarlandes Stuhlsatzenhausweg 3
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/PhD-Smolka.ps.Z, 19930726
Logic Programming over Polymorphically Order-Sorted Types Gert Smolka German Research Center for Artificial Intelligence (DFKI) Stuhlsatzenhausweg 3, 66123 Saarbrucken, Germany smolka@dfki.uni-sb.de Dissertation Fachbereich Informatik Universitat Kaiserslautern Kaiserslautern Germany 3 May 1989 At the
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/INRIA_RR_1831_93.ps.gz, 19930802
The Compilation of >=Prolog and its Execution with MALI1 Pascal Brisset IRISA | Olivier Ridoux IRISA/INRIA fbrisset; ridouxg@irisa.fr Abstract | We present a compiled implementation of >=Prolog that uses the abstract memory MALI for representing the execution state. >=Prolog is a logic programming
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/93actors.ps.gz, 19930805
A Foundation for Actor Computation Gul Agha University of Illinois agha@cs.uiuc.edu Ian A. Mason Stanford University iam@cs.stanford.edu Scott Smith Johns Hopkins University scott@cs.jhu.edu Carolyn Talcott Stanford University clt@sail.stanford.edu
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/inheritance-anomaly.ps.gz, 19930809
Analysis of Inheritance Anomaly in Object-Oriented Concurrent Programming Languages | Draft: Not for Wide Distribution | Satoshi Matsuoka and Akinori Yonezaway Department of Information Science, The University of Tokyo
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/gcsurvey.ps.gz, 19930916
Uniprocessor Garbage Collection Techniques Paul R. Wilson University of Texas Austin, Texas 78712-1188 USA (wilson@cs.utexas.edu)
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/tr93-04.ps.gz, 19931021
Concurrent Constraint Logic Programming on Massively Parallel SIMD Computers Bo-Ming Tong and Ho-Fung Leung Department of Computer Science The Chinese University of Hong Kong Shatin, New Territories Hong Kong email: bmtong@cuhk.hk, lhf@cuhk.hk Technical Report CS-TR-93/04 July 8, 1993
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/TEL-Report.ps.Z, 19931022
SEKI Report SR-87-11, Universitat Kaiserslautern, West Germany, February 1988 TEL (Version 0.9) Report and User Manual Gert Smolka FB Informatik, Universitat Kaiserslautern 6750 Kaiserslautern, West Germany smolka@uklirb.uucp
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/RobinMilner/pas.ps.gz, 19931104
Action Structures for the ss-Calculus Robin Milner Laboratory for Foundations of Computer Science, Computer Science Department, University of Edinburgh, The King's Buildings, Edinburgh EH9 3JZ, UK May 1993
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/RobinMilner/ppi.ps.gz, 19931104
The Polyadic ss-Calculus: a Tutorial Robin Milner Laboratory for Foundations of Computer Science, Computer Science Department, University of Edinburgh, The King's Buildings, Edinburgh EH9 3JZ, UK October 1991
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/RobinMilner/ac2.ps.gz, 19931104
Action Calculi II : ss-nets with boxes and replication Robin Milner Edinburgh, June 1993 1 Introduction This note explores and develops, in an informal way, the graphical presentation 1 of the action calculus PIC(box,rep) for the ss-calculus which was introduced in . The purpose is to get experience
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/RobinMilner/as.ps.gz, 19931104
Action Structures Robin Milner Laboratory for Foundations of Computer Science, Computer Science Department, University of Edinburgh, The King's Buildings, Edinburgh EH9 3JZ, UK December 1992
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/RobinMilner/spas.ps.gz, 19931104
An Action Structure for Synchronous ss-Calculus Robin Milner Laboratory for Foundations of Computer Science Computer Science Department, University of Edinburgh The King's Buildings, Edinburgh EH9 3JZ, UK
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/RobinMilner/ac3.ps.gz, 19931104
Action Calculi III : Higher-order Calculi Robin Milner Edinburgh, October 1993 THIRD DRAFT. PLEASE DO NOT REFERENCE 1 1 Introduction This paper extends an arbitrary action calculus to higher order, in a way which parallels the extension of the ss-calculus to higher order by Sangiorgi .
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/RobinMilner/ac1.ps.gz, 19931104
Action Calculi I: Axioms and Applications Robin Milner Edinburgh, June 1993
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/state.ps.gz, 19931110
Lazy Functional State Threads John Launchbury and Simon L Peyton Jones University of Glasgow Email: {simonpj,jl}@dcs.glasgow.ac.uk. Phone: +44-41-330-4500 November 8, 1993
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/pcn_prog_v2.0.ps.gz, 19931115
Parallel Programming with PCN Ian Foster Steven Tuecke Version 2.0: January 15, 1993 ARGONNENATIONALLABORATORYUNIVERSITYOFCHICAGO PCN is a system for developing and executing parallel programs. It comprises a high-level programming language, tools for developing and debugging programs in this language,
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PhD-Network/workshops/WSReport.92.ps.gz, 19931116
2nd European Workshop for PhD Students in Object-Oriented Systems Pieter Jan Morssink(1) Jan Overbeck(2) (eds.) (1) Department for Computer Science Leiden University email: MORSSINK@rulcri.LeidenUniv.nl (2) Department for Information Systems Technical University Vienna email:
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PhD-Network/workshops/WSReport.93.ps.gz, 19931116
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/state.a4.ps.gz, 19931119
Mutable Object State for Object-Oriented Logic Programming: A Survey Technical Report TR 93-15 Vladimir Alexievy Department of Computing Science, University of Alberta 615 GSB, Edmonton, Alberta T6G 2H1 email: vladimir@cs.ualberta.ca 16 August 1993
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/CAAP93.ps.Z, 19931126
Feature Automata and Recognizable Sets of Feature Trees Joachim Niehren German Research Center for Artificial Intelligence (DFKI) Stuhlsatzenhausweg 3 6600 Saarbrucken 11, Germany niehren@dfki.uni-sb.de Andreas Podelski Digital Equipment Corporation Paris Research Laboratory (PRL) 85, Avenue Victor
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/Erlang/bifs.ps.gz, 19931129
Erlang BIF Guide Version 3.2 J. L. Armstrong S. R. Virding M. C. Williams 12 December 1991 Copyright c 1991, Ellemtel Utvecklings AB Preface About the BIF Guide The Erlang BIF Guide contains descriptions of Erlang 's built in functions (BIF's). Warning The BIF Guide is an evolving document and
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/Erlang/iss90.ps.gz, 19931129
ERLANG - AN EXPERIMENTAL TELEPHONY PROGRAMMING LANGUAGE g C J. L. Armstrong and S.R.Virdin omputer Science Laboratory, Ellemtel Utvecklings AB W
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/Erlang/iss92_1.ps.gz, 19931129
REFERENCIES A SWITCHING SOFTWARE ARCHITECTURE PROTOTYPE USING REAL TIME DECLARTIVE LANGUAGE 7 of 7 7 REFERENCIES CCITT I.130 Method for characterisation of telecommunication services CCITT Q.65 Detailed description of Stage 2 CCITT I.310 ISDN Network Functional Principles Experiments
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/Erlang/guide.ps.gz, 19931129
Erlang User's Guide & Reference Manual Version 3.2 J. L. Armstrong S. R. Virding M. C. Williams 12 December 1991 Copyright c 1991, Ellemtel Utvecklings AB Preface About This Document The Erlang user guide and reference manual contains enough information for you to write and run simple Erlang programs.
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/Erlang/asn1.doc.2.2.ps.gz, 19931129
The ASN.1=)Erlang compiler User Manual Version 2.2 Claes Wikstrom Computer Science Laboratory Ellemtel Telecommunications Systems Laboratory Box 1505 S - 125 25 Alvsjo Sweden klacke@erix.ericsson.se 4 August 1992 1 Contents 1 Introduction 4 2 About Erlang 4 2.1 Data types : : : : : : : : : : : : : :
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/Erlang/implem.ps.gz, 19931129
Published in SETSS 92, 30th March to 1st April 1992, Florence L T IMPLEMENTING A FUNCTIONAL LANGUAGE FOR HIGHLY PARALLEL REA IME APPLICATIONS J. L. Armstrong, B. O. Da..cker, S. R. Virding and M. C. Williams I Computer Science Laboratory, Ellemtel Utvecklings AB ntroduction This paper describes a fast,
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/Erlang/contract.ps.gz, 19931129
Erlang Software Agreement April 8, 1993 Agreement between: 1 The Computer Science Laboratory of ELLEMTEL Utvecklings AB, Box 1505, 125 25 Alvsjo, Sweden, hereinafter called ELLEMTEL; and 2 hereinafter called THE USER Background ELLEMTEL has worked for several years with the definition and
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/Erlang/asn1_to_erlang-paper.ps.gz, 19931129
Conclusions We believe that declarative programming techniques are well suited for programming ASN.1 type applications. The advantages stem from: Small semantic gap between ASN.1 and it s representation in the declarative language. High abstraction level at the declaration layer. The programmer at the
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/Erlang/sdl2erlang.ps.gz, 19931129
1 Automatic code generation from SDL to a declarative programming language Magnus W Froberga b aComputer Science Laboratory, Ellemtel Utvecklings AB, Box 1505, S - 125 25 Alvsjo, Sweden bPublished in SDL '93, Proceedings of the 6th SDL-Forum : Edited by A. Sarma and O. Faergemand This paper describes
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/Erlang/prac_appl_prolog.ps.gz, 19931129
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 -
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/Erlang/hype.ps.gz, 19931129
The Erlang 3.2 Release The Erlang Development Group 920601 Summary Erlang is a programming language for building robust concurrent systems. Erlang is especially suited for rapid prototyping. Prototypes can be built in a fraction of the time it takes using conventional imperative languages. Erlang
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/Erlang/Erlang_to_C.ps.gz, 19931129
Bogumi l Hausman Computer Science Laboratory Ellemtel Telecommunications Systems Laboratories ox 1505, S-125 25 Alvs o, Sweden email: bogdan erix.ericsson.se b a . Erlang is a concurrent programming language designed for prototyping and implementing reliable real-time systems. n its design Erlang
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/RR-93-09.ps.Z, 19931206
Deutsches Forschungszentrum f ur K unstliche Intelligenz GmbH Research Report RR-93-09 Satisfiability of the Smallest Binary Program Philipp Hanschke, J org W urtz February 1993 Deutsches Forschungszentrum f ur K unstliche Intelligenz GmbH Postfach 20 80 67608 Kaiserslautern, FRG Tel.: + 49 (631)
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/RR-92-22.ps.Z, 19931206
Deutsches Forschungszentrum f ur K unstliche Intelligenz GmbH Research Report RR-92-22 Unifying Cycles J org W urtz March 1992 Deutsches Forschungszentrum f ur K unstliche Intelligenz GmbH Postfach 20 80 67608 Kaiserslautern, FRG Tel.: + 49 (631) 205-3211 Fax: + 49 (631) 205-3210 Stuhlsatzenhausweg 3
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/CADE92-Wuertz.ps.Z, 19931206
Appeared in the Proceedings of the 11th International Conference on Automated Deduction 1992 Cycle Unification Wolfgang Bibel , Steffen Holldobler , Jorg Wurtzy
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/lazy-imperative-programming.ps.gz, 19931213
Lazy Imperative Programming John Launchbury Computing Science Department Glasgow University jl@dcs.glasgow.ac.uk
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/odersky-popl94.ps.gz, 19931215
A Functional Theory of Local Names Martin Odersky Universitat Karlsruhe 76128 Karlsruhe, Germany odersky@ira.uka.de 21st ACM Symposium on Principles of Programming Languages, January 1994
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/linear-dfs.ps.gz, 19931215
Lazy Depth-First Search and Linear Graph Algorithms in Haskell David J. King John Launchbury Department of Computing Science University of Glasgow {gnik, jl}@dcs.glasgow.ac.uk
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/RR-1004.ps.gz, 19931217
Composing monads Mark P. Jones Yale University New Haven, CT, U.S.A. jones-mark@cs.yale.edu Luc Duponcheel Alcatel Bell Telephone Antwerp, Belgium ldup@ra.alcbel.be Research Report YALEU/DCS/RR-1004, December 1993
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/DA-Mehl.ps.Z, 19931219
Diplomarbeit Nichtmonotone Aspekte des fallbasierten Schliessens und deren Fundierung in Default-Logik mit Prioritaten Michael Mehl 15. Juni 1992 Betreuung: Prof. Dr. Michael M. Richter AG Kunstliche Intelligenz { Expertensysteme Universitat Kaiserslautern Erklarung Hiermit erklare ich, dass ich
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/MFCS93.ps.Z, 19931220
Feature Constraints with First-Class Features Ralf Treinen German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, 66123 Saarbrucken, Germany, email: treinen@dfki.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/JSC-Treinen92.ps.Z, 19931220
J. Symbolic Computation (1992) 14, 437{457 A New Method for Undecidability Proofs of First Order Theories RALF TREINEN DFKI, Stuhlsatzenhausweg 3, W6600 Saarbrucken, Germany (Received 21 March 1991) We claim that the reduction of Post's Correspondence Problem to the decision problem of a theory
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/LL-53.ps.Z, 19931220
LILOG Report 53, October 1988, IBM Deutschland, Stuttgart, Germany Definite Relations over Constraint Languages Markus Hohfeldy and Gert Smolkaz y FB Informatik, Universitat Kaiserslautern, West Germany z WT LILOG, IBM Deutschland, West Germany
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/A-01-91.ps.Z, 19931221
First Order Data Types and First Order Logic by Ralf Treinen A 01/91 Saarbrucken, Januar 1991
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/FeatureNegationUncertainty.ps.Z, 19931228
On the Expressivity of Feature Logics with Negation, Functional Uncertainty, and Sort Equations Franz Baader, Hans-Jurgen Burckert, Bernhard Nebel, Werner Nutt, and Gert Smolka German Research Center for Artificial Intelligence Saarbrucken, Germany
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/FeatureConstraintLog.ps.Z, 19931228
Feature Constraint Logics for Unification Grammars Gert Smolka German Research Center for Artificial Intelligence and Universitat des Saarlandes Stuhlsatzenhausweg 3, D-66123 Saarbrucken, Germany smolka@dfki.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/ResiduationGuardedRules.ps.Z, 19931228
Residuation and Guarded Rules for Chapter 22 in: Constraint Logic Programming: Selected Research, Fr ed eric Benhamou and Alain Colmerauer, eds., The MIT Press, 1993, pp. 405--419. Previous version as DFKI Research Report RR-91-13 Constraint Logic Programming Gert Smolka German Research Center for
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/li.ps.gz, 19940105
University of Alberta TR93-18 Applications of Linear Logic to Computation: An Overview Vladimir Alexievy University of Alberta email:vladimir@cs.ualberta.ca December 30, 1993
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/woggles-summary.ps.gz, 19940111
Woggles from Oz: Writing Interactive Fiction Benjamin C. Pierce November 16, 1993 The term interactive fiction" describes any artifact | book, theater script, image, automaton, or computer program | allowing a reader to make choices that determine the unfolding of a story. Adventure, a textual computer
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/woggles.ps.gz, 19940111
Woggles from Oz: Writing Interactive Fiction (Full Version) Benjamin C. Pierce November 16, 1993 A summary of this article will appear in the reviews section of Leonardo: Journal of the International Society for the Arts, Sciences, and Technology, 1994. The term interactive fiction" describes any
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/RR-91-15.ps.Z, 19940111
Attributive Description Formalisms : : : and the Rest of the World Published in O. Herzog, C. Rollinger (eds.), Textunderstanding in LILOG: Integrating Computational Linguistics and Artificial Intelligence, p. 439{452. Springer-Verlag, Berlin, Heidelberg, New York, 1991. Bernhard Nebel and Gert Smolka
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/CS-R9402.ps.gz, 19940118
Logic Programming and Negation: A Survey Krzysztof R. Apt CWI P.O. Box 94079, 1090 GB Amsterdam, The Netherlands and Faculty of Mathematics and Computer Science University of Amsterdam, Plantage Muidergracht 24 1018 TV Amsterdam, The Netherlands Roland Bol Department of Mathematics and Computer Science
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/found-impl-clp.ps.gz, 19940126
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
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/pict-tutorial.ps.gz, 19940201
Programming in the Pi-Calculus An Experiment in Language Design PICT Version 3.3 Benjamin C. Pierce Department of Computer Science University of Edinburgh The King's Buildings Edinburgh, EH9 3JZ United Kingdom bcp@dcs.ed.ac.uk Draft of February 1, 1994 Contents 1 First Steps 4 1.1 Simple Processes : : :
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/pilang.ps.gz, 19940203
A Typed Higher-Order Programming Language Based on the Pi-Calculus Benjamin C. Pierce LFCS, Edinburgh Didier R emy INRIA-Roquencourt David N. Turner LFCS, Edinburgh July 17, 1993
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PrimObj.ps.gz, 19940224
February 10, 1994 7:40 AM Page 1 A Theory of Primitive Objects Mart n Abadi and Luca Cardelli Digital Equipment Corporation, Systems Research Center
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/RR-93-14.ps.Z, 19940228
Deutsches Forschungszentrum f ur K unstliche Intelligenz GmbH Research Report RR-93-14 Equational and Membership Constraints for Infinite Trees Joachim Niehren, Andreas Podelski, Ralf Treinen April 1993 Deutsches Forschungszentrum f ur K unstliche Intelligenz GmbH Postfach 20 80 67608 Kaiserslautern,
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/RR-94-03.ps.Z, 19940301
Deutsches Forschungszentrum f ur K unstliche Intelligenz GmbH Research Report RR-94-03 A Calculus for Higher-order Concurrent Constraint Programming with Deep Guards Gert Smolka February 1994 Deutsches Forschungszentrum f ur K unstliche Intelligenz GmbH Postfach 20 80 67608 Kaiserslautern, FRG Tel.: +
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/RR-92-17.ps.Z, 19940314
Deutsches Forschungszentrum f ur K unstliche Intelligenz GmbH Research Report RR-92-17 A Feature-based Constraint System for Logic Programming with Entailment Hassan A t-Kaci, Andreas Podelski, Gert Smolka March 1992 Deutsches Forschungszentrum f ur K unstliche Intelligenz GmbH Postfach 20 80 67608
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP94/heintze.ps.Z, 19940414
Set Constraints and Set-Based Analysis Nevin Heintze and Joxan Jaffary May 1994 1 Introduction Set expressions over a signature of function symbols are a natural representation of sets of elements constructed from , and set constraints express basic relationships between these sets. In the literature,
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP94/hermenegildo.ps.Z, 19940414
Towards CIAO-Prolog - A Parallel Concurrent Constraint System M. Hermenegildo Facultad de Inform atica Universidad Polit ecnica de Madrid (UPM) 28660-Boadilla del Monte, Madrid, Spain herme@fi.upm.es 1 Introduction We present an informal discussion on some methodological aspects regarding the efficient
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP94/baudinet.ps.Z, 19940414
Constraint-Generating Dependencies Marianne Baudinet Universit e Libre de Bruxelles Jan Chomicki Kansas State Universityy Pierre Wolper Universit e de Li egez
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP94/koubarakis.ps.Z, 19940414
Foundations of Indefinite Constraint Databases Manolis Koubarakis IC-Parc Imperial College London SW7 2BZ United Kingdom msk@doc.ic.ac.uk March 24, 1994
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP94/sannella.ps.Z, 19940414
Analyzing and Debugging Hierarchies of Multi-Way Local Propagation Constraints Michael Sannella Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 sannella@cs.washington.edu April 1, 1994
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP94/pesant.ps.Z, 19940414
QUAD-CLP(R) : ADDING THE POWER OF QUADRATIC CONSTRAINTS GILLES PESANT AND MICHEL BOYER
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP94/srivastava-ross.ps.Z, 19940414
Foundations of Aggregation Constraints Divesh Srivastava AT&T Bell Laboratories divesh@research.att.com Kenneth A. Rossy Columbia University kar@cs.columbia.edu Peter J. Stuckey University of Melbourne pjs@cs.mu.oz.au S. Sudarshan AT&T Bell Laboratories sudarsha@research.att.com 1 Introduction Database
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP94/pugh.ps.Z, 19940414
Experiences with Constraint-based Array Dependence Analysis William Pugh David Wonnacott pugh@cs.umd.edu davew@cs.umd.edu Dept. of Computer Science Univ. of Maryland, College Park, MD 20742 April 2, 1994 1 Introduction When two memory accesses refer to the same address, and at least one of those
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP94/srivastava-ramakrishnan.ps.Z, 19940414
Constraint Objects Divesh Srivastava AT&T Bell Laboratories divesh@research.att.com Raghu Ramakrishnany University of Wisconsin, Madison raghu@cs.wisc.edu Peter Z. Reveszz University of Nebraska, Lincoln revesz@cse.unl.edu 1 Introduction Object-oriented database (OODB) systems will, most probably, have
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP94/montanari-rossi-bueno.ps.Z, 19940414
Towards a Concurrent Semantics based Analysis of CC and CLP U. Montanari F. Rossi ugo@di.unipi.it rossi@di.unipi.it Universit a di Pisa F. Bueno M. Garc a de la Banda M. Hermenegildo bueno@fi.upm.es maria@fi.upm.es herme@fi.upm.es Universidad Polit ecnica de Madrid (UPM) 1 Introduction We present in an
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP94/sabin.ps.Z, 19940414
Contradicting Conventional Wisdom in Constraint Satisfaction Daniel Sabin1 and Eugene C. Freuder2
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP94/aiken.ps.Z, 19940414
Set Constraints: Results, Applications and Future Directions Alexander Aiken Computer Science Division University of California, Berkeley Berkeley, CA 94702 aiken@cs.berkeley.edu
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP94/benhamou.ps.Z, 19940414
Study of symmetry in Constraint Satisfaction Problems Belaid Benhamou URA CNRS 1787 - Universit e de Provence, 3,Place Victor Hugo - F13331 Marseille cedex 3, France phone number : 91.10.61.08 e-mail : Benhamou@gyptis.univ-mrs.fr
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP94/thennarangam.ps.Z, 19940414
Inferring 3-dimensional constraints with DEVI Suresh Thennarangam suresh@iss.nus.sg Institute of Systems Science National University of Singapore, Heng Mui Keng terrace, Singapore 0511 Gurminder Singh gsingh@iss.nus.sg Institute of Systems Science National University of Singapore, Heng Mui Keng terrace,
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP94/haroud.ps.Z, 19940414
Global Consistency for Continuous Constraints1 Djamila Haroud, Boi Faltings Artificial Intelligence Laboratory (LIA) Swiss Federal Institute of Technology (EPFL) IN-Ecublens, 1015 Lausanne, Switzerland FAX: +41-21-693-5225, e-mail: haroud@lia.di.epfl.ch
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/PPCP94/rajasekar.ps.Z, 19940414
Applications in Constraint Logic Programming with Strings Arcot Rajasekar Computer Science Department University of Kentucky, Lexington, KY 40506
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/RR-94-12.ps.Z, 19940415
Deutsches Forschungszentrum f ur K unstliche Intelligenz GmbH Research Report RR-94-12 Ordering Constraints on Trees Hubert Comon and Ralf Treinen March 1994 Deutsches Forschungszentrum f ur K unstliche Intelligenz GmbH Postfach 20 80 67608 Kaiserslautern, FRG Tel.: + 49 (631) 205-3211 Fax: + 49 (631)
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/acclaim-bulletin.ps.gz, 19940505
ACCLAIM, Advanced Concurrent Constraint Languages: Application, Implementation, and Methodology ESPRIT Basic Research Project 7195 Project period: September 1, 1992 { August 31, 1995 Edited by Khayri M. Ali Swedish Institute of Computer Science Box 1263, S-164 28 KISTA, Sweden Tel +46/8 752 15 00, Fax
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/RecordsLogProg.ps.Z, 19940513
Records for Logic Programming Gert Smolka and Ralf Treinen German Research Center for Artificial Intelligence (DFKI) Stuhlsatzenhausweg 3, D 66123 Saarbrucken, Germany fsmolka, treineng@dfki.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/RR-94-16.ps.Z, 19940609
Deutsches Forschungszentrum f ur K unstliche Intelligenz GmbH Research Report RR-94-16 A Foundation for Higher-order Concurrent Constraint Programming Gert Smolka June 1994 Deutsches Forschungszentrum f ur K unstliche Intelligenz GmbH Postfach 20 80 67608 Kaiserslautern, FRG Tel.: + 49 (631) 205-3211
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/DFKI-others/RR-93-17.ps.Z, 19940613
Deutsches Forschungszentrum f ur K unstliche Intelligenz GmbH Research Report RR-93-17 Regular Path Expressions in Feature Logic Rolf Backofen May 1993 Deutsches Forschungszentrum f ur K unstliche Intelligenz GmbH Postfach 20 80 67608 Kaiserslautern, FRG Tel.: + 49 (631) 205-3211 Fax: + 49 (631)
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/DFKI-others/Terminological-Logics.ps.Z, 19940617
Terminologische Logiken Franz Baader, Hans-J urgen B urckert Bernhard Hollunder, Armin Laux, Werner Nutt Deutsches Forschungszentrum f ur K unstliche Intelligenz (DFKI) Stuhlsatzenhausweg 3 W-6600 Saarbr ucken 11 e-mail: hNachnamei@dfki.uni-sb.de Zusammenfassung Terminologische Wissensrepr
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/RR-2276.ps.gz, 19940624
ISSN 0249-6399apport de recherchefl1994 INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Observing distribution in processes: static and dynamic localities Ilaria Castellani N 2276 Mai 1994 PROGRAMME 2 Calcul symbolique, programmation et ge nie logiciel Observing distribution in
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/ECOOP94W4/02.ps.Z, 19940630
Reasoning About Concurrent Objects Jean Paul Bahsoun, Stephan Merz, Corinne Servieres bahsoun,merz, serviere@irit.fr IRIT, 118 route Narbonne 31062 Toulouse cedex France phone: (33) 61 558211 fax: (33) 61 558325 Actions, agents and systems The underlying metaphor of object orientation is that of largely
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/ECOOP94W4/04.ps.Z, 19940630
Towards a Semantics of Emerald Expressed in Map Theory Klaus Grue May 16, 1994
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/ECOOP94W4/05.ps.Z, 19940630
Object-Oriented Database Programming Languages Founded on an Axiomatic Theory of Objects Alvaro A.A. Fernandes, M. Howard Williams, Norman W. Paton, Maria L. Barja, Andrew Dinn Department of Computing and Electrical Engineering Heriot-Watt University Riccarton, Edinburgh EH14 4AS, Scotland, UK Position
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/ECOOP94W4/13.ps.Z, 19940630
Full late-binding and Objects as Records. Position paper for the LFOOP Workshop. Fran cois BOULADOUX May 30, 1994 From the begining of the century, one has tried to find in logic the fundation of, as a begining, mathematics, then computer science. I am not sure that we will manage to find a fundation of
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/ECOOP94W4/12.ps.Z, 19940630
Temporal Logic Foundations of Typed, Declarative Object-Oriented Languages S. Alagi c and A. Radiya Department of Computer Science Wichita State University, 1845 Fairmount Avenue Wichita, Kansas 67260-0083, USA Phone: (316) 689-3915, Fax: (316) 689-3984 E-mail: falagic, radiyag@cs.twsu.edu
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/ECOOP94W4/09.ps.Z, 19940630
Towards a Logical Theory of ADVs P. S. C. Alencar L. M. F. Carneiro-Coffin y D.D. Cowan z C.J.P. Lucena x
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/ECOOP94W4/03.ps.Z, 19940630
Object-Orientation in Programming with Type Specifications: Short Position Paper Tarmo Uustalu Dept of Teleinformatics, The Royal Institute of Technology Electrum 204, S-164 40 Kista, Sweden email tarmo@it.kth.se fax +46 8 751 1793 Submission to ECOOP'94 Workshop on Logical Foundations of OOP 5 May 1994
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/ECOOP94W4/01.ps.Z, 19940630
Towards a Declarative Type Theory Arno Puder Department of Computer Science University of Frankfurt P.O.Box 11 19 32 D-60054 Frankfurt Germany puder@informatik.uni-frankfurt.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/ECOOP94W4/15.ps.Z, 19940630
Formalizing coordination mechanisms for a language with objects-as-multisets Stefania Castellani1 and Paolo Ciancarini University of Bologna, Italy E-mail: fscastell,ciancag@cs.unibo.it Remo Pareschi Rank Xerox Research Centre, Grenoble, France E-mail: fPareschig@xerox.fr
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/ECOOP94W4/11.ps.Z, 19940630
State Change and Communication by Extending Unification F.J. Dur an E. Pimentel J.M. Troya Dep. de Lenguajes y Ciencias de la Computaci on Pza. El Ejido, 29014 M alaga, Spain fpimentel,troyag@ctima.uma.es
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/ECOOP94W4/08.ps.Z, 19940630
Objects in Higher-order ConcurrentConstraintPrograming with State Martin Henz and Gert Smolka German Research Center for Artificial Intelligence (DFKI) Stuhlsatzenhausweg 3, D{66123 Saarbrucken, Germany fhenz,smolkag@dfki.uni-sb.de Fax: +49 681 302-5341, Phone: +49 681 302-5311
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/ECOOP94W4/16.ps.Z, 19940630
Who is who We have a small research group in Artware s.r.l. (Rome, Italy), a firm specialized on the network environment (WAN and LAN), especially on very mixed and distributed architectures. Actually, we are working on a mailbox system (mbx for short) to extend the Prolog language. This is the first
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/tr-100.ps.gz, 19940704
EIDGENOSSISCHE TECHNISCHE HOCHSCHULE LAUSANNE POLITECNICO FEDERALE DI LOSANNA SWISS FEDERAL INSTITUTE OF TECHNOLOGY LAUSANNE DEPARTMENT OF COMPUTER SCIENCE COMPUTER SCIENCE THEORY LABORATORY COLEPOLYTECHNIQUEF D RALEDELAUSANNE A Survey on Minimax Trees and Associated Algorithms Claude G. Diderich and
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/DFKI-others/PossLog.ps, 19940722
An Alternative Proof Method for Possibilistic Logic and its Application to Terminological Logics In R. Lopez de Mantaras and D. Poole, editors, Tenth Annual Conference on Uncertainty in Artificial Intelligence, July 29 { 31, 1994, Seattle, Washington. Bernhard Hollunder German Research Center for
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/andorra-i-design.ps.gz, 19940810
ESPRIT Project 2471 PEPMA Parallel Execution of Prolog on Multiprocessor Architectures Design of the Andorra-I System Rong Yang, In^es Dutra and V tor Santos Costa Department of Computer Science University of Bristol Bristol BS8 1TR, U.K. January 1991 Contents 1 Introduction 1 1.1 The Basic Andorra
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/id_implementation_overview.ps.gz, 19940816
A Multithreaded Implementation of Id using P-RISC Graphs Rishiyur S. Nikhil Digital Equipment Corporation, Cambridge Research Laboratory One Kendall Square, Building 700, Cambridge MA 02139, USA Email: nikhil@crl.dec.com
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/RR-94-20.ps.Z, 19940816
Deutsches Forschungszentrum f ur K unstliche Intelligenz GmbH Research Report RR-94-20 Encapsulated Search and Constraint Programming in Oz Christian Schulte, Gert Smolka, J org W urtz August 1994 Deutsches Forschungszentrum f ur K unstliche Intelligenz GmbH Postfach 20 80 67608 Kaiserslautern, FRG
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/id_general_overview.ps.gz, 19940816
An Overview of the Parallel Language Id (a foundation for pH, a parallel dialect of Haskell) Rishiyur S. Nikhil Digital Equipment Corporation Cambridge Research Laboratory SUBMITTED FOR PUBLICATION: PLEASE DO NOT COPY OR DISTRIBUTE
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/visual-haskell.ps.gz, 19940905
Visual Haskell: A First Attempt H. John Reekie School of Electrical Engineering University of Technology, Sydney email: johnr@ee.uts.edu.au
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/RhoCCL94.ps.Z, 19941005
A Confluent Relational Calculus for Higher-Order Programming with Constraints Joachim Niehren Gert Smolka Programming Systems Lab German Research Center for Artificial Intelligence (DFKI) Stuhlsatzenhausweg 3, D-66123 Saarbrucken, Germany fniehren,smolkag@dfki.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/stacs94.ps.Z, 19941104
Appeared in the Proceedings of the Symposium on Theoretical Aspects of Computer Science, February 1994, Springer-Verlag LNCS 775, pp. 21{32 One Binary Horn Clause is Enough Philippe Devienne, Patrick Leb egue, Jean{Christophe Routier Laboratoire d'Informatique Fondamentale de Lille { CNRS UA 369
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/alliclp.ps.Z, 19941104
Appeared in the Proceedings of the Post-conference workshop at ICLP: Verification and analaysis of (concurrent) logic languages, June 1994, eds. F.S. de Boer and M. Gabbrielli, pp. 87{107 Towards the Verification of Concurrent Constraint Programs in Finite Domain Reasoning Jorg Wurtz German Research
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/dtccp-pub.ps.gz, 19941107
Default Timed Concurrent Constraint Programming Vijay A. Saraswat Radha Jagadeesan Vineet Gupta Systems and Practices Lab. Dept. of Math. Sciences Systems and Practices Lab. Xerox PARC Loyola University Xerox PARC Palo Alto, Ca 94304 Chicago, Il 60626 Palo Alto, Ca 94304 October 25, 1994 Extended
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/SequentialPrologImp.ps.Z, 19941109
PARIS RESEARCH LABORATORY digital December 1993 36 Peter Van Roy 1983 1993: The Wonder Years of Sequential Prolog Implementation 36 1983 1993: The Wonder Years of Sequential Prolog Implementation Peter Van Roy December 1993 Publication Notes This report is an edited version of an article to appear in
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/RR-94-23.ps.Z, 19941118
Deutsches Forschungszentrum f ur K unstliche Intelligenz GmbH Research Report RR-94-23 The Definition of Kernel Oz Gert Smolka November 1994 Deutsches Forschungszentrum f ur K unstliche Intelligenz GmbH Postfach 20 80 67608 Kaiserslautern, FRG Tel.: + 49 (631) 205-3211 Fax: + 49 (631) 205-3210
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/ILPS94.ps.Z, 19941124
Encapsulated Search for Higher-order Concurrent Constraint Programming1 Christian Schulte and Gert Smolka German Research Center for Artificial Intelligence (DFKI) Stuhlsatzenhausweg 3, D{66123 Saarbrucken, Germany fschulte,smolkag@dfki.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/ObliqPaper.ps.gz, 19941220
November 21, 1994 2:38 PM Page 1 Obliq A language with distributed scope Luca Cardelli Digital Equipment Corporation, Systems Research Center
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/ConstraintInterval-ijcai-ws93.ps.Z, 19950201
Constraint Deduction in an Interval-based Temporal Logic Jana Koehler & Ralf Treinen
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/ICLP95.ps.Z, 19950310
In Proceedings of the 1995 International Conference on Logic Programming, Kanagawa, Japan, June 1995. The MIT-Press. Operational Semantics of Constraint Logic Programs with Coroutining Andreas Podelski Max-Planck-Institut fur Informatik Im Stadtwald, D-6123 Saarbrucken, Germany podelski@mpi-sb.mpg.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/PhD-Niehren.ps.Z, 19950620
Funktionale Berechnung in einem uniform nebenl aufigen Kalk ul mit logischen Variablen Dissertation zur Erlangung des Grades Doktor der Naturwissenschaften der Technischen Fakultat der Universitat des Saarlandes von Joachim Niehren Saarbrucken Dezember, 1994 Zusammenfassung Wir prasentieren den
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/TypeTypeType95.ps.Z, 19950620
A Type is a Type is a Type Martin Muller Joachim Niehren Programming Systems Lab German Research Center for Artificial Intelligence (DFKI) Stuhlsatzenhausweg 3, 66123 Saarbrucken, Germany fmmueller,niehreng@dfki.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/RR-95-08.ps.Z, 19950628
Deutsches Forschungszentrum f ur K unstliche Intelligenz GmbH Research Report RR-95-08 An Abstract Machine for Oz Michael Mehl, Ralf Scheidhauer, and Christian Schulte June 1995 Deutsches Forschungszentrum f ur K unstliche Intelligenz GmbH Postfach 20 80 67608 Kaiserslautern, FRG Tel.: + 49 (631)
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/FeatArbStruct.ps.Z, 19950706
Feature Trees over Arbitrary Structures Ralf Treinen Programming Systems Lab German Research Center for Artificial Intelligence (DFKI) Stuhlsatzenhausweg 3, D66123 Saarbrucken, Germany treinen@dfki.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/PPCP93.ps.Z, 19951012
1 Object-Oriented Concurrent Constraint Programming in Oz Martin Henz, Gert Smolka, and Jorg Wurtz
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/CDinOz.ps.Z, 19951023
Constructive Disjunction in Oz Tobias Muller and Jorg Wurtz German Research Center for Artificial Intelligence (DFKI) D-66123 Saarbrucken, Stuhlsatzenhausweg 3, Germany Email: ftmueller,wuertzg@dfki.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/UNIF94.ps.Z, 19951024
A Constraint-Based Recast of ML{Polymorphism (Extended Abstract) Martin Muller mmueller@dfki.uni-sb.de German Research Center for Artificial Intelligence (DFKI) Stuhlsatzenhausweg 3, 66123 Saarbrucken, Germany
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/ConstraintsFree95.ps.Z, 19951024
Constraints for Free in Concurrent Computation Joachim Niehren Martin Muller Programming Systems Lab German Research Center for Artificial Intelligence (DFKI) Stuhlsatzenhausweg 3, 66123 Saarbrucken, Germany fniehren,mmuellerg@dfki.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/POPL96.ps.Z, 19951102
Functional Computation as Concurrent Computation Joachim Niehren German Research Center for Artificial Intelligence (DFKI) Stuhlsatzenhausweg 3, 66123 Saarbrucken, Germany niehren@dfki.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/AddingConstraintSystems.ps.Z, 19951204
Adding Constraint Systems to DFKI Oz Tobias Muller German Research Center for Artificial Intelligence (DFKI) D-66123 Saarbrucken, Stuhlsatzenhausweg 3, Germany Email: tmueller@dfki.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/volume1000.ps.Z, 19960112
The Oz Programming Model Gert Smolka Programming Systems Lab German Research Center for Artificial Intelligence (DFKI) Stuhlsatzenhausweg 3, 66123 Saarbrucken, Germany email: smolka@dfki.uni-sb.de July 1995
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/lpo-tcs.ps.Z, 19960124
The First-Order Theory of Lexicographic Path Orderings is Undecidable Hubert Comon 1 CNRS and LRI, Bat. 490, Universit e de Paris Sud, F-91405 ORSAY cedex, France, comon@lri.lri.fr Ralf Treinen 1;2 Laboratoire de Recherche en Informatique (LRI), Bat. 490, Universit e de Paris Sud, F-91405 ORSAY cedex,
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/Visions95.ps.Z, 19960124
Multiparadigm Programming in Oz Martin Muller, Tobias Muller, Peter Van Roy German Research Center for Artificial Intelligence (DFKI) Stuhlsatzenhausweg 3, 66123 Saarbrucken, Germany fmmueller,tmueller,vanroyg@dfki.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/SituSimpli95.ps.Z, 19960124
Situated Simplification Andreas Podelski1 and Gert Smolka2 1 Max-Planck-Institut fur Informatik, Im Stadtwald, D-66123 Saarbrucken, Germany 2 German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, D-66123 Saarbrucken, Germany
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/RR-95-14.ps.Z, 19960308
Functional Computation as Concurrent Computation Joachim Niehren Programming Systems Lab German Research Center for Artificial Intelligence (DFKI) Stuhlsatzenhausweg 3, 66123 Saarbrucken, Germany niehren@dfki.uni-sb.de 15 November 1995
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/others/JACMflogic.ps.gz, 19960314
Logical Foundations of Object-Oriented and Frame-Based Languages Michael Kifer Georg Lausen y James Wu z
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/RR-94-18.ps.Z, 19960515
How to Win a Game with Features Rolf Backofen Institut f ur Informatik Ludwig-Maximilian-Universit at M unchen Oettingenstrasse 67, D-80538 M unchen, Germany email: backofen@informatik.uni-muenchen.de http://www.informatik.uni-muenchen.de/ backofen Ralf Treineny Laboratoire de Recherche en Informatique
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/IJCAI93.ps.Z, 19960611
Oz|A Programming Language for Multi-Agent Systems Martin Henz, Gert Smolka, J org W urtz German Research Center for Artificial Intelligence (DFKI) Stuhlsatzenhausweg 3 D-6600 Saarbr ucken Germany E-mail: fhenz, smolka, wuertzg@dfki.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/misc/WOz_Glinda.ps.Z, 19960611
Glinda: A Meta-circular Interpreter for Oz Martin Henz and Michael Mehl
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/misc/ECOOP94.ps.Z, 19960611
Objects in Higher-order ConcurrentConstraintPrograming with State Martin Henz and Gert Smolka German Research Center for Artificial Intelligence (DFKI) Stuhlsatzenhausweg 3, D{66123 Saarbr ucken, Germany fhenz,smolkag@dfki.uni-sb.de Fax: +49 681 302-5341, Phone: +49 681 302-5311
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/ICPTAT95.ps.Z, 19960611
Using Oz for College Timetabling Martin Henz and J org W urtz German Research Center for Artificial Intelligence (DFKI) Stuhlsatzenhausweg 3, D{66123 Saarbr ucken, Germany fhenz,wuertzg@dfki.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/misc/CTR92.ps.Z, 19960611
Refining Completion Modulo AC1 Leo Bachmair State University of New York at Stony Brook Department of Computer Science NY 11794 Stony Brook U.S.A. leo@sbcs.sunysb.edu Martin Henz German Research Center for Artificial Intelligence Stuhlsatzenhausweg 3 D-6600 Saarbr ucken 11 Germany henz@dfki.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/misc/WOz_Munchkins.ps.Z, 19960611
WOZ'95: INTERNATIONAL WORKSHOP ON OZ PROGRAMMING Munchkins: A Shell for Distributed Multi-User Games Martin Henz, Martin M uller, Markus Wolf
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/AAAI96.ps.Z, 19960621
Copyright 1996, American Association for Artificial Intelligence. All rights reserved.1 Tuning Local Search for Satisfiability Testing Andrew J. Parkes CIS Dept. and CIRL 1269 University of Oregon Eugene, OR 97403-1269 U.S.A. parkes@cirl.uoregon.edu Joachim P. Walser Programming Systems Lab Universit at
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/SituSimpliTCS.ps, 19960708
Situated Simplification Andreas Podelski Max-Planck-Institut Informatik Im Stadtwald D-66123 Saarbr ucken, Germany podelski@mpi-sb.mpg.de Gert Smolka Programming Systems Lab German Research Center for Artificial Intelligence (DFKI) Stuhlsatzenhausweg 3 D{66123 Saarbr ucken, Germany smolka@dfki.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/puzzle96.ps.Z, 19960715
Don't Be Puzzled! Martin Henz Programming Systems Lab University of the Saarland Geb. 45, Postfach 151150 D-66041 Saarbr ucken, Germany email: henz@dfki.uni-sb.de July 3, 1996
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/KI96.ps.Z, 19960715
Constructive Disjunction Revisited J org W urtz1 and Tobias M uller2 1 German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, D-66123 Saarbr ucken, Germany, Email: wuertz@dfki.uni-sb.de 2 Universit at des Saarlandes, Stuhlsatzenhausweg 3, D-66123 Saarbr ucken, Germany, Email:
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/JLP96.ps.Z, 19960715
J. LOGIC PROGRAMMING 1994:19, 20:1{679 1 SMALLEST HORN CLAUSE PROGRAMS P. DEVIENNE, P. LEB EGUE, A. PARRAIN, J.C. ROUTIER, AND J. W URTZ The simplest non{trivial program pattern in logic programming is the following one : 8 p(fact) : p(left) p(right) : p(goal) : where fact , goal , left and right are
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/fa96.ps.Z, 19960716
Feasible Cellular Frequency Assignment Using Constraint Programming Abstractions Joachim P. Walser Programming Systems Lab Universit at des Saarlandes Geb. 45, Postfach 151150 66041 Saarbr ucken, Germany walser@ps.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/plilp96.ps.Z, 19960724
Integrating efficient records into concurrent constraint programming Peter Van Roy1, Michael Mehl2, and Ralf Scheidhauer2 1 Swedish Institute of Computer Science, Stockholm, Sweden 2 Programming Systems Lab, DFKI, Saarbr ucken, Germany
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/COMPOzE96.ps.Z, 19960808
COMPOzE Intention-based Music Composition through Constraint Programming Martin Henz Programming Systems Lab Stefan Lauer Computer Science Department Detlev Zimmermann Graduate School for Cognitive Science University of Saarland Im Stadtwald D-66041 Saarbr ucken, Germany E-mail:
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/scheduler96.ps.Z, 19960809
Oz Scheduler: A Workbench for Scheduling Problems J org W urtz Programming Systems Lab, DFKI GmbH, University of the Saarland, Geb. 45, 66041 Saarbr ucken, Germany, Email: wuertz@ps.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/interfacing96.ps.Z, 19960809
Interfacing Propagators with a Concurrent Constraint Language Tobias M uller Programming Systems Lab University of the Saarland Geb. 45, Postf. 15 11 50 66041 Saarbr ucken tmueller@ps.uni-sb.de J org W urtz Programming Systems Lab German Research Center for AI Geb. 45, Postf. 15 11 50 66041 Saarbr ucken
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/KI-LP96.ps.Z, 19961021
Oz: Nebenl aufige Programmierung mit Constraints Martin M uller1 und Gert Smolka2 Forschungsbereich Programmiersysteme 1;2 Universit at des Saarlandes und 2 Deutsches Forschungszentrum f ur K unstliche Intelligenz (DFKI) Stuhlsatzenhausweg 3, D-66123 Saarbr ucken fmmueller,smolkag@ps.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/ConstraintScheduling97.ps.Z, 19970128
Constraint-Based Scheduling in Oz J org W urtz, DFKI GmbH, Saarbr ucken
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/plain-report-97.ps.Z, 19970128
Typed Concurrent Programming with Logic Variables Martin M uller Joachim Niehren Gert Smolka Programming Systems Lab, Universit at des Saarlandes and DFKI D-66041 Saarbr ucken, Germany fmmueller,niehren,smolkag@ps.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/ines97.ps.Z, 19970128
Inclusion Constraints over Non-empty Sets of Trees Martin M uller1, Joachim Niehren1 and Andreas Podelski2 1 Programming System Lab, Universit at des Saarlandes, 66041 Saarbr ucken, Germany fmmueller,niehreng@ps.uni-sb.de 2 Max-Planck-Institut f ur Informatik, Im Stadtwald, 66123 Saarbr ucken, Germany
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/AAAI97.ps.Z, 19970404
Solving Linear Pseudo-Boolean Constraint Problems with Local Search Joachim P. Walser Programming Systems Lab Universit at des Saarlandes, Postfach 151150 66041 Saarbr ucken, Germany walser@ps.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/ACM_Surveys_96.ps.Z, 19970604
Problem Solving with Constraints and Programming Gert Smolka DFKI and Universit at des Saarlandes Postfach 15 11 50, Geb. 45 D-66041 Saarbr ucken, Germany smolka@ps.uni-sb.de http://ps-www.dfki.uni-sb.de/ smolka/ I sketch a general model of constraint-based problem solving that is not committed to a
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/Diss-Henz.ps.Z, 19970625
Objects in Oz Objects in OzObjects in Oz Martin Henz Dissertation zur Erlangung des Grades des Doktors der Naturwissenschaften der Technischen Fakult at der Universit at des Saarlandes Saarbr ucken Mai 1997 ii Zur Beurteilung der vorliegenden Dissertation wurden vom Promotionsausschuss der Technischen
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/Ellipses.ps.Z, 19970630
A Uniform Approach to Underspecification and Parallelism Joachim Niehren Programming Systems Lab Universit at des Saarlandes Saarbr ucken, Germany niehren@ps.uni-sb.de Manfred Pinkal Department of Computational Linguistics Universit at des Saarlandes Saarbr ucken, Germany pinkal@coli.uni-sb.de Peter
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/Explorer.ps.Z, 19970714
Oz Explorer: A Visual Constraint Programming Tool Christian Schulte Programming Systems Lab, German Research Center for AI (DFKI) Stuhlsatzenhausweg 3, 66123 Saarbr ucken, Germany schulte@dfki.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/fullContext.ps.Z, 19970717
On Equality Up-to Constraints over Finite Trees, Context Unification, and One-Step Rewriting Joachim Niehren1, Manfred Pinkal2 and Peter Ruhrberg2 1 Programming Systems Lab 2 Department of Computational Linguistics Universit at des Saarlandes, Saarbr ucken, Germany niehren@ps.uni-sb.de and
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/inesInfeas.ps.Z, 19970717
Entailment of Set Constraints is not Feasible Martin M uller Joachim Niehren Programming Systems Lab, Universit at des Saarlandes 66041 Saarbr ucken, Germany, fmmueller,niehreng@ps.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/Engines.ps.Z, 19970718
Programming Constraint Inference Engines Christian Schulte Programming Systems Lab, DFKI, Stuhlsatzenhausweg 3, 66123 Saarbr ucken, Germany E-Mail: schulte@dfki.de, Web: www.ps.uni-sb.de/ schulte/
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/FTSub97.ps.Z, 19970729
Ordering Constraints over Feature Trees Martin M uller1, Joachim Niehren1 and Andreas Podelski2 1 Universit at des Saarlandes, fmmueller,niehreng@ps.uni-sb.de 2 Max-Planck-Institut f ur Informatik, podelski@mpi-sb.mpg.de Saarbr ucken, Germany
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/SWS97.ps.Z, 19970929
Ordering Constraints over Feature Trees Expressed in Second-order Monadic Logic Martin M uller Joachim Niehren Programming Systems Lab, Universit at des Saarlandes 66041 Saarbr ucken, Germany, fmmueller,niehreng@ps.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/mueller97.ps.Z, 19971021
Extending a Concurrent Constraint Language by Propagators Tobias M uller and J org W urtz Programming Systems Lab Universit at des Saarlandes and DFKI Saarbr ucken Postfach 15 11 50, D-66041 Saarbr ucken, Germany Email: ftmueller,wuertzg@ps.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/TMMM97a.ps.Z, 19971021
Finite Set Constraints in Oz Tobias M uller and Martin M uller Forschungsbereich Programmiersysteme Universit at des Saarlandes 66041 Saarbr ucken, Germany ftmueller,mmuellerg@ps.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/PASCO97.ps.Z, 19971022
An Overview of the Design of Distributed Oz Seif Haridi Swedish Institute of Computer Science (SICS), Sweden seif@sics.se Peter Van Roy Universit e catholique de Louvain (UCL), Belgium pvr@info.ucl.ac.be Gert Smolka Universit at des Saarlandes, Saarbr ucken, Germany smolka@ps.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/TOPLAS97.ps.Z, 19971022
Mobile Objects in Distributed Oz PETER VAN ROY Universit e Catholique de Louvain SEIF HARIDI and PER BRAND Swedish Institute of Computer Science and GERT SMOLKA, MICHAEL MEHL, and RALF SCHEIDHAUER German Research Center For Artificial Intelligence (DFKI) Some of the most difficult questions to answer
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/schild-98.ps.Z, 19971215
Off-Line Scheduling of a Real-Time System Klaus Schild Daimler-Benz AG Research & Technology Alt-Moabit 96a, D-10559 Berlin, Germany e-mail: schild@DBresearch-berlin.de J org W urtz Programming Systems Lab, DFKI Stuhlsatzenhausweg 3, D-66123 Saarbr ucken Germany e-mail: wuertz@dfki.de Keywords
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/DA-Kornstaedt.ps.Z, 19971215
Diplomarbeit Definition und Implementierung eines Front-End-Generators f ur Oz von Leif Kornstaedt September 1996 Betreuer: Prof. Dr. rer. nat. Gert Smolka Dipl.-Inform. Christian Schulte Prof. Dr.-Ing. Hans-Wilm Wippermann Fachbereich Informatik Universit at Kaiserslautern Erkl arung Hiermit erkl are
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/Uniform-97.ps.Z, 19980109
J. Functional Programming 1 (1): 1{000, January 1993 c 1993 Cambridge University Press 1 Uniform Confluence in Concurrent Computation Joachim Niehren Programming Systems Lab, Universit at des Saarlandes 66041 Saarbr ucken, Germany, niehren@ps.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/Dominance-98.ps.Z, 19980109
Dominance Constraints in Context Unification Joachim Niehren1 and Alexander Koller2 1 Programming Systems Lab 2 Department of Computational Linguistics Universit at des Saarlandes, Saarbr ucken, Germany niehren@ps.uni-sb.de and koller@coli.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/Diagnosis-97.ps.Z, 19980113
Set-based Error Diagnosis of Concurrent Constraint Programs Andreas Podelski, Witold Charatonik Max-Planck-Institut f ur Informatik D-66123 Saarbr ucken, Germany fpodelski ; witoldg@mpi-sb.mpg.de Martin M uller Programming Systems Lab, Universit at des Saarlandes D-66041 Saarbr ucken, Germany
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/CLLS-98.ps.Z, 19980203
Constraints over Lambda-Structures in Semantic Underspecification Markus Egg and Joachim Niehren and Peter Ruhrberg and Feiyu Xu Department of Computational Linguistics / Programming Systems Lab Universit at des Saarlandes, Saarbr ucken, Germany {egg,peru,feiyu}@coli.uni-sb.de niehren@ps.uni-sb.de
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/Smolka-Oz-SML-98.ps.Z, 19980203
Concurrent Constraint Programming Based on Functional Programming (Extended Abstract) Gert Smolka Programming Systems Lab DFKI and Universit at des Saarlandes Postfach 15 11 50, D-66041 Saarbr ucken, Germany smolka@dfki.de, http://www.ps.uni-sb.de/~smolka/ To appear in Proceedings of the 1998 European
open this document and view contentsftp://duck.dfki.uni-sb.de/pub/papers/ProgrammingSysLab/FTSubTheory-98.ps.Z, 19980212
Draft12/2/1998 The First-Order Theory of Ordering Constraints over Feature Trees Martin M uller and Joachim Niehren Programming Systems Lab, Univ. des Saarlandes, Saarbr ucken, Germany Ralf Treinen LRI, Universit e de Paris-Sud, Orsay, France February 12, 1998