Jörg Würtz.
Unifying Cycles.
In Bernd Neumann, editor, 10th European Conference on Artificial
Intelligence, pages 60-64, Vienna, Austria, August 1992. John Wiley &
Sons.
Extended Version: DFKI Research Report, RR-92-22.
Full
paper Abstract
M. Adi and C. Kirchner.
Associative Commutative Matching Based on the Syntacticity of the AC
Theory.
In F. Baader, J. Siekmann, and W. Snyder, editors, Proceedings of 6th
International Workshop on Unification, UNIF'92, Dagstuhl (Germany), 1992.
A. Bouhoula, E. Kounalis, and M. Rusinowitch.
SPIKE: An automatic theorem prover.
In A. Voronkov, editor, Proc. International Conference Logic Programming
and Automated Reasoning, volume 624 of Lecture Notes in Artificial
Intelligence, pages 460-462, St. Petersburg (Russia), July 1992.
Springer-Verlag.
R. Curien.
Combining Second Order Matching and First Order E-Matching.
Technical Report 92-R-178, CRIN, Nancy (France), 1992.
E. Domenjoud.
AC-Unification through Order-Sorted AC1 Unification.
Journal of Symbolic Computation, 14:537-556, 1992.
E. Domenjoud.
A technical note on AC-Unification. The Number of Minimal Unifiers of the
Equation [alpha]x_1 + + [alpha]x_p _ AC
[beta]y_1 + + [beta]y_q.
Journal of Automated Reasoning, 8:39-44, 1992.
Also available as Technical Report 89-R-2, CRIN, Nancy (France).
I. Gnaedig.
Termination of order-sorted rewriting.
In H. Kirchner and G. Levi, editors, Proceedings of 3rd Algebraic and Logic
Programming Conference, volume 632 of Lecture Notes in Computer
Science, pages 37-52, Volterra (Italy), September 1992. Springer-Verlag.
J. Hsiang, H. Kirchner, P. Lescanne, and M. Rusinowitch.
The term rewriting approach to automated theorem proving.
Journal of Logic Programming, 14(1&2):71-100, October 1992.
C. Kirchner, H. Kirchner, and M. Vittek.
Implementation of computational logics with constraints or ECOLOG-Nancy, a
meta-language for specifing logic programming languages.
In E. Domenjoud and C. Kirchner, editors, Proceedings of 1st CCL
Workshop, Le Val d'Ajol (France), 1992.
F. Klay.
Unification dans les Théories Syntaxiques.
Thèse de Doctorat d'Université, Université Nancy 1, 1992.
H. Kirchner and Ch. Ringeissen.
A constraint solver in finite algebras and its combination with unification
algorithms.
In K. Apt, editor, Proceedings Joint International Conference and Symposium
on Logic Programming, pages 225-239, Washington (DC, USA), 1992. The MIT
press.
Full paper
Ch. Ringeissen.
Unification in a combination of equational theories with shared constants
and its application to Primal Algebras.
In A. Voronkov, editor, Proceedings International Conference Logic
Programming and Automated Reasoning, volume 624 of Lecture Notes in
Artificial Intelligence, pages 261-284, St. Petersburg (Russia), July
1992. Springer-Verlag.
Full paper
M. Rusinowitch and J.-L. Rémy, editors.
Conditional Term Rewriting Systems, Third International Workshop,
volume 656 of Lecture Notes in Computer Science, Pont-à-Mousson
(France), July 1992. Springer-Verlag.
M. Rusinowitch and L. Vigneron.
Associative Commutative Deduction.
In E. Domenjoud and C. Kirchner, editors, Proceedings of 1st CCL
Workshop, Le Val d'Ajol (France), 1992.
P. Viry.
La réécriture concurrente.
Thèse de Doctorat d'Université, Université Nancy 1, 1992.
Full
paper
M. Vittek.
A Combinatory Logic Rewriting Relation which Supports Narrowing.
In F. Baader, J. Siekmann, and W. Snyder, editors, Proceedings of 6th
International Workshop on Unification, UNIF'92, Dagstuhl (Germany), 1992.
Maribel Fernández.
Narrowing based procedures for equational disunification.
Applicable Algebra in Engineering Communication and Computing, 3:1-26,
1992.
Jean-Pierre Jouannaud, Claude Kirchner, Hélène Kirchner, and Aristide
Megrelis.
OBJ: Programming with equalities, subsorts, overloading and
parametrization.
Journal of Logic Programming, 12:257-279, 1992.
Jean-Pierre Jouannaud and Claude Marché.
Termination and completion modulo associativity, commutativity and
identity.
Theoretical Computer Science, 104:29-51, 1992.
Full paper Abstract
D. Kapur, editor.
11th International Conference on Automated Deduction, volume 607 of
Lecture Notes in Computer Science, Saratoga Springs, NY, June 1992.
Springer-Verlag.
Delia Kesner.
Free Sequentiality in Orthogonal Order-Sorted Rewriting Systems with
Constructors.
In D. Kapur, editor, 11th International Conference on Automated
Deduction, June 1992 (see there), pages 603-617.
Full paper
Mathematical Foundations of Computer Science. Springer-Verlag,
1992.
Claude Marché.
The word problem of ACD-ground theories is undecidable.
International Journal of Foundations of Computer Science, 3(1):81-92,
1992.
Full paper Abstract
Juan Carlos González-Moreno, M. Teresa Hortalá-González, and Mario
Rodríguez-Artalejo.
On the Completeness of Narrowing as the Operational Semantics of Functional
Logic Programming.
In E. Börger, G. Jäger, H. Kleine Büning, S. Martini, and M. M.
Richter, editors, Computer Science Logic. Selected papers from
CSL'92, volume 702 of LNCS, pages 216-231, San Miniato, Italy,
sep/oct 1992. Springer.
Full paper Abstract
Back to the CCL online bibliography.
Ralf Treinen
Generated at
Mon Mar 12 07:07:00 CET 2001.