


default search action
Theoretical Computer Science, Volume 173
Volume 173, Number 1, 20 February 1997
- Laurent Michel, Pascal Van Hentenryck:
Helios: A Modeling Language for Global Optimization and its Implementation in Newton. 3-48 - Nikolaj S. Bjørner, Anca Browne, Zohar Manna:
Automatic Generation of Invariants and Intermediate Assertions. 49-87 - Manolis Koubarakis
:
From Local to Global Consistency in Temporal Constraint Networks. 89-112 - Michael J. Maher:
Constrained Dependencies. 113-149 - Stéphane Grumbach, Jianwen Su:
Queries with Arithmetical Constraints. 151-181 - Farid Ajili, Evelyne Contejean:
Avoiding Slack Variables in the Solving of Linear Diophantine Equations and Inequations. 183-208 - Kim Marriott, Martin Odersky:
A Confluent Calculus for Concurrent Constraint Programming. 209-233 - Andreas Podelski, Gert Smolka:
Situated Simplification. 235-252 - Pierre Girodias, Eduard Cerny, William J. Older:
Solving Linear, Min and Max Constraint Systems Using CLP Based on Relational Interval Arithmetic. 253-281 - Rina Dechter, Peter van Beek:
Local and Global Relational Consistency. 283-308
Volume 173, Number 2, 28 February 1997
- Maura Cerioli
, José Meseguer:
May I Borrow Your Logic? (Transporting Logical Structures Along Maps). 311-347 - Jean-Pierre Jouannaud, Mitsuhiro Okada:
Abstract Data Type Systems. 349-391 - Rolf Hennicker, Martin Wirsing, Michel Bidoit:
Proof Systems for Structured Specifications with Observability Operators. 393-443 - Stefan Kahrs, Donald Sannella
, Andrzej Tarlecki
:
The Definition of Extended ML: A Gentle Introduction. 445-484 - Fernando Orejas, Elvira Pino, Hartmut Ehrig:
Institutions for Logic Programming. 485-511 - Gerardo Costa, Gianna Reggio:
Specification of Abstract Dynamic-Data Types: A Temporal Logic Approach. 513-554

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.