Franz Baader and Klaus U. Schulz.
On the Combination of Symolic Constraints, Solution Domains, and
Constraint Solvers.
Research Report CIS-Rep-94-82, Center for Information- and Language Processing
(CIS), Wagmüllerstr. 23, D-80538 Munich, Germany, december 1994.
Full
paper Abstract
Klaus U. Schulz.
On Existential Theories of List Concatenation.
Research report, Center for Information- and Language Processing (CIS),
Wagmüllerstr. 23, D-80538 Munich, Germany, September 1994.
The paper has been presented at the Conference on Computer Science Logic 94 in
Kazimierz, Poland. A longer version will soon appear as CIS report.
Full
paper Abstract
Rolf Backofen and Ralf Treinen.
How to Win a Game with Features.
In Jean-Pierre Jouannaud, editor, 1st International Conference on
Constraints in Computational Logics, Lecture Notes in Computer Science,
vol. 845, pages 320-335, München, Germany, September 1994.
Springer-Verlag.
Full
paper Abstract
Hubert Comon and Ralf Treinen.
Ordering Constraints on Trees.
In Sophie Tison, editor, Colloquium on Trees in Algebra and
Programming, Lecture Notes in Computer Science, vol. 787, pages 1-14,
Edinburgh, Scotland, April 1994. Springer-Verlag.
Full
paper Abstract
P. Devienne, P. Lebegue, J.C. Routier, and J. Würtz.
One binary Horn clause is enough.
In K.W. Wagner P. Enjalbert, E.W. Mayr, editor, Symposium on Theoretical
Aspects of Computer Science, Lecture Notes in Computer Science, vol. 775,
pages 21-32. Springer-Verlag, February 1994.
Full
paper Abstract
Martin Müller.
A Constraint-Based Recast of ML-Polymorphism.
In Denis Lugiez, editor, 8^thInternational Workshop on Unification,
June23-25 1994.
Technical Report, Université de Nancy, to appear.
Full
paper Abstract
Joachim Niehren.
Funktionale Berechnung in einem uniform nebenläufigen Kalkül mit
logischen Variablen.
PhD thesis, Universität des Saarlandes, Fachbereich Informatik,
Stuhlsatzenhausweg, 66123 Saarbrücken, Germany, December 1994.
Full paper Abstract
Joachim Niehren and Gert Smolka.
A Confluent Relational Calculus for Higher-Order Programming with
Constraints.
In Jean-Pierre Jouannaud, editor, 1^st International Conference on
Constraints in Computational Logics, Lecture Notes in Computer Science,
vol. 845, pages 89-104, München, Germany, 7-9 September 1994.
Springer-Verlag.
Full
paper Abstract
Peter Van Roy.
1983-1993: The Wonder Years of Sequential Prolog Implementation.
Journal of Logic Programming, 1994.
Full paper Abstract
Gert Smolka.
A Calculus for Higher-Order Concurrent Constraint Programming with Deep
Guards.
Research Report RR-94-03, Deutsches Forschungszentrum für Künstliche
Intelligenz, Stuhlsatzenhausweg 3, D-66123 Saarbrücken, Germany, February
1994.
Full
paper Abstract
Gert Smolka.
A Foundation for Higher-order Concurrent Constraint Programming.
In Jean-Pierre Jouannaud, editor, 1st International Conference on
Constraints in Computational Logics, Lecture Notes in Computer Science,
vol. 845, pages 50-72, München, Germany, 7-9 September 1994.
Springer-Verlag.
Full
paper Abstract
Christian Schulte and Gert Smolka.
Encapsulated Search in Higher-order Concurrent Constraint Programming.
In Maurice Bruynooghe, editor, Logic Programming: Proceedings of the 1994
International Symposium, pages 505-520, Ithaca, New York, USA, November
1994. MIT-Press.
Full
paper Abstract
Christian Schulte, Gert Smolka, and Jörg Würtz.
Encapsulated Search and Constraint Programming in Oz.
In A.H. Borning, editor, Second Workshop on Principles and Practice of
Constraint Programming, Lecture Notes in Computer Science, vol. 874,
pages 134-150, Orcas Island, Washington, USA, May 1994. Springer-Verlag.
Full
paper Abstract
Gert Smolka and Ralf Treinen.
Records for Logic Programming.
Journal of Logic Programming, 18(3):229-258, April 1994.
Full paper Abstract
Jörg Würtz.
Towards the verification of concurrent constraint programs in finite domain
reasoning.
In F.S. de Boer and M. Gabbrielli, editors, Post-conference workshop at
ICLP: Verification and analysis of (concurrent) logic languages, pages
87-107, June 1994.
Full
paper Abstract
A. Bouhoula.
Preuves Automatiques par Récurrence dans les Théories
Conditionnelles.
Thèse de Doctorat d'Université, Université Nancy 1, mars 1994.
A. Bouhoula.
SPIKE: a system for sufficient completeness and parameterized inductive
proof.
In A. Bundy, editor, Proceedings 12th International Conference on Automated
Deduction, volume 814 of Lecture Notes in Artificial
Intelligence, pages 836-840, Nancy (France), June 1994. Springer-Verlag.
A. Bouhoula.
Sufficient Completeness and Parameterized Proofs by Induction.
In Proceedings Fourth International Conference on Algebraic and Logic
Programming, volume 850 of Lecture Notes in Computer Science,
pages 23-40, Madrid (Spain), September 1994. Springer-Verlag.
G. Dowek, Th. Hardin, and C. Kirchner.
Higher-order unification via explicit substitutions.
In D. Lugiez, editor, Proceedings 8th International Workshop on
Unification, UNIF'94, Val d'Ajol (France), June 1994.
Also available as Technical Report 94-R-243, CRIN, Nancy (France).
Full paper
E. Domenjoud, F. Klay, and Ch. Ringeissen.
Combination techniques for non-disjoint equational theories.
In A. Bundy, editor, Proceedings 12th International Conference on Automated
Deduction, volume 814 of Lecture Notes in Artificial
Intelligence, pages 267-281, Nancy (France), June 1994. Springer-Verlag.
Full paper
E. Domenjoud.
Extending Elliot/MacMahon's algorithm to arbitrary linear
constraints.
In E. Contejean, editor, Proceedings of 2nd SOL Workshop, Orsay
(France), November 1994.
D. Hofbauer and M. Huber.
Linearizing Term Rewriting Systems Using Test Set.
Journal of Symbolic Computation, 17(1):91-129, 1994.
H. Kirchner and Ch. Ringeissen.
Combining Symbolic Constraint Solvers on Algebraic Domains.
Journal of Symbolic Computation, 18(2):113-155, 1994.
Full paper
H. Kirchner and Ch. Ringeissen.
Constraint solving by narrowing in combined algebraic domains.
In P. Van Hentenryck, editor, Proceedings of 11th International Conference
on Logic Programming, pages 617-631, Santa Marherita Ligure (Italy),
1994. The MIT press.
Full paper
G. Kucherov and M. Rusinowitch.
On Ground-Reducibility Problem for Word Rewriting Systems with
Variables.
In E. Deaton and R. Wilkerson, editors, Proceedings 1994 ACM/SIGAPP
Symposium on Applied Computing, Phoenix (AR, USA), March 1994. ACM-Press.
D. Lugiez and J.-L. Moysset.
Tree automata help one to solve equational formulae in AC-theories.
Journal of Symbolic Computation, 18(4):297-318, 1994.
Full paper
D. Lugiez.
Higher-order disunification: some decidable cases.
In J.-P. Jouannaud, editor, Constraints in Computational Logics, volume
845 of Lecture Notes in Computer Science, pages 121-135, Munich
(Germany), September 1994. Springer-Verlag.
D. Lugiez.
Higher-order disunification: some decidable cases.
In D. Lugiez, editor, Proceedings of 8th International Workshop on
Unification, UNIF'94, Val d'Ajol (France), June 1994.
Ch. Lynch.
Local Simplification.
In J.-P. Jouannaud, editor, Constraints in Computational Logics, volume
845 of Lecture Notes in Computer Science, pages 3-18, Munich
(Germany), September 1994. Springer-Verlag.
Ch. Ringeissen.
Combination of matching algorithms.
In P. Enjalbert, E. W. Mayr, and K. W. Wagner, editors, Proceedings 11th
Annual Symposium on Theoretical Aspects of Computer Science, volume 775
of Lecture Notes in Computer Science, pages 187-198, Caen (France),
February 1994. Springer-Verlag.
Full paper
J.-L. Rémy and M. Rusinowitch, editors.
Journal of Symbolic Computation, Special Issue on Conditional Term
Rewriting Systems.
Academic Press, 1994.
L. Vigneron.
Associative-Commutative Deduction with Constraints.
In A. Bundy, editor, Proceedings 12th International Conference on Automated
Deduction, volume 814 of Lecture Notes in Artificial
Intelligence, pages 530-544, Nancy (France), June 1994. Springer-Verlag.
Full paper
L. Vigneron.
Déduction automatique avec contraintes symboliques dans les théories
équationnelles.
Thèse de Doctorat d'Université, Université Henri Poincaré - Nancy 1,
novembre 1994.
Full paper
L. Vigneron.
Proofs in Equational Theories.
In D. Lugiez, editor, Proceedings 8th International Workshop on
Unification, UNIF'94, Val d'Ajol (France), June 1994.
M. Vittek.
ELAN: Un cadre logique pour le prototypage de langages de programmation
avec contraintes.
Thèse de Doctorat d'Université, Université Henri Poincaré - Nancy 1,
octobre 1994.
Full paper
Alexandre Boudet and Evelyne Contejean.
``Syntactic'' AC-Unification.
In Jean-Pierre Jouannaud, editor, First International Conference on
Constraints in Computational Logics, September 1994 (see there), pages
136-151.
Full paper
Abstract
F. Barbanera, M. Fernández, and H. Geuvers.
Modularity of Strong Normalization and Confluence in the
lambda-algebraic-cube.
In Proceedings of the Ninth Annual IEEE Symposium on Logic in Computer
Science, pages 406-415.
Anne-Cécile Caron, Hubert Comon, Jean-Luc Coquidé, Max Dauchet, and
Florent Jacquemard.
Pumping, Cleaning and Symbolic Constraints Solving.
In Proc. Int. Conference on Algorithms, Languages and Programming,
pages 436-449, 1994.
Hubert Comon and Catherine Delor.
Equational Formulae with Membership Constraints.
Information and Computation, 112(2):167-216, August 1994.
Full paper
Abstract
Hubert Comon, Marianne Haberstrau, and Jean-Pierre Jouannaud.
Syntacticness, Cycle-Syntacticness and Shallow Theories.
Information and Computation, 111(1):154-191, May 1994.
Full paper
Hubert Comon and Ralf Treinen.
Ordering Constraints on Trees.
In Sophie Tison, editor, Colloquium on Trees in Algebra and
Programming, 1994 (see there), pages 1-14.
(Invited Lecture).
Full paper
Roberto Di Cosmo and Delia Kesner.
Combining first order algebraic rewriting systems, recursion and
extensional lambda calculi.
In Serge Abiteboul and Eli Shamir, editors, 21th International Colloquium
on Automata, Languages and Programming, July 1994 (see there), pages
462-472.
Full paper
Roberto Di Cosmo and Delia Kesner.
Simulating expansions without expansions.
Mathematical Structures in Computer Science, 4:315-362, 1994.
Full paper
Marianne Haberstrau.
ECOLOG: an Environment for COnstraint LOGics.
In Jean-Pierre Jouannaud, editor, First International Conference on
Constraints in Computational Logics, September 1994 (see there), pages
237-252.
IEEE Comp. Soc. Press.
Proceedings of the Ninth Annual IEEE Symposium on Logic in Computer
Science, Paris, France, July 1994.
Jean-Pierre Jouannaud, editor.
First International Conference on Constraints in Computational Logics,
volume 845 of Lecture Notes in Computer Science, München,
Germany, September 1994. Springer-Verlag.
Jean-Pierre Jouannaud and Walid Sadfi.
Strong sequentiality of left-linear overlapping rewrite systems.
In N. Dershowitz, editor, Workshop on Conditional Term Rewriting
systems, Lecture Notes in Computer Science, vol. 968, pages 235-246,
Jerusalem, July 1994. Springer-Verlag.
Full
paper Abstract
Delia Kesner.
Reasoning about Layered, Wildcard and Product Patterns.
In Giorgio Levi and Mario Rodríguez-Artalejo, editors, 4th
International Conference on Algebraic and Logic Programming, September
1994 (see there), pages 253-268.
Full paper
Giorgio Levi and Mario Rodríguez-Artalejo, editors.
4th International Conference on Algebraic and Logic Programming, volume
850 of Lecture Notes in Computer Science, Madrid, Spain, September
1994. Springer-Verlag.
Claude Marché.
Normalised Rewriting and Normalised Completion.
In Proceedings of the Ninth Annual IEEE Symposium on Logic in Computer
Science, pages 394-403.
Full paper Abstract
Sophie Tison, editor.
Colloquium on Trees in Algebra and Programming, volume 787 of
Lecture Notes in Computer Science, Edinburgh, Scotland, 1994.
Springer-Verlag.
Peter Barth.
Linear 0-1 Inequalities and Extended Clauses.
Research Report MPI-I-94-216, Max-Planck-Institut für Informatik, Im
Stadtwald, D-66123 Saarbrücken, Germany, April 1994.
Peter Barth.
Simplifying Clausal Satisfiability Problems.
In Jean-Pierre Jouannaud, editor, Proceedings of the 1st International
Conference on Constraints in Computational Logics (CCL'94), volume 845 of
Lecture Notes in Computer Science, pages 19-33, Munich, Germany,
September 1994. Springer.
Peter Barth and Alexander Bockmayr.
Finite Domain and Cutting Plane Techniques in CLP( PB).
Research Report MPI-I-94-261, Max-Planck-Institut für Informatik, Im
Stadtwald, D-66123 Saarbrücken, Germany, November 1994.
Accepted for ICLP'95.
Peter Barth and Alexander Bockmayr.
Global Consistency in CLP( PB).
In Proceedings of the 10th Workshop Logic Programming WLP'94, page 4,
Zurich, 1994.
Leo Bachmair and Harald Ganzinger.
Buchberger's algorithm: a constraint-based completion procedure.
In Jean-Pierre Jouannaud, editor, Proceedings of the 1st International
Conference on Constraints in Computational Logics (CCL'94), volume 845 of
Lecture Notes in Computer Science, pages 285-301, Munich, Germany,
September 1994. Springer.
Leo Bachmair and Harald Ganzinger.
Ordered Chaining for Total Orderings.
In Alan Bundy, editor, Proceedings of the 12th International Conference on
Automated Deduction (CADE-12), volume 814 of Lecture Notes in
Artificial Intelligence, pages 435-450, Nancy, France, 1994. Springer.
Full version available as Research Report MPI-I-93-250, 1993.
Leo Bachmair and Harald Ganzinger.
Rewrite Techniques for Transitive Relations.
In Proceedings of the 9th IEEE Symposium on Logic in Computer Science,
pages 384-393. IEEE Computer Society Press, 1994.
Full version available as Technical Report MPI-I-93-249.
Leo Bachmair, Harald Ganzinger, and Uwe Waldmann.
Refutational Theorem Proving for Hierarchic First-Order Theories.
Applicable Algebra in Engineering, Communication and Computing (AAECC),
5(3-4):193-212, April 1994.
Earlier Version: Theorem Proving for Hierarchic First-Order Theories, in
Giorgio Levi and Hélène Kirchner, editors, Algebraic and Logic
Programming, Third International Conference, LNCS 632, pages 420-434,
Volterra, Italy, September 2-4, 1992, Springer-Verlag.
Alexander Bockmayr.
Cutting Planes in Constraint Logic Programming.
Research Report MPI-I-94-207, Max-Planck-Institut für Informatik, Im
Stadtwald, D-66123 Saarbrücken, Germany, February 1994.
Alexander Bockmayr.
Cutting planes in constraint logic programming (Abstract).
In Proceedings of the 3rd International Symposium Artificial Intelligence
and Mathematics, Ft. Lauderdale, Florida, 1994. Florida Atlantic
University.
Alexander Bockmayr.
Using Strong Cutting Planes in Constraint Logic Programming (Extended
Abstract).
In A. Bachem and et al., editors, Operations Research '93, 18th Symposium
on Operations Research, pages 47-49, Köln, September 1994. Physica
Verlag.
Detlef Fehrer, Ullrich Hustadt, Manfred Jaeger, Andreas Nonnengart,
Hans Jürgen Ohlbach, Renate A. Schmidt, Christoph Weidenbach, and Emil
Weydert.
Description Logics for Natural Language Processing.
In Franz Baader, Maurizio Lenzerini, Werner Nutt, and Peter F. Patel-Schneider,
editors, International Workshop on Description Logics '94, volume
D-94-10 of Document, pages 80-84, Bonn, Germany, 1994. DFKI.
Harald Ganzinger.
The Saturate System.
Available on the World-Wide Web and URL
http://www.mpi-sb.mpg.de/SATURATE/Saturate.html, 1994.
Michael Hanus.
Combining Lazy Narrowing and Simplification.
In Manuel Hermenegildo and Jaan Penjam, editors, Proceedings of the 6th
International Symposium on Programming Language Implementation and Logic
Programming (PLILP'94), volume 844 of Lecture Notes in Computer
Science, pages 370-384, Madrid, Spain, 1994. Springer-Verlag.
Michael Hanus.
The Integration of Functions into Logic Programming: From Theory to
Practice.
Journal of Logic Programming, 19 & 20:583-628, 1994.
Also available as Research Report MPI-I-94-201, Max-Planck-Institut für
Informatik, Saarbrücken.
Michael Hanus.
Lazy Unification with Simplification.
In Don Sannella, editor, Proceedings of the 5th European Symposium on
Programming Languages and Systems (ESOP'94), volume 788 of Lecture
Notes in Computer Science, pages 272-286, Edinburgh, UK, 1994.
Springer-Verlag.
Michael Hanus and Frank Zartmann.
Mode Analysis of Functional Logic Programs.
In Baudouin Le Charlier, editor, Proceedings of the 1st International
Static Analysis Symposium (SAS'94), volume 864 of Lecture Notes in
Computer Science, pages 26-42, Namur, Belgium, 1994. Springer-Verlag.
Jürgen Stuber.
Computing Stable Models by Program Transformation.
In Pascal Van Hentenryck, editor, Proceedings of the 11th International
Conference on Logic Programming (ICLP'94), pages 58-73, Santa Margherita
Ligure, Italy, 1994. MIT Press.
Andreas Werner, Alexander Bockmayr, and Stefan Krischer.
How to realize LSE narrowing.
In Giorgio Levi and Mario Rodríguez-Artalejo, editors, Proceedings of the
4th International Conference on Algebraic and Logic Programming (ALP'94),
volume 850 of Lecture Notes in Computer Science, pages 59-76,
Madrid, Spain, 1994. Springer-Verlag.
Christoph Weidenbach.
First-Order Tableaux with Sorts.
In Krysia Broda, Marcello D'Agostino, and et. al., editors, TABLEAUX-'94,
3rd Workshop on Theorem Proving with Analytic Tableaux and Related
Methods, pages 247-261, Marseille, France, April 1994. Imperial College
of Science Technology and Medicine, TR-94/5.
To appear in the Bulletin of IGPL.
Christoph Weidenbach.
Sorts, Resolution, Tableaux and Propositional Logic.
In Jürgen Kunze and Herbert Stoyan, editors, KI-94 Workshops: Extended
Abstracts, pages 315-316, Saarbrücken, Germany, 1994. Gesellschaft
für Informatik.
F. Baader and A. Laux.
Terminological Logics with Modal Operators.
DFKI Research Report RR-94-33, Deutsches Forschungszentrum für
Künstliche Intelligenz, Kaiserslautern, 1994.
Full paper Abstract
F. Baader and K. Schulz.
On the Combination of Symbolic Constraints, Solution Domains, and
Constraint Solvers.
CIS-Report 94-82, Universität München, 1994.
Full paper Abstract
Franz Baader and Klaus U. Schulz.
Combination of Constraint Solving Techniques: An Algebraic Point of
View.
Research Report CIS-Rep-94-75, Center for Language and Information Processing
(CIS), Wagmüllerstraße 23, D-80538 Munich, Germany, July 1994.
Full paper Abstract
Richard Mayr and Tobias Nipkow.
Higher-Order Rewrite Systems and their Confluence.
Technical Report I9433, Insitut für Informatik, TU München, 1994.
Full
paper
Christian Prehofer.
Decidable Higher-order Unification Problems.
In Automated Deduction - CADE-12. Springer LNAI 814, 1994.
Full
paper
Christian Prehofer.
Higher-order Narrowing.
In Proc. Ninth Annual IEEE Symposium on Logic in Computer Science.
IEEE Computer Society Press, July 1994.
Full
paper
Christian Prehofer.
On Modularity in Term Rewriting and Narrowing.
In Jean-Pierre Jouannaud, editor, 1st International Conference on
Constraints in Computational Logics, München, Germany, 7-9September
1994. Springer LNCS 845.
Full
paper
Puri Arenas Martínez, Ana Gil Luezas, and Francisco López Fraguas.
Combining Lazy Narrowing with Disequality Constraints.
Research Report DIA 94/2, Departamento de Informática y Automática,
Facultad de Matemáticas (UCM), Av. Complutense s/n, Ciudad Universitaria,
Madrid E-28040 (SPAIN), March 1994.
Submitted.
Full paper Abstract
Puri Arenas Sánchez and Ana Gil Luezas.
A Debugging Model for Lazy Functional Logic Languages.
Research Report DIA 94/6, Departamento de Informática y Automática,
Facultad de Matemáticas (UCM), Av. Complutense s/n, Ciudad Universitaria,
Madrid E-28040 (SPAIN), April 1994.
Full paper Abstract
Puri Arenas Sánchez and Ana Gil Luezas.
A Debugging Model for Lazy Functional Logic Languages.
In Procs. PRODE-GULP' 94, pages 117-131, 1994.
Full paper Abstract
Alvaro Ruiz-Andino Illera and Jose J. Ruz Ortiz.
Using Prolog and CLP for Designing a Microprogrammed Processor.
In PAP'94, pages 281-289. Leon Sterling, 1994.
Full paper Abstract
Abdela Sadaoui Jose J. Ruz Ortiz and Alvaro Ruiz-Andino Illera.
A VHDL-Based Methodology for Designing a Prolog Processor.
In MELECOM'94, pages 298-301. IEEE, 1994.
Full paper Abstract
Patrick Lincoln, Narciso Martí-Oliet, and José Meseguer.
Specification, Transformation, and Programming of Concurrent Systems in
Rewriting Logic.
In G. E. Blelloch, K. M. Chandy, and S. Jagannathan, editors, Proc. DIMACS
Workshop on Specification of Parallel Algorithms, Princeton, NJ, May
1994, volume 18 of DIMACS Series in Discrete Mathematics and
Theoretical Computer Science, pages 309-339. American Mathematical
Society, 1994.
Abstract
Narciso Martí-Oliet and José Meseguer.
Action and Change in Rewriting Logic.
Technical Report SRI-CSL-94-07, Computer Science Laboratory, SRI International,
April 1994.
To appear in Theoretical Approaches to Dynamic Worlds in Computer Science
and Artificial Intelligence, edited by R. Pareschi and B. Fronhoefer.
Abstract
Narciso Martí-Oliet and José Meseguer.
General Logics and Logical Frameworks.
In D. M. Gabbay, editor, What is a Logical System?, volume 4 of
Studies in Logic and Computation, pages 355-391. Oxford University
Press, 1994.
Abstract
Fernando Orejas, Elvira Pino, and Ehrig Hartmut.
Algebraic methods in the compositional analysis of logic programs.
In I. Privara, B. Rovan, and P. Ruzicka, editors, MFCS 1994, LNCS 841,
pages 112-126, Kosice, Slovakia, September 1994.
Full paper
Albert Rubio.
Automated deduction with ordering and equality constrained clauses.
PhD. Thesis, Technical University of Catalonia, Barcelona, Spain, 1994.
Back to the CCL online bibliography.
Ralf Treinen
Generated at
Mon Mar 12 07:07:00 CET 2001.