Let S Be Fair

This book constitutes the refereed proceedings of the 25th International Conference on Applications and Theory of Petri Nets, ICATPN 2004, held in Bologna, Italy in June 2004. The 19 revised full regular papers and 5 revised tool presentation papers presented together with 6 invited papers were carefully reviewed and selected from 62 submissions. All current issues on research and development in the area of Petri nets are addressed, in particular concurrent systems design and analysis, modular systems development, formal specification, model validation, model checking, workflow management, flow charts, networking, formal methods in software engineering, etc.

The multi-volume set LNAI 14169 until 14175 constitutes the refereed proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases, ECML PKDD 2023, which took place in Turin, Italy, in September 2023. The 196 papers were selected from the 829 submissions for the Research Track, and 58 papers were selected from the 239 submissions for the Applied Data Science Track. The volumes are organized in topical sections as follows: Part I: Active Learning; Adversarial Machine Learning; Anomaly Detection; Applications; Bayesian Methods; Causality; Clustering. Part II: ​Computer Vision; Deep Learning; Fairness; Federated Learning; Few-shot learning; Generative Models; Graph Contrastive Learning. Part III: ​Graph Neural Networks; Graphs; Interpretability; Knowledge Graphs; Large-scale Learning. Part IV: ​Natural Language Processing; Neuro/Symbolic Learning; Optimization; Recommender Systems; Reinforcement Learning; Representation Learning. Part V: ​Robustness; Time Series; Transfer and Multitask Learning. Part VI: ​Applied Machine Learning; Computational Social Sciences; Finance; Hardware and Systems; Healthcare & Bioinformatics; Human-Computer Interaction; Recommendation and Information Retrieval. ​Part VII: Sustainability, Climate, and Environment.- Transportation & Urban Planning.- Demo.

This PSTV'94 Symposium is the fourteenth of a series of annual meetings organized under the auspices of IFIP W.G. 6.1, a Working Group dedicated to "Architectures and Protocols for Computer Networks". This is the oldest and most established symposium in the emerging field of protocol engineering which has spawn many international conferences including FORTE (International Conference on Formal Description Tech niques), IWPTS (International Workshop on Protocol Test Systems), ICNP (Interna tional Conference on Network Protocols) and CAY (Conference on Computer-Aided Verification). The main objective of this PSTV symposium is to provide a forum for researchers and practitioners in industry and academia interested in advances in using formal methods and methodologies to specify, develop, test and verify communication protocols and distributed systems. This year's PSTV symposium enjoys a nice mixture of formal methods and practical issues in network protocols through the invited addresses of three outstanding speakers, Ed Brinksma (University of Twente), Raj Jain (Ohio State University) and David Tennenhouse (MIT) as well as 5 tutorials, in addition to 9 techni cal sessions and two practical panel sessions. The 5 tutorials are offered on the first day in two parallel tracks for intensive exposure on hot topics of current interest. This year, out of 51 submissions the Program Committee selected 18 regular papers (with an allotment of 16 pages in the Proceedings) and 9 mini-papers (of 8 pages).

This book provides a structured introduction to the verification of sequen tial and concurrent programs. It thus belongs to the area of programming languages but at the same time it is firmly based on mathematical logic. In logic one usually studies fixed syntactic or semantic objects. This is not necessarily the case in the area of program verification. The objects studied here, namely programs, do not have a standard syntax, their semantics can be defined in many different ways, and several approaches to their verification can be contemplated. These differences lead to various difficult design decisions. Even though we restrict our attention here to one programming style - imperative pro gramming - we are still confronted with a veritable cornucopia of pro gramming constructs from which an appropriate selection has to be made. Having studied some of these constructs separately does not yet imply that we understand their combined effect.

This volume contains the papers selected for presentation at the conference and two abstracts from invited speakers. The programme committee selected these 25 papers from 12 countries out of 65 submissions from 17 countries. The rst JELIA meeting was in Rosco , France, ten years ago. Afterwards, it took place in the Netherlands, Germany, United Kingdom, Portugal, and now again in Germany. The proceedings of the last four meetings appeared in the Springer-Verlag LNCS series, and a selected series of papers of the English and the Portuguese meeting appeared as special issues in the Journal of Applied Non-Classical Logics and in the Journal of Automated Reasoning, respectively. The aim of JELIA was and still is to provide a forum for the exchange of ideas and results in the domain of foundations of AI, focusing on rigorous descriptions of some aspects of intelligence. These descriptions are promoted by applications, and produced by logical tools and methods. The papers contained in this volume cover the following topics: 1. Logic programming 2. Epistemic logics 3. Theorem proving 4. Non-monotonic reasoning 5. Non-standard logics 6. Knowledge representation 7. Higher order logics We would like to warmly thank the authors, the invited speakers, the m- bers of the program committee, and the additional reviewers listed below. They all have made these proceedings possible and ensured their quality.

This volume contains the proceedings of the 14th International Colloquium on Automata Languages and Programming, organized by the European Association for Theoretical Computer Science (EATCS) and held in Karlsruhe, July 13-17, 1987. The papers report on original research in theoretical computer science and cover topics such as algorithms and data structures, automata and formal languages, computability and complexity theory, semantics of programming languages, program specification, transformation and verification, theory of data bases, logic programming, theory of logical design and layout, parallel and distributed computation, theory of concurrency, symbolic and algebraic computation, term rewriting systems, cryptography, and theory of robotics. The authors are young scientists and leading experts in these areas.