000 04711nam a22006255i 4500
001 978-3-540-40016-5
003 DE-He213
005 20240423132550.0
007 cr nn 008mamaa
008 121227s2000 gw | s |||| 0|eng d
020 _a9783540400165
_9978-3-540-40016-5
024 7 _a10.1007/10722311
_2doi
050 4 _aQA76.76.C65
072 7 _aUMC
_2bicssc
072 7 _aCOM010000
_2bisacsh
072 7 _aUMC
_2thema
082 0 4 _a005.45
_223
245 1 0 _aAnalysis and Visualization Tools for Constraint Programming
_h[electronic resource] :
_bConstraint Debugging /
_cedited by Pierre Deransart, M.V. Hermenegildo, J. Maluszynski.
250 _a1st ed. 2000.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2000.
300 _aXXII, 370 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1870
505 0 _aDebugging of Constraint Programs: The DiSCiPl Methodology and Tools -- Debugging of Constraint Programs: The DiSCiPl Methodology and Tools -- I. Correctness Debugging -- An Assertion Language for Constraint Logic Programs -- A Generic Preprocessor for Program Validation and Debugging -- Assertions with Constraints for CLP Debugging -- Locating Type Errors in Untyped CLP Programs -- Declarative Diagnosis in the CLP Scheme -- II. Performance Debugging -- Visual Tools to Debug Prolog IV Programs -- Search-Tree Visualisation -- Towards a Language for CLP Choice-Tree Visualisation -- Tools for Search-Tree Visualisation: The APT Tool -- Tools for Constraint Visualisation: The VIFID/TRIFID Tool -- Debugging Constraint Programs by Store Inspection -- Complex Constraint Abstraction: Global Constraint Visualisation -- III. Test Cases -- Using Constraint Visualisation Tools.
520 _aCoordinating 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.
650 0 _aCompilers (Computer programs).
650 0 _aComputer programming.
650 0 _aSoftware engineering.
650 0 _aArtificial intelligence.
650 0 _aMachine theory.
650 1 4 _aCompilers and Interpreters.
650 2 4 _aProgramming Techniques.
650 2 4 _aSoftware Engineering.
650 2 4 _aArtificial Intelligence.
650 2 4 _aFormal Languages and Automata Theory.
700 1 _aDeransart, Pierre.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aHermenegildo, M.V.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aMaluszynski, J.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540411376
776 0 8 _iPrinted edition:
_z9783662202395
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1870
856 4 0 _uhttps://doi.org/10.1007/10722311
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c189193
_d189193