{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":40,"n_cols":5,"rows_kept":40,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[10,2,10,3],[12,2,12,3],[12,4,12,5],[13,2,13,3],[13,4,13,5],[14,2,14,3],[15,2,15,3],[20,2,20,3],[21,2,21,3],[22,2,22,3],[23,2,23,3],[26,2,26,3],[27,2,27,3],[28,2,28,3],[32,2,32,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910229559503321"]
[null,null,"Autore",null,"Alliegro, Enzo Vinicio"]
[null,null,"Titolo",null,"Lewis Henry Morgan e la ricerca antropologica sui sistemi di parentela : diario di campo in Kansas e Nebraska 1859 - 1860 / a cura di Enzo Vinicio Alliegro"]
[null,null,"Pubbl/distr/stampa",null,"Roma : CISU, 20174"]
[null,null,"ISBN",null,"978-88-7975-648-8"]
[null,null,"Descrizione fisica",null,"223 p. ; 20 cm"]
[null,null,"Disciplina",null,"306.83"]
[null,null,"Locazione",null,"BFS"]
[null,null,"Collocazione",null,"306.83 ALL 1"]
[null,null,"Lingua di pubblicazione",null,"Italiano"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,"2.","Record Nr.",null,"UNINA9910830751803321"]
[null,null,"Titolo",null,"Trends in constraint programming / / edited by Frédéric Benhamou, Narendra Jussien, Barry O'Sullivan"]
[null,null,"Pubbl/distr/stampa",null,"Newport Beach, CA : , : ISTE USA, , 2007"]
[null,null,"ISBN",null,"1-280-84786-7"]
[{"$nulls":4},"9786610847860"]
[{"$nulls":4},"0-470-61230-4"]
[{"$nulls":4},"0-470-39494-3"]
[{"$nulls":4},"1-84704-647-9"]
[null,null,"Edizione",null,"[1st ed.]"]
[null,null,"Descrizione fisica",null,"1 online resource (410 p.)"]
[null,null,"Collana",null,"ISTE ; ; v.123"]
[null,null,"Disciplina",null,"005.1"]
[{"$nulls":4},"005.1/16"]
[{"$nulls":4},"005.116"]
[null,null,"Soggetti",null,"Constraint programming (Computer science)"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Trends in Constraint Programming; Contents; Introduction; Part I. The Past, Present and Future of Constraint Programming; Chapter 1. Constraint Programming as Declarative Algorithmics; 1.1. The CHIP project; 1.2. The Numerica project; 1.3. The OPL project; 1.4. The Comet project; 1.5. The future of constraint programming; Chapter 2. Constraint Programming Tools; 2.1. Introduction; 2.2. Invited talks; 2.2.1. The development of an industrial CP tool; 2.2.1.1. Design goals; 2.2.1.2. The future; 2.2.2. System design: taking informed decisions; 2.2.2.1. Search; 2.2.2.2. Constraint propagation"]
[{"$nulls":4},"2.2.2.3. Variables2.3. System presentations; 2.3.1. ECLiPSe; 2.3.2. SICStus FD; 2.3.3. G12; 2.3.4. DiSolver; 2.3.5.MINION; 2.3.6. Choco; 2.3.7. Gecode; 2.3.8. Comet; 2.3.9. JaCoP; 2.3.10. Borderwijk; 2.4. Panels; 2.5. Conclusion; 2.6. References; Chapter 3. The Next 10 Years of Constraint Programming; 3.1. Pedro Barahona; 3.2. Christian Bessiere; 3.3. Peter Jeavons; 3.4. Pedro Meseguer; 3.5. Gilles Pesant; 3.6. Francesca Rossi; 3.7. Thomas Schiex; 3.8. Christian Schulte; 3.9. Meinolf Sellmann; 3.10. Mark Wallace; 3.11. Toby Walsh; 3.12. Roland Yap; 3.13. References"]
[{"$nulls":4},"Chapter 4. Constraint Propagation and Implementation4.1. Filtering algorithms for precedence and dependency constraints; 4.1.1. Problem "]
[{"$nulls":4},"description and related works; 4.1.2. Filtering rules for precedence and dependency constraints; 4.1.3. Summary; 4.2. A study of residual supports in arc consistency; 4.3. Maintaining singleton arc consistency; 4.3.1. Mixed consistency; 4.3.2. Checking existential-SAC; 4.3.3. Conclusion; 4.4. Probabilistic singleton arc consistency; 4.5. Simplification and extension of the SPREAD constraint; 4.5.1. Filtering of π; 4.5.2. Filtering of X; 4.5.3. Conclusion"]
[{"$nulls":4},"4.6. A new filtering algorithm for the graph isomorphism problem4.6.1. A global constraint for the graph isomorphism problem; 4.6.2. ILL-consistency and ILL-filtering; 4.6.3. Experimental results; 4.7. References; Chapter 5. On the First SAT/CP Integration Workshop; 5.1. The technical program; 5.1.1. The invited talk; 5.1.2. Contributions related to SMT and solver integration; 5.1.3. Contributions related to the use of SAT techniques to improve CSP/CP solvers; 5.1.4. Other contributions; 5.2. The panel session; 5.2.1. Are SAT and CP different or similar?"]
[{"$nulls":4},"5.2.2. Why has SAT succeeded in reducing the tuning issue?5.2.3. How long can the current generation of SAT solvers evolve?; 5.2.4. Were performance issues correctly addressed by CP?; 5.2.5. Was CP too ambitious?; 5.2.6. Do we still need CP?; 5.3. Summary, future directions and conclusion; 5.4. References; Chapter 6. Constraint-Based Methods for Bioinformatics; 6.1. On using temporal logic with constraints to express biological properties of cell processes; 6.2. Modeling biological systems in stochastic concurrent constraint programming"]
[{"$nulls":4},"6.3. Chemera: constraints in protein structural problems"]
[null,null,null,"Sommario/riassunto","This title brings together the best papers on a range of topics raised at the annual International Conference on Principles and Practice of Constraint Programming. This conference provides papers and workshops which produce new insights, concepts and results which can then be used by those involved in this area to develop their own work."]