Logics of variable inclusion / / Stefano Bonzio, Francesco Paoli and Michele Pra Baldi |
Autore | Bonzio Stefano |
Pubbl/distr/stampa | Cham, Switzerland : , : Springer Nature Switzerland AG, , [2022] |
Descrizione fisica | 1 online resource (227 pages) |
Disciplina | 511.324 |
Collana | Trends in logic |
Soggetto topico |
Algebraic logic
Lògica algebraica |
Soggetto genere / forma | Llibres electrònics |
ISBN | 3-031-04297-2 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-9910741198403321 |
Bonzio Stefano | ||
Cham, Switzerland : , : Springer Nature Switzerland AG, , [2022] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Nearly projective boolean algebras / Lutz Heindorf, Leonid B. Shapiro ; with an appendix by Sakae Fuchino |
Autore | Heindorf, Lutz |
Pubbl/distr/stampa | Berlin : Springer-Verlag, c1994 |
Descrizione fisica | x, 202 p. ; 24 cm |
Disciplina | 511.324 |
Collana | Lecture Notes in Mathematics |
Soggetto non controllato |
Algebra booleana proiettiva
Topologia - Risultati di consistenza Iperspazi Compattificazioni |
ISBN | 3-540-58787-X |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-990001333630403321 |
Heindorf, Lutz | ||
Berlin : Springer-Verlag, c1994 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Nearly projective boolean algebras / Lutz Heindorf, Leonid B. Shapiro ; with an appendix by Sakaé Fuchino |
Autore | Heindorf, Lutz |
Pubbl/distr/stampa | Berlin [etc.] : Springer, c1994 |
Descrizione fisica | X, 202 p. ; 24 cm. |
Disciplina | 511.324 |
Altri autori (Persone) | Shapiro, Leonid B. |
Collana | Lecture notes in mathematics |
Soggetto topico | Algebra booleana |
ISBN | 3-540-58787-X |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNIBAS-000012300 |
Heindorf, Lutz | ||
Berlin [etc.] : Springer, c1994 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. della Basilicata | ||
|
Nearly projective Boolean algebras / Lutz Heindorf, Leonid B. Shapiro ; with an appendix by Sakaé Fuchino |
Autore | Heindorf, Lutz |
Pubbl/distr/stampa | Berlin : Springer-Verlag, c1994 |
Descrizione fisica | x, 202 p. : ill. ; 24 cm. |
Disciplina | 511.324 |
Altri autori (Persone) | Shapiro, Leonid B. |
Collana | Lecture notes in mathematics, 0075-8434 ; 1596 |
Soggetto topico | Boolean algebra |
ISBN | 354058787X |
Classificazione | AMS 06E05 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISALENTO-991001164569707536 |
Heindorf, Lutz | ||
Berlin : Springer-Verlag, c1994 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. del Salento | ||
|
Principes et applications de l'analyse Booléenne / par Michel Carvallo |
Autore | Carvallo, Michel |
Pubbl/distr/stampa | Paris : Gauthier-Villars, 1965 |
Descrizione fisica | xiii, 131 p. ; 24 cm. |
Disciplina | 511.324 |
Collana | Collection de mathématiques économiques ; 2 |
Soggetto topico | Boolean algebras |
Classificazione | AMS 06E |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | fre |
Record Nr. | UNISALENTO-991001240469707536 |
Carvallo, Michel | ||
Paris : Gauthier-Villars, 1965 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. del Salento | ||
|
Proceedings of the summer school in logic, leeds, 1967 : NATO advanced study institute : meeting of the association for symbolic logic / / edited By M. H. Loeb |
Edizione | [1st ed. 1968.] |
Pubbl/distr/stampa | Berlin : , : Springer-Verlag, , [1968] |
Descrizione fisica | 1 online resource (IV, 331 p.) |
Disciplina | 511.324 |
Collana | Lecture notes in mathematics |
Soggetto topico | Algebraic logic |
ISBN | 3-540-35886-2 |
Classificazione | 03-06 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Lectures on proof theory -- Partitions and models -- Klassen rekursiver funktionen -- Hyperarithmetic ultrafilters -- Recursive equivalence: A survey -- Half-ring morphologies -- Formalisations of some ?0 ?ukasiewicz propositional calculi -- Theories which are not ?o-categorical -- The monadic fragment of predicate calculus with the Chang quantifier and equality -- The ? 1 1 -comprehension schema and ?-rules. |
Record Nr. | UNISA-996466612803316 |
Berlin : , : Springer-Verlag, , [1968] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Recent findings in Boolean techniques : selected papers from the 14th International Workshop on Boolean Problems / / Rolf Drechsler, Daniel Grosse, editors |
Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2021] |
Descrizione fisica | 1 online resource (198 pages) |
Disciplina | 511.324 |
Soggetto topico | Algebra, Boolean |
ISBN | 3-030-68071-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Intro -- Preface -- Contents -- Formal Verification of Integer Multiplier Circuits Using Algebraic Reasoning: A Survey -- 1 Introduction -- 2 Circuit Verification Using Computer Algebra -- 2.1 Multiplier Circuits -- 2.2 Algebra -- 2.3 Circuit Verification Using Computer Algebra -- 2.4 Algebraic Proof Systems -- 3 Verification Tools -- 3.1 Algebraic RewriTing in ABC CiesielskiYuBrownLiuRossi-DAC15,YuBrownLiuRossiCieslieski-TCAD16,YuCiesielskiMishchenko-TCAD17,CiesielskiSuYasinYu-TCAD19 -- 3.2 AMulet KaufmannBiereKauers-FMCAD19 -- 3.3 PolyCleaner MahzoonGrosseDrechsler-ICCAD18 -- 3.4 RevSCA/RevSCA-2.0 MahzoonGrosseDrechsler-DAC19 -- 3.5 DyPoSub MahzoonGrosseSchollDrechsler-DATE20 -- 4 Benchmark Generators -- 4.1 Arithmetic Module Generator -- 4.2 GenMul -- 4.3 MultGen -- 4.4 EPFL Combinational Benchmark Suite -- 4.5 ABC/Boolector -- 4.6 Processing Verilog Benchmarks -- 4.7 Optimizing Benchmarks -- 5 Evaluation -- 5.1 Arithmetic Module Generator -- 5.2 GenMul -- 5.3 MultGen -- 5.4 EPFL Combinational Benchmark Suite -- 5.5 ABC/Boolector -- 5.6 Optimized Benchmarks -- 5.7 Proof Generation -- 6 Conclusion -- References -- The Vital Role of Machine Learning in Developing Emerging Technologies -- 1 Introduction -- 1.1 Machine Learning Transistor Model -- 1.2 Machine Learning Standard Cell Model -- 2 Related Work -- 3 Background -- 3.1 Compact Models -- 3.2 Negative Capacitance FinFET -- 3.3 Transistor Characteristics -- 4 Our Machine Learning Transistor Model -- 4.1 Experimental Setup -- 4.2 Data Scaling -- 4.3 Advantages of NN-Based Transistor Modeling -- 4.4 Disadvantages of NN-Based Transistor Modeling -- 4.5 Inference Accuracy and Training Time -- 4.6 Traditional Fitness Compared to Transistor Metric Fitness -- 4.7 Early Evaluation with Limited Data -- 4.8 Modeling NC-FinFET with NN-Based Transistor Models.
5 Our Proposed Machine Learning-Based Approach -- 5.1 ML for Library Characterization -- 5.1.1 Generation of Training Data -- 5.1.2 Training of ML Estimators -- 5.2 Design Technology Co-Optimization for NC-FinFET -- 6 Evaluation and Experimental Results -- 6.1 Accuracy of Cell Library Prediction -- 6.2 Accuracy of Prediction on System Level -- 6.3 DTCO Parameter Optimization -- 6.4 Improvement in Performance -- 7 Conclusion -- References -- Fast Optimal Synthesis of Symmetric Index Generation Functions -- 1 Introduction -- 2 Preliminaries -- 3 Linearity, Orthogonality, and Circuit Structures -- 4 The Task to Solve and the Used Approach -- 5 Analysis of the Properties of the Reverse Task -- 5.1 Trivial Solution for t=1 -- 5.2 Smallest Optimal Circuits L for a Fixed Value of t -- 5.3 Regions of Restrictions -- 5.4 Repeated Use of the Smallest Optimal Circuits -- 5.5 Missing Values nmax for Odd Values of t -- 5.6 Missing Values nmax for Even Values of t -- 5.7 Summary of the Analysis -- 6 Algorithms to Compute pmin and nmax -- 7 Experimental Results -- 8 Conclusion and Future Work -- References -- Axiomatizing Boolean Differentiation -- 1 Introduction -- 1.1 Our Approach -- 1.2 Applications of Axiomatizing Boolean Differentiation -- 1.3 Outline -- 2 Model-Theoretic Fundamentals -- 3 Axiomatizing=3=3= Boolean Differentiation -- 3.1 Boolean Functions, Rings, and Derivations -- 3.2 A Complete Axiomatization -- 4 Relationship to Finite Models and Immediate Consequences -- 5 Future Applications and Perspectives -- References -- Construction of Binary Bent Functions by FFT-Like Permutation Algorithms -- 1 Introduction -- 2 Walsh Transform -- 3 Spectral Invariant Operations in the Walsh Domain -- 4 Bent Functions and Walsh Transform -- 5 Essence of FFT -- 6 Permutation Matrices -- 7 Illustrative Examples -- 8 Algorithm for Constructing Bent Functions. 9 Closing Remarks -- References -- Nonlinear Codes for Test Patterns Compression: The Old School Way -- 1 Introduction -- 2 Proposed Approach -- 2.1 Expander Outputs as a Clique Cover Problem -- 2.2 Compatibility Graph Properties -- 2.3 Techniques for Minimum Clique Cover -- 2.4 Expander Input as an MV-Encoding Problem -- 2.5 Method Summary -- 3 Results -- 3.1 Implementation -- 3.2 Resulting Codes -- 3.3 Is Optimum MV Encoding Important? -- 3.4 Expander Synthesis -- 4 Future Directions -- 5 Conclusions -- References -- Translation Techniques for Reversible Circuit Synthesis with Positive and Negative Controls -- 1 Introduction -- 2 Background -- 2.1 Reversible Functions, Gates, and Circuits -- 2.2 Quantum Gates and Circuits -- 3 Function Translations -- 3.1 Function Inverse -- 3.2 Input-Output Negation -- 3.3 Input-Output Permutation -- 4 Transformation-Based Synthesis -- 5 Simplifying a Reversible Circuit -- 6 Mapping a Reversible Circuit to a Quantum Circuit -- 6.1 Negative Control CNOTs -- 6.2 NCV Realization of MPMCT Gates -- 6.3 MPP and MPIP Gate Cost and Substitution -- 6.4 Overall Simplification and Mapping Strategy -- 7 Experimental Results -- 8 Heuristic Selection of Function Translations -- 9 Discussion and Future Work -- References -- Hybrid Control of Toffoli and Peres Gates -- 1 Introduction -- 2 Hybrid-Controlled Gates -- 3 Scalability -- 4 Closing Remark -- References -- GenMul: Generating Architecturally Complex Multipliers to Challenge Formal Verification Tools -- 1 Introduction -- 2 Preliminaries -- 2.1 Multiplier Architectures -- 2.2 SCA Basics -- 2.3 SCA-Based Verification -- 3 Multiplier Generator GenMul -- 3.1 Overview and Data Structures -- 3.2 Generation of Multipliers -- 4 Challenges of Verifying Multipliers -- 5 Conclusion -- Appendix -- GenMulWebsite -- References -- Index. |
Record Nr. | UNINA-9910484017803321 |
Cham, Switzerland : , : Springer, , [2021] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Relation algebras [e-book] / Roger D. Maddux |
Autore | Maddux, Roger D. |
Pubbl/distr/stampa | Amsterdam ; Boston : Elsevier, 2006 |
Descrizione fisica | xxvi, 731 p. : ill. ; 24 cm |
Disciplina | 511.324 |
Collana | Studies in logic and the foundations of mathematics, 0049-237X ; 150 |
Soggetto topico | Relation algebras |
ISBN |
9780444520135
0444520139 |
Formato | Risorse elettroniche |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISALENTO-991003279859707536 |
Maddux, Roger D. | ||
Amsterdam ; Boston : Elsevier, 2006 | ||
Risorse elettroniche | ||
Lo trovi qui: Univ. del Salento | ||
|
Relational and Algebraic Methods in Computer Science [[electronic resource] ] : 17th International Conference, RAMiCS 2018, Groningen, The Netherlands, October 29 – November 1, 2018, Proceedings / / edited by Jules Desharnais, Walter Guttmann, Stef Joosten |
Edizione | [1st ed. 2018.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
Descrizione fisica | 1 online resource (XVI, 385 p. 30 illus.) |
Disciplina | 511.324 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Machine theory
Artificial intelligence Computer science Compilers (Computer programs) Computer programming Numerical analysis Formal Languages and Automata Theory Artificial Intelligence Computer Science Logic and Foundations of Programming Compilers and Interpreters Programming Techniques Numerical Analysis |
ISBN | 3-030-02149-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Paper -- Theoretical Foundations -- Reasoning about Computations and Programs -- Applications and Tools. |
Record Nr. | UNISA-996466455803316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Relational and Algebraic Methods in Computer Science : 17th International Conference, RAMiCS 2018, Groningen, The Netherlands, October 29 – November 1, 2018, Proceedings / / edited by Jules Desharnais, Walter Guttmann, Stef Joosten |
Edizione | [1st ed. 2018.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
Descrizione fisica | 1 online resource (XVI, 385 p. 30 illus.) |
Disciplina |
511.324
004.0151 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Machine theory
Artificial intelligence Computer science Compilers (Computer programs) Computer programming Numerical analysis Formal Languages and Automata Theory Artificial Intelligence Computer Science Logic and Foundations of Programming Compilers and Interpreters Programming Techniques Numerical Analysis |
ISBN | 3-030-02149-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Paper -- Theoretical Foundations -- Reasoning about Computations and Programs -- Applications and Tools. |
Record Nr. | UNINA-9910349395603321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|