top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Application of graph rewriting to natural language processing / / Guillaume Bonfante, Bruno Guillaume, Guy Perrier
Application of graph rewriting to natural language processing / / Guillaume Bonfante, Bruno Guillaume, Guy Perrier
Autore Bonfante Guillaume
Pubbl/distr/stampa Hoboken, New Jersey : , : Iste Ltd/John Wiley and Sons Inc., , 2018
Descrizione fisica 1 online resource (277 pages)
Disciplina 410.285
Soggetto topico Computational linguistics
Rewriting systems (Computer science)
Graph theory - Data processing
Soggetto genere / forma Electronic books.
ISBN 1-119-52233-1
1-119-42858-0
1-119-52234-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910271022103321
Bonfante Guillaume  
Hoboken, New Jersey : , : Iste Ltd/John Wiley and Sons Inc., , 2018
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Application of graph rewriting to natural language processing / / Guillaume Bonfante, Bruno Guillaume, Guy Perrier
Application of graph rewriting to natural language processing / / Guillaume Bonfante, Bruno Guillaume, Guy Perrier
Autore Bonfante Guillaume
Pubbl/distr/stampa Hoboken, New Jersey : , : Iste Ltd/John Wiley and Sons Inc., , 2018
Descrizione fisica 1 online resource (277 pages)
Disciplina 410.285
Soggetto topico Computational linguistics
Rewriting systems (Computer science)
Graph theory - Data processing
ISBN 1-119-52233-1
1-119-42858-0
1-119-52234-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910830378203321
Bonfante Guillaume  
Hoboken, New Jersey : , : Iste Ltd/John Wiley and Sons Inc., , 2018
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Applications of graph transformations with industrial relevance : third international symposium, AGTIVE 2007, Kassel, Germany, October 10-12, 2007, revised selected and invited papers / / edited by Andy Schürr, Manfred Nagl, Albert Zündorf
Applications of graph transformations with industrial relevance : third international symposium, AGTIVE 2007, Kassel, Germany, October 10-12, 2007, revised selected and invited papers / / edited by Andy Schürr, Manfred Nagl, Albert Zündorf
Edizione [1st ed. 2008.]
Pubbl/distr/stampa Berlin, Germany ; ; New York, New York : , : Springer, , [2008]
Descrizione fisica 1 online resource (XIII, 594 p.)
Disciplina 004
Collana Programming and Software Engineering
Soggetto topico Rewriting systems (Computer science)
Computer science
ISBN 3-540-89020-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Graph Transformation Applications -- Combining Quality Assurance and Model Transformations in Business-Driven Development -- Assuring Consistency of Business Process Models and Web Services Using Visual Contracts -- Transforming Scene Graphs Using Triple Graph Grammars – A Practice Report -- Using Graph Transformation to Support Collaborative Ontology Evolution -- Modelling of Longitudinal Information Systems with Graph Grammars -- Meta-modeling and Domain-Specific Language -- A Generic Layout Algorithm for Meta-model Based Editors -- Domain Specific Languages with Graphical and Textual Views -- Generating Domain-Specific Model Editors with Complex Editing Commands -- Specifying Domain-Specific Refactorings for AndroMDA Based on Graph Transformation -- New Graph Transformation Approaches -- Defining Abstract Graph Views as Module Interfaces -- Programmed Graph Rewriting with DEVS -- Relational Growth Grammars – A Parallel Graph Transformation Approach with Applications in Biology and Architecture -- Applications and Rewriting of Omnigraphs – Exemplified in the Domain of MDD -- Program Transformation Applications -- A Single-Step Term-Graph Reduction System for Proof Assistants -- Shaped Generic Graph Transformation -- Code Graph Transformations for Verifiable Generation of SIMD-Parallel Assembly Code -- Graph Rewriting for Hardware Dependent Program Optimizations -- Dynamic System Modeling -- Transforming Timeline Specifications into Automata for Runtime Monitoring -- Visualization, Simulation and Analysis of Reconfigurable Systems -- Communities of Autonomous Units for Pickup and Delivery Vehicle Routing -- Efficient Graph Matching with Application to Cognitive Automation -- Model Driven Software Development Applications -- Checking and Enforcement of Modeling Guidelines with Graph Transformations -- Aspect Diagrams for UML Activity Models -- Model-Driven Software Development with Graph Transformations: A Comparative Case Study -- Verification and Synthesis of OCL Constraints Via Topology Analysis -- Queries, Views, and Model Transformations -- State of the Art of QVT: A Model Transformation Language Standard -- Adaptable Support for Queries and Transformations for the DRAGOS Graph-Database -- New Pattern Matching and Rewriting Concepts -- Applying a Grouping Operator in Model Transformations -- Modeling Successively Connected Repetitive Subgraphs -- Simulating Set-Valued Transformations with Algorithmic Graph Transformation Languages -- Recursive Graph Pattern Matching -- A First Experimental Evaluation of Search Plan Driven Graph Pattern Matching -- Graph Transformation Tool Contest -- AGTIVE 2007 Graph Transformation Tool Contest -- Ludo: A Case Study for Graph Transformation Tools -- Generation of Sierpinski Triangles: A Case Study for Graph Transformation Tools -- Transformation of UML Models to CSP: A Case Study for Graph Transformation Tools -- Graph Transformation Tools -- The EMF Model Transformation Framework -- GrGen.NET: A Fast, Expressive, and General Purpose Graph Rewrite Tool -- The Modelling Platform GroIMP and the Programming Language XL -- Metamodeling with MOFLON -- The Graph Rewriting Language and Environment PROGRES -- Algorithm and Tool for Ontology Integration Based on Graph Rewriting -- Generating Eclipse Editor Plug-Ins Using Tiger -- From Graph Transformation to OCL Using USE -- Introducing the VMTS Mobile Toolkit.
Record Nr. UNISA-996466342703316
Berlin, Germany ; ; New York, New York : , : Springer, , [2008]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Applications of graph transformations with industrial relevance : third international symposium, AGTIVE 2007, Kassel, Germany, October 10-12, 2007, revised selected and invited papers / / edited by Andy Schürr, Manfred Nagl, Albert Zündorf
Applications of graph transformations with industrial relevance : third international symposium, AGTIVE 2007, Kassel, Germany, October 10-12, 2007, revised selected and invited papers / / edited by Andy Schürr, Manfred Nagl, Albert Zündorf
Edizione [1st ed. 2008.]
Pubbl/distr/stampa Berlin, Germany ; ; New York, New York : , : Springer, , [2008]
Descrizione fisica 1 online resource (XIII, 594 p.)
Disciplina 004
Collana Programming and Software Engineering
Soggetto topico Rewriting systems (Computer science)
Computer science
ISBN 3-540-89020-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Graph Transformation Applications -- Combining Quality Assurance and Model Transformations in Business-Driven Development -- Assuring Consistency of Business Process Models and Web Services Using Visual Contracts -- Transforming Scene Graphs Using Triple Graph Grammars – A Practice Report -- Using Graph Transformation to Support Collaborative Ontology Evolution -- Modelling of Longitudinal Information Systems with Graph Grammars -- Meta-modeling and Domain-Specific Language -- A Generic Layout Algorithm for Meta-model Based Editors -- Domain Specific Languages with Graphical and Textual Views -- Generating Domain-Specific Model Editors with Complex Editing Commands -- Specifying Domain-Specific Refactorings for AndroMDA Based on Graph Transformation -- New Graph Transformation Approaches -- Defining Abstract Graph Views as Module Interfaces -- Programmed Graph Rewriting with DEVS -- Relational Growth Grammars – A Parallel Graph Transformation Approach with Applications in Biology and Architecture -- Applications and Rewriting of Omnigraphs – Exemplified in the Domain of MDD -- Program Transformation Applications -- A Single-Step Term-Graph Reduction System for Proof Assistants -- Shaped Generic Graph Transformation -- Code Graph Transformations for Verifiable Generation of SIMD-Parallel Assembly Code -- Graph Rewriting for Hardware Dependent Program Optimizations -- Dynamic System Modeling -- Transforming Timeline Specifications into Automata for Runtime Monitoring -- Visualization, Simulation and Analysis of Reconfigurable Systems -- Communities of Autonomous Units for Pickup and Delivery Vehicle Routing -- Efficient Graph Matching with Application to Cognitive Automation -- Model Driven Software Development Applications -- Checking and Enforcement of Modeling Guidelines with Graph Transformations -- Aspect Diagrams for UML Activity Models -- Model-Driven Software Development with Graph Transformations: A Comparative Case Study -- Verification and Synthesis of OCL Constraints Via Topology Analysis -- Queries, Views, and Model Transformations -- State of the Art of QVT: A Model Transformation Language Standard -- Adaptable Support for Queries and Transformations for the DRAGOS Graph-Database -- New Pattern Matching and Rewriting Concepts -- Applying a Grouping Operator in Model Transformations -- Modeling Successively Connected Repetitive Subgraphs -- Simulating Set-Valued Transformations with Algorithmic Graph Transformation Languages -- Recursive Graph Pattern Matching -- A First Experimental Evaluation of Search Plan Driven Graph Pattern Matching -- Graph Transformation Tool Contest -- AGTIVE 2007 Graph Transformation Tool Contest -- Ludo: A Case Study for Graph Transformation Tools -- Generation of Sierpinski Triangles: A Case Study for Graph Transformation Tools -- Transformation of UML Models to CSP: A Case Study for Graph Transformation Tools -- Graph Transformation Tools -- The EMF Model Transformation Framework -- GrGen.NET: A Fast, Expressive, and General Purpose Graph Rewrite Tool -- The Modelling Platform GroIMP and the Programming Language XL -- Metamodeling with MOFLON -- The Graph Rewriting Language and Environment PROGRES -- Algorithm and Tool for Ontology Integration Based on Graph Rewriting -- Generating Eclipse Editor Plug-Ins Using Tiger -- From Graph Transformation to OCL Using USE -- Introducing the VMTS Mobile Toolkit.
Record Nr. UNINA-9910767522203321
Berlin, Germany ; ; New York, New York : , : Springer, , [2008]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Rewriting techniques and applications : 14th international conference, RTA 2003, Valencia, Spain, June 2003 : proceedings / / edited by Robert Nieuwenhuis
Rewriting techniques and applications : 14th international conference, RTA 2003, Valencia, Spain, June 2003 : proceedings / / edited by Robert Nieuwenhuis
Edizione [1st ed. 2003.]
Pubbl/distr/stampa Berlin, Germany ; ; New York, New York : , : Springer, , [2003]
Descrizione fisica 1 online resource (526 p.)
Disciplina 005.131
Collana Lecture Notes in Computer Science
Soggetto topico Rewriting systems (Computer science)
Computer programming
Algorithms
ISBN 1-280-80485-8
9786610804856
3-540-44881-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Talk -- Symbolic Systems Biology -- Confluence as a Cut Elimination Property -- Associative-Commutative Rewriting on Large Terms -- A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms -- Efficient Reductions with Director Strings -- Rewriting Logic and Probabilities -- The Maude 2.0 System -- Diagrams for Meaning Preservation -- Expression Reduction Systems with Patterns -- Residuals in Higher-Order Rewriting -- Rewriting UNITY -- New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols -- An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation -- Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties -- Rule-Based Analysis of Dimensional Safety -- Invited Talk -- Topological Collections, Transformations and Their Application to the Modeling and the Simulation of Dynamical Systems -- On the Complexity of Higher-Order Matching in the Linear ?-Calculus -- XML Schema, Tree Logic and Sheaves Automata -- Size-Change Termination for Term Rewriting -- Monotonic AC-Compatible Semantic Path Orderings -- Relating Derivation Lengths with the Slow-Growing Hierarchy Directly -- Tsukuba Termination Tool -- Liveness in Rewriting -- Validation of the JavaCard Platform with Implicit Induction Techniques -- “Term Partition” for Mathematical Induction -- Equational Prover of Theorema -- Termination of Simply Typed Term Rewriting by Translation and Labelling -- Rewriting Modulo in Deduction Modulo -- Termination of String Rewriting Rules That Have One Pair of Overlaps -- Environments for Term Rewriting Engines for Free! -- Joint RTA-TLCA Invited Talk -- A Logical Algorithm for ML Type Inference -- A Rewriting Alternative to Reidemeister-Schreier -- Stable Computational Semantics of Conflict-Free Rewrite Systems (Partial Orders with Duplication) -- Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism -- Testing Extended Regular Language Membership Incrementally by Rewriting.
Altri titoli varianti RTA 2003
Record Nr. UNISA-996466026003316
Berlin, Germany ; ; New York, New York : , : Springer, , [2003]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Rewriting techniques and applications : 14th international conference, RTA 2003, Valencia, Spain, June 2003 : proceedings / / edited by Robert Nieuwenhuis
Rewriting techniques and applications : 14th international conference, RTA 2003, Valencia, Spain, June 2003 : proceedings / / edited by Robert Nieuwenhuis
Edizione [1st ed. 2003.]
Pubbl/distr/stampa Berlin, Germany ; ; New York, New York : , : Springer, , [2003]
Descrizione fisica 1 online resource (526 p.)
Disciplina 005.131
Collana Lecture Notes in Computer Science
Soggetto topico Rewriting systems (Computer science)
Computer programming
Algorithms
ISBN 1-280-80485-8
9786610804856
3-540-44881-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Talk -- Symbolic Systems Biology -- Confluence as a Cut Elimination Property -- Associative-Commutative Rewriting on Large Terms -- A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms -- Efficient Reductions with Director Strings -- Rewriting Logic and Probabilities -- The Maude 2.0 System -- Diagrams for Meaning Preservation -- Expression Reduction Systems with Patterns -- Residuals in Higher-Order Rewriting -- Rewriting UNITY -- New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols -- An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation -- Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties -- Rule-Based Analysis of Dimensional Safety -- Invited Talk -- Topological Collections, Transformations and Their Application to the Modeling and the Simulation of Dynamical Systems -- On the Complexity of Higher-Order Matching in the Linear ?-Calculus -- XML Schema, Tree Logic and Sheaves Automata -- Size-Change Termination for Term Rewriting -- Monotonic AC-Compatible Semantic Path Orderings -- Relating Derivation Lengths with the Slow-Growing Hierarchy Directly -- Tsukuba Termination Tool -- Liveness in Rewriting -- Validation of the JavaCard Platform with Implicit Induction Techniques -- “Term Partition” for Mathematical Induction -- Equational Prover of Theorema -- Termination of Simply Typed Term Rewriting by Translation and Labelling -- Rewriting Modulo in Deduction Modulo -- Termination of String Rewriting Rules That Have One Pair of Overlaps -- Environments for Term Rewriting Engines for Free! -- Joint RTA-TLCA Invited Talk -- A Logical Algorithm for ML Type Inference -- A Rewriting Alternative to Reidemeister-Schreier -- Stable Computational Semantics of Conflict-Free Rewrite Systems (Partial Orders with Duplication) -- Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism -- Testing Extended Regular Language Membership Incrementally by Rewriting.
Altri titoli varianti RTA 2003
Record Nr. UNINA-9910768471803321
Berlin, Germany ; ; New York, New York : , : Springer, , [2003]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Rewriting techniques and applications : 5th international conference, RTA-93, Montreal, Canada, June 16-18, 1993 : proceedings / / Claude Kirchner, editor
Rewriting techniques and applications : 5th international conference, RTA-93, Montreal, Canada, June 16-18, 1993 : proceedings / / Claude Kirchner, editor
Edizione [1st ed. 1993.]
Pubbl/distr/stampa Berlin, Germany ; ; New York, New York : , : Springer-Verlag, , [1993]
Descrizione fisica 1 online resource (XI, 492 p.)
Disciplina 005.13/1
Collana Lecture Notes in Computer Science
Soggetto topico Rewriting systems (Computer science)
Computer programming
Algorithms
Soggetto genere / forma Electronic books.
ISBN 3-662-21551-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Rewrite techniques in theorem proving -- Redundancy criteria for constrained completion -- Bi-rewriting, a term rewriting technique for monotonic order relations -- A case study of completion modulo distributivity and Abelian groups -- A semantic approach to order-sorted rewriting -- Distributing equational theorem proving -- On the correctness of a distributed memory Gröbner basis algorithm -- Improving transformation systems for general E-unification -- Equational and membership constraints for infinite trees -- Regular path expressions in feature logic -- Proving properties of typed lambda terms: Realizability, covers, and sheaves -- Some lambda calculi with categorical sums and products -- Paths, computations and labels in the ?-calculus -- Confluence and superdevelopments -- Relating graph and term rewriting via Böhm models -- Topics in termination -- Total termination of term rewriting -- Simple termination is difficult -- Optimal normalization in orthogonal term rewriting systems -- A graph reduction approach to incremental term rewriting -- Generating tables for bottom-up matching -- On some algorithmic problems for groups and monoids -- Combination techniques and decision problems for disunification -- The negation elimination from syntactic equational formula is decidable -- Encompassment properties and automata with constraints -- Recursively defined tree transductions -- AC complement problems: Satisfiability and negation elimination -- A precedence-based total AC-compatible ordering -- Extension of the associative path ordering to a chain of associative commutative symbols -- Polynomial time termination and constraint satisfaction tests -- Linear interpretations by counting patterns -- Some undecidable termination problems for semi-Thue systems -- Saturation of first-order (constrained) clauses with the Saturate system -- MERILL: An equational reasoning system in standard ML -- Reduce the redex ? ReDuX -- Agg — An implementation of algebraic graph rewriting -- Smaran: A congruence-closure based system for equational computations -- LAMBDALG: Higher order algebraic specification language -- More problems in rewriting.
Record Nr. UNISA-996466085803316
Berlin, Germany ; ; New York, New York : , : Springer-Verlag, , [1993]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui