Muutke küpsiste eelistusi

Rewriting Logic and Its Applications: 13th International Workshop, WRLA 2020, Virtual Event, October 20-22, 2020, Revised Selected Papers 1st ed. 2020 [Pehme köide]

  • Formaat: Paperback / softback, 217 pages, kõrgus x laius: 235x155 mm, kaal: 454 g, 11 Illustrations, color; 28 Illustrations, black and white; VII, 217 p. 39 illus., 11 illus. in color., 1 Paperback / softback
  • Sari: Theoretical Computer Science and General Issues 12328
  • Ilmumisaeg: 11-Dec-2020
  • Kirjastus: Springer Nature Switzerland AG
  • ISBN-10: 3030635945
  • ISBN-13: 9783030635947
  • Pehme köide
  • Hind: 48,70 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 57,29 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Paperback / softback, 217 pages, kõrgus x laius: 235x155 mm, kaal: 454 g, 11 Illustrations, color; 28 Illustrations, black and white; VII, 217 p. 39 illus., 11 illus. in color., 1 Paperback / softback
  • Sari: Theoretical Computer Science and General Issues 12328
  • Ilmumisaeg: 11-Dec-2020
  • Kirjastus: Springer Nature Switzerland AG
  • ISBN-10: 3030635945
  • ISBN-13: 9783030635947
This book constitutes selected papers from the 12th International Workshop on Rewriting Logic and Its Applications, WRLA 2020, held in Dublin, Ireland, in April 2020.Due to the COVID-19 pandemic the workshop took place virtually.





The 11 full papers presented in this volume were carefully reviewed and selected from 16 submissions Rewriting logic is a natural model of computation and an expressive semantic framework for concurrency, parallelism, communication, and interaction. It can be used for specifying a wide range of systems and languages in various application fields.
Models of rewriting and rewriting logic.- Termination, confluence,
coherence, and complexity.- Unification, generalization, and narrowing.-
Graph rewriting.- Tree automata.- Rewriting strategies.- Rewriting-based
declarative languages.- Explicit-state and symbolic model checking
techniques.- Rewriting-based theorem proving, including (co)inductive theorem
proving.- Rewriting-based constraint solving and satisfiability.