CCL Bibliography 1998

CIS München

Franz Baader and Klaus U. Schulz. Combination of Constraint Solvers for Free and Quasi-Free Structures. Theoretical Computer Science, 192:107-161, 1998.
Abstract

Franz Baader and Klaus U. Schulz. Unification Theory - An Introduction. In Wolfgang Bibel and Peter H. Schmitt, editors, Automated Deduction. A basis for applications. Kluwer Academic Publishers, 1998.

Stephan Kepser. Combination of Constraint Systems. PhD thesis, CIS, University of Munich, 1998.
Full paper Abstract

Holger Meuss. Indexed Tree Matching with Complete Answer Representations. In Charles Nicholas and Derrick Wood, editors, Proc. Fourth Workshop on Principles of Digital Document Processing PODDP'98. Springer, 1998.
Abstract

H. Meuss and Klaus U. Schulz. Complete Answer Aggregates for Structured Document Retrieval. Technical Report 98-112, CIS, University of Munich, 1998. Submitted.

Manfred Schmidt-Schauß and Klaus U. Schulz. On the Exponent of Periodicity of Minimal Solutions of Context Equations. In Tobias Nipkow, editor, Rewriting Techniques and Applications, Proceedings RTA-98, LNCS. Springer, 1998.

DFKI Saarbrücken

Ralf Treinen Alexander Koller, Joachim Niehren. Dominance Constraints: Algorithms and Complexity. In Third International Conference on Logical Aspects of Computational Linguistics (LACL '98), Grenoble, France, December 1998.
Full paper Abstract

James M. Crawford, Mukesh Dalal, and Joachim P. Walser. Abstract Local Search. In Proceedings of the AIPS-98 Workshop on Planning as Combinatorial Search, 1998. In conjunction with The Fourth International Conference on Artificial Intelligence Planning Systems, AIPS-98.
Full paper Abstract

Markus Egg, Joachim Niehren, Peter Ruhrberg, and Feiyu Xu. Constraints over Lambda-Structures in Semantic Underspecification. In Proceedings of the 17th International Conference on Computational Linguistics and 36th Annual Meeting of the Association for Computational Linguistics (COLING/ACL'98), pages 353-359, Montreal, Canada, August 1998.
Full paper Abstract

Martin Müller and Joachim Niehren. Ordering Constraints over Feature Trees Expressed in Second-order Monadic Logic. In Tobias Nipkow, editor, International Conference on Rewriting Techniques and Applications, volume 1379 of Lecture Notes in Computer Science, pages 196-210, Tsukuba, Japan, 1998. Springer-Verlag, Berlin.
Full paper Abstract

Martin Müller and Susumu Nishimura. Type Inference for First-Class Messages with Feature Constraints. In Jieh Hsiang and Atsushi Ohori, editors, Asian Computer Science Conference (ASIAN 98), volume 1538 of LNCS, pages 169-187, Manila, The Philippines, December 1998. Springer-Verlag.
Full paper Abstract

Martin Müller, Joachim Niehren, and Ralf Treinen. The First-Order Theory of Ordering Constraints over Feature Trees. In Thirteenth annual IEEE Symposium on Logic in Computer Sience (LICS98), pages 432-443, Indianapolis, Indiana, 21-24 June 1998. IEEE Press. An extended version is available at http://www.ps.uni-sb.de/Papers/abstracts/FTSubTheory-Long:99.html.
Full paper Abstract

Martin Müller. Set-based Failure Diagnosis for Concurrent Constraint Programming. PhD thesis, Universität des Saarlandes, Fachbereich Informatik, Saarbrücken, Germany, January 1998.
Full paper Abstract

Tobias Müller. Solving Set Partitioning Problems with Constraint Programming. In Proceedings of the Sixth International Conference on the Practical Application of Prolog and the Forth International Conference on the Practical Application of Constraint Technology - PAPPACT98, pages 313-332, London, UK, March 1998. The Practical Application Company Ltd.
Full paper Abstract

Joachim Niehren and Alexander Koller. Dominance Constraints in Context Unification. In Third International Conference on Logical Aspects of Computational Linguistics (LACL '98), Grenoble, France, December 1998.
Full paper Abstract

Joachim Niehren, Martin Müller, and Jean-Marc Talbot. Entailment of Atomic Set Constraints is PSPACE-Complete. Technical report, Programming Systems Lab. Univeritaet des Saarlandes, Germany, 1998. This is a preliminary long version of www.ps.uni-sb.de/Papers/abstracts/atomic-lics-99.html.
Full paper Abstract

Klaus Schild and Jörg Würtz. Off-Line Scheduling of a Real-Time System. In K. M. George, editor, Proceedings of the 1998 ACM Symposium on Applied Computing, SAC98, pages 29-38, Atlanta, Georgia, 1998. ACM Press.
Full paper Abstract

Joachim P. Walser, Ramesh Iyer, and Narayan Venkatasubramanyan. An Integer Local Search Method with Application to Capacitated Production Planning. In Proceedings of the 15th National Conference on Artificial Intelligence, AAAI-98, pages 373-379. AAAI press/MIT press, 1998.
Full paper Abstract

Griffith University

G. Antoniou, D. Billington, and M. Maher. Normal Forms for Defeasible Logic. In J. Jaffar, editor, Proc. Joint International Conference and Symposium on Logic Programming, pages 160-174. MIT Press, 1998.

J. Jaffar, M.J. Maher, K.G. Marriott, and P.J. Stuckey. Semantics of Constraint Logic Programs. Journal of Logic Programming, 37:1-46, 1998.

M. Maher, G. Antoniou, and D. Billington. A Study of Provability in Defeasible Logic. In G. Antoniou and J. Slaney, editors, Proc. Australian Joint Conference on Artificial Intelligence, number 1502 in Lecture Notes in Artificial Intelligence. Springer, 1998.

M. Maher and J.-F. Puget, editors. Proc. Fourth International Conference on Principles and Practice of Constraint Programming, number 1520 in Lecture Notes in Computer Science. Springer, 1998.

Hebrew Univ. Jerusalem

Naomi Lindenstrauss, Yehoshua Sagiv, and Alexander Serebrenik. Unfolding the Mystery of Mergesort. In Norbert E. Fuchs, editor, LOPSTR'97, Logic Program Synthesis and Transformation, 7th International Workshop, volume 1463 of Lecture Notes in Computer Science, pages 206-225. Springer Verlag, 1998.

W. Nutt, Y. Sagiv, and S. Shurin. Deciding Equivalences Among Aggregate Queries. In Proc. 17th Symposium on Principles of Database Systems, pages 214-223, Seattle (Washington, USA), June 1998. ACM Press.

University of Illinois / Tel Aviv University

Nachum Dershowitz. Calendar Function Inversion (Abstract). In CCL II Workshop, Jerusalem, September 1998.

Nachum Dershowitz and Subrata Mitra. Function Inversion. In Proceedings of the Workshop on Logic, Language, Information and Computation, Sao Paulo, Brazil, August 1998.

Nachum Dershowitz and Ralf Treinen. An On-line Problem Database. In Proceedings of the Ninth International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science. Springer-Verlag, 1998.

INRIA Nancy

F. Ajili. Contraintes Diophantiennes Linéaires : résolution et coopération inter-résolveurs. Thèse de doctorat d'université, Université Henri Poincaré - Nancy 1, 1998.
Full paper

F. Ajili and H. C. R. Lock. Integrating Constraint Propagation in Complete Solving of Linear Diophantine Systems. In Proceedings of Principles of Declarative Programming (ALP/PLILP'98), volume 1490 of Lecture Notes in Computer Science, pages 463-480, Pisa (Italy), September 1998. Springer-Verlag.
Full paper

N. Berregeb, A. Bouhoula, and M. Rusinowitch. Observational Proofs with Critical Contexts. In Fundamental Approaches to Software Engineering - ETAPS'98, volume 1382 of Lecture Notes in Computer Science, pages 38-53, Lisbon (Portugal), April 1998. Springer-Verlag.
Full paper

P. Borovanský and C. Castro. Cooperation of Constraint Solvers: Using the New Process Control Facilities of ELAN. In C. Kirchner and H. Kirchner, editors, Proceedings of 2nd International Workshop on Rewriting Logic and its Applications, WRLA'98, volume 15 of Electronic Notes in Theoretical Computer Science, pages 379-398, Pont-à-Mousson (France), 1998.
Full paper

P. Borovanský. Le contrôle de la réécriture : étude et implantation d'un formalisme de stratégies. Thèse de Doctorat d'Université, Université Henri Poincaré - Nancy 1, 1998.
Full paper

A. Bouhoula. Mécanisation du Raisonnement par Récurrence. Habilitation à diriger des recherches, Université Henri Poincaré - Nancy 1, 1998.
Full paper

C. Castro. Building Constraint Satisfaction Problem Solvers Using Rewrite Rules and Strategies. Fundamenta Informaticae, 34(3):263-293, 1998.
Full paper

C. Castro. COLETTE, Prototyping CSP Solvers Using a Rule-Based Language. In J. Calmet and J. Plaza, editors, Proceedings of 4th International Conference on Artificial Intelligence and Symbolic Computation, Theory, Implementationsand Applications, AISC'98, volume 1476 of Lecture Notes in Computer Science, pages 107-119, Plattsburgh (NY, USA), 1998. Springer-Verlag.
Full paper

C. Castro. Une approche déductive de la résolution de problèmes de satisfaction de contraintes. Thèse de doctorat d'université, Université Henri Poincaré - Nancy 1, 1998. Also available as Technical Report 98-T-315, LORIA, Nancy (France).
Full paper

C. Castro and C. Kirchner. Using Computational Systems as a General Framework for Handling CSPs. In Proceedings of Annual Workshop of The Constraints in Computational Logics Working Group, CCL'98, Jerusalem (Israel), September 1998.
Full paper

H. Cirstea and C. Kirchner. Combining Higher-Order and First-Order Computation Using -calculus: Towards a semantics of ELAN. In Frontiers of Combining Systems, October 1998. Full version available as Technical Report 98-R-220, LORIA, Nancy (France).

H. Cirstea and C. Kirchner. -calculus, the rewriting calculus. In Proceedings of Annual Workshop of the Constraints in Computational Logics Working Group, CCL'98, Jerusalem (Israel), September 1998.
Full paper

H. Cirstea and C. Kirchner. The rewriting calculus as a semantics of ELAN. In J. Hsiang and A. Ohori, editors, 4th Asian Computing Science Conference, volume 1538 of Lecture Notes in Computer Science, pages 8-10, Manila (The Philippines), December 1998. Springer-Verlag.

H. Cirstea and C. Kirchner. Using Rewriting and Strategies for Describing the B Predicate Prover. In F. Pfenning and B. Gramlich, editors, Proceedings of Workshop on Strategies in Automated Deduction - CADE-15, pages 23-34, Lindau (Germany), 1998.

C. Castro and E. Monfroy. A Strategy Language for Solving CSPs. In K. Apt, Ph. Codognet, and E. Monfroy, editors, Proceedings of 3rd Workshop of the Working Group on Constraints of the European Research Consortium for Informatics and Mathematics, ERCIM'98, Amsterdam (The Netherlands), 1998. CWI Amsterdam.
Full paper

C. Castro and E. Monfroy. A Strategy Language for Specifying Constraint Solvers and their Collaborations. In Proceedings of the Poster Session of the 4th International Conference on Artificial Intelligence and Symbolic Computation, Theory, Implementations and Applications, AISC'98, Plattsburgh (NY, USA), 1998.

H. Comon, P. Narendran, R. Nieuwenhuis, and M. Rusinowitch. Decision problems in ordered rewriting. In Proceedings 13th IEEE Symposium on Logic in Computer Science, June 1998. Also available as Technical Report 98-R-132, LORIA, Nancy (France).
Full paper

Th. Genet. Contraintes d'ordre et automates d'arbres pour les preuves de terminaison. Thèse de Doctorat d'Université, Université Henri Poincaré - Nancy 1, 1998.
Full paper

Th. Genet. Decidable Approximations of Sets of Descendants and Sets of Normal forms . In Proceedings of 9th Conference on Rewriting Techniques and Applications, volume 1379 of Lecture Notes in Computer Science, pages 151-165, Tsukuba (Japan), March 1998. Springer-Verlag.
Full paper

M. Hermann and L. Juban. On Counting the Hilbert basis of a linear Diophantine system. In Proceedings of 12th International Workshop on Unification, UNIF'98, Roma (Italy), June 1998. (extended abstract).

C. Hintermeier, C. Kirchner, and H. Kirchner. Dynamically-Typed Computations for Order-Sorted Equational Presentations. Journal of Symbolic Computation, 25(4):455-526, April 1998.
Full paper

H. Kirchner. Orderings in Automated Theorem Proving. In F. Hoffman, editor, Mathematical Aspects of Artificial Intelligence, volume 55 of Proceedings of Symposia in Applied Mathematics, pages 55-95. American Mathematical Society, 1998.

C. Kirchner and Ch. Ringeissen. Rule-Based Constraint Programming. Fundamenta Informaticae, 34:225-262, 1998.

Ch. Lynch and Ch. Scharff. Basic Completion with E-cycle Simplification. In J. Calmet and J. Plaza, editors, AISC'98, volume 1476 of Lecture Notes in Artificial Intelligence, pages 209-221, Plattsburgh (NY, USA), 1998. Springer-Verlag.

Ch. Lynch and P. Strogova. SOUR Graphs for Efficient Completion. Discrete Mathematics and Theoretical Computer Science, 2:1-25, 1998.
Full paper

Ch. Lynch. Local simplification. Information and Computation, 142(1):102-126, 1998.
Full paper

P.-E. Moreau and H. Kirchner. A Compiler for Rewrite Programs in Associative-Commutative Theories. In C. Palamidessi, H. Glaser, and K. Meinke, editors, ALP/PLILP: Principles of Declarative Programming, volume 1490 of Lecture Notes in Computer Science, pages 230-249, Pisa (Italy), September 1998. Springer-Verlag.
Full paper

P.-E. Moreau. A choice-point library for backtrack programming. In K. Sagolas, editor, Proceedings of JICSLP'98 Post-Conference Workshop on Implementation Technologies for Programming Languages based on Logic, pages 16-31, Manchester (UK), 1998.
Full paper

R. Mayr and M. Rusinowitch. Reachability is decidable for ground AC Rewrite systems. In INFINITY'98, 3rd International Workshop on Verification of Infinite State Systems, Aalborg (Denmark), July 1998.

E. Monfroy and Ch. Ringeissen. Solex: a Domain-Independent Scheme for Constraint Solver Extension. In J. Calmet and J. Plaza, editors, Artificial Intelligence and Symbolic Computation AISC'98, volume 1476 of Lecture Notes in Artificial Intelligence, pages 222-233, Plattsburgh (NY, USA), 1998. Springer-Verlag.

P. Narendran, M. Rusinowitch, and R. Verma. RPO constraint solving is in NP. In Annual Conference of the European Association for Computer Science Logic, Brno (Czech Republic), August 1998. Available as Technical Report 98-R-023, LORIA, Nancy (France).

L. Vigneron. Automated Deduction Techniques for Studying Rough Algebras. Fundamenta Informaticae, 33(1):85-103, February 1998.
Full paper

R. Verma, M. Rusinowitch, and D. Lugiez. Algorithms and Reductions for Rewriting Problems. In Proceedings 9th Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, pages 166-180, Tsukuba (Japan), 1998. Springer-Verlag. Also available as Technical Report 98-R-131, CRIN, Nancy (France).
Full paper

A. Wasilewska and L. Vigneron. Rough Algebras and Automated Deduction. In L. Polkowski and A. Skowron, editors, Rough Sets in Knowledge Discovery, volume 1, pages 261-275. Springer-Verlag, 1998.
Full paper

J. Zhou. A Unified Framework for Solving Boolean, Integer and Set Constraints. In Third International Conference on Systems Science and Systems Engineering, Beijing (China), August 1998. To appear.

LIFL Lille

P. Devienne, JM. Talbot, and S. Tison. Co-definite Set Constraints with Membership Expressions. In Joxan Jaffar, editor, Proceedings of the 1998 Joint International Conference Symposium on Logic Programming, pages 25-39. MIT-Press, jun 1998.

Jean-Marc Talbot. Contraintes Ensemblistes Définies et Co-définies : Extensions et Applications. PhD thesis, Université de Lille, jul 1998.

LRI Orsay

Alexandre Boudet and Evelyne Contejean. About the Confluence of Equational Pattern Rewrite Systems. In C. and H. Kirchner, editors, 15th International Conference on Automated Deduction, volume 1421 of Lecture Notes in Artificial Intelligence, pages 88-102. Springer-Verlag, 1998.

Lubos Brim, Jozef Gruska, and Jiri Zlatuska, editors. Mathematical Foundations of Computer Science, volume 1450 of Lecture Notes in Computer Science, Brno, Czech Republic, August 1998. Springer-Verlag.

F. Blanqui, J.-P. Jouannaud, and M. Okada. Inductive Data Type Systems, 1998. submitted.

F. Blanqui. The Calculus of Algebraic and Inductive Constructions. Master's thesis, Université Paris VII, 1998.

Rolf Backofen and Ralf Treinen. How to Win a Game with Features. Information and Computation, 142(1):76-101, April 1998. Special issue on the 1st International Conference on Constraints in Computational Logics, München, Germany, edited by Jean-Pierre Jouannaud.
Full paper Abstract

Hubert Comon, Mehmet Dincbas, Jean-Pierre Jouannaud, and Claude Kirchner. A methodological view of constraint solving. To appear in Constraints, 1998.
Full paper Abstract

Nachum Dershowitz and Ralf Treinen. An On-line Problem Database. In Tobias Nipkow, editor, 9th International Conference on Rewriting Techniques and Applications, April 1998 (see there), pages 332-342.
Full paper

Maria C.F. Ferreira, Delia Kesner, and Laurence Puel. Reducing AC-Termination to Termination. In Lubos Brim, Jozef Gruska, and Jiri Zlatuska, editors, Mathematical Foundations of Computer Science, August 1998 (see there), pages 239-247.
Full paper

Delia Kesner and Pablo E. Martínez López. Explicit Substitutions for Objects and Functions. In MCatuscia Palamidessi, Hugh Glaser, and Karl Meinke, editors, Principles of Declarative Programming, September 1998 (see there), pages 195-212.

Alexander Koller, Joachim Niehren, and Ralf Treinen. Dominance Constraints: Algorithms and Complexity. In Logical Aspects of Computational Linguistics.
Full paper

Logical Aspects of Computational Linguistics, Grenoble, France, December 1998.

Claude Marché. Normalized Rewriting: an unified view of Knuth-Bendix completion and Gröbner bases computation. Progress in Computer Science and Applied Logic, 15:193-208, 1998.
Full paper Abstract

Martin Müller, Joachim Niehren, and Ralf Treinen. The First-Order Theory of Ordering Constraints over Feature Trees. In Vaughan Pratt, editor, Thirteenth Annual IEEE Symposium on Logic in Computer Science, June 1998 (see there), pages 432-443.

Claude Marché and Xavier Urbain. Termination of Associative-Commutative Rewriting by Dependency Pairs. In Tobias Nipkow, editor, 9th International Conference on Rewriting Techniques and Applications, April 1998 (see there), pages 241-255.
Full paper Abstract

Tobias Nipkow, editor. 9th International Conference on Rewriting Techniques and Applications, volume 1379 of Lecture Notes in Computer Science, Tsukuba, Japan, April 1998. Springer-Verlag.

MCatuscia Palamidessi, Hugh Glaser, and Karl Meinke, editors. Joint International Symposiums Programming Languages, Implementations, Logics and Program (PLILP) and Algebraic and Logic Programming (ALP), volume 1490 of Lecture Notes in Computer Science, Pisa, Italy, September 1998. Springer-Verlag.

Vaughan Pratt, editor. Thirteenth Annual IEEE Symposium on Logic in Computer Science, Indianapolis, IN, USA, June 1998. IEEE Comp. Soc. Press.

Ralf Treinen. The First-Order Theory of Linear One-Step Rewriting Is Undecidable. Theoretical Computer Science, 208(1-2):149-177, November 1998.

MPI Saarbrücken

Alexander Bockmayr and Yannis Dimopoulos. Mixed Integer Programming Models for Planning Problems. In Jeremy Frank and Mihaela Sabin, editors, Proceedings of the Workshop on Constraint Problem Reformulation (CP-98), pages 1-6, Pisa, Italy, 1998. NASA Ames Research Center.

Alexander Bockmayr and Thomas Kasper. Branch-and-Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming. INFORMS Journal on Computing, 10(3):287-300, 1998.

Witold Charatonik. An Undecidable Fragment of the Theory of Set Constraints. Information Processing Letters, 68:147-151, November 1998.

Witold Charatonik, David McAllester, Damian Niwinski, Andreas Podelski, and Igor Walukiewicz. The Horn Mu-calculus. In Vaughan Pratt, editor, Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science (LICS-98), pages 58-69, Indianapolis, Indiana, June 1998. IEEE Technical Committee on Mathematical Foundations of Computing, IEEE Computer Society Press.

Witold Charatonik and Andreas Podelski. Co-definite Set Constraints. In Tobias Nipkow, editor, Proceedings of the 9th International Conference on Rewriting Techniques and Applications (RTA-98), volume 1379 of Lecture Notes in Computer Science, pages 211-225, Tsukuba, Japan, March 1998. Springer.

Witold Charatonik and Andreas Podelski. Directional Type Inference for Logic Programs. In Giorgio Levi, editor, Proceedings of the 5th International Symposium in Static Analysis (SAS-98), volume 1503 of Lecture Notes in Computer Science, pages 278-294, Pisa, Italy, September 1998. Springer.

Witold Charatonik and Andreas Podelski. Set-Based Analysis of Reactive Infinite-state Systems. In Bernhardt Steffen, editor, Tools and Algorithms for the Construction and Analysis of Systems (TACAS-98), volume 1384 of Lecture Notes in Computer Science, pages 358-375, Lisbon, Portugal, March 1998. Springer.

Giorgio Delzanno and Andreas Podelski. Model Checking Infinite-state Systems in CLP. Research Report MPI-I-98-2-012, Max-Planck-Institut für Informatik, Im Stadtwald, D-66123 Saarbrücken, Germany, July 1998.

Thomas Kasper. A Unifying Logical Framework for Integer Linear Programming and Finite Domain Constraint Programming. PhD thesis, Universität des Saarlandes, December 1998.

M. R. K. Krishna Rao. Modular Aspects of term graph rewriting. Theoretical Computer Science, 208(1-2):59-86, November 1998. -.

Jürgen Stuber. Superposition theorem proving for abelian groups represented as integer modules. Theoretical Computer Science, 208(1-2):149-177, November 1998.

Jürgen Stuber. Superposition theorem proving for commutative rings. In Wolfgang Bibel and Peter H. Schmitt, editors, Automated Deduction - A Basis for Applications. Volume III. Applications, volume 10 of Applied Logic Series, chapter 2, pages 31-55. Kluwer, Dordrecht, Netherlands, January 1998.

Sergei Vorobyov. ^-Equational Theory of Context Unification is _1^0-Hard. In Lubos Brim, Jozef Gruska, and Jirí Zlatuska, editors, Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS-98), volume 1450 of Lecture Notes in Computer Science, pages 597-606, Brno, Czech Republic, August 1998. Mazaryk University, European Assoc of Computer Science Logic, Springer.

Sergei Vorobyov and Andrei Voronkov. Complexity of Nonrecursive Logic Programs with Complex Values. In Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS-98), pages 244-253, Saeattle, Washington, U.S.A., June 1998. Asoc Comput Machinery, Boeing, ACM Press.

Uwe Waldmann. Extending reduction orderings to ACU-compatible reduction orderings. Information Processing Letters, 67(1):43-49, July 1998.

Uwe Waldmann. Superposition for Divisible Torsion-Free Abelian Groups. In Claude Kirchner and Hélène Kirchner, editors, Proceedings of the 15th International Conference on Automated Deduction (CADE-98), volume 1421 of Lecture Notes in Artificial Intelligence, pages 144-159, Lindau, Germany, 1998. Springer.

Andreas Werner, Alexander Bockmayr, and Stefan Krischer. How to realize LSE narrowing. New Generation Computing, 16(4):397-434, 1998.

RWTH Aachen

F. Baader. On the Complexity of Boolean Unification. Information Processing Letters, 67(4):215-220, 1998.
Abstract

F. Baader, A. Borgida, and D.L. McGuinness. Matching in Description Logics: Preliminary Results. In M.-L. Mugnier and M. Chein, editors, Proceedings of the Sixth International Conference on Conceptual Structures (ICCS-98), volume 1453 of Lecture Notes in Computer Science, pages 15-34, Montpelier (France), 1998. Springer-Verlag.
Abstract

F. Baader and R. Küsters. Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions. In O. Herzog and A. Günter, editors, Proceedings of the 22nd Annual German Conference on Artificial Intelligence, KI-98, volume 1504 of Lecture Notes in Computer Science, pages 129-140, Bremen, Germany, 1998. Springer-Verlag.
Abstract

F. Baader, R. Küsters, and R. Molitor. Structural Subsumption Considered from an Automata Theoretic Point of View. In Proceedings of the 1998 International Workshop on Description Logics DL'98, Trento, Italy, 1998.
Full paper Abstract

F. Baader and P. Narendran. Unification of Concept Terms in Description Logics. In H. Prade, editor, Proceedings of the 13th European Conference on Artificial Intelligence (ECAI-98), pages 331-335. John Wiley & Sons Ltd, 1998.
Abstract

F. Baader and K. Schulz. Combination of Constraint Solvers for Free and Quasi-Free Structures. Theoretical Computer Science, 192:107-161, 1998.
Abstract

F. Baader and K.U. Schulz. Unification Theory. In W. Bibel and P.H. Schmidt, editors, Automated Deduction - A Basis for Applications, Vol. I: Foundations - Calculi and Methods, volume 8 of Applied Logic Series, pages 225-263. Kluwer Academic Publishers, Dordrecht, NL, 1998.
Abstract

F. Baader and C. Tinelli. Deciding the Word Problem in the Union of Equational Theories. UIUCDCS-Report UIUCDCS-R-98-2073, Department of Computer Science, University of Illinois at Urbana-Champaign, 1998.
Full paper Abstract

UC Madrid

P. Arenas-Sánchez. Programación Declarativa con Restricciones sobre Tipos de Datos Algebraicos. PhD thesis, Universidad Complutense de Madrid, 1998.

P. Arenas-Sánchez, F.J. López-Fraguas, and M. Rodríguez-Artalejo. Embedding Multiset Constraints into a Lazy Functional Logic Language. In Proc. PLILP'98, volume 1490 of LNCS, pages 429-444. Springer, 1998.

Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, and José Meseguer. Metalevel Computation in Maude. In C. Kirchner and H. Kirchner, editors, Proc. Second Int. Workshop on Rewriting Logic and its Applications, Pont-à-Mousson, France, September 98, volume 15 of Electronic Notes in Theoretical Computer Science, pages 3-23. Elsevier Science, 1998. Electronic publication.
Full paper

Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, and José F. Quesada. Language Prototyping in the Maude Metalanguage. Technical report, Computer Science Laboratory, SRI International, November 1998.

Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, and José F. Quesada. Maude as a Metalanguage. In C. Kirchner and H. Kirchner, editors, Proc. Second Int. Workshop on Rewriting Logic and its Applications, Pont-à-Mousson, France, September 98, volume 15 of Electronic Notes in Theoretical Computer Science, pages 237-249. Elsevier Science, 1998. Electronic publication.
Full paper

R. Caballero-Roldán and F. J. López-Fraguas. A functional-logic alternative to monads. In Proc. First International Workshop on Component-based Software Development in Computational Logic (COCL'98), pages 1-15, 1998.

R. Caballero-Roldán and F. J. López-Fraguas. Parsing with non-deterministic functions. In Proc. APPIA-GULP-PRODE'98, pages 87-100, 1998.

R. Caballero Roldán and P. López Fraguas. Functional-logic Parsers in Toy. Research Report 7498, Departamento de Sistemas Informáticos y Programación, Facultad de Matemáticas (UCM), Av. Complutense s/n, Ciudad Universitaria, Madrid E-28040 (SPAIN), 1998.
Full paper Abstract

F. J. López-Fraguas and J. Sánchez-Hernández. An Efficient Narrowing Strategy by means of Disequality Constraints. Technical Report SIP84/98, Dpto. de Sistemas Informáticos y Programación, Univ. Complutense de Madrid, 1998.

P.J. Martín and A. Gavilanes. Simulteneous sorted unification for free variable tableaux: an elegant calculus. Technical Report SIP86/98, Dpto. Sist. Inf, y Progr.(UCM), 1998. Position paper presented at TABLEAUX'99.

P.J. Martín, A. Gavilanes, and J. Leach. Free variable tableaux for a logic with term declarations. In Proc. TABLEAUX'98, volume 1397 of LNAI, pages 202-216. Springer Verlag, 1998.

J. Mateos-Lago and M. Rodríguez-Artalejo. Operations with Static Typing in Genetic Inheritance Object Specifications. Technical Report TR98/82, Dpto. de Sistemas Informáticos y Programación, Univ. Complutense de Madrid, 1998.

A. Ruiz-Andino, L. Araujo, F. Sáez, and J. J. Ruz. Parallel Arc-Consistency for Functional Constraints. In Proc. of the Int. Workshop on Implementation Technologies for Programming Languages based on Logic, 1998.

A. Ruiz-Andino, L. Araujo, F. Sáez, and J. J. Ruz. Parallel Evolutionary Optimization with Constraint Propagation. In Proc. of the Int. Conf. on Parallel Problem Solving from Nature, volume 1498 of LNCS, pages 270-279. Springer Verlag, 1998.

A. Ruiz-Andino, L. Araujo, F. Sáez, and J. J. Ruz. Parallel Execution Models for Constraint Propagation. In Proc. of Constraint Programming'98, volume 1520 of LNCS. Springer Verlag, 1998.

A. Ruiz-Andino and J. J. Ruz. Integration of CLP and Stochastic Optimisation Strategies. In Proc. JICSLP'98, pages 351-352. The MIT Press, 1998.

UP Barcelona

Hubert Comon, Paliath Narendran, Robert Nieuwenhuis, and Michael Rusinowitch. Decision Problems in Ordered Rewriting. In 13th IEEE Symposium on Logic in Computer Science (LICS), pages 410-422, Indianapolis, USA, June 27-30, 1998.

Jean-Pierre Jouannaud and Albert Rubio. Rewite orderings for higher-order terms in [eta]-long [beta]-normal form and the recursive path ordering. Theoretical Computer Science, 208:33-58, 1998.

Robert Nieuwenhuis. Decidability and Complexity Analysis by Basic Paramodulation. Information and Computation, 147:1-21, 1998.

Univ. Wroclaw

Antoni Koscielski and Leszek Pacholski. Makanins Group Algorithm is not Primitive Recursive. Theoretical Computer Science, 191:145-156, 1998.

Jerzy Marcinkowski and Leszek Pacholski. Thue trees. Submitted, 1998.

Leszek Pacholski and Pawel Mielniczuk. Tarskian Set Constraints are in NEXPTIME. In Proceedings of 23rd Symposium on Mathematical Foundations of Computer Science, volume 1450 of Lecture Notes in Computer Science, pages 589 - 596. Springer-Verlag, 1998.


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