Data Portal @ linkeddatafragments.org

Matches in Harvard for { <http://id.lib.harvard.edu/aleph/008555206/catalog> ?p ?o. }

• catalog abstract "Coordinating production across a supply chain, designing a new VLSI chip, allocating classrooms or scheduling maintenance crews at an airport are just a few examples of complex (combinatorial) problems that can be modeled as a set of decision variables whose values are subject to a set of constraints. The decision variables may be the time when production of a particular lot will start or the plane that a maintenance crew will be working on at a given time. Constraints may range from the number of students you can ?t in a given classroom to the time it takes to transfer a lot from one plant to another.Despiteadvancesincomputingpower,manyformsoftheseandother combinatorial problems have continued to defy conventional programming approaches. Constraint Logic Programming (CLP) ?rst emerged in the mid-eighties as a programming technique with the potential of signi?cantly reducing the time it takes to develop practical solutions to many of these problems, by combining the expressiveness of languages such as Prolog with the compu- tional power of constrained search. While the roots of CLP can be traced to Monash University in Australia, it is without any doubt in Europe that this new software technology has gained the most prominence, bene?ting, among other things, from sustained funding from both industry and public R&D programs over the past dozen years. These investments have already paid o?, resulting in a number of popular commercial solutions as well as the creation of several successful European startups.".
• catalog contributor b11971776.
• catalog contributor b11971777.
• catalog contributor b11971778.
• catalog created "2000.".
• catalog date "2000".
• catalog date "2000.".
• catalog dateCopyrighted "2000.".
• catalog description "Coordinating production across a supply chain, designing a new VLSI chip, allocating classrooms or scheduling maintenance crews at an airport are just a few examples of complex (combinatorial) problems that can be modeled as a set of decision variables whose values are subject to a set of constraints. The decision variables may be the time when production of a particular lot will start or the plane that a maintenance crew will be working on at a given time. Constraints may range from the number of students you can ?t in a given classroom to the time it takes to transfer a lot from one plant to another.Despiteadvancesincomputingpower,manyformsoftheseandother combinatorial problems have continued to defy conventional programming approaches. Constraint Logic Programming (CLP) ?rst emerged in the mid-eighties as a programming technique with the potential of signi?cantly reducing the time it takes to develop practical solutions to many of these problems, by combining the expressiveness of languages such as Prolog with the compu- tional power of constrained search. While the roots of CLP can be traced to Monash University in Australia, it is without any doubt in Europe that this new software technology has gained the most prominence, bene?ting, among other things, from sustained funding from both industry and public R&D programs over the past dozen years. These investments have already paid o?, resulting in a number of popular commercial solutions as well as the creation of several successful European startups.".
• catalog description "Includes bibliographical references and index.".
• catalog description "pt. I. Correctness Debugging. 1. An Assertion Language for Constraint Logic Programs / German Puebla, Francisco Bueno and Manuel Hermenegildo. 2. A Generic Preprocessor for Program Validation and Debugging / German Puebla, Francisco Bueno and Manuel Hermenegildo. 3. Assertions with Constraints for CLP Debugging / Claude Lai. 4. Locating Type Errors in Untyped CLP Programs / Wlodzimierz Drabent, Jan Maluszynski and Pawel Pietrzak. 5. Declarative Diagnosis in the CLP Scheme / Alexandre Tessier and Gerard Ferrand -- pt. II. Performance Debugging. 6. Visual Tools to Debug Prolog IV Programs / Pascal Bouvier. 7. Search-Tree Visualisation / Helmut Simonis and Abder Aggoun.".
• catalog extent "xxi, 363 p. :".
• catalog identifier "3540411372 (softcover : alk. paper)".
• catalog isPartOf "Lecture notes in computer science ; 1870".
• catalog issued "2000".
• catalog issued "2000.".
• catalog language "eng".
• catalog publisher "Berlin ; New York : Springer,".
• catalog subject "005.1/1 21".
• catalog subject "Artificial intelligence.".
• catalog subject "Computer science.".
• catalog subject "Constraint programming (Computer science)".
• catalog subject "QA76.612 .A53 2000".
• catalog subject "Software engineering.".
• catalog tableOfContents "pt. I. Correctness Debugging. 1. An Assertion Language for Constraint Logic Programs / German Puebla, Francisco Bueno and Manuel Hermenegildo. 2. A Generic Preprocessor for Program Validation and Debugging / German Puebla, Francisco Bueno and Manuel Hermenegildo. 3. Assertions with Constraints for CLP Debugging / Claude Lai. 4. Locating Type Errors in Untyped CLP Programs / Wlodzimierz Drabent, Jan Maluszynski and Pawel Pietrzak. 5. Declarative Diagnosis in the CLP Scheme / Alexandre Tessier and Gerard Ferrand -- pt. II. Performance Debugging. 6. Visual Tools to Debug Prolog IV Programs / Pascal Bouvier. 7. Search-Tree Visualisation / Helmut Simonis and Abder Aggoun.".
• catalog title "Analysis and visualization tools for constraint programming : constraint debugging / Pierre Deransart, M. Hermenegildo, J. Małuszyński (eds.).".
• catalog type "text".