CCL Bibliography 1997

CIS München

Franz Baader and Klaus U. Schulz. Unification Theory - An Introduction. Technical Report CIS-Bericht-97-103, CIS, LMU Munich, 1997.
Full paper

Klaus U. Schulz. A Criterion for Intractability of E-unification with free function symbols and its relevance for combination of unification algorithms. In H. Comon, editor, Rewriting Techniques and Applications, 8th International Conference (RTA-97), volume 1232 of LNCS, pages 284-298. Springer, 1997.
Full paper

Klaus U. Schulz and Tomasz Mikolajewski. Between Finite State and Prolog: Constraint-Based Automata for Efficient Recognition of Phrases. Journal of Natural Language Engineering, 2(4), 1997.
Abstract

Klaus U. Schulz and Tomasz Mikolajewski. Between Finite State and Prolog: Constraint-Based Automata for Efficient Recognition of Phrases. ACL Studies in Natural Language Processing. Cambridge University Press, 1997. to appear.
Full paper

DFKI Saarbrücken

Hubert Comon and Ralf Treinen. The First-Order Theory of Lexicographic Path Orderings is Undecidable. Theoretical Computer Science, April 1997. To Appear.
Full paper Abstract

Seif Haridi, Peter Van Roy, and Gert Smolka. An Overview of the Design of Distributed Oz. In Proceedings of the Second International Symposium on Parallel Symbolic Computation (PASCO '97), pages 176-187, Maui, Hawaii, USA, July 1997. ACM Press.
Full paper Abstract

Tobias Müller and Martin Müller. Finite Set Constraints in Oz. In François Bry, Burkhard Freitag, and Dietmar Seipel, editors, 13. Workshop Logische Programmierung, pages 104-115, Technische Universität München, 17-19 September 1997.
Full paper Abstract

Martin Müller and Joachim Niehren. Entailment of Set Constraints is not Feasible. Technical report, Programming Systems Lab, Universität des Saarlandes, 1997.
Full paper Abstract

Martin Müller, Joachim Niehren, and Andreas Podelski. Ordering Constraints over Feature Trees. In Gert Smolka, editor, Proceedings of the Third International Conference on Principles and Practice of Constraint Programming, volume 1330 of Lecture Notes in Computer Science, pages 297-311, Schloss Hagenberg, Linz, Austria, 29 October-1 November 1997. Springer-Verlag.
Full paper Abstract

Martin Müller, Joachim Niehren, and Gert Smolka. Typed Concurrent Programming with Logic Variables. Technical report, Programming Systems Lab, Universität des Saarlandes, September 1997.
Full paper Abstract

Tobias Müller and Jörg Würtz. Extending a Concurrent Constraint Language by Propagators. In Jan Maluszynski, editor, Proceedings of the International Logic Programming Symposium, pages 149-163. The MIT Press, 1997.
Full paper Abstract

Joachim Niehren, Martin Müller, and Andreas Podelski. Inclusion Constraints over Non-Empty Sets of Trees. In Max Dauchet, editor, Theory and Practice of Software Development, International Joint Conference CAAP/FASE/TOOLS, volume 1214 of Lecture Notes in Computer Science. Springer-Verlag, April 1997.
Full paper Abstract

Joachim Niehren, Manfred Pinkal, and Peter Ruhrberg. On Equality Up-to Constraints over Finite Trees, Context Unification and One-Step Rewriting. In Procedings of the International Conference on Automated Deduction, volume 1249 of Lecture Notes in Computer Science, pages 34-48, Townsville, Australia, 14-17July 1997. Springer-Verlag. Full version available from http://www.ps.uni-sb.de/Papers/abstracts/fullContext.html.
Full paper Abstract

Joachim Niehren, Manfred Pinkal, and Peter Ruhrberg. A Uniform Approach to Underspecification and Parallelism. In Proceedings of the 35th Annual Meeting of the Association of Computational Linguistics (ACL), pages 410-417, Madrid, Spain, 7-11July 1997.
Full paper Abstract

Andreas Podelski, Witold Charatonik, and Martin Müller. Set-based Error Diagnosis of Concurrent Constraint Programs. Technical report, December 1997. http://www.ps.uni-sb.de/Paper/abstracts/Diagnosis-97.html. Submitted.
Full paper Abstract

Andreas Podelski and Gert Smolka. Situated Simplification. Theoretical Computer Science, 173:209-233, February 1997.

Christian Schulte. Programming Constraint Inference Engines. In Gert Smolka, editor, Proceedings of the Third International Conference on Principles and Practice of Constraint Programming, volume 1330 of Lecture Notes in Computer Science, pages 519-533, Schloß Hagenberg, Austria, October 1997. Springer-Verlag.
Full paper Abstract

Peter Van Roy, Seif Haridi, Per Brand, Gert Smolka, Michael Mehl, and Ralf Scheidhauer. Mobile Objects in Distributed Oz. ACM Transactions on Programming Languages and Systems, 19(5):804-851, September 1997.
Full paper Abstract

Joachim P. Walser. Solving Linear Pseudo-Boolean Constraint Problems with Local Search. In Proceedings of the fourteenth National Conference on Artificial Intelligence (AAAI '97), 1997. To appear.
Full paper Abstract

Univ. Frankfurt

Manfred Schmidt-Schauß. A Unification Algorithm for Distributivity and a Multiplicative Unit. Journal of Symbolic Computation, 22(3):315-344, 1997.

Griffith University

A. Brodsky, J. Jaffar, and M. Maher. Toward Practical Query Evaluation for Constraint Databases. Constraints, 2(3):279-304, 1997.

M. J. Maher. Constrained dependencies. Theoretical Computer Science, 173(1):113-149, 1997.

Hebrew Univ. Jerusalem

Naomi Lindenstrauss and Yehoshua Sagiv. Automatic Termination Analysis of Logic Programs. In Lee Naish, editor, ICLP'97, Proceedings of the 14th International Conference on Logic Programming, pages 63-77. MIT Press, 1997.

Naomi Lindenstrauss, Yehoshua Sagiv, and Alexander Serebrenik. TermiLog: A System for Checking Termination of Queries to Logic Programs. In CAV'97, Computer Aided Verification,9th International Conference, volume 1254 of Lecture Notes in Computer Science, pages 444-447. Springer Verlag, 1997.

University of Illinois / Tel Aviv University

Nachum Dershowitz. Innocuous Constructor-Sharing Combinations. In H. Comon, editor, Proceedings of the Eighth International Conference on Rewriting Techniques and Applications (Sitges, Spain), volume 1232 of Lecture Notes in Computer Science, pages 202-216, Berlin, June 1997. Springer-Verlag.

Nachum Dershowitz. Well-Quasi Orderings and Some Applications (Abstract). In T. Arts, editor, Extended Abstracts of Third International Workshop on Termination (Ede, The Netherlands)", Utrecht, The Netherlands, May 1997. Universiteit Utrecht.

Nachum Dershowitz. When are Two Rewrite Systems More than None?. In I. Pr'vara and P. Ruzicka, editors, Proceedings of the Twenty-Second International Symposium on Mathematical Foundations of Computer Science (Bratislava, Slovakia), volume 1295 of Lecture Notes in Computer Science, pages 37-43, Berlin, August 1997. Springer-Verlag.

Nachum Dershowitz and Naomi Lindenstrauss. Abstract And-Parallel Machines. In C. Lengauer, M. Griebl, and S. Gorlatch, editors, Proceedings of the Third International Euro-Par Conference on Parallel Processing (Passau, Germany), Lecture Notes in Computer Science, pages 1221-1225, Berlin, August 1997. Springer-Verlag.

Nachum Dershowitz, Naomi Lindenstrauss, and Yehoshua Sagiv. What Norms are Useful for Logic Programs? (Abstract). In T. Arts, editor, Extended Abstracts of Third International Workshop on Termination (Ede, The Netherlands)", Utrecht, The Netherlands, May 1997. Universiteit Utrecht.

Nachum Dershowitz, Ralf Treinen, and Laurent Vigneron. Rewriting Home Page, 1997.

INRIA Nancy

F. Ajili and E. Contejean. Avoiding slack variables in the solving of linear diophantine equations and inequations. Theoretical Computer Science, 173(1):183-208, February 1997.
Full paper

A. Amaniss, M. Hermann, and D. Lugiez. Set Operation for Recurrent Term Schematization. In M. Bidoit and M. Dauchet, editors, 7th International Joint Conference on Theory and Practice of Software Development (TAPSOFT'97), volume 1214 of Lecture Notes in Computer Science, pages 333-344, Lille (France), 1997. Springer-Verlag.
Full paper

F. Ajili and C. Kirchner. A Modular Framework for the Combination of Symbolic and Built-In Constraints. In L. Naish, editor, Proceedings of Fourteenth International Conference on Logic Programming, pages 331-345, Leuven (Belgium), July 1997. The MIT press.
Full paper

F. Ajili and H. C. R. Lock. A Propagation-Based Approach for Complete Solving of Linear Diophantine Constraints. In Proceedings of 6th International Workshop on Functional and Logic Programming, Schwarzenberg (Germany), January 1997. Extended abstract.
Full paper

F. Ajili and H. C. R. Lock. Cooperating propagation techniques and linear Diophantine constraints solving. In S. Anantharaman, P. Réty, and G. Richard, editors, Proceedings of 11th International Workshop on Unification, UNIF'97, Orléans (France), June 1997.

I. Alouini. Étude et mise en oeuvre de la réécriture conditionnelle concurrente sur des machines parallèles à mémoire distribuée. Thèse de Doctorat d'Université, Université Henri Poincaré - Nancy 1, juin 1997.
Full paper

N. Berregeb. Preuves par induction implicite : cas des théories associatives-commutatives et observationnelles. Thèse de Doctorat d'Université, Université Henri Poincaré - Nancy 1, juin 1997.
Full paper

A. Bouhoula and J.-P. Jouannaud. Automata-Driven Automated Induction. In Proceedings 12th IEEE Symposium on Logic in Computer Science, pages 14-25, Warsaw (Poland), 1997. IEEE Comp. Soc. Press.

A. Bouhoula, J.-P. Jouannaud, and J. Meseguer. Specification and proof in membership equational logic. In M. Bidoit and M. Dauchet, editors, Proceedings Theory and Practice of Software Development, volume 1214 of Lecture Notes in Computer Science, pages 67-92, Lille (France), April 1997. Springer-Verlag.

A. Bouhoula. Automated Theorem Proving by Test Set Induction. Journal of Symbolic Computation, 23(1):47-77, 1997.
Full paper

C. Castro. Constraint Manipulation using Rewrite Rules and Strategies. In A. Drewery, G.-J. M. Kruijff, and R. Zuber, editors, Proceedings of 2nd ESSLLI Student Session, 9th European Summer School in Logic, Language and Information, ESSLLI'97, pages 45-56, Aix-en-Provence (France), August 1997.
Full paper

H. Cirstea and C. Kirchner. Theorem proving using computational systems : The case of the B Predicate prover. In Proceedings of Workshop CCL'97, Dagstuhl (Germany), September 1997.

Th. Genet. Decidable Approximations of Sets of Normal Forms and Some Applications. In Workshop CCL'97, Dagstuhl (Germany), 1997.

Th. Genet. Proving Termination of Sequential Reduction Relation using Tree Automata. In Proceedings 3rd International Workshop on Termination, IWT'97 (Abstracts), Utrecht (The Netherlands), May 1997. Full version available as Technical Report 97-R-091, LORIA, Nancy (France).
Full paper

Th. Genet and I. Gnaedig. Termination Proofs using gpo Ordering Constraints. In M. Dauchet, editor, Proceedings 22nd International Colloquium on Trees in Algebra and Programming, volume 1214 of Lecture Notes in Computer Science, pages 249-260, Lille (France), 1997. Springer-Verlag. Extended version available as Technical Report 3087, INRIA, Nancy (France).
Full paper

M. Hermann and Ph. G. Kolaitis. On the complexity of unification and disunification in commutative idempotent semigroups. In G. Smolka, editor, Proceedings 3rd International Conference on Principles and Practice of Constraint Programming (CP'97), volume 1330 of Lecture Notes in Computer Science, pages 283-297, Linz (Austria), October 1997. Springer-Verlag.

C. Kirchner and Ch. Ringeissen. Higher-Order Equational Unification via Explicit Substitutions. In Proceedings International Conference PLILP/ALP/HOA'97, volume 1298 of Lecture Notes in Computer Science, pages 61-75, Southampton (England), 1997. Springer-Verlag.
Full paper

G. Kucherov and M. Rusinowitch. Matching a set of strings with variable length don't cares. Theoretical Computer Science, 178(1-2):129-154, 1997.
Full paper

Ch. Lynch and Ch. Scharff. Basic Completion and E-cycle Simplification. In S. Anantharaman, P. Réty, and G. Richard, editors, Proceedings of 11th International Workshop on Unification, UNIF'97, Orléans (France), June 1997.
Full paper

Ch. Lynch and Ch. Scharff. Basic Completion with E-cycle Simplification. In Proceedings of CCL'97 Workshop, Dagstuhl (Germany), September 1997.

Ch. Lynch. Oriented equational logic programming is complete. Journal of Symbolic Computation, 23(1):23-45, 1997.
Full paper

Ch. Ringeissen. Efficient Combination of Constraint Solvers for Regular and Collapse-Free Amalgamations. In S. Anantharaman, P. Réty, and G. Richard, editors, Proceedings of 11th International Workshop on Unification, UNIF'97, Orléans (France), June 1997.

Ch. Ringeissen. Prototyping Combination of Unification Algorithms with the ELAN Rule-Based Programming Language. In Proceedings 8th Conference on Rewriting Techniques and Applications, volume 1232 of Lecture Notes in Computer Science, pages 323-326, Sitges (Spain), 1997. Springer-Verlag.
Full paper

LIFL Lille

H. Comon, M. Dauchet, Florent Jacquemard, R. Gilleron, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. Available on http://www.grappa.univ-lille3.fr/tata, 1997.
Full paper

P. Devienne, J.-M. Talbot, and S. Tison. Solving Classes of Set Constraints with Tree Automata. In G. Smolka, editor, Proceedings of the 3^th International Conference on Principles and Practice of Constraint Programming, number 1330 in Lecture Notes in Computer Science, pages 62-76, oct 1997.
Full paper

Franck Seynhaeve, Marc Tommasi, and Ralf Treinen. Grid Structures and Undecidable Constraint Theories. In Michel Bidoit and Max Dauchet, editors, Proceedings of the 7^th International Joint Conference on Theory and Practice of Software Development, volume 1214 of Lecture Notes in Computer Science, pages 357-368, Lille, France, April 1997.
Full paper

J.M. Talbot, S. Tison, and P. Devienne. Set-Based Analysis for Logic programming and Tree Automata. In Proceedings of the 1997 Symposium on Static Analysis, number 1302 in Lecture Notes in Computer Science, pages 127-140, 1997.
Full paper

LRI Orsay

Farid Ajili and Evelyne Contejean. Avoiding Slack Variables in the Solving of Linear Diophantine Equations and Inequations. Theoretical Computer Science, 173(1):183-208, February 1997.
Full paper Abstract

Alexandre Boudet and Evelyne Contejean. AC-Unification of Higher-order Patterns. In Gert Smolka, editor, Principles and Practice of Constraint Programming, October 1997 (see there), pages 267-281.
Full paper Abstract

Michel Bidoit and Max Dauchet, editors. Theory and Practice of Software Development, volume 1214 of Lecture Notes in Computer Science, Lille, France, April 1997. Springer-Verlag.

Adel Bouhoula and Jean-Pierre Jouannaud. Automata-Driven Automated Induction. In Twelfth Annual IEEE Symposium on Logic in Computer Science, pages 14-25.

A. Bouhoula, J.-P. Jouannaud, and J. Meseguer. Specification and proof in membership equational logic. In Michel Bidoit and Max Dauchet, editors, Theory and Practice of Software Development, April 1997 (see there), pages 67-92.

Manuel Bronstein and Volker Weispfenning, editors. Proceedings of the Conference on Symbolic Rewriting Techniques, Monte Verita, Switzerland, 1997. Birkhäuser.

Evelyne Contejean, Claude Marché, and Landy Rabehasaina. Rewrite systems for natural, integral, and rational arithmetic. In Hubert Comon, editor, 8th International Conference on Rewriting Techniques and Applications, June 1997 (see there).
Full paper Abstract

Hubert Comon, editor. 8th International Conference on Rewriting Techniques and Applications, volume 1232 of Lecture Notes in Computer Science, Barcelona, Spain, June 1997. Springer-Verlag.

Hubert Comon and Ralf Treinen. The First-Order Theory of Lexicographic Path Orderings is Undecidable. Theoretical Computer Science, 176(1-2):67-87, April 1997.
Full paper Abstract

Roberto Di Cosmo and Delia Kesner. Strong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets. In Twelfth Annual IEEE Symposium on Logic in Computer Science, pages 35-46.

IEEE Comp. Soc. Press. Twelfth Annual IEEE Symposium on Logic in Computer Science, Warsaw,Poland, June 1997.

Jean-Pierre Jouannaud and Mitsuhiro Okada. Abstract data type systems. Theoretical Computer Science, 173(2):349-391, February 1997.

Delia Kesner. Confluence of Extensional and Non-Extensional lambda-calculi with Explicit Substitutions. RR 1103, LRI, Université Paris-Sud, 1997.

Delia Kesner. Reasoning about redundant patterns. Journal of Functional and Logic Programming, 4, 1997.

Claude Marché. Normalized Rewriting: an unified view of Knuth-Bendix completion and Gröbner bases computation. In Manuel Bronstein and Volker Weispfenning, editors, Proceedings of the Conference on Symbolic Rewriting Techniques, 1997 (see there). to appear.
Full paper Abstract

Gert Smolka, editor. Principles and Practice of Constraint Programming, volume 1330 of Lecture Notes in Computer Science, Linz, Austria, October 1997. Springer-Verlag.

Franck Seynhaeve, Marc Tommasi, and Ralf Treinen. Grid Structures and Undecidable Constraint Theories. In Michel Bidoit and Max Dauchet, editors, Theory and Practice of Software Development, April 1997 (see there), pages 357-368. Extended version to appear in Theoretical Computer Science.
Full paper Abstract

Ralf Treinen. Feature Trees over Arbitrary Structures. In Patrick Blackburn and Maarten de Rijke, editors, Specifying Syntactic Structures, chapter 7, pages 185-211. CSLI Publications and FoLLI, 1997.
Full paper Abstract

MPI Saarbrücken

Peter Barth and Alexander Bockmayr. PLAM: ProLog and Algebraic Modelling. In Proceedings of the Fifth International Conference on the Practical Application of Prolog, pages 73-82, London, UK, 1997. The Practical Application Company.

Alexander Bockmayr and Friedrich Eisenbrand. On the Chvátal Rank of Polytopes in the 0/1 Cube. Research Report MPI-I-97-2-009, Max-Planck-Institut für Informatik, Im Stadtwald, D-66123 Saarbrücken, Germany, September 1997.

Leo Bachmair and Harald Ganzinger. Strict Basic Superposition and Chaining. Research Report MPI-I-97-2-011, Max-Planck-Institut für Informatik, Im Stadtwald, D-66123 Saarbrücken, Germany, December 1997.

Leo Bachmair and Harald Ganzinger. A Theory of Resolution. Research Report MPI-I-97-2-005, Max-Planck-Institut für Informatik, Im Stadtwald, D-66123 Saarbrücken, Germany, May 1997. To appear in J.A. Robinson, A. Voronkov (eds): Handbook of Automated Reasoning.

Leo Bachmair, Harald Ganzinger, and Andrei Voronkov. Elimination of Equality via Transformation with Ordering Constraints. Research Report MPI-I-97-2-012, Max-Planck-Institut für Informatik, Im Stadtwald, D-66123 Saarbrücken, Germany, December 1997.

Alexander Bockmayr and Thomas Kasper. A Unifying Framework for Integer and Finite Domain Constraint Programming. Research Report MPI-I-97-2-008, Max-Planck-Institut für Informatik, Im Stadtwald, D-66123 Saarbrücken, Germany, August 1997.

Witold Charatonik and Andreas Podelski. Set Constraints with Intersection. In Glynn Winskel, editor, Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS-97), pages 362-372, Warsaw, Poland, 1997. IEEE Computer Society, IEEE Comput. Soc. Press.

Witold Charatonik and Andreas Podelski. Solving set constraints for greatest models. Research Report MPI-I-97-2-004, Max-Planck-Institut für Informatik, Im Stadtwald, D-66123 Saarbrücken, Germany, November 1997.

Harald Ganzinger, Christoph Meyer, and Christoph Weidenbach. Soft Typing for Ordered Resolution. In William McCune, editor, Proceedings of the 14th International Conference on Automated Deduction (CADE-14), volume 1249 of Lecture Notes in Computer Science, pages 321-335, Townsville, Australia, 1997. Springer.

Martin Müller, Joachim Niehren, and Andreas Podelski. Inclusion Constraints over Non-empty Sets of Trees. In Michel Bidoit and Max Dauchet, editors, Proceedings of the 7th International Joint Conference CAAP/FASE: Theory and practice of software development (TAPSOFT-97), volume 1214 of Lecture Notes in Computer Science, pages 345-356, Lille, France, April 1997. Springer.

Martin Müller, Joachim Niehren, and Andreas Podelski. Ordering Constraints over Feature Trees. In Gert Smolka, editor, Proceedings of the Third International Conference on Principles and Practice of Constraint Programming (CP-97), volume 1330 of Lecture Notes in Computer Science, pages 549-562, Linz, Austria, 1997. Springer.

Maurice Nivat and Andreas Podelski. Minimal Ascending and Descending Tree Automata. SIAM Journal on Computing, 26(1):39-58, 1997.

Andreas Podelski. Set-Based Analysis of Logic Programs and Reactive Logic Programs. In Jan Maluszynski, editor, Proceedings of the International Symposium on Logic Programming (ILPS-14), pages 35-36, Leuven, Belgium, 1997. MIT Press.

Leszek Pacholski and Andreas Podelski. Set Constraints: a Pearl in Research on Constraints. In Gert Smolka, editor, Proceedings of the Third International Conference on Principles and Practice of Constraint Programming (CP-97), volume 1330 of Lecture Notes in Computer Science, pages 549-562, Linz, Austria, 1997. Springer.

Andreas Podelski and Gert Smolka. Situated Simplification. Theoretical Computer Science, 173(1):235-252, February 1997. Preliminary Version in Ugo Montanari, editor, Proceedings of the First International Conference on Principles and Practice of Constraint Programming (CP'95). Springer LNCS 976, 1995.

Georg Struth. On the Word Problem for Free Lattices. In Hubert Comon, editor, Proceedings of the 8th International Conference on Rewriting Techniques and Applications (RTA-97), volume 1103 of Lecture Notes in Computer Science, pages 128-141, Sitges, Spain, June 1997. Springer.

Jürgen Stuber. Strong Symmetrization, Semi-Compatibility of Normalized Rewriting and First-Order Theorem Proving. In Maria Paola Bonacina and Ulrich Furbach, editors, Proceedings of the International Workshop on First-Order Theorem Proving (FTP-97), volume 97-50 of RISC-Linz Report, pages 125-129, Schloss Hagenberg by Linz, Austria, 1997. Johannes Kepler Universität.

Uwe Waldmann. Cancellative Abelian Monoids in Refutational Theorem Proving. PhD thesis, Universität des Saarlandes, July 1997.

Uwe Waldmann. A Superposition Calculus for Divisible Torsion-Free Abelian Groups. In Maria Paola Bonacina and Ulrich Furbach, editors, Proceedings of the International Workshop on First-Order Theorem Proving (FTP-97), number 97-50 in RISC-Linz Report Series, pages 130-134, Linz, Austria, 1997. Johannes Kepler Universität.

Christoph Weidenbach. SPASS Version 0.49. Journal of Automated Reasoning, 18(2):247-252, April 1997.

RWTH Aachen

F. Baader. Combination of Compatible Reduction Orderings that are Total on Ground Terms. In G. Winskel, editor, Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS-97), pages 2-13, Warsaw, Poland, 1997. IEEE Computer Society Press.
Abstract

F. Baader and P. Narendran. Unification of Concept Terms. In Proceedings of the 11th International Workshop on Unification, UNIF-97, LIFO Technical Report 97-8. LIFO, Universitè de Orlèans, 1997.
Full paper Abstract

F. Baader and P. Narendran. Unification of Concept Terms in Description Logics. In Proceedings of the International Workshop on Description Logics, DL'97, pages 34-38. LRI, Universitè PARIS-SUD, Cente d'Orsay, 1997.
Full paper Abstract

Franz Baader and Klaus U. Schulz. Unification Theory - An Introduction. Research Report CIS-Rep-97-103, Center for Language and Information Processing (CIS), Oettingenstraße 67, D-80538 Munich, Germany, January 1997.
Full paper Abstract

F. Baader and C. Tinelli. A New Approach for Combining Decision Procedures for the Word Problem, and Its Connection to the Nelson-Oppen Combination Method. In W. McCune, editor, Proceedings of the 14th International Conference on Automated Deduction (CADE-97), volume 1249 of Lecture Notes in Artificial Intelligence, pages 19-33. Springer-Verlag, 1997.
Abstract

TU München

Franz Baader and Tobias Nipkow. Term Rewriting and All That. Cambridge University Press, 1997. To appear.

UC Madrid

L. Araujo Serna, J.C. González Moreno, T. Hortalá González, and E. Ullán Hernández. A Little User Manual for BabLog System. Research Report 52-97, Departamento de Informática y Automática, Facultad de Matemáticas (UCM), Av. Complutense s/n, Ciudad Universitaria, Madrid E-28040 (SPAIN), 1997.
Full paper Abstract

R. Caballero Roldán, P. López Fraguas, and Sánchez Hernández J. User's Manual for Toy. Research Report 57-97, Departamento de Sistemas Informáticos y Programación, Facultad de Matemáticas (UCM), Av. Complutense s/n, Ciudad Universitaria, Madrid E-28040 (SPAIN), 1997.
Full paper Abstract

A. Gavilanes Franco, J. Leach Albert, C. Martín de la Calle, and S. Nieva Soto. Semantic Tableaux for a Logic with Preorders and Dynamic Declarations. In TABLEAUX' 97, pages 7-12. CRIN 97-R-030, 1997. Position Papers.
Full paper Abstract

A. Gavilanes, J. Leach, P.J. Martín, and S. Nieva. Semantic Tableaux for a Logic with Preorders and Dynamic Declarations. Technical Report TR97-50, Dpto. de Sistemas Informáticos y Programación, Univ. Complutense de Madrid, 1997. Position paper presented at TABLEAUX'97.

J. C. González Moreno, Hortalá González M. T., and M. Rodríguez Artalejo. A Higher Order Rewriting Logic for Functional Logic Programming. In Proc. ICLP' 97, Logic Programming, pages 153-167. MIT Press, 1997.
Full paper Abstract

J. Leach, S. Nieva, and M. Rodríguez-Artalejo. Constraint Logic Programming with Hereditary Harrop Formulas. In Proc. ILPS'97, pages 307-321. The MIT Press, 1997.

P.J. Martín, A. Gavilanes, and J. Leach. Free variable tableaux for a logic with term declarations. Technical Report TR97-69, Dpto. de Sistemas Informáticos y Programación, Univ. Complutense de Madrid, 1997.

M. Rodríguez-Artalejo P. Arenas-Sánchez. A Semantic Framework for Functional Logic Programming with Algebraic Polymorphic Types. In Michel Bidoit and Max Dauchet, editors, Tapsoft'97(CAAP'97), volume 1214 of Lecture Notes in Computer Science, pages 453-464. Springer-Verlag, 1997.
Full paper Abstract

A. Ruiz-Andino and J.J. Ruz. Integration of Constraint Programming and Evolution Programs: Application to Channel Routing. In Proc. of the 11th Int. Conf. on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, volume 1415 of LNAI, pages 448-459. Springer Verlag, 1997.

UP Barcelona

Robert Nieuwenhuis and Albert Rubio. Paramodulation with Built-in AC-Theories and Symbolic Constraints. Journal of Symbolic Computation, 23(1):1-21, May 1997.
Full paper

Robert Nieuwenhuis, José Miguel Rivero, and Miguel Ángel Vallejo. The Barcelona Prover. Journal of Automated Reasoning, 18(2):171-176, 1997.

Univ. Wroclaw

Leszek Pacholski and Andreas Podelski. Set Constraints - a Pearl in Research on Constraints. In Gert Smolka, editor, Proceedings of the Third International Conference on Principles and Practice of Constraint Programming - CP97, volume 1330 of LNCS, Berlin, Germany, October 1997. Springer-Verlag.


Back to the CCL online bibliography.
Ralf Treinen
Generated at Mon Mar 12 07:07:00 CET 2001.