Franz Baader and Klaus U. Schulz.
Unification in the Union of Disjoint Equational Theories: Combining
Decision Procedures.
J. Symbolic Computation, 21:211-243, 1996.
Abstract
Stephan Kepser and Klaus U. Schulz.
Combination of Constraint Solvers II: Rational Amalgamation.
In Proceedings of the International Conference on Constraint Programming,
CP-96, volume 1118 of Lecture Notes in Computer Science.
Springer-Verlag, 1996.
Full
paper Abstract
Klaus U. Schulz.
Combining Unification- and Disunification Algorithms-Tractable and
Intractable Instances.
Technical Report CIS-Bericht-96-99, CIS, LMU Munich, 1996.
Full paper Abstract
Klaus U. Schulz and Stephan (Eds.) Kepser.
UNIF'96.
Technical Report CIS-Bericht-96-91, CIS, LMU Munich, 1996.
Full paper Abstract
Martin Henz.
Don't Be Puzzled!.
In Proceedings of the Workshop on Constraint Programming Applications, in
conjunction with the Second International Conference on Principles and
Practice of Constraint Programming (CP96), Cambridge, Massachusetts, USA,
August 1996.
Full
paper Abstract
Martin Henz and Jörg Würtz.
Constraint-based Time Tabling-A Case Study.
Applied Artificial Intelligence, 10(5):439-453, 1996.
Abstract
Martin Henz and Jörg Würtz.
Using Oz for College Time Tabling.
In E.K.Burke and P.Ross, editors, The Practice and Theory of Automated Time
Tabling: The Selected Proceedings of the 1st International Conference on the
Practice and Theory of Automated Time Tabling, Edinburgh 1995, Lecture
Notes in Computer Science, vol. 1153, pages 162-177, 1996.
Full
paper Abstract
Martin Müller and Gert Smolka.
Oz: Nebenläufige Programmierung mit Constraints.
KI - Künstliche Intelligenz, pages 55-61, September 1996.
Themenheft: Logische Programmierung.
Full
paper Abstract
Tobias Müller and Jörg Würtz.
Interfacing Propagators with a Concurrent Constraint Language.
In JICSLP96 Post-conference workshop and Compulog Net Meeting on
Parallelism and Implementation Technology for (Constraint) Logic Programming
Languages, pages 195-206, 1996.
Full paper Abstract
Joachim Niehren.
Functional Computation as Concurrent Computation.
In 23^th Proceedings of the ACM Symposium on Principles of
Programming Languages, pages 333-343. The ACM Press, 21-24January
1996.
longer version appeared as DFKI Research Report RR-95-14.
Full
paper Abstract
A.J. Parkes and J.P. Walser.
Tuning local search for satisfiability testing.
In Proceedings of the thirteenth national conference on artificial
intelligence (AAAI '96), 1996.
Full
paper Abstract
Peter Van Roy, Michael Mehl, and Ralf Scheidhauer.
Integrating Efficient Records into Concurrent Constraint Programming.
In International Symposium on Programming Languages, Implementations,
Logics, and Programs, Aachen, Germany, September 1996. Springer-Verlag.
Full
paper Abstract
Gert Smolka.
Problem Solving with Constraints and Programming.
ACM Computing Surveys, 28(4es), December 1996.
Electronic Section.
Full paper Abstract
Ralf Treinen.
Feature Trees over Arbitrary Structures.
In Patrick Blackburn and Maarten de Rijke, editors, Specifying Syntactic
Structures, Studies in Logic, Language and Information. CSLI
Publications, 1996.
To appear. Collection of selected papers from the Workshop on Logic, Structures
and Syntax, Amsterdam, September 1994.
Full paper Abstract
Joachim Walser.
Feasible Cellular Frequency Assignment Using Constraint Programming
Abstractions.
In Proceedings of the Workshop on Constraint Programming Applications, in
conjunction with the Second International Conference on Principles and
Practice of Constraint Programming (CP96), Cambridge, Massachusetts, USA,
August 1996.
Full
paper Abstract
Jörg Würtz and Tobias Müller.
Constructive Disjunction Revisited.
In G. Görz and S. Hölldobler, editors, 20th German Annual Conference on
Artificial Intelligence, volume 1137 of Lecture Notes in Artificial
Intelligence, pages 377-386, Dresden, Germany, 1996. Springer-Verlag.
Full
paper Abstract
Jörg Würtz.
Oz Scheduler: A Workbench for Scheduling Problems.
In Proceedings of the 8th IEEE International Conference on Tools with
Artificial Intelligence, pages 132-139, Toulouse, France, November16-19
1996. IEEE Computer Society Press.
Full paper Abstract
M.J. Maher, editor.
Logic Programming: Proceedings of the 1996 Joint International Conference
and Symposium. MIT Press, 1996.
I. Alouini and C. Kirchner.
Toward the Concurrent Implementation of Computational Systems.
In M. Hanus and M. Rodríguez-Artalejo, editors, Proceedings 5th
International Conference on Algebraic and Logic Programming, volume 1139
of Lecture Notes in Computer Science, pages 1-31, Aachen (Germany),
September 1996. Springer-Verlag.
Full paper
A. Amaniss.
Méthodes de schématisation pour la démonstration automatique.
Thèse de Doctorat d'Université, Université Henri Poincaré - Nancy 1,
septembre 1996.
Full paper
N. Berregeb, A. Bouhoula, and M. Rusinowitch.
Automated Verification by Induction with Associative-Commutative
Operators.
In Proceedings of International Conference on Computer Aided
Verification, volume 1102 of Lecture Notes in Computer Science,
pages 220-231, New Jersey (NJ, USA), 1996. Springer-Verlag.
Full paper
N. Berregeb, A. Bouhoula, and M. Rusinowitch.
SPIKE-AC: a System for Proofs by Induction in Associative-Commutative
Theories.
In Proceedings 7th Conference on Rewriting Techniques and Applications,
volume 1103 of Lecture Notes in Computer Science, pages 428-431, New
Brunswick (NJ, USA), 1996. Springer-Verlag.
A. Bouhoula.
A General Framework for Mechanizing Induction using Test Set.
In Proccedings of 4th Pacific Rim International Conference on Artificial
Intelligence, volume 1114 of Lecture Notes in Artificial
Intelligence, pages 1-12, Cairns (Australia), August 1996.
Springer-Verlag.
A. Bouhoula.
Using Induction and Rewriting to Verify and Complete Parameterized
Specifications.
Theoretical Computer Science, 170:245-276, December 1996.
L. Bachmair, I. V. Ramakrishnan, and L. Vigneron.
Efficient Term Rewriting Techniques.
In Proceedings of CCL'96 Workshop, San Lorenzo (Spain), September 1996.
C. Castro.
Binary CSP Solving as an Inference Process.
In Proceedings of 8th International Conference on Tools in Artificial
Intelligence, ICTAI'96, pages 462-463, Toulouse (France), November 1996.
Full paper
R. Curien, Z. Qian, and H. Shi.
Efficient Second-Order Matching.
In H. Ganzinger, editor, Proceedings 7th Conference on Rewriting Techniques
and Applications, volume 1103 of Lecture Notes in Computer
Science, pages 317-331, New Brunswick (NJ, USA), July 1996.
Springer-Verlag.
G. Dowek, Th. Hardin, C. Kirchner, and F. Pfenning.
Unification via Explicit Substitutions: The Case of Higher-Order
Patterns.
In M. J. Maher, editor, Proceedings of Joint International Conference and
Symposium on Logic Programming, pages 259-273, Bonn (Germany), September
1996. The MIT press.
Full paper
E. Domenjoud.
Undecidability of the word problem in the union of theories sharing
constructors.
In K. Schulz and S. Kepser, editors, Proceedings 10th International
Workshop on Unification, UNIF'96, pages 92-96, Munich (Germany), June
1996.
Th. Genet and I. Gnaedig.
Termination Proofs with Efficient gpo Ordering Constraint Solving.
In K. Schulz and S. Kepser, editors, Proceedings 10th International
Workshop on Unification, UNIF'96, Munich (Germany), June 1996.
B. Gramlich.
Conditional Rewrite Systems under Signature Extensions: Some
Counterexamples.
In K. U. Schulz and S. Kepser, editors, Proceedings 10th International
Workshop on Unification, UNIF'96, pages 45-50, Munich (Germany), June
1996.
Full paper
B. Gramlich.
Confluence without Termination via Parallel Critical Pairs.
In H. Kirchner, editor, Proceedings 21st International Colloquium on Trees
in Algebra and Programming, volume 1059 of Lecture Notes in Computer
Science, pages 211-225, Linköping (Sweden), April 1996.
Springer-Verlag.
Full paper
B. Gramlich.
On Proving Termination by Innermost Termination.
In H. Ganzinger, editor, Proceedings 7th Conference on Rewriting Techniques
and Applications, volume 1103 of Lecture Notes in Computer
Science, pages 93-107, New Brunswick (NJ, USA), July 1996.
Springer-Verlag.
Full paper
B. Gramlich.
On Termination and Confluence Properties of Disjoint and
Constructor-Sharing Conditional Rewrite Systems.
Theoretical Computer Science, 165(1):97-131, September 1996.
Full paper
B. Gramlich and C.-P. Wirth.
Confluence of Terminating Conditional Rewrite Systems Revisited.
In H. Ganzinger, editor, Proceedings 7th Conference on Rewriting Techniques
and Applications, volume 1103 of Lecture Notes in Computer
Science, pages 245-259, New Brunswick (NJ, USA), July 1996.
Springer-Verlag.
Full paper
C. Kirchner, Ch. Lynch, and Ch. Scharff.
A Fine-grained Concurrent Completion Procedure.
In H. Ganzinger, editor, Proceedings 7th Conference on Rewriting Techniques
and Applications, volume 1103 of Lecture Notes in Computer
Science, pages 3-17, New Brunswick (NJ, USA), July 1996.
Springer-Verlag.
C. Kirchner and Ch. Ringeissen.
Higher Order Equational Unification via Explicit Substitutions.
In K. Schulz and S. Kepser, editors, Proceedings 10th International
Workshop on Unification, UNIF'96, Munich (Germany), June 1996.
E. Monfroy.
Collaboration de solveurs pour la programmation logique à
contraintes.
Thèse de Doctorat d'Université, Université Henri Poincaré - Nancy 1,
novembre 1996.
Full paper
E. Monfroy.
Solver Collaboration for Constraint Logic Programming.
PhD Thesis, Université Henri Poincaré - Nancy 1, November 1996.
English translation.
Full paper
E. Monfroy.
Solver Collaborations for Non-Linear Constraints.
In 2nd IMACS Conference on Applications of Computer Algebra, RISC
(Research Institute for Symbolic Computation), Castle Hagenberg (Austria),
July 1996.
E. Monfroy and Ch. Ringeissen.
Domain-Independent Scheme for Constraint Solver Extension.
In 2nd IMACS Conference on Applications of Computer Algebra, RISC
(Research Institute for Symbolic Computation), Castle Hagenberg (Austria),
July 1996.
E. Monfroy, M. Rusinowitch, and R. Schott.
Implementing Non-Linear Constraints with Cooperative Solvers.
In Proceedings of ACM Symposium on Applied Computing, pages 63-72,
Philadelphia (PA, USA), February 1996.
Also available as Technical Report 2747, INRIA, Nancy (France).
Full paper
P. Narendran and M. Rusinowitch.
Any ground associative-commutative theory has a finite canonical
system.
Journal of Automated Reasoning, 17(1):131-143, 1996.
Ch. Ringeissen.
Combining Decision Algorithms for Matching in the Union of Disjoint
Equational Theories.
Information and Computation, 126(2):144-160, May 1996.
Ch. Ringeissen.
Cooperation of Decision Procedures for the Satisfiability Problem.
In F. Baader and K. U. Schulz, editors, Frontiers of Combining Systems,
First International Workshop, Applied Logic, pages 121-140, Munich
(Germany), March 1996. Kluwer Academic Publishers.
Full paper
P. Strogova.
Techniques de Réécriture pour le Traitement de Problème de Routage
dans des Graphes de Cayley.
Thèse de Doctorat d'Université, Université Henri Poincaré - Nancy 1,
décembre 1996.
Full paper
L. Vigneron.
Extended Equations for Deduction modulo E.
In Proceedings of CCL'96 Workshop, San Lorenzo (Spain), September 1996.
M. Vittek.
A Compiler for Nondeterministic Term Rewriting Systems.
In H. Ganzinger, editor, Proceedings 7th Conference on Rewriting Techniques
and Applications, volume 1103 of Lecture Notes in Computer
Science, pages 154-168, New Brunswick (NJ, USA), July 1996.
Springer-Verlag.
L. Vigneron and A. Wasilewska.
Automated Study of Rough and Modal Algebras.
In Proceedings of CCL'96 Workshop, San Lorenzo (Spain), September 1996.
Adel Bouhoula and Jean-Pierre Jouannaud.
Automata-Driven Automated Induction, June 1996.
Full paper
Abstract
Evelyne Contejean and Claude Marché.
CiME: Completion Modulo E.
In Harald Ganzinger, editor, 7th International Conference on Rewriting
Techniques and Applications, July 1996 (see there), pages 416-419.
System Description available at http://www.lri.fr/ demons/cime.html.
Full
paper Abstract
Maria C.F. Ferreira, Delia Kesner, and Laurence Puel.
lambda-Calculi with Explicit Substitutions and Composition which
Preserve [beta]-Strong Normalization (Extended Abstract).
In Michael Hanus and Mario Rodríguez-Artalejo, editors, 5th
International Conference on Algebraic and Logic Programming, September
1996 (see there), pages 284-298.
Harald Ganzinger, editor.
7th International Conference on Rewriting Techniques and Applications,
volume 1103 of Lecture Notes in Computer Science, New Brunswick, NJ,
USA, July 1996. Springer-Verlag.
Michael Hanus and Mario Rodríguez-Artalejo, editors.
5th International Conference on Algebraic and Logic Programming, volume
1139 of Lecture Notes in Computer Science, Aachen, Germany, September
1996. Springer-Verlag.
Jean-Pierre Jouannaud and Mitsuhiro Okada.
Strong Normalization of Inductive Data Type Systems, February 1996.
Full paper
Abstract
Jean-Pierre Jouannaud and Albert Rubio.
A Recursive Path Ordering for Higher-Order Terms in [eta]-Long
[beta]-Normal Form.
In Harald Ganzinger, editor, 7th International Conference on Rewriting
Techniques and Applications, July 1996 (see there), pages 108-122.
Full
paper Abstract
Delia Kesner.
Confluence Properties of Extensional and Non-Extensional lambda-calculi
with Explicit Substitutions.
In Harald Ganzinger, editor, 7th International Conference on Rewriting
Techniques and Applications, July 1996 (see there), pages 184-199.
Claude Marché.
Normalized Rewriting: an alternative to Rewriting modulo a Set of
Equations.
Journal of Symbolic Computation, 21(3):253-288, 1996.
Full paper Abstract
Ralf Treinen.
The First-Order Theory of Linear One-Step Rewriting is Undecidable.
Rapport de Recherche 1080, Laboratoire de Recherche en Informatique,
Université de Paris-Sud, F91405 Orsay cedex, France, November 1996.
Full
paper Abstract
Ralf Treinen.
The First-Order Theory of One-Step Rewriting by a Linear Term Rewriting
System is Undecidable (Extended Abstract).
In Klaus Schulz and Stephan Kepser, editors, Extended Abstracts of the
Tenth International Workshop on Unification, Herrsching, Germany, June
1996.
Published as CIS-Bericht-96-91, Universität München.
Ralf Treinen.
The First-Order Theory of One-Step Rewriting is Undecidable.
In Harald Ganzinger, editor, 7th International Conference on Rewriting
Techniques and Applications, July 1996 (see there), pages 276-286.
Alexander Bockmayr, Peter Barth, and Thomas Kasper.
Methods and Tools for Pseudo-Boolean Problems.
In B. Steinbach, editor, 2. Workshop Boolesche Probleme, pages
105-109, Freiberg, Sachsen, 1996. TU Bergakademie Freiberg, Institut für
Informatik.
David A. Basin and Harald Ganzinger.
Complexity Analysis Based on Ordered Resolution.
In Proceedings of the 11th Annual IEEE Symposium on Logic in Computer
Science (LICS'96), pages 456-465, New Brunswick, New Jersey, USA, 1996.
IEEE Comput. Soc. Tech. Committee on Math. Found. Comput.; ACM Special
Interest Group on Automata & Comput. Theory; Assoc. Symbolic Logic; Eur.
Assoc. Theoret. Comput. Sci, IEEE Comput. Soc. Press.
Alexander Bockmayr and Thomas Kasper.
Pseudo-Boolean and Finite Domain Constraint Programming: A Case Study.
In Ulrich Geske and Helmut Simonis, editors, Deklarative Constraint
Programmierung, number 297 in GMD-Studien, pages 29-41, Dresden,
Germany, September 1996. GDM-Forschungszentrum Informationstechnik GmbH, GMD.
Alexander Bockmayr.
Constraints in functional logic programming (Abstract).
In Michael Hanus, John W. Lloyd, and Juan José Moreno Navarro, editors,
Integration of functional and logic languages, volume 146 of
Dagstuhl-Seminar-Report, page 4, Schloss Dagstuhl, Germany, 1996. IBFI
GmbH.
Witold Charatonik and Andreas Podelski.
The Independence Property of a Class of Set Constraints.
In Eugene Freuder, editor, Principles and Practice of Constraint
Programming, Proceedings of the Second International Conference (CP'96),
volume 1118 of Lecture Notes in Computer Science, pages 76-90,
Cambridge, USA, August 1996. Springer.
Harald Ganzinger, editor.
Rewriting Techniques and Applications, 7th International Conference,
RTA-96, volume 1103 of Lecture Notes in Computer Science, Berlin,
1996. Center for Discrete Mathematics and Computer Science (DIMACS),
Springer.
One of the conferences participating in the 1996 Federated Logic Conference
(FLoC).
Harald Ganzinger.
Saturation-based theorem proving (abstract).
In Friedhelm Meyer auf der Heide and Burkhard Monien, editors, Automata,
Languages and Programming: International Colloquium (ICALP-23), volume
1099 of Lecture Notes in Computer Science, pages 1-3, Paderborn,
Germany, 1996. Springer.
Peter Graf and Christoph Meyer.
Advanced indexing operations on substitution trees.
In M. A. McRobbie and J. K. Slaney, editors, Proceedings of the 13th
International Conference on Automated Deduction (CADE-13), volume 1104 of
Lecture Notes in Artificial Intelligence, pages 553-567, New
Brunswick, New Jersey, USA, 1996. Springer.
Harald Ganzinger and Uwe Waldmann.
Theorem Proving in Cancellative Abelian Monoids.
Research Report MPI-I-96-2-001, Max-Planck-Institut für Informatik, Im
Stadtwald, D-66123 Saarbrücken, Germany, January 1996.
Harald Ganzinger and Uwe Waldmann.
Theorem Proving in Cancellative Abelian Monoids (Extended Abstract).
In Michael A. McRobbie and John K. Slaney, editors, Proceedings of the 13th
International Conference on Automated Deduction (CADE-13), volume 1104 of
Lecture Notes in Artificial Intelligence, pages 388-402, New
Brunswick, USA, 1996. Springer.
Full version: Technical Report MPI-I-96-2-001, Max-Planck-Institut für
Informatik, Saarbrücken, Germany, January 1996.
Jürgen Stuber.
Superposition Theorem Proving for Abelian Groups Represented as Integer
Modules.
In Harald Ganzinger, editor, Rewriting Techniques and Applications, 7th
International Conference, RTA-96, volume 1103 of Lecture Notes in
Computer Science, pages 33-47, New Brunswick, USA, 1996. Springer.
Christoph Weidenbach.
Computational Aspects of a First-Order Logic with Sorts.
PhD thesis, Universität des Saarlandes, 1996.
Christoph Weidenbach.
Sorted Unification and Its Application to Automated Theorem Proving.
In Miki Hermann and Gernot Salzer, editors, Proceedings of the CADE-13
Workshop: Term Schematizations and Their Applications, pages 67-76, New
Brunswick, USA, 1996. Self.
To appear in form of a technical report at the University of Wien, Austria.
Christoph Weidenbach.
Unification in Pseudo-Linear Sort Theories is Decidable.
In M. A. McRobbie and J. K. Slaney, editors, Proceedings of the 13th
International Conference on Automated Deduction (CADE-13), volume 1104 of
Lecture Notes in Artificial Intelligence, pages 343-357, New
Brunswick, USA, 1996. Springer.
Christoph Weidenbach.
Unification in Sort Theories.
In Klaus U. Schulz and Stephan Kepser, editors, Proceedings of the 10th
International Workshop on Unification, UNIF'96, volume 96 of
CIS-Bericht, pages 16-25, Harsching, Germany, 1996. Universität
München.
Christoph Weidenbach.
Unification in Sort Theories and its Applications.
Annals of Mathematics and Artificial Intelligence, 18(2-4):261-293,
1996.
Christoph Weidenbach, Bernd Gaede, and Georg Rock.
SPASS & FLOTTER, Version 0.42.
In M. A. McRobbie and J. K. Slaney, editors, Proceedings of the 13th
International Conference on Automated Deduction (CADE-13), volume 1104 of
Lecture Notes in Artificial Intelligence, pages 141-145, New
Brunswick, USA, 1996. Springer.
F. Baader, M. Buchheit, and B. Hollunder.
Cardinality Restrictions on Concepts.
Artificial Intelligence, 88(1-2):195-213, 1996.
Abstract
F. Baader and W. Nutt.
Combination Problems for Commutative/Monoidal Theories: How Algebra Can
Help in Equational Reasoning.
J. Applicable Algebra in Engineering, Communication and Computing,
7(4):309-337, 1996.
Abstract
F. Baader and U. Sattler.
Description Logics with Symbolic Number Restrictions.
In W. Wahlster, editor, Proceedings of the Twelfth European Conference on
Artificial Intelligence (ECAI-96), pages 283-287. John Wiley & Sons
Ltd, 1996.
An extended version has appeared as Technical Report LTCS-96-03.
Full paper Abstract
F. Baader and U. Sattler.
Number Restrictions on Complex Roles in Description Logics.
In Proceedings of the Fifth International Conference on the Principles of
Knowledge Representation and Reasoning (KR-96). Morgan Kaufmann, Los
Altos, 1996.
An extended version has appeared as Technical Report LTCS-96-02.
Abstract
F. Baader and K. U. Schulz.
Unification in the Union of Disjoint Equational Theories: Combining
Decision Procedures.
J. Symbolic Computation, 21:211-243, 1996.
Abstract
Henrik Linnestad, Christian Prehofer, and Olav Lysne.
Higher-Order Proof by Consistency.
In Proc. 16th Conf. Foundations of Software Technology and Theoretical
Computer Science, to appear. Technische Universität München, Springer
LNCS, 1996.
Full paper
Dieter Nazareth and Tobias Nipkow.
Formal Verification of Algorithm W: The Monomorphic Case .
In J. von Wright J. Grundy J. Harrison, editor, Theorem Proving in Higher
Order Logics (TPHOLs'96), pages 331-346. Springer-Verlag, 1996.
LNCS 1125.
Full paper
Dieter Nazareth and Tobias Nipkow.
Formal Verification of Algorithm W: The Monomorphic Case.
In J. von Wright, J. Grundy, and J. Harrison, editors, Theorem Proving in
Higher Order Logics, volume 1125 of LNCS, pages 331-346.
Springer, 1996.
Full
paper
Cornelia Pusch.
Verification of Compiler Correctness for the WAM .
In J. von Wright J. Grundy J. Harrison, editor, Theorem Proving in Higher
Order Logics (TPHOLs'96), pages 347-362. Springer-Verlag, 1996.
Full
paper
Jesús Manuel Almendros Jiménez, Antonio Gavilanes Franco, and Ana
Gil Luezas.
Algebraic Semantics for Functional Logic Programming with Polymorphic Order
Sorted Types.
In Algebraic and Logic Programming ALP' 96, volume 1139 of Lecture
Notes in Computer Science, pages 299-313. Springer-Verlag, 1996.
Full paper Abstract
Puri Arenas Martínez, M. T. Hortalá González, F. J.
López Fraguas, and Eva Ullán Hernández.
Functional Logic Programming with Real Numbers.
Technical report, Technische Universität Berlin, 1996.
To appear.
Full paper Abstract
Puri Arenas Sánchez, M. T. Hortalá González, F. J.
López Fraguas, and Eva Ullán Hernández.
Real Constraints within a Functional Logic Language.
In M. Navarro P. Lucio, M. Martelli, editor, 1996 Joint Conference on
Declarative Programming. APPIA-GULP-PRODE'96, pages 451-462. Universidad
del Pais Vasco, 1996.
Full paper Abstract
P. Arenas-Sánchez and M. Rodríguez-Artalejo.
A Semantic Framework for Functional Logic Programming with Algebraic
Polymorphic Types.
Technical Report TR-39/96, Dpto. Informática y Automática, (U.C.M.),
October 1996.
Full paper
Abstract
A. Gavilanes, J. Leach, P. J. Martín, and S. Nieva.
Reasoning with Preorders and Dynamic Sorts Using Free Variable
Tableaux.
In Artificial Intelligence and Symbolic Mathematical Computation.
AISMC-3, volume 1138 of Lecture Notes in Computer Science, pages
365-379. Springer-Verlag, 1996.
Extended version on http://mozart.sip.ucm.es/papers/1996/traismc.ps.gz.
Full paper Abstract
A. Gavilanes, J. Leach, P. J. Martín, and S. Nieva.
Reasoning with Preorders and Dynamic Sorts Using Free Variable
Tableaux.
Technical Report DIA 34-96, Departamento de Informática y Automática,
Facultad de Matemáticas (UCM), Av. Complutense s/n, Ciudad Universitaria,
Madrid E-28040 (SPAIN), jun 1996.
Full paper
Abstract
A. Gavilanes, J. Leach, and S. Nieva.
Free Variable Tableaux for a Many Sorted Logic with Preorders.
In Algebraic Methodology and Software Technology. AMAST' 96, volume
1101 of Lecture Notes in Computer Science, pages 102-116.
Springer-Verlag, 1996.
Extended version on http://mozart.sip.ucm.es/papers/1996/tramast.ps.gz.
Full paper Abstract
A. Gavilanes, J. Leach, and S. Nieva.
Free Variable Tableaux for a Many Sorted Logic with Preorders.
Technical Report DIA 23-96, Departamento de Informática y Automática,
Facultad de Matemáticas (UCM), Av. Complutense s/n, Ciudad Universitaria,
Madrid E-28040 (SPAIN), mar 1996.
Full paper
Abstract
J. C. González Moreno, F. J. López Fraguas, Hortalá González M.
T., and M. Rodríguez Artalejo.
A Rewriting Logic for Declarative Programming.
In ESOP' 96, volume 1058 of Lecture Notes in Computer Science,
pages 156-172. Springer-Verlag, 1996.
Extended version on http://mozart.sip.ucm.es/papers/1996/full_esop96.ps.gz.
Full paper Abstract
J. C. González Moreno, Hortalá González M. T., and
M. Rodríguez Artalejo.
A Higher Order Rewriting Logic for Declarative Programming.
Technical report, Technische Universität Berlin, 1996.
To appear.
Full paper Abstract
P. J. Martín and A. Gavilanes.
Semantic Tableaux for a Logic with Preorders and Dynamic Sorts.
In M. Navarro P. Lucio, M. Martelli, editor, 1996 Joint Conference on
Declarative Programming. APPIA-GULP-PRODE'96, pages 139-151. Universidad
del Pais Vasco, 1996.
Full paper
Abstract
J. Mateos Lago and M. Rodríguez Artalejo.
Genetic Inheritance.
Research Report 44/96, Departamento de Informática y Automática,
Facultad de Matemáticas (UCM), Av. Complutense s/n, Ciudad Universitaria,
Madrid E-28040 (SPAIN), 1996.
Full paper
Abstract
J. Mateos Lago and M. Rodríguez Artalejo.
GOTA Algebras.
Technical Report DIA 26-96, Departamento de Informática y Automática,
Facultad de Matemáticas (UCM), Av. Complutense s/n, Ciudad Universitaria,
Madrid E-28040 (SPAIN), apr 1996.
Full paper Abstract
J. Mateos Lago and M. Rodríguez Artalejo.
GOTA Algebras: A Specification Formalism for Inheritance and Object
Hierarchies.
In PLILP' 96, volume 1140 of Lecture Notes in Computer Science,
pages 62-76. Springer-Verlag, 1996.
Extended version on http://mozart.sip.ucm.es/papers/1996/tr26.ps.gz.
Full
paper Abstract
Narciso Martí-Oliet and José Meseguer.
Action and Change in Rewriting Logic.
In B. Fronhöfer and R. Pareschi, editors, REpresenting and Managing
Dynamic Knowledge in Artificial Intelligence and Computer Science. Kluwer
Academic Publishers, 1996.
To appear.
Abstract
Narciso Martí-Oliet and José Meseguer.
Rewriting Logic as a Logical and Semantic Framework.
In J. Meseguer, editor, Proc. First Int. Workshop on Rewriting Logic and
its Applications, Asilomar, CA, September 96, volume 4 of Electronic
Notes in Theoretical Computer Science. Elsevier Science, 1996.
Electronic publication.
Abstract
Narciso Martí-Oliet and José Meseguer.
Rewriting Logic as a Logical and Semantic Framework.
In D. M. Gabbay, editor, Handbook of Philosophical Logic, Second Edition,
Volume 6. Kluwer Academic Publishers, 1996.
To appear.
Full paper Abstract
Isabel Pita and Narciso Martí-Oliet.
A Maude specification of an object-oriented database model for
telecommunication networks.
In J. Meseguer, editor, Proc. First Int. Workshop on Rewriting Logic and
its Applications, Asilomar, CA, September 96, volume 4 of Electronic
Notes in Theoretical Computer Science. Elsevier Science, 1996.
Electronic publication.
Abstract
M. (ed.) Rodríguez Artalejo.
Abstracts of the CCL'96 Workshop.
Technical Report DIA 95/37, Departamento de Informática y Automática,
Facultad de Matemáticas (UCM), Av. Complutense s/n, Ciudad Universitaria,
Madrid E-28040 (SPAIN), sep 1996.
ESPRIT Working Group 6028 Construction of Computational Logics.
Full paper Abstract
Jean-Pierre Jouannaud and Albert Rubio.
A Recursive Path Ordering for Higher-Order Terms in [eta]-Long
[beta]-Normal Form.
In 7th International Conference on Rewriting Techniques and
Applications, LNCS. Springer-Verlag, July 1996.
Full paper
Robert Nieuwenhuis.
Basic Paramodulation and Decidable Theories.
In Eleventh Annual IEEE Symposium on Logic in Computer Science, pages
473-482, New Brunswick, New Jersey, USA, July 27-30, 1996. IEEE Computer
Society Press.
Full paper
Robert Nieuwenhuis, José Miguel Rivero, and Miguel Ángel Vallejo.
An implementation kernel for theorem proving with equality clauses.
In Proc. joint conference on declarative programming APPIA-GULP-ProDe,
San Sebastian, Spain, July 1996.
Full paper
Robert Nieuwenhuis, José Miguel Rivero, and Miguel Ángel Vallejo.
A Kernel of Data Structures and Algorithms for Automated Deduction with
Equality Clauses, 1996.
Submitted.
Full paper
Back to the CCL online bibliography.
Ralf Treinen
Generated at
Mon Mar 12 07:07:00 CET 2001.