Klaus U. Schulz and Stephan Kepser.
Combination of Constraint Solvers II: Rational Amalgamation.
Theoretical Computer Science, 2000.
Markus Egg, Alexander Koller, and Joachim Niehren.
The Constraint Language for Lambda Structures.
Technical report, Universität des Saarlandes, Programming Systems Lab,
2000.
Submitted. Available at
http://www.ps.uni-saarland.de/Papers/abstracts/clls2000.html.
Full
paper Abstract
Katrin Erk and Joachim Niehren.
Parallelism Constraints.
In International Conference on Rewriting Techniques and Applications,
volume 1833 of Lecture Notes in Computer Science, pages 110-126,
Norwich, U.K., 2000. Springer-Verlag, Berlin.
Full paper Abstract
Alexander Koller and Joachim Niehren.
On Underspecified Processing of Dynamic Semantics.
In Proceedings of the 18th International Conference on Computational
Linguistics, pages 460-466, Saarbrücken, Germany, July 31 - August 4
2000.
Full
paper Abstract
Martin Müller and Joachim Niehren.
Ordering Constraints over Feature Trees Expressed in Second-order Monadic
Logic.
Information and Computation, 159(1/2):22-58, 2000.
Special Issue on RTA, Tsukuba, Japan, March 1998. To appear.
Full paper Abstract
Martin Müller, Joachim Niehren, and Andreas Podelski.
Ordering Constraints over Feature Trees.
Constraints, an International Journal, 5(1-2):7-42, January 2000.
Special Issue on CP'97, Linz, Austria.
Full paper Abstract
Joachim Niehren.
Uniform Confluence in Concurrent Computation.
Journal of Functional Programming, 10(3):1-47, August 2000.
An unabridged version from June 30, 1999 is available at
www.ps.uni-saarland.de/Papers/abstracts/Uniform:99.html.
Full paper Abstract
Christian Schulte.
Parallel Search Made Simple.
Technical Report TRA9/00, School of Computing, National University of
Singapore, 55 Science Drive 2, Singapore 117599, September 2000.
To appear.
Full
paper Abstract
Christian Schulte.
Programming Deep Concurrent Constraint Combinators.
In Enrico Pontelli and Vítor Santos Costa, editors, Practical Aspects of
Declarative Languages, Second International Workshop, PADL 2000, volume
1753 of Lecture Notes in Computer Science, pages 215-229, Boston,
MA, USA, January 2000. Springer-Verlag.
Full paper Abstract
C. Alvarado and Q.-H. Nguyen.
ELAN for equational reasoning in Coq.
In J. Despeyroux, editor, Proceeding of 2nd Workshop on Logical Frameworks
and Metalanguages, Santa Barbara (CA, USA), June 2000.
Full paper
A. Bockmayr and Y. Dimopoulos.
Integer Programs and Valid Inequalities for Planning Problems.
In S. Biundo and M. Fox, editors, 5th European Conference on Planning,
ECP-99, volume 1809 of Lecture Notes in Artificial Intelligence,
Durham (UK), 2000. Springer-Verlag.
Also available as Technical Report A00-R-271, LORIA, Nancy (France).
Full paper
A. Bockmayr and F. Eisenbrand.
Combining Logic and Optimization in Cutting Plane Theory.
In H. Kirchner and Ch. Ringeissen, editors, Frontiers of Combining Systems,
Third International Workshop, FroCoS 2000, LNAI 1794, pages 1-17, Nancy
(France), March 2000. Springer-Verlag.
Full paper
L. Bachmair, I. V. Ramakrishnan, A. Tiwari, and L. Vigneron.
Congruence Closure Modulo Associativity and Commutativity.
In H. Kirchner and Ch. Ringeissen, editors, Frontiers of Combining Systems,
Third International Workshop, FroCoS 2000, LNAI 1794, pages 245-259,
Nancy, France, March 2000. Springer-Verlag.
Also available as Technical Report A00-R-031, LORIA, Nancy (France).
Full paper
H. Cirstea.
Calcul de réécriture : fondements et applications.
Thèse de doctorat d'université, Université Henri Poincaré -
Nancy 1, octobre 2000.
Also available as Technical Report A00-T-277, LORIA, Nancy (France).
Full paper
H. Cirstea and C. Kirchner.
Rewriting and Multisets in the -Calculus and ELAN.
In Workshop on Multiset Processing, Curtea de Arges (Romania), August
2000.
Also available as Technical Report A00-R-238, LORIA, Nancy (France).
H. Cirstea and C. Kirchner.
The simply typed rewriting calculus.
In Third International Workshop on Rewriting Logic and Applications,
WRLA'2000, Kanazawa (Japan), September 2000.
to appear in Electronic Notes in Theoretical Computer Science. Also available
as Technical Report A00-R-237, LORIA, Nancy (France).
A. Durand, M. Hermann, and L. Juban.
On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine
System.
Theoretical Computer Science, 2000.
Also available as Technical Report A00-R-309, LORIA, Nancy (France).
G. Dowek, Th. Hardin, and C. Kirchner.
Higher-order Unification via Explicit Substitutions.
Information and Computation, 157(1-2):183-235, 2000.
A. Durand, M. Hermann, and Ph. G. Kolaitis.
Subtractive Reductions and Complete Problems for Counting Complexity
Classes.
In M. Nielsen and B. Rovan, editors, 25th International Symposium on
Mathematical Foundations of Computer Science (MFCS 2000), volume 1893 of
Lecture Notes in Computer Science, pages 323-332, Bratislava
(Slovaquie), August 2000. Springer.
H. Dubois and H. Kirchner.
Rule Based Programming with Constraints and Strategies.
In K. R. Apt, A. C. Kakas, E. Monfroy, and F. Rossi, editors, Joint
ERCIM/Compulog Net Workshop. Selected Papers, volume 1865 of Lecture
Notes in Artificial Intelligence, pages 274-297, Paphos (Cyprus), 2000.
Springer-Verlag.
Also available as Technical Report A00-R-247, LORIA, Nancy (France).
H. Ganzinger, F. Jacquemard, and M. Veanes.
Rigid reachability, the non-symmetric form of rigid E-unification.
International Journal of Foundations of Computer Science, IJFCS,
11(1):3-28, 2000.
Also available as Technical Report 99-R-248, LORIA, Nancy (France).
M. Hermann and Ph. G. Kolaitis.
Unification Algorithms Cannot Be Combined in Polynomial Time.
Information and Computation, 162(1-2):24-42, 2000.
Also available as Technical Report A00-R-358, LORIA, Nancy (France).
F. Jacquemard, M. Rusinowitch, and L. Vigneron.
Compiling and Verifying Security Protocols.
In M. Parigot and A. Voronkov, editors, Seventh International Conference
on Logic for Programming and Automated Reasoning, LPAR 2000, volume 1955
of Lecture Notes in Computer Science, pages 131-160, St Gilles
(Reunion, France), November 2000. Springer-Verlag.
Also available as Technical Report A00-R-267, LORIA, Nancy (France).
Full paper
H. Kirchner and I. Gnaedig.
Termination and normalisation under strategies-Proofs in ELAN.
In Third International Workshop on Rewriting Logic and Applications,
WRLA'2000, Kanazawa (Japan), September 2000.
To appear in Electronic Notes in Theoretical Computer Science. Also available
as Technical Report A00-R-307, LORIA, Nancy (France).
H. Kirchner and C. Ringeissen, editors.
Frontiers of Combining Systems, Third International Workshop, FroCoS
2000, LNAI 1794, Nancy, France, March 2000. Springer-Verlag.
P.-E. Moreau.
REM (Reduce Elan Machine) : Core of the New ELAN Compiler.
In L. Bachmair, editor, Eleventh International Conference on Rewriting
Techniques and Applications, RTA 2000, number 1833 in Lecture Notes in
Computer Science, pages 265-269, Norwich (England), July 2000. Springer.
Also available as Technical Report A00-R-398, LORIA, Nancy (France).
Full paper
P. Narendran and M. Rusinowitch.
The theory of total unary rpo is decidable.
In J. Lloyd et al., editor, First International Conference on
Computational Logic, number 1861 in Lecture Notes in Computer Science,
pages 660-672, Londres (England), July 2000. Springer.
Also available as Technical Report A00-R-264, LORIA, Nancy (France).
Full paper
Ch. Ringeissen.
Handling Relations over Finite Domains in the Rule-Based System ELAN.
In Third International Workshop on Rewriting Logic and Applications,
WRLA'2000, Kanazawa (Japan), September 2000.
to appear in Electronic Notes in Theoretical Computer Science. Also available
as Technical Report A00-R-154, LORIA, Nancy (France).
Ch. Ringeissen and E. Monfroy.
Generating Propagation Rules for Finite Domains: a Mixed Approach.
In Krzysztof R. Apt, Antonis C. Kakas, Eric Monfroy, and Francesca Rossi,
editors, Joint ERCIM/Compulog Net Workshop. Selected Papers, volume
1865 of Lecture Notes in Artificial Intelligence, pages 150-172,
Paphos (Cyprus), 2000. Springer-Verlag.
Also available as Technical Report A00-R-155, LORIA, Nancy (France).
M. Rusinowitch, S. Stratulat, and F. Klay.
Mechanical Verification of an Ideal ABR Conformance Algorithm.
In E. A. Emerson and A. P. Sistla, editors, 12th International Conference
on Conference on Computer Aided Verification, CAV 2000, volume 1855 of
Lecture Notes in Computer Science, pages 344-357, Chicago (IL, USA),
July 2000. Springer.
Also available as Technical Report A00-R-263, LORIA, Nancy (France).
Full paper
S. Stratulat.
Preuves par récurrence avec ensembles couvrants contextuels.
Applications à la vérification de logiciels de
télécommunications.
Thèse de doctorat d'université, Université Henri Poincaré -
Nancy 1, novembre 2000.
Also available as Technical Report A00-T-294, LORIA, Nancy (France).
Full paper
J. Stuber.
Deriving Theory Superposition Calculi from Convergent Term Rewriting
Systems.
In L. Bachmair, editor, Eleventh International Conference on Rewriting
Techniques and Applications, RTA 2000, volume 1833 of LNCS,
pages 229-245, Norwich (England), July 2000. Springer.
Also available as Technical Report A00-R-399, LORIA, Nancy (France).
M. van den Brand and Ch. Ringeissen.
ASF+SDF parsing tools applied to ELAN.
In Third International Workshop on Rewriting Logic and Applications,
WRLA'2000, Kanazawa (Japan), September 2000.
to appear in Electronic Notes in Theoretical Computer Science. Also available
as Technical Report A00-R-153, LORIA, Nancy (France).
J. Zhou.
Introduction to the constraint language NCL.
Journal of Logic Programming, 45(1-3):71-103, 2000.
Also available as Technical Report A00-R-376, LORIA, Nancy (France).
Franck Seynhaeve, Sophie Tison, Marc Tommasi, and Ralf Treinen.
Grid Structures and Undecidable Constraint Theories.
Theoretical Computer Science, 2000.
To appear.
Joachim Niehren, Sophie Tison, and Ralf Treinen.
On Rewrite Constraints and Context Unification.
Information Processing Letters, 2000.
To Appear.
Full paper
Abstract
Jerzy Tiuryn, editor.
Foundations of Software Science and Computation Structures, Lecture
Notes in Computer Science, Berlin, Germany, March 2000. Springer-Verlag.
To Appear.
Ralf Treinen.
Predicate Logic and Tree Automata with Tests.
In Jerzy Tiuryn, editor, Foundations of Software Science and Computation
Structures, March 2000 (see there).
To Appear.
Full
paper Abstract
Witold Charatonik, Andreas Podelski, and Jean-Marc Talbot.
Paths vs. Trees in Set-based Program Analysis.
In Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of
Programming Languages (POPL'00), pages 330-337, Boston, Massachusetts,
USA, January 2000. ACM Press.
Jean-Marc Talbot, Philippe Devienne, and Sophie Tison.
Generalized Definite Set Constraints.
CONSTRAINTS - An International Journal, 5(1-2):161-202, January 2000.
F. Baader and W. Snyder.
Unification Theory.
In J.A. Robinson and A. Voronkov, editors, Handbook of Automated
Reasoning. Elsevier Science Publishers, 2000.
To appear.
Full paper Abstract
F. Baader and C. Tinelli.
Combining Equational Theories Sharing Non-Collapse-Free Constructors.
In H. Kirchner and Ch. Ringeissen, editors, Proceedings of the 3rd
International Workshop on Frontiers of Combining Systems (FroCoS 2000),
volume 1794 of Lecture Notes in Computer Science, pages 257-271,
Nancy, France, 2000. Springer-Verlag.
Full paper Abstract
Back to the CCL online bibliography.
Ralf Treinen
Generated at
Mon Mar 12 07:07:00 CET 2001.