{"entities":{"Q1413092":{"pageid":1423832,"ns":120,"title":"Item:Q1413092","lastrevid":68647332,"modified":"2026-04-13T01:09:58Z","type":"item","id":"Q1413092","labels":{"en":{"language":"en","value":"Principles and practice of constraint programming -- CP 2003. 9th international conference, CP 2003, Kinsale, Ireland, September 29 -- October 3, 2003. Proceedings"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 2003521"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1413092$28C2E740-515B-45C2-AD8C-4B4F7FE7BC9D","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"d267e9c79823d062e4cb7a409591a58416b6798b","datavalue":{"value":{"text":"Principles and practice of constraint programming -- CP 2003. 9th international conference, CP 2003, Kinsale, Ireland, September 29 -- October 3, 2003. Proceedings","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1413092$442325E8-C294-4D74-A0EB-E421F6A1D9DC","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"47262ff1e9b99370ee40d36d28c386802cbd5ec3","datavalue":{"value":"1024.00062","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1413092$267A3C78-DB0F-445F-A7F3-C791397BD6A0","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"85c07c7737819bff773f78e2590a3bb761fe677b","datavalue":{"value":{"entity-type":"item","numeric-id":162374,"id":"Q162374"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1413092$4B62FA24-7FD4-40DE-9DB8-79D8DE130C4C","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"2d267c93bb2df1d01eef21b76c404524b49eb1f9","datavalue":{"value":{"time":"+2003-11-13T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1413092$2AF22F88-F38A-402F-957F-BD3AF7ACF0CB","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"2e7f7d350d124a8d291058a313a6c3dfda78cd98","datavalue":{"value":"http://link.springer.de/link/service/series/0558/tocs/t2833.htm","type":"string"},"datatype":"url"},"type":"statement","id":"Q1413092$A07265C0-8358-432E-B9B5-FE3866A4E08D","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"fda2d15341bc23fa372b5b33020ee362d7fb0758","datavalue":{"value":"The articles of this volume will be reviewed individually. For the preceding conference see Zbl 1049.68016.  Indexed articles:  \\textit{Kautz, Henry; Selman, Bart}, Ten challenges \\textit{redux}: recent progress in propositional reasoning and search, 1-18 [Zbl 1273.68350]  \\textit{Sandholm, Tuomas}, Automated mechanism design: a new application area for search algorithms, 19-36 [Zbl 1273.68385]  \\textit{Angelsmark, Ola; Jonsson, Peter}, Improved algorithms for counting solutions in constraint satisfaction problems, 81-95 [Zbl 1273.68330]  \\textit{Bailleux, Olivier; Boufkhad, Yacine}, Efficient CNF encoding of Boolean cardinality constraints, 108-122 [Zbl 1273.68332]  \\textit{Bent, Russell; Van Hentenryck, Pascal}, A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows, 123-137 [Zbl 1273.90020]  \\textit{Bistarelli, Stefano; Codognet, Philippe; Hui, Kin-Chuen; Lee, Jimmy Ho Man}, Solving finite domain constraint hierarchies by local consistency and tree search, 138-152 [Zbl 1273.68335]  \\textit{Bulatov, Andrei A.; Jeavons, Peter}, An algebraic approach to multi-sorted constraints, 183-198 [Zbl 1273.68337]  \\textit{Chen, Hubie}, Periodic constraint satisfaction problems: polynomial-time algorithms, 199-213 [Zbl 1273.68338]  \\textit{Cheng, Chi Kan; Lee, Jimmy Ho Man; Stuckey, Peter J.}, Box constraint collections for adhoc constraints, 214-228 [Zbl 1273.68339]  \\textit{Choi, Chiu Wo; Lee, Jimmy Ho Man; Stuckey, Peter J.}, Propagation redundancy in redundant modelling, 229-243 [Zbl 1273.68340]  \\textit{Cohen, David A.; Cooper, Martin; Jeavons, Peter; Krokhin, Andrei}, Soft constraints: complexity and multimorphisms, 244-258 [Zbl 1273.68342]  \\textit{Cruz, Jorge; Barahona, Pedro}, Constraint satisfaction differential problems, 259-273 [Zbl 1273.68343]  \\textit{Dimitriou, Tassos}, A wealth of SAT distributions with planted assignments, 274-287 [Zbl 1273.68344]  \\textit{Dot\u00fa, Iv\u00e1n; del Val, Alvaro; Cebri\u00e1n, Manuel}, Redundant modeling for the quasigroup completion problem, 288-302 [Zbl 1273.68269]  \\textit{Faltings, Boi; Macho-Gonzalez, Santiago}, Open constraint optimization, 303-317 [Zbl 1273.68345]  \\textit{Frisch, Alan M.; Jefferson, Chris; Miguel, Ian}, Constraints for breaking more row and column symmetries, 318-332 [Zbl 1273.68075]  \\textit{Gent, Ian P.; Harvey, Warwick; Kelsey, Tom; Linton, Steve}, Generic SBDD using computational group theory, 333-347 [Zbl 1273.68076]  \\textit{Gent, Ian P.; Hoos, Holger H.; Rowley, Andrew G. D.; Smyth, Kevin}, Using stochastic local search to solve quantified Boolean formulae, 348-362 [Zbl 1273.68346]  \\textit{de Givry, Simon; Larrosa, Javier; Meseguer, Pedro; Schiex, Thomas}, Solving Max-SAT as weighted CSP, 363-376 [Zbl 1273.68368]  \\textit{Golden, Keith; Pang, Wanlin}, Constraint reasoning over strings, 377-391 [Zbl 1273.68347]  \\textit{Green, Martin J.; Cohen, David A.}, Tractability by approximating constraint languages, 392-406 [Zbl 1273.68146]  \\textit{van Hoeve, Willem Jan}, A hybrid constraint programming and semidefinite programming approach for the stable set problem, 407-421 [Zbl 1273.90181]  \\textit{Katriel, Irit; Thiel, Sven}, Fast bound consistency for the global cardinality constraint, 437-451 [Zbl 1273.68400]  \\textit{Liu, Lengning; Truszczy\u0144ski, Miros\u0142aw}, Local-search techniques for propositional logic extended with cardinality constraints, 495-509 [Zbl 1273.68353]  \\textit{Maher, Michael J.}, A synthesis of constraint satisfaction and constraint solving, 525-539 [Zbl 1273.68354]  \\textit{Michel, Laurent; Van Hentenryck, Pascal}, Maintaining longest paths incrementally, 540-554 [Zbl 1273.68355]  \\textit{Mitchell, David G.}, Resolution and constraint satisfaction, 555-569 [Zbl 1273.68356]  \\textit{Puget, Jean-Fran\u00e7ois}, Symmetry breaking using stabilizers, 585-599 [Zbl 1273.68360]  \\textit{Quimper, Claude-Guy; van Beek, Peter; L\u00f3pez-Ortiz, Alejandro; Golynski, Alexander; Sadjad, Sayyed Bashir}, An efficient bounds consistency algorithm for the global cardinality constraint, 600-614 [Zbl 1273.68361]  \\textit{Ratschan, Stefan}, Solving existentially quantified constraints with one equality and arbitrarily many inequalities, 615-633 [Zbl 1273.68362]  \\textit{R\u00e9gin, Jean-Charles}, Using constraint programming to solve the maximum clique problem, 634-648 [Zbl 1273.90176]  \\textit{Satish Kumar, T. K.}, Incremental computation of resource-envelopes in producer-consumer models, 664-678 [Zbl 1273.91330]  \\textit{Sellmann, Meinolf}, Approximated consistency for knapsack constraints, 679-693 [Zbl 1273.90179]  \\textit{Sellmann, Meinolf}, Cost-based filtering for shorter path constraints, 694-708 [Zbl 1273.90231]  \\textit{Terrioux, Cyril; J\u00e9gou, Philippe}, Bounded backtracking for the valued constraint satisfaction problems, 709-723 [Zbl 1273.68363]  \\textit{Walsh, Toby}, Consistency and propagation with multiset constraints: a formal viewpoint, 724-738 [Zbl 1273.68364]  \\textit{Wolf, Armin}, Pruning while sweeping over task intervals, 739-753 [Zbl 1273.68366]  \\textit{Bessi\u00e8re, Christian; Van Hentenryck, Pascal}, To be or not to be \\(\\ldots\\) a global constraint, 789-794 [Zbl 1273.68334]  \\textit{Brand, Sebastian; Gennari, Rosella; de Rijke, Maarten}, Constraint programming for modelling and solving modal satisfiability, 795-800 [Zbl 1273.68336]  \\textit{Cohen, David A.}, A new class of binary CSPs for which arc-consistency is a decision procedure, 807-811 [Zbl 1273.68341]","type":"string"},"datatype":"string"},"type":"statement","id":"Q1413092$9A1CA929-CB84-4B4F-B1F3-DCDA1979FEDB","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1413092$1DC6104E-E328-44B6-9384-C597EAD75F05","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1413092$D7765A05-592C-4D20-A6F0-72474DD60B50","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"35c3f01235ccba091e1644bb05c86f53d45fd7f7","datavalue":{"value":"68N19","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1413092$60206761-342A-4C4F-B301-73AB86C9F07C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"a0dc380a7a6964f00e6560e4112710836960e832","datavalue":{"value":"68T20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1413092$49710BF6-752C-472B-8788-2712E4365DB5","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"07c6a01166d8f773b1eb4f28dbcda3a7dd8f9fec","datavalue":{"value":"2003521","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1413092$79C99410-5CE4-4ED6-A4FA-3067C673F985","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"36cfceb64a86d89a2cdbe0e21504b0724a6287fb","datavalue":{"value":"Constraint programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q1413092$E8BB8852-052F-41C9-AD31-6AFF7FDED022","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"89d54f864bb79736bd869f395582681f6c3baa96","datavalue":{"value":"CP 2003","type":"string"},"datatype":"string"},"type":"statement","id":"Q1413092$EE97B307-CEAA-420D-84F9-173F8D741F31","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"b7ef9f5a041a7ca7e8a4c675640def5334d138d6","datavalue":{"value":"Kinsale (Ireland)","type":"string"},"datatype":"string"},"type":"statement","id":"Q1413092$58AE0A52-77AA-48E2-871F-6F37CBDFB8BC","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1413092$0AB74A21-FB3F-432C-910B-F6B47683CFA7","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"49b07624b0b62d4da04deefc3f7c61204803e5bb","datavalue":{"value":"W2497660909","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1413092$AFFBD570-1A94-4075-ADA1-F3658F20131B","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"157818170df4ba439bc3d580df95d4f0c83ad56b","datavalue":{"value":"10.1007/B13743","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1413092$9E0ADB82-8456-47F1-A3C6-9E773E4EE610","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Principles and practice of constraint programming -- CP 2003. 9th international conference, CP 2003, Kinsale, Ireland, September 29 -- October 3, 2003. Proceedings","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Principles_and_practice_of_constraint_programming_--_CP_2003._9th_international_conference,_CP_2003,_Kinsale,_Ireland,_September_29_--_October_3,_2003._Proceedings"}}}}}