CCL Bibliography 1999

CIS München

Rolf Backofen, François Bry, Peter Clote, Hans-Peter Kriegel, Thomas Seidl, and Klaus U. Schulz. Aktuelles Schlagwort: Bioinformatik. Informatik-Spektrum, October 1999.

Franz Baader and Klaus U. Schulz. Combining Constraint Solving. In Lecture Notes of CCL Summer-School '99. 1999. to appear.

Stephan Kepser. Negation in Combining Constraint Systems. In Maarten de Rijke and Dov Gabbay, editors, Frontiers of Combining Systems 2, Papers presented at FroCoS'98, pages 117-192. Research Studies Press/Wiley, 1999.
Full paper Abstract

Stephan Kepser and Jörn Richts. Optimisation Techniques for Combining Constraint Solvers. In Maarten de Rijke and Dov Gabbay, editors, Frontiers of Combining Systems 2, Papers presented at FroCoS'98, pages 193-210. Research Studies Press/Wiley, 1999.
Full paper Abstract

Stephan Kepser and Jörn Richts. UniMoK - A System for Combining Equational Unification Algorithms. In Michael Rusinowitch and Paliath Narendran, editors, Rewriting Techniques and Applications, Proceedings RTA-99, LNCS. Springer, 1999.
Full paper

Holger Meuss and Klaus U. Schulz. Complete Answer Aggregates for Answer Mappings to Sequence, Tree and Graph Databases. Submitted for publication, 1999.

Holger Meuss and Christian Strohmaier. Improving Index Structures for Structured Document Retrieval. In 21st Annual Colloquium on IR Research (IRSG'99), 1999.

Manfred Schmidt-Schauß and Klaus U. Schulz. Solvability of context equations with two context variables is decidable. In Automated Deduction, Proceedings CADE 16, volume 1632 of LNAI, pages 67-82. Springer, 1999.

DFKI Saarbrücken

Denys Duchier and Claire Gardent. A Constraint-Based Treatment of Descriptions. In H.C. Bunt and E.G.C. Thijsse, editors, Third International Workshop on Computational Semantics (IWCS-3), pages 71-85, Tilburg, NL, January 1999.
Full paper Abstract

Denys Duchier and Stefan Thater. Parsing with Tree Descriptions: a constraint-based approach. In Sixth International Workshop on Natural Language Understanding and Logic Programming (NLULP'99), pages 17-32, Las Cruces, New Mexico, December 1999.
Full paper Abstract

Denys Duchier. Axiomatizing Dependency Parsing Using Set Constraints. In Sixth Meeting on Mathematics of Language, pages 115-126, Orlando, Florida, July 1999.
Full paper Abstract

Denys Duchier. Set Constraints in Computational Linguistics - Solving Tree Descriptions. In Workshop on Declarative Programming with Sets (DPS'99), pages 91-98, September 1999.
Full paper Abstract

Seif Haridi, Peter Van Roy, Per Brand, Michael Mehl, Ralf Scheidhauer, and Gert Smolka. Efficient Logic Variables for Distributed Computing. ACM Transactions on Programming Languages and Systems, 21(3):569-626, May 1999.
Full paper Abstract

Alexander Koller and Joachim Niehren. Scope Underspecification and Processing. Reader for the ESSLLI summer school., last Revision: July 21 1999.
Full paper Abstract

Alexander Koller, Joachim Niehren, and Kristina Striegnitz. Relaxing Underspecified Semantic Representations for Reinterpretation. In Proceedings of the Sixth Meeting on Mathematics of Language (MOL6), pages 74-87, Orlando, Florida, jul 1999. University of Central Florida.
Full paper Abstract

Alexander Koller. Constraint Languages for Semantic Underspecification. Diplom thesis, Universität des Saarlandes, Saarbrücken, 1999.
Full paper Abstract

Martin Müller, Joachim Niehren, and Ralf Treinen. The First-Order Theory of Ordering Constraints over Feature Trees, 1999.
Full paper Abstract

Joachim Niehren, Martin Müller, and Jean-Marc Talbot. Entailment of Atomic Set Constraints is PSPACE-Complete. In Fourteenth annual IEEE Symposium on Logic in Computer Sience (LICS99), pages 285-294, Trento, Italy, 2-5, July 1999. IEEE Press. An extended version is available at www.ps.uni-sb.de/Papers/abstracts/atomic:98.html.
Full paper Abstract

Joachim Niehren and Tim Priesnitz. Entailment of Non-Structural Subtype Constraints. In Asian Computing Science Conference, number 1742 in LNCS, pages 251-265, Phuket, Thailand, December 10-12 1999. Springer-Verlag.
Full paper Abstract

Andreas Podelski, Witold Charatonik, and Martin Müller. Set-based Failure Analysis for Logic Programs and Concurrent Constraint Programs. In S. Doaitse Swierstra, editor, Proceedings of ESOP'99, the European Symposium of Programmin, Springer LNCS, Amsterdam, March 22-26 1999. Springer-Verlag.
Full paper Abstract

Christian Schulte. Comparing Trailing and Copying for Constraint Programming. In Danny De Schreye, editor, Proceedings of the Sixteenth International Conference on Logic Programming, pages 275-289, Las Cruces, NM, USA, November 1999. The MIT Press.
Full paper Abstract

Griffith University

G. Antoniou, D. Billington, and M. Maher. On the Analysis of Regulations using Defeasible Rules. In Proc. Hawaii International Conference on System Sciences. IEEE Computer Society Press, 1999.

G. Antoniou, D. Billington, M. Maher, and G. Governatori. Comparison of Sceptical NAF-Free Logic Programming Approaches. In Proc. International Conference on Logic Programming and Nonmonotonic Reasoning, Lecture Notes in Artificial Intelligence. Springer, 1999.

A. Brodsky, C. Lassez, J-L. Lassez, and M.J. Maher. Separability of Polyhedra for Optimal Filtering of Spatial and Constraint Data. Journal of Automated Reasoning, 23(1):83-104, 1999.

M. J. Maher. Adding Constraints to Logic-based Formalisms. In K.R. Apt, V. Marek, M. Truszczynski, and D.S. Warren, editors, The Logic Programming Paradigm: a 25 Years Perspective, Lecture Notes in Artificial Intelligence, pages 313-331. Springer, 1999.

M. Maher and G. Governatori. A Semantic Decomposition of Defeasible Logics. In Proc. National Conference on Artificial Intelligence, pages 299-305. MIT Press, 1999.

E. Tick and R. Yap amd M. Maher. Finding Fair Allocations for the Coalition Problem with Constraints. In D. De Schreye, editor, Proc. International Conference on Logic Programming. MIT Press, 1999.

Hebrew Univ. Jerusalem

Z. Bar-Yossef, Y. Kanza, Y. Kogan, W. Nutt, and Y. Sagiv. Querying Semantically Tagged Documents on the World-Wide Web. In 4th International Workshop on Next Generation Information Technology and Systems (NGITS'99), volume 1649 of Lecture Notes in Computer Science, pages 2-19. Springer-Verlag, 1999.

S. Cohen, Y. Kanza, Y. Kogan, W. Nutt, Y. Sagiv, and A. Serebrenik. EquiX-Easy Querying in XML Databases. In Proceedings of the Second International Workshop on the Web and Databases (WebDB'99), 1999.

S. Cohen, W. Nutt, and A. Serebrenik. Algorithms for Rewriting Aggregate Queries Using Views. In Proc. Workshop Design and Management of Data Warehouses (DMDW'99), 1999.

S. Cohen, W. Nutt, and A. Serebrenik. Rewriting Aggregate Queries Using Views. In Proc. 18th Symposium on Principles of Database Systems (PODS'99), pages 227-236. ACM Press, 1999.

Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, and Alexander Serebrenik. Arithmetic Termination Analysis of Programs Containing Arithmetic Predicates. Electronic Notes in Theoretical Compputer Science 30, No. 1, 1999.

Y. Kanza, W. Nutt, and Y. Sagiv. Queries with Incomplete Answers over Semistructured Data. In Proc. 18th Symposium on Principles of Database Systems (PODS'99), pages 155-166. ACM Press, 1999.

University of Illinois / Tel Aviv University

Nachum Dershowitz. Undecidability Results that Follow from Results in Recursion Theory (Abstract). In Abstracts of the Fifth International Workshop on Termination, Dagstuhl, Germany, May 1999.

Nachum Dershowitz and Subrata Mitra. Jeopardy. In P. Narendran and M. Rusinowitch, editors, Proceedings of the Tenth International Conference on Rewriting Techniques and Applications (Trento, Italy), volume 1631 of Lecture Notes in Computer Science, pages 16-29, Berlin, July 1999. Springer-Verlag.

INRIA Nancy

A. Bockmayr, F. Eisenbrand, M. Hartmann, and A. S. Schulz. On the Chvátal Rank of Polytopes in the 0/1 Cube. Discrete Applied Mathematics, 98:21-27, 1999. Also available as Technical Report 99-R-162, LORIA, Nancy (France).

H. Cirstea and C. Kirchner. Combining Higher-Order and First-Order Computation Using -calculus: Towards a semantics of ELAN. In D. Gabbay and M. de Rijke, editors, Frontiers of Combining Systems 2, Research Studies, ISBN 0863802524, pages 95-120. Wiley, 1999.

L. Juban. Sur les Problèmes de Complexité en Déduction Automatique : Base de Hilbert, Modèles Uniques et Minimaux. Thèse de doctorat d'université, Université Henri Poincaré - Nancy 1, décembre 1999. Also available as Technical Report 99-T-381, LORIA, Nancy (France).
Full paper

P.-E. Moreau. Compilation de règles de réécriture et de stratégies non-déterministes. Thèse de doctorat d'université, Université Henri Poincaré - Nancy 1, juin 1999. Also available as Technical Report 99-T-083, LORIA, Nancy (France).
Full paper

P. Narendran and M. Rusinowitch, editors. 10th International Conference on Rewriting Techniques and Applications, volume 1631 of Lecture Notes in Computer Science. Springer-Verlag, Trento (Italy), 1999.

Ch. Scharff. Déduction avec contraintes et simplification dans les théories équationnelles. Thèse de doctorat d'université, Université Henri Poincaré - Nancy 1, septembre 1999.
Full paper

LIFL Lille

Y. Andre, F. Bossut, and A.-C. Caron. On Decidability of Boundedness Property for Regular Path Queries. In Proceedings of DLT'99, 1999. To appear.
Full paper

B. Boagert, F. Seynhaeve, and S. Tison. The Recognizability Problem for Tree Automata with Comparisons between Brothers. In W. Thomas, editor, Proceedings of the 2^nd International Conference on Foundations of Software Science and Computation Structure, number 1578 in Lecture Notes in Computer Science, Amsterdam, Netherlands, 1999. Submitted.
Full paper

A.-C. Caron, F. Seynhaeve, S. Tison, and M. Tommasi. Deciding the satisfiability of quantifier free formulae on one-step rewriting. In M. Rusinowitch P. Narendran, editor, Proceedgins of the Tenth International Conference on Rewriting Techniques and Applications, 1999 (see there).
Full paper

M. Rusinowitch P. Narendran, editor. Proceedgins of the Tenth International Conference on Rewriting Techniques and Applications, volume 1631 of Lecture Notes in Computer Science, Trento, Italy, 1999. Springer Verlag.

Franck Seynhaeve. Automates, Réécriture et Contraintes: Résultats de Décidabilité et d'Indécidabilité. PhD thesis, Université de Lille, may 1999.

J-M. Talbot, P. Devienne, and S. Tison. Generalized Definite Set Constraints. CONSTRAINTS - An International Journal, 1999. To appear.

LRI Orsay

F. Blanqui, J.-P. Jouannaud, and M. Okada. The Calculus of Algebraic Constructions. In RTA'99, 1999.

Serenella Cerrito and Delia Kesner. Pattern Matching as Cut Elimination. In Giuseppe Longo, editor, Fourteenth Annual IEEE Symposium on Logic in Computer Science, July 1999 (see there).
Full paper

Maria C.F. Ferreira, Delia Kesner, and Laurence Puel. Lambda-calculi with Explicit Substitutions Preserving Strong Normalization. Applicable Algebra in Engineering Communication and Computing, 9(4):333-371, 1999.

Jean-Pierre Jouannaud and Albert Rubio. The Higher-Order Recursive Path Ordering. In Giuseppe Longo, editor, Fourteenth Annual IEEE Symposium on Logic in Computer Science, July 1999 (see there).
Full paper Abstract

Jean-Pierre Jouannaud and Ralf Treinen. Constraints and Constraint Solving: An Introduction. Course Notes at the International Summer School on Constraints in Computational Logics, Gif-sur-Yvette, France, September 1999.
Full paper Abstract

Delia Kesner. Confluence of extensional and non-extensional lambda-calculi with explicit substitutions. Theoretical Computer Science, 1999. To appear.
Full paper

Delia Kesner and Pablo E. Martínez López. Explicit Substitutions for Objects and Functions. Journal of Functional and Logic Programming, (2), 1999.

Giuseppe Longo, editor. Fourteenth Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, July 1999. IEEE Comp. Soc. Press.

MPI Saarbrücken

Harald Ganzinger, David McAllester, and Andrei Voronkov, editors. Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning (LPAR-99), volume 1705 of Lecture Notes in Artificial Intelligence, Berlin, 1999. Springer. Earlier version: Technical Report MPI-I-1999-2-003, Max-Planck-Institut für Informatik, Saarbrücken.

Andreas Podelski, Witold Charatonik, and Martin Müller. Set-based Failure Analysis for Logic Programs and Concurrent Constraint Programs. In S. Doaitse Swierstra, editor, Programming Languages and Systems: Proceedings of the 8th European Symposium on Programming (ESOP-99), volume 1576 of Lecture Notes in Computer Science, pages 177-192, Amsterdam, The Netherlands, March 1999. Springer.

Jean-Marc Talbot, Joachim Niehren, and Martin Müller. Entailment of Atomic Set Constraints is PSPACE-Complete. In Giuseppe Longo, editor, Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science (LICS-99), pages 285-294, Trento, Italy, 1999. IEEE Computer Society, IEEE Computer Society.

Sergei Vorobyov. Subtyping Functional+Nonempty Record Types. In Georg Gottlob, Etienne Grandjean, and Katrin Seyr, editors, Proceedings of the 12th International Workshop on Computer Science Logic (CSL-98), Annual Conference on the EACSL, volume 1584 of Lecture Notes in Computer Science, pages 285-297, Brno, Czech Republic, 1999. European Association for Computer Science Logic, Springer.

Uwe Waldmann. Cancellative Superposition Decides the Theory of Divisible Torsion-Free Abelian Groups. In Harald Ganzinger, David McAllester, and Andrei Voronkov, editors, Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning (LPAR-99), volume 1705 of Lecture Notes in Artificial Intelligence, pages 131-147, Tbilisi, Georgia, 1999. Springer. Earlier version: Technical Report MPI-I-1999-2-003, Max-Planck-Institut für Informatik, Saarbrücken.

RWTH Aachen

F. Baader and R. Küsters. Matching in Description Logics with Existential Restrictions. In P. Lambrix, A. Borgida, M. Lenzerini, R. Möller, and P. Patel-Schneider, editors, Proceedings of the International Workshop on Description Logics 1999 (DL'99), number 22 in CEUR-WS, Sweden, 1999. Linköping University. Proceedings online available from http://SunSITE.Informatik.RWTH-Aachen.DE/Publications/CEUR-WS/Vol-22/.
Full paper Abstract

F. Baader, R. Küsters, A. Borgida, and D. McGuinness. Matching in Description Logics. Journal of Logic and Computation, 9(3):411-447, 1999.
Abstract

F. Baader and R. Molitor. Rewriting Concepts Using Terminologies. In P. Lambrix, A. Borgida, M. Lenzerini, R. Möller, and P. Patel-Schneider, editors, Proceedings of the International Workshop on Description Logics 1999 (DL'99), number 22 in CEUR-WS, Sweden, 1999. Linköping University. Proceedings online available from http://SunSITE.Informatik.RWTH-Aachen.DE/Publications/CEUR-WS/Vol-22/.
Full paper Abstract

F. Baader and U. Sattler. Expressive Number Restrictions in Description Logics. Journal of Logic and Computation, 9(3):319-350, 1999.
Full paper Abstract

F. Baader and C. Tinelli. Deciding the Word Problem in the Union of Equational Theories Sharing Constructors. In P. Narendran and M. Rusinowitch, editors, Proceedings of the 10th International Conference on Rewriting Techniques and Applications (RTA-99), volume 1631 of Lecture Notes in Computer Science, pages 175-189, Trento, Italy, 1999. Springer-Verlag.
Abstract

Franz Baader and Cesare Tinelli. Combining Equational Theories Sharing Non-Collapse-Free Constructors. Technical Report 99-13, Department of Computer Science, University of Iowa, October 1999.
Full paper Abstract

Ian Horrocks, Ulrike Sattler, and Stephan Tobies. Practical Reasoning for Expressive Description Logics. In Harald Ganzinger, David McAllester, and Andrei Voronkov, editors, Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning (LPAR'99), number 1705 in Lecture Notes in Artificial Intelligence, pages 161-180. Springer-Verlag, September 1999.
Full paper Abstract

Stephan Kepser and Jörn Richts. Optimisation Techniques for Combining Constraint Solvers. In Dov Gabbay and Maarten de Rijke, editors, Frontiers of Combining Systems 2, Papers presented at FroCoS'98, pages 193-210, Amsterdam, 1999. Research Studies Press/Wiley.
Full paper Abstract

Stephan Kepser and Jörn Richts. UniMoK: A System for Combining Equational Unification Algorithms. In Rewriting Techniques and Applications, Proceedings RTA-99, volume 1631 of Lecture Notes in Computer Science, pages 248-251. Springer-Verlag, 1999.

C. Lutz. Complexity of Terminological Reasoning Revisited. In Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning LPAR'99, Lecture Notes in Artificial Intelligence, pages 181-200. Springer-Verlag, September 6 - 10, 1999.
Full paper Abstract

S .Tobies. A NExpTime-complete Description Logic Strictly Contained in C^2. In J. Flum and M. Rodríguez-Artalejo, editors, Proceedings of the Annual Conference of the European Association for Computer Science Logic (CSL-99), LNCS 1683, pages 292-306. Springer-Verlag, 1999.
Full paper Abstract

S. Tobies. A PSpace Algorithm for Graded Modal Logic. In H. Ganzinger, editor, Automated Deduction - CADE-16, 16th International Conference on Automated Deduction, LNAI 1632, pages 52-66, Trento, Italy, July 7-10, 1999. Springer-Verlag.
Full paper Abstract

UC Madrid

P. Arenas-Sánchez, F.J. López-Fraguas, and M. Rodríguez-Artalejo. Functional plus Logic Programming with Built-in and Symbolic Constraints. In Proc. PPDP'99, volume 1702 of LNCS, pages 152-169. Springer, 1999.

R. Caballero-Roldán and F.J. López-Fraguas. Extensions: A Technique for Structuring Functional-Logic Programs. In Proc. Perspectives of System Informatics PSI'99, volume 1755 of Springer LNCS, 1999.

R. Caballero-Roldán and F.J. López-Fraguas. A Functional Logic Perspective of Parsing. In Proc. FLOPS'99, volume 1722 of Springer LNCS, pages 85-99, 1999.

J. C. González-Moreno, M. T. Hortalá-González, F. J. López-Fraguas, and M. Rodríguez-Artalejo. An Approach to Declarative Programming Based on a Rewriting Logic. Journal of Logic Programming, 40:47-87, 1999.

J.C. González Moreno, M.T. Hortalá González, and M. Rodríguez Artalejo. Polymorphic types in Functional Logic Programming (Draft). Research Report 97-99, Departamento de Sistemas Informáticos y Programación, Escuela Superior de Informática (UCM), Av. Complutense s/n, Ciudad Universitaria, Madrid E-28040 (SPAIN), 1999.
Full paper Abstract

J.C. González-Moreno, M.T. Hortalá-González, and M. Rodríguez-Artalejo. Semantics and Types in Functional Logic Programming. In Proc. FLOPS'99, volume 1722 of Springer LNCS, pages 1-20, 1999.

F.J. López-Fraguas and J. Sánchez-Hernández. Disequalities May Help to Narrow. In Proc. APPIA-GULP-PRODE'99, pages 89-104, 1999.

F.J. López-Fraguas and J. Sánchez-Hernández. TOY: A Multiparadigm Declarative System. In Proc. RTA'99, volume 1631 of Springer LNCS, pages 244-247, 1999.

Narciso Martí-Oliet and José Meseguer. Action and Change in Rewriting Logic. In R. Pareschi and B. Fronhöfer, editors, Dynamic Worlds: From the Frame Problem to Knowledge Management, volume 12 of Applied Logic Series, pages 1-53. Kluwer Academic Publishers, 1999. ISBN 0-7923-5535-0.

M. Rodríguez Artalejo. Functional and Constraint Logic Programming. Research Report 96-99, Departamento de Sistemas Informáticos y Programación, Escuela Superior de Informática (UCM), Av. Complutense s/n, Ciudad Universitaria, Madrid E-28040 (SPAIN), 1999.
Full paper Abstract

A. Ruiz-Andino, L. Araujo, F. Sáenz, and J. J. Ruz. Parallel Execution Models for Constraint Programming over Finite Domains. In Proc. International Conference on Principles and Practice of Declarative Programming, Paris, volume 1702, pages 134-151, 1999.

A. Ruiz-Andino, L. Araujo, F. Sáenz, and J. J. Ruz. Parallel Implementation of Constraint Solving. In V. Malyshkin, editor, Proceedings of the 5th Parallel Computing Technologies (PaCT) 99, volume 1662, pages 466-471. Springer-Verlag, 1999.

UP Barcelona

Miquel Bofill, Guillem Godoy, Robert Nieuwenhuis, and Albert Rubio. Paramodulation with Non-Monotonic Orderings. In 14th IEEE Symposium on Logic in Computer Science (LICS), pages 225-233, Trento, Italy, July 2-5, 1999.

Jean-Pierre Jouannaud and Albert Rubio. The Higher-Order Recursive Path Ordering. In 14th IEEE Symposium on Logic in Computer Science (LICS), pages 402-411, Trento, Italy, July 2-5, 1999.

Robert Nieuwenhuis and José Miguel Rivero. Solved forms for path ordering constraints. In P. Narendran and M. Rusinowitch, editors, Tenth International Conference on Rewriting Techniques and Applications (RTA), LNCS 1631, pages 1-15, Trento, Italy, July 2-4, 1999. Springer-Verlag.

A. Rubio. A Fully Syntactic AC-RPO. In P. Narendran and M. Rusinowitch, editors, Tenth International Conference on Rewriting Techniques and Applications (RTA), LNCS 1631, pages 133-147, Trento, Italy, July 2-4, 1999. Springer-Verlag.

Univ. Wroclaw

Daniel Kirsten and Jerzy Marcinkowski. Two techniques in the area of the Star Problem. In Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP'99), volume 1644 of LNCS, pages 483-492. Springer-Verlag, 1999.

Jerzy Marcinkowski. Achilles, Turtle and undecidable boundedness problems for small D ATALOG programs. SIAM Journal on Computing, 29(1):231-257, 1999.

Leszek Pacholski, Wieslaw Szwast, and Lidia Tendera. Complexity Results for Two-Variable Logic with Counting. SIAM Journal on Computing, 1999. To appear. Preliminary version appeared in Proceedings of 12th IEEE Symposium on Logic in Computer Science, 1997.

Tomasz Wierzbicki. Complexity of the higher order matching. In Harald Ganzinger, editor, Proceedings of the 16th International Conference on Automated Deduction (CADE-16), volume 1632 of LNAI, pages 82-96. Springer-Verlag, 1999.


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