F
Francesca Rossi
Researcher at IBM
Publications - 214
Citations - 9423
Francesca Rossi is an academic researcher from IBM. The author has contributed to research in topics: Constraint satisfaction & Constraint (information theory). The author has an hindex of 40, co-authored 214 publications receiving 8577 citations. Previous affiliations of Francesca Rossi include Tulane University & University of Pisa.
Papers
More filters
Book
Handbook of Constraint Programming
TL;DR: Researchers from other fields should find in this handbook an effective way to learn about constraint programming and to possibly use some of the constraint programming concepts and techniques in their work, thus providing a means for a fruitful cross-fertilization among different research areas.
Journal ArticleDOI
AI4People—An Ethical Framework for a Good AI Society: Opportunities, Risks, Principles, and Recommendations
Luciano Floridi,Luciano Floridi,Josh Cowls,Josh Cowls,Monica Beltrametti,Raja Chatila,Patrice Chazerand,Virginia Dignum,Virginia Dignum,Christoph Luetge,Robert Madelin,Ugo Pagallo,Francesca Rossi,Francesca Rossi,Burkhard Schafer,Peggy Valcke,Peggy Valcke,Effy Vayena +17 more
TL;DR: The core opportunities and risks of AI for society are introduced; a synthesis of five ethical principles that should undergird its development and adoption are presented; and 20 concrete recommendations are offered to serve as a firm foundation for the establishment of a Good AI Society.
Journal ArticleDOI
Semiring-based constraint satisfaction and optimization
TL;DR: It is shown how this framework can be used to model both old and new constraint solving and optimization schemes, thus allowing one to both formally justify many informally taken choices in existing schemes, and to prove that local consistency techniques can beused also in newly defined schemes.
Book
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
TL;DR: The algebraic approaches to graph transformation are based on the concept of gluing of graphs, modelled by pushouts in suitable categories of graphs and graph morphisms, which allows one not only to give an explicit algebraic or set theoretical description of the constructions, but also to use concepts and results from category theory in order to build up a rich theory and to give elegant proofs even in complex situations as discussed by the authors.
Journal ArticleDOI
Semiring-Based CSPs and Valued CSPs: Frameworks, Properties,and Comparison
Stefano Bistarelli,Ugo Montanari,Francesca Rossi,Thomas Schiex,Gérard Verfaillie,Hélène Fargier +5 more
TL;DR: This paper describes and compares two frameworks for constraint solving where classical CSPs, fuzzy C SPs, weighted CSP’s, partial constraint satisfaction, and others can be easily cast.