Franz Baader and Klaus U. Schulz.
On the Combination of Symbolic Constraints, Solution Domains, and
Constraint Solvers.
In Proceedings of the International Conference on Constraint Programming,
CP-95, volume 976 of Lecture Notes in Computer Science.
Springer-Verlag, 1995.
Full
paper Abstract
Klaus U. Schulz and Dov M. Gabbay.
Logic Finite Automata.
In M. Masuch and Lázló Pólos, editors, Applied Logic: How, What
and Why?, volume 247 of Synthese Library. Kluwer Academic
Publishers, 1995.
Full paper Abstract
Jana Koehler and Ralf Treinen.
Constraint Deduction in an Interval-based Temporal Logic.
In Michael Fisher and Richard Owens, editors, Executable Modal and Temporal
Logics, Lecture Notes in Artificial Intelligence, vol. 897, pages
103-117. Springer-Verlag, 1995.
Full paper Abstract
Martin Müller, Tobias Müller, and Peter Van Roy.
Multi-Paradigm Programming in Oz.
In Donald Smith, Olivier Ridoux, and Peter Van Roy, editors, Visions for
the Future of Logic Programming: Laying the Foundations for a Modern
successor of Prolog, Portland, Oregon, 7 December 1995.
A Workshop in Association with ILPS'95.
Full
paper Abstract
Martin Müller and Joachim Niehren.
A Type is a Type is a Type.
In Joint COMPULOGNET/ELSNET/EAGLES Workshop on Computational Logic for
Natural Language Processing, Edinburgh, Scotland, April 3-5 1995.
The orginal workshop version was titled: Weak Subsumption Constraints for
Type Diagnosis: An Incremental Algorithm.
Full paper Abstract
Michael Mehl, Ralf Scheidhauer, and Christian Schulte.
An Abstract Machine for Oz.
Research Report RR-95-08, Deutsches Forschungszentrum für Künstliche
Intelligenz, Stuhlsatzenhausweg 3, D66123 Saarbrücken, Germany, June
1995.
Also in: Proceedings of PLILP'95, Springer-Verlag, LNCS, Utrecht, The
Netherlands.
Full
paper Abstract
Tobias Müller.
Adding Constraint Systems to DFKI Oz.
In WOz'95, International Workshop on Oz Programming, Institut Dalle
Molle d'Intelligence Artificielle Perceptive, Martigny, Switzerland, 29
November-1 December 1995.
Full paper Abstract
Tobias Müller and Jörg Würtz.
Constructive Disjunction in Oz.
In Andreas Krall and Ulrich Geske, editors, 11. Workshop Logische
Programmierung, GMD-Studien, Technische Universität Wien,
27-29September 1995. GMD-Forschungszentrum Informationstechnik GmbH,
D-53754 Sankt Augustin.
Full
paper Abstract
Joachim Niehren.
Functional Computation as Concurrent Computation.
Research Report RR-95-14, Deutsches Forschungszentrum für Künstliche
Intelligenz, Stuhlsatzenhausweg 3, D66123 Saarbrücken, Germany, November
1995.
shorter version appeared in: Proceedings of POPL'96, The ACM Press.
Full
paper Abstract
Joachim Niehren and Martin Müller.
Constraints for Free in Concurrent Computation.
In Kanchana Kanchanasut and Jean-Jacques Lévy, editors, Asian Computing
Science Conference, Lecture Notes in Computer Science, vol. 1023, pages
171-186, Pathumthani, Thailand, December 11-13 1995. Springer-Verlag.
Full paper Abstract
Andreas Podelski and Gert Smolka.
Operational Semantics of Constraint Logic Programs with Coroutining.
In Leon Sterling, editor, Proceedings of the 1995 International Conference
on Logic Programming, pages 449-463, Kanagawa, Japan, 13-18 June 1995.
The MIT Press.
Full
paper Abstract
Gert Smolka, Martin Henz, and Jörg Würtz.
Object-Oriented Concurrent Constraint Programming in Oz.
In P. van Hentenryck and V. Saraswat, editors, Principles and Practice of
Constraint Programming, chapter 2, pages 29-48. The MIT Press, 1995.
Full
paper Abstract
Gert Smolka.
The Definition of Kernel Oz.
In Andreas Podelski, editor, Constraints: Basics and Trends, Lecture
Notes in Computer Science, vol. 910, pages 251-292. Springer-Verlag, 1995.
Full
paper Abstract
Gert Smolka.
The Oz Programming Model.
In Jan van Leeuwen, editor, Computer Science Today, Lecture Notes in
Computer Science, vol. 1000, pages 324-343. Springer-Verlag, Berlin, 1995.
Full paper Abstract
F. Ajili and E. Contejean.
Complete Solving of Linear Diophantine Equations and Inequations without
Adding Variables.
In U. Montanari and F. Rossi, editors, Proceedings of 1st International
Conference on Principles and Practice of Constraint Programming, volume
976 of Lecture Notes in Computer Science, pages 1-17, Cassis
(France), September 1995. Springer-Verlag.
Full paper
I. Alouini.
Concurrent Garbage Collection for Concurrent Rewriting.
In J. Hsiang, editor, Proceedings 6th Conference on Rewriting Techniques
and Applications, volume 914 of Lecture Notes in Computer
Science, pages 132-146, Kaiserslautern (Germany), 1995. Springer-Verlag.
Full paper
A. Bouhoula, E. Kounalis, and M. Rusinowitch.
Automated Mathematical Induction.
Journal of Logic and Computation, 5(5):631-668, 1995.
Also available as Technical Report 1636, INRIA, Nancy (France).
Full paper
P. Borovanský.
Implementation of higher-order unification based on calculus of explicit
substitutions.
In M. Barto sek, J. Staudek, and J. Wiedermann, editors, Proceedings of
SOFSEM'95: Theory and Practice of Informatics, volume 1012 of Lecture
Notes in Computer Science, pages 363-368, Milovy (Czech Republic), 1995.
Springer-Verlag.
Full paper
A. Bouhoula and M. Rusinowitch.
Implicit induction in conditional theories.
Journal of Automated Reasoning, 14(2):189-235, 1995.
Full paper
A. Bouhoula and M. Rusinowitch.
SPIKE: a system for automatic inductive proofs.
In V. S. Alagar and M. Nivat, editors, Proceedings of 4th International
Conference on Algebraic Methodology and Software Technology, volume 936
of Lecture Notes in Computer Science, pages 576-577, Montreal
(Canada), July 1995. Springer-Verlag.
R. Curien.
Outils pour la preuve par analogie.
Thèse de Doctorat d'Université, Université Henri Poincaré - Nancy 1,
janvier 1995.
Full paper
G. Dowek, Th. Hardin, and C. Kirchner.
Higher-order unification via explicit substitutions, Extended
abstract.
In D. Kozen, editor, Proceedings 10th IEEE Symposium on Logic in Computer
Science, pages 366-374, San Diego (CA, USA), June 1995.
Also available as Technical Report 2709, INRIA, Nancy (France).
Full paper
E. Domenjoud and A. P. Tomás.
From Elliott-MacMahon to an Algorithm for General Linear Constraints
on Naturals.
In U. Montanari and F. Rossi, editors, Proceedings of 1st International
Conference on Principles and Practice of Constraint Programming, volume
976 of Lecture Notes in Computer Science, pages 18-35, Cassis
(France), September 1995. Springer-Verlag.
Full paper
C. Hintermeier.
Déduction avec sortes ordonnées et égalités.
Thèse de Doctorat d'Université, Université Henri Poincaré - Nancy 1,
octobre 1995.
Full paper
C. Kirchner, editor.
Special Issue on RTA-93.
Theoretical Computer Science. Elsevier Science Publishers B. V.
(North-Holland), 1995.
H. Kirchner.
On the Use of Constraints in Automated Deduction.
In A. Podelski, editor, Constraint Programming: Basics and Trends,
volume 910 of Lecture Notes in Computer Science, pages 128-146.
Springer-Verlag, 1995.
Full paper
H. Kirchner.
Some Extensions of Rewriting.
In H. Comon and J.-P. Jouannaud, editors, Term Rewriting, French Spring
School of Theoretical Computer Science, volume 909 of Lecture Notes
in Computer Science, pages 54-73. Springer-Verlag, Font Romeux (France),
1995.
Also available as Technical Report 94-R-175, CRIN, Nancy (France).
Full paper
C. Kirchner, H. Kirchner, and M. Vittek.
Designing Constraint Logic Programming Languages using Computational
Systems.
In P. Van Hentenryck and V. Saraswat, editors, Principles and Practice of
Constraint Programming. The Newport Papers., pages 131-158. MIT press,
1995.
Full
paper
C. Kirchner, Ch. Lynch, and Ch. Scharff.
A Fine-grained Concurrent Completion Procedure.
In Proceedings of CCL'95 Workshop, Rottach-Egern (Germany), September
1995.
H. Kirchner and P.-E. Moreau.
Prototyping completion with constraints using computational systems.
In J. Hsiang, editor, Proceedings 6th Conference on Rewriting Techniques
and Applications, volume 914 of Lecture Notes in Computer
Science, pages 438-443, Kaiserslautern (Germany), 1995. Springer-Verlag.
Full paper
E. Kounalis and M. Rusinowitch.
Reasoning with conditional axioms.
Annals of Mathematics and Artificial Intelligence, 15(2):125-149,
1995.
G. Kucherov and M. Rusinowitch.
Undecidability of Ground Reducibility for Word Rewriting Systems with
Variables.
Information Processing Letters, 53:209-215, 1995.
Full paper
Ch. Lynch and W. Snyder.
Redundancey Criteria for Constrained Completion.
Theoretical Computer Science, 142(2):141-177, May 1995.
Full paper
D. Lugiez.
Positive and Negative Results for Higher-order Disunification.
Journal of Symbolic Computation, 20(4):431-470, 1995.
Full paper
D. Lugiez.
Résolution de contraintes symboliques.
Habilitation à diriger des recherches, Université Henri Poincaré - Nancy
1, janvier 1995.
Full paper
Ch. Lynch.
Goal Directed Completion using SOUR Graphs.
In Proceedings of CCL'95 Workshop, Rottach-Egern (Germany), September
1995.
Ch. Lynch.
Paramodulation without Duplication.
In D. Kozen, editor, Proceedings 10th IEEE Symposium on Logic in Computer
Science, LICS'95, pages 167-177, San Diego (CA, USA), June 1995. IEEE
Computer Society Press.
Full paper
J.-L. Moysset.
Compléments associatifs-commutatifs et leurs applications.
Thèse de Doctorat d'Université, Université Henri Poincaré - Nancy 1,
juin 1995.
Ch. Ringeissen.
Cooperation of decision procedures for the union of non-disjoint
theories.
In Proceedings of CCL'95 Workshop, Rottach-Egern (Germany), September
1995.
M. Rusinowitch and L. Vigneron.
Automated Deduction with Associative-Commutative Operators.
Applicable Algebra in Engineering, Communication and Computation,
6(1):23-56, January 1995.
Full paper
L. Vigneron.
Positive Deduction modulo Regular Theories.
In H. K. Büning, editor, Annual Conference of the European Association
for Computer Science Logic, volume 1092 of Lecture Notes in Computer
Science, pages 468-485, Paderborn (Germany), September 1995.
Springer-Verlag.
Selected papers.
Full paper
Hubert Comon and Jean-Pierre Jouannaud, editors.
Term Rewriting, volume 909 of Lecture Notes in Computer
Science. French Spring School of Theoretical Computer Science,
Springer-Verlag, 1995.
Hubert Comon, Robert Nieuwenhuis, and Albert Rubio.
Orderings, AC-Theories and Symbolic Constraint Solving.
In Dexter Kozen, editor, Tenth Annual IEEE Symposium on Logic in Computer
Science, June 1995 (see there), pages 375-385.
Full paper Abstract
Hubert Comon.
On Unification of Terms with Integer Exponents.
Math. Systems Theory, 28:67-88, 1995.
Full paper
Hubert Comon.
Sequentiality, second-order monadic logic and tree automata.
In Dexter Kozen, editor, Tenth Annual IEEE Symposium on Logic in Computer
Science, June 1995 (see there), pages 508-517.
Full
paper Abstract
Maribel Fernández and Jean-Pierre Jouannaud.
Modular Termination of Term Rewriting Systems Revisited.
In Egidio Astesiano, Gianni Reggio, and Andrzej Tarlecki, editors, Recent
Trends in Data Type Specification, Lecture notes in Computer Science,
vol.906, pages 255-272. Springer-Verlag, 1995.
Refereed selection of papers presented at ADT'94.
Jean-Pierre Jouannaud and Mitsuhiro Okada.
Abstract Data Type Systems.
Research Report 975, Laboratoire de Recherche en Informatique, June 1995.
Full paper
Abstract
Jean-Pierre Jouannaud.
Introduction to Rewriting.
In Hubert Comon and Jean-Pierre Jouannaud, editors, Term Rewriting,
1995 (see there).
Jean-Pierre Jouannaud.
Rewrite Proofs and Computations.
In Helmut Schwichtenberg, editor, Proof and Computation, volume 139 of
F: Computer and Systems Sciences, pages 173-218.
Springer-Verlag, 1995.
NATO Advanced Study Institute, International Summer School held in
Marktoberdorf, Germany, July 20 - August 1, 1993.
Full paper
Abstract
Dexter Kozen, editor.
Tenth Annual IEEE Symposium on Logic in Computer Science, San Diego,
CA, June 1995. IEEE Comp. Soc. Press.
Claude Marché.
Associative-Commutative Reduction Orderings via Head-Preserving
Interpretations.
Technical Report 95-2, LIFAC, E.N.S. de Cachan, January 1995.
Full
paper Abstract
Claude Marché.
Normalized Rewriting - Application to ground completion and standard
bases.
In Hubert Comon and Jean-Pierre Jouannaud, editors, Term Rewriting,
1995 (see there), pages 154-169.
Full paper Abstract
Peter Barth.
Logic-based 0-1 constraint programming.
Operations Research/Computer Science Interfaces. Kluwer, Boston, November 1995.
Peter Barth.
Logic-based 0-1 Constraint Solving in Constraint Logic Programming.
PhD thesis, Fachbereich Informatik, Universität des Saarlandes, Germany,
February 1995.
Peter Barth and Alexander Bockmayr.
Finite domain and cutting plane techniques in CLP( PB).
In Leon Sterling, editor, Proceedings of the Twelfth International
Conference on Logic Programming, Logic Programming, pages 133-147,
Shonan Village Center, Hayama-Machi, Kanagawa, Japan, 1995. The MIT Press.
Peter Barth and Alexander Bockmayr.
Modelling Mixed-Integer Optimisation Problems in Constraint Logic
Programming.
Research Report MPI-I-95-2-011, Max-Planck-Institut für Informatik, Im
Stadtwald, D-66123 Saarbrücken, Germany, November 1995.
Peter Barth and Alexander Bockmayr.
Pseudo-Boolean Constraint Logic Programming.
Computational Logic. The Newsletter of the European Network in
Computational Logic, 2(2):52-53, February 1995.
Leo Bachmair and Harald Ganzinger.
Associative-Commutative Superposition.
In N. Dershowitz and N. Lindenstrauss, editors, Proceedings of the 4th
International Workshop on Conditional and Typed Rewrite Systems
(CTRS-94), volume 968 of Lecture Notes in Computer Science, pages
1-14, Jerusalem, Israel, 1995. Springer.
Revised version of MPI-I-93-267, 1993.
Leo Bachmair and Harald Ganzinger.
Ordered Chaining Calculi for First-Order Theories of Binary Relations.
Research Report MPI-I-95-2-009, Max-Planck-Institut für Informatik, Im
Stadtwald, D-66123 Saarbrücken, Germany, October 1995.
Submitted for publication elsewhere.
David A. Basin and Harald Ganzinger.
Automated Complexity Analysis Based on Ordered Resolution.
Research Report MPI-I-95-2-006, Max-Planck-Institut für Informatik, Im
Stadtwald, D-66123 Saarbrücken, Germany, November 1995.
Leo Bachmair, Harald Ganzinger, Christopher Lynch, and Wayne Snyder.
Basic Paramodulation.
Information and Computation, 121(2):172-192, 1995.
Revised version of TR MPI-I-93-236, 1993.
Leo Bachmair, Harald Ganzinger, and Jürgen Stuber.
Combining Algebra and Universal Algebra in First-Order Theorem Proving: The
Case of Commutative Rings.
In Egidio Astesiano, Gianna Reggio, and Andrzej Tarlecki, editors, Recent
Trends in Data Type Specification. 10th Workshop on Specification of Abstract
Data Types Joint with the 5th COMPASS Workshop, volume 906 of Lecture
Notes in Computer Science, pages 1-29, S. Margherita, Italy, 1995.
Springer.
Peter Barth, Hans Kleine Büning, and Christoph Weidenbach.
Workshop CPL Computational Propositional Logic.
In Leonie Dreschler-Fischer and Simone Pribbenow, editors, KI-95
Activities: Workshops, Posters, Demos, pages 71-72, Bielefeld, Germany,
1995. Gesellschaft für Informatik e.V., Gesellschaft für Informatik
e.V.
Alexander Bockmayr, Stefan Krischer, and Andreas Werner.
Narrowing strategies for arbitrary canonical systems.
Fundamenta Informaticae, 24(1,2):125-155, September 1995.
Alexander Bockmayr.
Solving pseudo-Boolean constraints.
In Andreas Podelski, editor, Constraint Programming: Basics and Trends,
volume 910 of Lecture Notes in Computer Science, pages 22-38,
Châtillon-sur-Seine, 1995. Springer.
Alexander Bockmayr and Andreas Werner.
LSE narrowing for decreasing conditional term rewrite systems.
In Nachum Dershowitz and Naomi Lindenstrauss, editors, Conditional Term
Rewriting Systems CTRS'94, volume 968 of Lecture Notes in Computer
Science, pages 51-70, Jerusalem, Israel, 1995. Springer.
Michael Hanus.
Analysis of Residuating Logic Programs.
Journal of Logic Programming, 24(3):219-245, 1995.
Michael Hanus.
Compile-Time Analysis of Nonlinear Constraints in CLP(R).
New Generation Computing, 13(2):155-186, 1995.
Michael Hanus.
On Extra Variables in (Equational) Logic Programming.
In Proceedings of the Twelfth International Conference on Logic
Programming, pages 665-679, Kanagawa, Japan, 1995. MIT Press.
Hans Jürgen Ohlbach and Christoph Weidenbach.
A Note on Assumptions about Skolem Functions.
Journal of Automated Reasoning, 15(2):267-275, 1995.
Andreas Podelski, editor.
Constraint Programming: Basics and Trends, volume 910 of Lecture
Notes in Computer Science, Berlin, 1995. Springer.
Andreas Podelski and Gert Smolka.
Operational Semantics of Constraint Logic Programming with Coroutining.
In Leon Sterling, editor, Proceedings of the 12th International Conference
on Logic Programming, pages 449-463, Kanagawa, Japan, 1995. The MIT
Press.
Andreas Podelski and Gert Smolka.
Situated Simplification.
In Ugo Montanari and Francesca Rossi, editors, Proceedings of the First
International Conference on Principles and Practice of Constraint Programming
(CP'95), volume 976 of Lecture Notes in Computer Science, pages
328-344, Cassis, France, 1995. Springer.
Christoph Weidenbach.
First-Order Tableaux with Sorts.
Journal of the Interest Group in Pure and Applied Logics,
3(6):887-906, 1995.
F. Baader and A. Laux.
Terminological Logics with Modal Operators.
In C. Mellish, editor, Proceedings of the 14th International Joint
Conference on Artificial Intelligence, pages 808-814, Montréal,
Canada, 1995. Morgan Kaufmann.
Abstract
F. Baader and K.U. Schulz.
Combination of Constraint Solving Techniques: An Algebraic Point of
View.
In Proceedings of the 6th International Conference on Rewriting Techniques
and Applications, volume 914 of Lecture Notes in Artificial
Intelligence, pages 352-366, Kaiserslautern, Germany, 1995. Springer
Verlag.
Abstract
F. Baader and K.U. Schulz.
Combination Techniques and Decision Problems for Disunification.
Theoretical Computer Science B, 142:229-255, 1995.
Abstract
F. Baader and K.U. Schulz.
On the Combination of Symbolic Constraints, Solution Domains, and
Constraint Solvers.
In Proceedings of the International Conference on Principles and Practice
of Constraint Programming, CP95, volume 976 of Lecture Notes in
Artificial Intelligence, pages 380-397, Cassis, France, 1995. Springer
Verlag.
Abstract
Tobias Nipkow and Christian Prehofer.
Type Reconstruction for Type Classes.
Journal of Functional Programming, 5(2):201-224, 1995.
Full
paper
Christian Prehofer.
A Call-by-Need Strategy for Higher-Order Functional-Logic Programming.
In International Logic Programming Symposium. MIT Press, 1995.
To appear.
Full
paper
Christian Prehofer.
Higher-Order Narrowing with Convergent Systems.
In 4th Int. Conf. Algebraic Methodology and Software Technology, AMAST
'95. Springer LNCS 936, July 1995.
Full paper
Puri Arenas Sánchez and A. Dovier.
Minimal Set Unification.
In Procs. of PLILP' 95, volume 982 of Lecture Notes in Computer
Science, pages 397-414. Springer Verlag, 1995.
Full paper Abstract
Puri Arenas Sánchez and A. Dovier.
Minimal Set Unification.
In GULP-PRODE' 95, pages 447-458, 1995.
Full paper
Abstract
A. Gavilanes, J. Leach, and Nieva S.
A Complete Tableau Method for a Logic with Preorders.
Technical Report DIA 95/5, Departamento de Informática y Automática,
Facultad de Matemáticas (UCM), Av. Complutense s/n, Ciudad Universitaria,
Madrid E-28040 (SPAIN), apr 1995.
Full paper Abstract
J. C. González Moreno, F. J. López Fraguas, Hortalá González M.
T., and M. Rodríguez Artalejo.
A Rewriting Logic for Declarative Programming.
Technical Report DIA 95/10, Departamento de Informática y Automática,
Facultad de Matemáticas (UCM), Av. Complutense s/n, Ciudad Universitaria,
Madrid E-28040 (SPAIN), apr 1995.
Accepted in ESOP' 96.
Full paper Abstract
Alvaro Ruiz-Andino Illera and Jose J. Ruz Ortiz.
Labeling in CLP(FD) with evolutionary programming.
In Proceedings GULP-PRODE'95, Marina di Vietri (Italy), pages 569-580,
1995.
Full paper Abstract
José Meseguer and Narciso Martí-Oliet.
From Abstract Data Types to Logical Frameworks.
In E. Astesiano, G. Reggio, and A. Tarlecki, editors, Recent Trends in Data
Type Specification, Selected Papers from 10th Workshop on Specification of
Abstract Data Types joint with the 5th COMPASS Workshop, S. Margherita,
Italy, May/June 1994, volume 906 of Lecture Notes in Computer
Science, pages 48-80. Springer-Verlag, 1995.
Abstract
Eva Ullan Hernandez.
A Lazy Narrowing Machine.
Research Report DIA 95/3, Departamento de Informática y Automática,
Facultad de Matemáticas (UCM), Av. Complutense s/n, Ciudad Universitaria,
Madrid E-28040 (SPAIN), March 1995.
Full
paper Abstract
Robert Nieuwenhuis.
On Narrowing, Refutation Proofs and Constraints.
In J. Hsiang, editor, 6th International Conference on Rewriting Techniques
and Applications, LNCS 914, pages 56-70, Kaiserslautern, Germany,
April 4-7, 1995. Springer-Verlag.
Full paper
Marisa Navarro, Fernando Orejas, and Ana Sánchez.
On the Correctness of Modular Systems.
Theoretical Computer Science, 140(1):139-178, March 1995.
Full paper
Robert Nieuwenhuis and Albert Rubio.
Theorem Proving with Ordering and Equality Constrained Clauses.
J. of Symbolic Computation, 19(4):321-351, April 1995.
Full paper
Fernando Orejas, Elvira Pino, and Ehrig Hartmut.
Institutions for Logic Programming.
Theoretical Computer Science, 1995.
To appear.
Full paper
Albert Rubio and Robert Nieuwenhuis.
A total AC-compatible ordering based on RPO.
Theoretical Computer Science, 142(2):209-227, May 15, 1995.
Full paper
Albert Rubio.
Extension Orderings.
In Automata, Languages and Programming, 22nd International Colloquium,
LNCS, Szeged, Hungary, July 10-14 1995. Springer-Verlag.
Full
paper
Albert Rubio.
Theorem Proving modulo Associativity.
In Conference of the European Association for Computer Science Logic,
LNCS, Paderborn, Germany, September 1995. Springer-Verlag.
Full
paper
Back to the CCL online bibliography.
Ralf Treinen
Generated at
Mon Mar 12 07:07:00 CET 2001.