{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":3,"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":69,"n_cols":5,"rows_kept":69,"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],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[20,2,20,3],[21,2,21,3],[25,2,25,3],[28,2,28,3],[28,4,28,5],[29,2,29,3],[29,4,29,5],[30,2,30,3],[31,2,31,3],[32,2,32,3],[33,2,33,3],[34,2,34,3],[36,2,36,3],[37,2,37,3],[39,2,39,3],[39,4,39,5],[40,2,40,3],[40,4,40,5],[41,2,41,3],[42,2,42,3],[45,2,45,3],[46,2,46,3],[47,2,47,3],[48,2,48,3],[49,2,49,3],[61,2,61,3],[62,2,62,3],[66,2,66,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996465298803316"]
[null,null,"Titolo",null,"Applications of Graph Transformations with Industrial Relevance [[electronic resource] ] : 4th International Symposium, AGTIVE 2011, Budapest, Hungary, October 4-7, 2011, Revised Selected Papers / / edited by Andy Schürr, Dániel Varró, Gergely Varró"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012"]
[null,null,"ISBN",null,"3-642-34176-4"]
[null,null,"Edizione",null,"[1st ed. 2012.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XII, 255 p. 133 illus.)"]
[null,null,"Collana",null,"Programming and Software Engineering ; ; 7233"]
[null,null,"Disciplina",null,"004.015115"]
[null,null,"Soggetti",null,"Computer science—Mathematics"]
[{"$nulls":4},"Data structures (Computer science)"]
[{"$nulls":4},"Software engineering"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Computer logic"]
[{"$nulls":4},"Mathematical logic"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Data Structures"]
[{"$nulls":4},"Software Engineering"]
[{"$nulls":4},"Algorithm Analysis and Problem Complexity"]
[{"$nulls":4},"Logics and Meanings of Programs"]
[{"$nulls":4},"Mathematical Logic and Formal Languages"]
[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","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and author index."]
[null,null,"Nota di contenuto",null,"Best Practices to Model Business Services in Complex IT Environments -- Drools: A Rule Engine for Complex Event Processing -- Graph Transformation Concepts for Meta-model Evolution Guaranteeing Permanent Type Conformance throughout Model Migration -- A Graph Transformation-Based Semantics for Deep Metamodelling -- Reusable Graph Transformation Templates -- Towards an Automated 3D Reconstruction of Plant Architecture.- Generating Graph Transformation Rules from AML/GT State Machine Diagrams for Building Animated Model Editors -- AGG 2.0 – New Features for Specifying and Analyzing Algebraic Graph Transformations -- Integration of a Pattern-Based Layout Engine into Diagram Editors -- "]
[{"$nulls":4},"Tool Demonstration of the Transformation Judge -- Knowledge-Based Graph Exploration Analysis.- Graph Grammar Induction as a Parser-Controlled Heuristic Search Process.- Planning Self-adaption with Graph Transformations -- From Graph Transformation Units via MiniSat to GrGen.NET -- Locality in Reasoning about Graph Transformations -- Contextual Hyperedge Replacement -- The Added Value of Programmed Graph Transformations – A Case Study from Software Configuration Management -- A Case Study Based Comparison of ATL and SDM -- Applying Advanced TGG Concepts for a Complex Transformation of Sequence Diagram Specifications to Timed Game Automata -- Automatic Conformance Testing of Optimized Triple Graph Grammar Implementations. Drools: A Rule Engine for Complex Event Processing -- Graph Transformation Concepts for Meta-model Evolution Guaranteeing Permanent Type Conformance throughout Model Migration -- A Graph Transformation-Based Semantics for Deep Metamodelling -- Reusable Graph Transformation Templates -- Towards an Automated 3D Reconstruction of Plant Architecture.- Generating Graph Transformation Rules from AML/GT State Machine Diagrams for Building Animated Model Editors -- AGG 2.0 – New Features for Specifying and Analyzing Algebraic Graph Transformations -- Integration of a Pattern-Based Layout Engine into Diagram Editors -- Tool Demonstration of the Transformation Judge -- Knowledge-Based Graph Exploration Analysis.- Graph Grammar Induction as a Parser-Controlled Heuristic Search Process.- Planning Self-adaption with Graph Transformations -- From Graph Transformation Units via MiniSat to GrGen.NET -- Locality in Reasoning about Graph Transformations -- Contextual Hyperedge Replacement -- The Added Value of Programmed Graph Transformations – A Case Study from Software Configuration Management -- A Case Study Based Comparison of ATL and SDM -- Applying Advanced TGG Concepts for a Complex Transformation of Sequence Diagram Specifications to Timed Game Automata -- Automatic Conformance Testing of Optimized Triple Graph Grammar Implementations."]
[null,null,null,"Sommario/riassunto","This book constitutes the thoroughly refereed post-conference proceedings of the 4th International Symposium on Applications of Graph Transformations, AGTIVE 2011, held in Budapest, Hungary, in October 2011. The 13 revised full papers presented together with 2 invited talks, 2 application reports, and 3 tool demonstration papers were carefully selected from 36 submissions during two rounds of reviewing and improvement. The papers are organized in topical sections on invited talk abstracts, model-driven engineering, graph transformation applications, tool demonstrations, graph transformation exploration techniques, graph transformation semantics and reasoning, application reports and bidirectional transformations."]
[null,"2.","Record Nr.",null,"UNIORUON00078191"]
[null,null,"Titolo",null,"Islam, globalisation and postmodernity / Edited by Akbar Salahuddin Ahmed, Hastings Donnan"]
[null,null,"Pubbl/distr/stampa",null,"London ; New York, : Routledge, 1994"]
[null,null,"ISBN",null,"04-15-09367-8"]
[null,null,"Descrizione fisica",null,"xiv, 242 p. ; 24 cm"]
[null,null,"Disciplina",null,"301.097671"]
[null,null,"Soggetti",null,"PAESI ISLAMICI - Condizioni sociali"]
[{"$nulls":4},"Sociologia - Paesi islamici"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,"3.","Record Nr.",null,"UNINA9910484298903321"]
[null,null,"Titolo",null,"Approaches and Applications of Inductive Programming : Third International Workshop, AAIP 2009, Edinburgh, UK, September 4, 2009, Revised Papers / / edited by Ute Schmid, Emanuel Kitzelmann"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010"]
[null,null,"ISBN",null,"1-280-38580-4"]
[{"$nulls":4},"9786613563729"]
[{"$nulls":4},"3-642-11931-X"]
[null,null,"Edizione",null,"[1st ed. 2010.]"]
[null,null,"Descrizione fisica",null,"1 online resource (IX, 195 p. 14 illus.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 1611-3349 ; ; 5812"]
[null,null,"Disciplina",null,"005.1"]
[null,null,"Soggetti",null,"Software engineering"]
[{"$nulls":4},"Artificial intelligence"]
[{"$nulls":4},"Machine theory"]
[{"$nulls":4},"Computer science"]
[{"$nulls":4},"Application software"]
[{"$nulls":4},"Computer programming"]
[{"$nulls":4},"Software Engineering"]
[{"$nulls":4},"Artificial Intelligence"]
[{"$nulls":4},"Formal Languages and Automata Theory"]
[{"$nulls":4},"Computer Science Logic and Foundations of Programming"]
[{"$nulls":4},"Computer and Information Systems Applications"]
[{"$nulls":4},"Programming Techniques"]
[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","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Invited Papers -- Deriving a Relationship from a Single Example -- Synthesis of Functions Using Generic Programming -- Regular Papers -- Inductive Programming: A Survey of Program Synthesis Techniques -- Incremental Learning in Inductive Programming -- Enumerating Well-Typed Terms Generically -- Generalisation Operators for Lists Embedded in a Metric Space -- Porting IgorII from Maude to Haskell -- Automated Method Induction: Functional Goes Object Oriented -- Recent Improvements of MagicHaskeller."]
[null,null,null,"Sommario/riassunto","Inductive programming is concerned with the automated construction of decl- ative-often functional -"]
[{"$nulls":4},"recursiveprogramsfromincompletespeci'cationssuch as input/output examples. The inferred program must be correct with respect to the provided examples in a generalizing sense: it should be neither equivalent to it, nor inconsistent. Inductive programming algorithms are guided explicitly or implicitly by a language bias (the class of programs that can be induced) and a search bias (determining which generalized program is constructed ?rst). Induction strategiesare either generate-and-testor example-driven.In genera- and-test approaches, hypotheses about candidate programs are generated in- pendently from the given speci'cations. Program candidates are tested against the given speci'cation and one or more of the best evaluated candidates are - veloped further. In analytical approaches, candidate programs are constructed in an example-driven way. While generate-and-test approaches can - in prin- ple - construct any kind of program, analytical approaches have a more limited scope. On the other hand, e'ciency of induction is much higher in analytical approaches. Inductive programming is still mainly a topic of basic research, exploring how the intellectual ability of humans to infer generalized recursive procedures from incomplete evidence can be captured in the form of synthesis methods. Intended applications are mainly in the domain of programming assistance - either to relieve professional programmers from routine tasks or to enable n- programmers to some limited form of end-user programming. Furthermore, in future,inductiveprogrammingtechniquesmightbe appliedtofurtherareassuch as support inference of lemmata in theorem proving or learning grammar rules."]