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.
2010 IEEE Annual Conference on Computational Complexity
2010 IEEE Annual Conference on Computational Complexity
Pubbl/distr/stampa [Place of publication not identified], : IEEE, 2010
Descrizione fisica 1 online resource : illustrations
Disciplina 511.3
Soggetto topico Computational complexity
Logic programming
ISBN 9781424472154
1424472156
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910140660603321
[Place of publication not identified], : IEEE, 2010
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
21st Annual IEEE Conference on Computational Complexity (CCC 2006): 16-20 July 2006/Prague, Czech Republic
21st Annual IEEE Conference on Computational Complexity (CCC 2006): 16-20 July 2006/Prague, Czech Republic
Pubbl/distr/stampa [Place of publication not identified], : IEEE Computer Society Press, 2006
Descrizione fisica 1 online resource
Disciplina 511.3
Soggetto topico Computational complexity
Logic programming
ISBN 9781509098248
1509098240
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Proceedings. Twenty-First Annual IEEE Conference on Computational Complexity -- 21st Annual IEEE Conference on Computational Complexity - Title -- 21st Annual IEEE Conference on Computational Complexity - Copyright -- 21st Annual IEEE Conference on Computational Complexity - TOC -- Preface -- Committees -- Reviewers -- Awards -- Godel and Computations -- Polynomial identity testing for depth 3 circuits -- Every Linear Threshold Function has a Low-Weight Approximator -- Constructions of low-degree and error-correcting /spl epsi/-biased generators -- How to Get More Mileage from Randomness Extractors -- Exposure-resilient extractors -- Making hard problems harder.
Record Nr. UNINA-9910145611703321
[Place of publication not identified], : IEEE Computer Society Press, 2006
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
A 25-year perspective on logic programming : achievements of the Italian Association for Logic Programming, GULP / / Agostino Dovier, Enrico Pontelli (eds.)
A 25-year perspective on logic programming : achievements of the Italian Association for Logic Programming, GULP / / Agostino Dovier, Enrico Pontelli (eds.)
Edizione [1st ed.]
Pubbl/distr/stampa New York, : Springer, 2010
Descrizione fisica 1 online resource (XIV, 329 p. 21 illus.)
Disciplina 005.1
Altri autori (Persone) DovierAgostino
PontelliEnrico <1967->
Collana Lecture notes in computer science
LNCS sublibrary. SL 2, Programming and software engineering
Soggetto topico Logic programming
ISBN 1-280-38788-2
9786613565808
3-642-14309-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Twenty-Five Years of Logic Programming in Italy -- Logic Programming in Italy: A Historical Perspective -- Theoretical Foundations and Semantics of Logic Programming -- Theory-Specific Automated Reasoning -- Constraint Logic Programming -- Knowledge Representation and Non-monotonic Reasoning -- The Transformational Approach to Program Development -- Static Analysis, Abstract Interpretation and Verification in (Constraint Logic) Programming -- Answer Set Programming -- Logic Programming Languages for Databases and the Web -- Agents, Multi-Agent Systems and Declarative Programming: What, When, Where, Why, Who, How? -- Concurrent and Reactive Constraint Programming -- Proof-Theoretic and Higher-Order Extensions of Logic Programming -- Transformation and Debugging of Functional Logic Programs -- 25 Years of Applications of Logic Programming in Italy.
Record Nr. UNINA-9910483881603321
New York, : Springer, 2010
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algebraic and logic programming : international workshop, Gaussing, GDR, November 14-18, 1988 : proceedings / / J. Grabowski, P. Lescanne, W. Wechler (editors)
Algebraic and logic programming : international workshop, Gaussing, GDR, November 14-18, 1988 : proceedings / / J. Grabowski, P. Lescanne, W. Wechler (editors)
Edizione [1st ed. 1988.]
Pubbl/distr/stampa Berlin : , : Springer-Verlag, , [1988]
Descrizione fisica 1 online resource (IX, 269 p.)
Disciplina 005.115
Collana Lecture notes in computer science
Soggetto topico Logic programming
ISBN 3-540-46063-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto ACP with signals -- Functional extensions to prolog: Are they needed? -- Narrowing and resolution in logic-functional programming languages -- Nondeterministic algebraic specifications and nonconfluent term rewriting -- OBJ: Programming with equalities, subsorts, overloading and parameterization -- Logic programming with polymorphically order-sorted types -- Integrating logic programming and equational specification of abstract data types -- Narrowing with built-in theories -- A completion procedure for hierarchical conditional rewriting systems -- An effective method for handling initial algebras -- Boolean valued models and incomplete specifications -- Types, modularisation and abstraction in logic programming -- Translating algebraic specifications to Prolog programs: A comparative study -- Rewrite rule systems for modal propositional logic -- A characterization of irreducible sets modulo left-linear term rewriting systems by tree automata -- Functional data term models and semantic unification -- Modular algebraic specifications -- Proving inductive theorems based on term rewriting systems -- Jungle evaluation for efficient term rewriting -- A new quasi-reducibility testing algorithm and its application to proofs by induction -- Fuzzy reasoning based on f-horn clause rules -- Babel: A functional and logic programming language based on constructor discipline and narrowing -- Refined compilation of pattern-matching for functional languages -- Narrowing in partial conditional equational theories -- Solving equations in an equational language -- Nonstandard logics of recursive programs and denotational semantics. .
Record Nr. UNISA-996465313103316
Berlin : , : Springer-Verlag, , [1988]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithmic Discrimination and Ethical Perspective of Artificial Intelligence / / edited by Muharrem Kılıç, Sezer Bozkuş Kahyaoğlu
Algorithmic Discrimination and Ethical Perspective of Artificial Intelligence / / edited by Muharrem Kılıç, Sezer Bozkuş Kahyaoğlu
Edizione [1st ed. 2024.]
Pubbl/distr/stampa Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2024
Descrizione fisica 1 online resource (231 pages)
Disciplina 006.3
Collana Accounting, Finance, Sustainability, Governance & Fraud: Theory and Application
Soggetto topico Business - Data processing
Human rights
Logic programming
Machine learning
Business Analytics
Human Rights
Logic in AI
Machine Learning
Negocis
Processament de dades
Drets humans
Programació lògica
Aprenentatge automàtic
Soggetto genere / forma Llibres electrònics
ISBN 981-9963-27-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Introduction -- Socio-Political Analysis Of AI-Based Discrimination In The Meta-Surveillance Universe -- Rethinking Non-Discrimination Law In The Age Of Artificial Intelligence -- Data Protection Legislation, Artificial Intelligence and Discrimination -- Can The Right To Explanation Right In GDPR Be A Remedy For Algoritmic Discrimination? -- Sufficency Of Struglling With The Current Criminal Law Rules on the Use Of Artificial Intelligence in CrimePrevention of Discrimination in the Practices of Predictive Policing -- Issues That May Arise From Usage Of Artificial Intelligence Technologies In Criminal Justice and Law Enforcement -- Artificial Intelligence And Prohibition of Discrimination From The Perspective of Private Law -- Legal Challenges of Artificial Intelligence In Healthcare -- The Impact Of Artificial Intelligence On Social Rights -- An Investigation On The Detection Of Discrimination and Hate Speech Shared On Social Media Platforms Using Artificial Intelligence Methods -- The New Era: Transforming Healthcare -- Quality With Artificial Intelligence -- Managing Artificial Intelligence Algorithmic Discrimination: The Internal Audit Function Role.
Record Nr. UNINA-9910760296803321
Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2024
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Analytical learning and term-rewriting systems / / Philip Laird and Evan Gamble
Analytical learning and term-rewriting systems / / Philip Laird and Evan Gamble
Autore Laird Philip
Pubbl/distr/stampa Moffett Field, CA : , : NASA Ames Research Center, , June 1990
Descrizione fisica 1 online resource (46 pages)
Collana NASA/TM
Soggetto topico Machine learning
Calculus
Algorithms
Logic programming
Mathematical models
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910713791003321
Laird Philip  
Moffett Field, CA : , : NASA Ames Research Center, , June 1990
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Arithmetic and logic in computer systems [[electronic resource] /] / Mi Lu
Arithmetic and logic in computer systems [[electronic resource] /] / Mi Lu
Autore Lu Mi
Edizione [1st edition]
Pubbl/distr/stampa Hoboken, NJ, : Wiley-Interscience, c2004
Descrizione fisica 1 online resource (270 p.)
Disciplina 004/.01/51
Collana Wiley Series in Microwave and Optical Engineering
Soggetto topico Computer arithmetic
Logic programming
ISBN 1-280-25336-3
9786610253364
0-470-35774-6
0-471-72621-4
0-471-72851-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Arithmetic and Logic in Computer Systems; Contents; Preface; List of Figures; List of Figures; List of Tables; List of Tables; About the Author; 1 Computer Number Systems; 1.1 Conventional Radix Number System; 1.2 Conversion of Radix Numbers; 1.3 Representation of Signed Numbers; 1.3.1 Sign-Magnitude; 1.3.2 Diminished Radix Complement; 1.3.3 Radix Complement; 1.4 Signed-Digit Number System; 1.1 Numbers Represented by 4 bits in Different Number Systems; 1.2 Finding Signed Digits; 1.5 Floating-point Number Representation; 1.5.1 Normalization; 1.5.2 Bias; 1.1 Floating-point Representation
1.2 Range of the Numbers1.3 Precision of Floating-Point Numbers; 1.4 Double Precision Floating-Point Representation; 1.3 Reserved Representation in IEEE Standard; 1.6 Residue Number System; 1.7 Logarithmic Number System; References; Problems; 2 Addition and Subtraction; 2.1 Single-Bit Adders; 2.1.1 Logical Devices; 2.1 AOI Function; 2.1 Delay Time and Area of Logic Gates; 2.2 Decoder and Multiplexer; 2.1.2 Single-Bit Half-Adder and Full-Adders; 2.3 Single-Bit Half-Adder; 2.2 Logic Function of a Half-Adder; 2.3 Logic Function of a Full-Adder; 2.4 Design of Full-Adder; 2.2 Negation
2.4 Single-Bit Subtractor2.2.1 Negation in One's Complement System; 2.5 Single-Bit Subtrator; 2.5 Negation in One's Complement System; 2.6 Negation in One's Complement System; 2.2.2 Negation in Two's Complement System; 2.7 Negation in Two's Complement System; 2.3 Subtraction through Addition; 2.8 Subtraction through Addition; 2.9 One-Bit Adder/Subtractor; 2.4 Over flow; 2.5 Ripple Carry Adders; 2.5.1 Two's Complement Addition; 2.10 Two's Complement Addition/Subtraction; 2.5.2 One's Complement Addition; 2.11 One's Complement Addition/Subtraction; 2.5.3 Sign-Magnitude Addition
2.12 Block Diagram of Sign-Magnitude Addition/SubtractionReferences; 2.13 Sign-Magnitude Addition/Subtraction; Problems; 3 High-Speed Adder; 3.1 Conditional-Sum Addition; 3.1 Conditional-Sum Addition; 3.2 Carry-Completion Sensing Addition; 3.2 Conditional-Sum Adder; 3.3 Generation and Transmission of Carries; 3.4 Construction of Carry-Completion Sensing Adder; 3.3 Carry-Lookahead Addition (CLA); 3.3.1 Carry-Lookahead Adder; 3.3.2 Block Carry Lookahead Adder; 3.5 Carry-Lookahead Adder; 3.6 Block Carry-Lookahead Adder; 3.4 Carry-Save Adders (CSA); 3.7 Carry-Save Adder; 3.8 Carry-Save Adder Tree
3.9 Two Types of Parallelization in Multi-Operand Addition3.5 Bit-Partitioned Multiple Addition; 3.1 Maximum Inputs of CSA Trees; 3.10 Bit-Partitioned Multiple Addition; References; Problems; 3.11 Carry-Completion Sensing Adder; 3.12 Carry-Save Adder; 3.13 Bit-Partitional Adder; 4 Sequential Multiplication; 4.1 Add-and-shift Approach; 4.1 Hardware for Sequential Multiplication; 4.2 Register Occupation; 4.2 Indirect Multiplication Schemes; 4.2. 1 Unsigned Number Multiplication; 4.2.2 Sign-Magnitude Number Multiplication; 4.2.3 One's Complement Number Multiplication
4.3 Unsigned Number Multiplication
Record Nr. UNINA-9910145764203321
Lu Mi  
Hoboken, NJ, : Wiley-Interscience, c2004
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Arithmetic and logic in computer systems / / Mi Lu
Arithmetic and logic in computer systems / / Mi Lu
Autore Lu Mi
Edizione [1st edition]
Pubbl/distr/stampa Hoboken, NJ, : Wiley-Interscience, c2004
Descrizione fisica 1 online resource (270 p.)
Disciplina 004/.01/51
Collana Wiley Series in Microwave and Optical Engineering
Soggetto topico Computer arithmetic
Logic programming
ISBN 9786610253364
9781280253362
1280253363
9780470357743
0470357746
9780471726210
0471726214
9780471728511
0471728519
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Arithmetic and Logic in Computer Systems; Contents; Preface; List of Figures; List of Figures; List of Tables; List of Tables; About the Author; 1 Computer Number Systems; 1.1 Conventional Radix Number System; 1.2 Conversion of Radix Numbers; 1.3 Representation of Signed Numbers; 1.3.1 Sign-Magnitude; 1.3.2 Diminished Radix Complement; 1.3.3 Radix Complement; 1.4 Signed-Digit Number System; 1.1 Numbers Represented by 4 bits in Different Number Systems; 1.2 Finding Signed Digits; 1.5 Floating-point Number Representation; 1.5.1 Normalization; 1.5.2 Bias; 1.1 Floating-point Representation
1.2 Range of the Numbers1.3 Precision of Floating-Point Numbers; 1.4 Double Precision Floating-Point Representation; 1.3 Reserved Representation in IEEE Standard; 1.6 Residue Number System; 1.7 Logarithmic Number System; References; Problems; 2 Addition and Subtraction; 2.1 Single-Bit Adders; 2.1.1 Logical Devices; 2.1 AOI Function; 2.1 Delay Time and Area of Logic Gates; 2.2 Decoder and Multiplexer; 2.1.2 Single-Bit Half-Adder and Full-Adders; 2.3 Single-Bit Half-Adder; 2.2 Logic Function of a Half-Adder; 2.3 Logic Function of a Full-Adder; 2.4 Design of Full-Adder; 2.2 Negation
2.4 Single-Bit Subtractor2.2.1 Negation in One's Complement System; 2.5 Single-Bit Subtrator; 2.5 Negation in One's Complement System; 2.6 Negation in One's Complement System; 2.2.2 Negation in Two's Complement System; 2.7 Negation in Two's Complement System; 2.3 Subtraction through Addition; 2.8 Subtraction through Addition; 2.9 One-Bit Adder/Subtractor; 2.4 Over flow; 2.5 Ripple Carry Adders; 2.5.1 Two's Complement Addition; 2.10 Two's Complement Addition/Subtraction; 2.5.2 One's Complement Addition; 2.11 One's Complement Addition/Subtraction; 2.5.3 Sign-Magnitude Addition
2.12 Block Diagram of Sign-Magnitude Addition/SubtractionReferences; 2.13 Sign-Magnitude Addition/Subtraction; Problems; 3 High-Speed Adder; 3.1 Conditional-Sum Addition; 3.1 Conditional-Sum Addition; 3.2 Carry-Completion Sensing Addition; 3.2 Conditional-Sum Adder; 3.3 Generation and Transmission of Carries; 3.4 Construction of Carry-Completion Sensing Adder; 3.3 Carry-Lookahead Addition (CLA); 3.3.1 Carry-Lookahead Adder; 3.3.2 Block Carry Lookahead Adder; 3.5 Carry-Lookahead Adder; 3.6 Block Carry-Lookahead Adder; 3.4 Carry-Save Adders (CSA); 3.7 Carry-Save Adder; 3.8 Carry-Save Adder Tree
3.9 Two Types of Parallelization in Multi-Operand Addition3.5 Bit-Partitioned Multiple Addition; 3.1 Maximum Inputs of CSA Trees; 3.10 Bit-Partitioned Multiple Addition; References; Problems; 3.11 Carry-Completion Sensing Adder; 3.12 Carry-Save Adder; 3.13 Bit-Partitional Adder; 4 Sequential Multiplication; 4.1 Add-and-shift Approach; 4.1 Hardware for Sequential Multiplication; 4.2 Register Occupation; 4.2 Indirect Multiplication Schemes; 4.2. 1 Unsigned Number Multiplication; 4.2.2 Sign-Magnitude Number Multiplication; 4.2.3 One's Complement Number Multiplication
4.3 Unsigned Number Multiplication
Record Nr. UNINA-9910817402703321
Lu Mi  
Hoboken, NJ, : Wiley-Interscience, c2004
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy [[electronic resource] ] : Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday / / edited by Mário S. Alvim, Kostas Chatzikokolakis, Carlos Olarte, Frank Valencia
The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy [[electronic resource] ] : Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday / / edited by Mário S. Alvim, Kostas Chatzikokolakis, Carlos Olarte, Frank Valencia
Edizione [1st ed. 2019.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Descrizione fisica 1 online resource (XXXIV, 461 p. 1292 illus., 45 illus. in color.)
Disciplina 005.13
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science
Software engineering
Logic programming
Computer science - Mathematics
Mathematical statistics
Data protection
Theory of Computation
Software Engineering
Logic in AI
Probability and Statistics in Computer Science
Data and Information Security
ISBN 3-030-31175-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Concurrency -- Variations of the Itai-Rodeh Algorithm for Computing Anonymous Ring Size -- Axiomatizing Team Equivalence for Finite-State Machines -- Asynchronous pi-calculus at work: the call-by-need strategy -- Deadlock Analysis of Wait-Notify Coordination -- Enhancing reaction systems: a process algebraic approach -- Checking the Expressivity of Firewall Languages -- Polymorphic Session Processes as Morphisms -- Guess Who's Coming: Runtime Inclusion of Participants in Choreographies -- A Complete Axiomatizion of Branching Bisimulation for a Simple Process Language with Probabilistic Choice -- Walking Through the Semantics of Exclusive and Event-Based Gateways in BPMN Choreographies -- Stronger Validity Criteria for Encoding Synchrony -- Confluence of the Chinese Monoid -- Logic and Constraint Programming -- A coalgebraic approach to unification semantics of logic programming -- Polyadic Soft Constraints -- Security and Privacy -- Core-concavity, Gain Functions and Axioms for Information Leakage -- Formalisation of Probabilistic Testing Semantics in Coq -- Fully Syntactic Uniform Continuity Formats for Bisimulation Metrics -- Fooling the Parallel Or Tester with Probability 8/27 -- Categorical information flow -- Statistical Epistemic Logic -- Approximate model counting, sparse XOR constraints and minimum distance -- Verification and Control of Turn-Based Probabilistic Real-Time Games -- Refinement Metrics for Quantitative Information Flow -- Models and Puzzles -- Toward a Formal Model for Group Polarization in Social Networks -- Make Puzzles Great Again.
Record Nr. UNISA-996466338303316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy : Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday / / edited by Mário S. Alvim, Kostas Chatzikokolakis, Carlos Olarte, Frank Valencia
The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy : Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday / / edited by Mário S. Alvim, Kostas Chatzikokolakis, Carlos Olarte, Frank Valencia
Edizione [1st ed. 2019.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Descrizione fisica 1 online resource (XXXIV, 461 p. 1292 illus., 45 illus. in color.)
Disciplina 005.13
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science
Software engineering
Logic programming
Computer science - Mathematics
Mathematical statistics
Data protection
Theory of Computation
Software Engineering
Logic in AI
Probability and Statistics in Computer Science
Data and Information Security
ISBN 3-030-31175-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Concurrency -- Variations of the Itai-Rodeh Algorithm for Computing Anonymous Ring Size -- Axiomatizing Team Equivalence for Finite-State Machines -- Asynchronous pi-calculus at work: the call-by-need strategy -- Deadlock Analysis of Wait-Notify Coordination -- Enhancing reaction systems: a process algebraic approach -- Checking the Expressivity of Firewall Languages -- Polymorphic Session Processes as Morphisms -- Guess Who's Coming: Runtime Inclusion of Participants in Choreographies -- A Complete Axiomatizion of Branching Bisimulation for a Simple Process Language with Probabilistic Choice -- Walking Through the Semantics of Exclusive and Event-Based Gateways in BPMN Choreographies -- Stronger Validity Criteria for Encoding Synchrony -- Confluence of the Chinese Monoid -- Logic and Constraint Programming -- A coalgebraic approach to unification semantics of logic programming -- Polyadic Soft Constraints -- Security and Privacy -- Core-concavity, Gain Functions and Axioms for Information Leakage.-Formalisation of Probabilistic Testing Semantics in Coq -- Fully Syntactic Uniform Continuity Formats for Bisimulation Metrics -- Fooling the Parallel Or Tester with Probability 8/27 -- Categorical information flow -- Statistical Epistemic Logic -- Approximate model counting, sparse XOR constraints and minimum distance -- Verification and Control of Turn-Based Probabilistic Real-Time Games -- Refinement Metrics for Quantitative Information Flow -- Models and Puzzles -- Toward a Formal Model for Group Polarization in Social Networks -- Make Puzzles Great Again.
Record Nr. UNINA-9910357851903321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui