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.
Automated Deduction – CADE 29 [[electronic resource] ] : 29th International Conference on Automated Deduction, Rome, Italy, July 1–4, 2023, Proceedings / / edited by Brigitte Pientka, Cesare Tinelli
| Automated Deduction – CADE 29 [[electronic resource] ] : 29th International Conference on Automated Deduction, Rome, Italy, July 1–4, 2023, Proceedings / / edited by Brigitte Pientka, Cesare Tinelli |
| Autore | Pientka Brigitte |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (614 pages) |
| Disciplina | 006.3 |
| Altri autori (Persone) | TinelliCesare |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Machine theory Computer science Software engineering Artificial Intelligence Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Software Engineering |
| ISBN | 3-031-38499-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Certified Core-Guided MaxSAT Solving -- Superposition with Delayed Unification -- On Incremental Pre-processing for SMT -- Verified Given Clause Procedures -- QSMA: A New Algorithm for Quantified Satisfiability Modulo Theory and Assignment -- Uniform Substitution for Dynamic Logic with Communicating Hybrid Programs -- An Isabelle/HOL Formalization of the SCL(FOL) Calculus -- SCL(FOL) Can Simulate Non-Redundant Superposition Clause Learning -- Formal Reasoning about Influence in Natural Sciences Experiments -- A Theory of Cartesian Arrays (with Applications in Quantum Circuit Verification) -- SAT-Based Subsumption Resolution -- A more Pragmatic CDCL for IsaSAT and targetting LLVM (Short Paper) -- Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper) -- COOL 2 - A Generic Reasoner for Modal Fixpoint Logics (System Description) -- Choose your Colour: Tree Interpolation for Quantified Formulas in SMT -- Proving Termination of C Programs with Lists -- Reasoning about Regular Properties: A Comparative Study -- Program Synthesis in Saturation -- A Uniform Formalisation of Three-Valued Logics in Bisequent Calculus -- Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs -- Verification of NP-hardness Reduction Functions for Exact Lattice Problems -- Buy One Get 14 Free: Evaluating Local Reductions for Modal Logic -- Left-Linear Completion with AC Axioms -- On P -interpolation in local theory extensions and applications to the study of interpolation in the description logics EL, EL+ -- Theorem Proving in Dependently-Typed Higher-Order Logic -- Towards Fast Nominal Anti-Unification of Letrec-Expressions -- Confluence Criteria for Logically Constrained Rewrite Systems -- Towards a Verified Tableau Prover for a Quantifier-Free Fragment of Set Theory -- An Experimental Pipeline for Automated Reasoning in Natural Language (Short paper) -- Combining Combination Properties: An Analysis of Stable-infiniteness, Convexity, and Politeness -- Decidability of difference logic over the reals with uninterpreted unary predicates -- Incremental Rewriting Modulo SMT -- Iscalc: an Interactive Symbolic Computation Framework (System Description). |
| Record Nr. | UNINA-9910743293703321 |
Pientka Brigitte
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automated Deduction – CADE 29 [[electronic resource] ] : 29th International Conference on Automated Deduction, Rome, Italy, July 1–4, 2023, Proceedings / / edited by Brigitte Pientka, Cesare Tinelli
| Automated Deduction – CADE 29 [[electronic resource] ] : 29th International Conference on Automated Deduction, Rome, Italy, July 1–4, 2023, Proceedings / / edited by Brigitte Pientka, Cesare Tinelli |
| Autore | Pientka Brigitte |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (614 pages) |
| Disciplina | 006.3 |
| Altri autori (Persone) | TinelliCesare |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Machine theory Computer science Software engineering Artificial Intelligence Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Software Engineering |
| ISBN | 3-031-38499-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Certified Core-Guided MaxSAT Solving -- Superposition with Delayed Unification -- On Incremental Pre-processing for SMT -- Verified Given Clause Procedures -- QSMA: A New Algorithm for Quantified Satisfiability Modulo Theory and Assignment -- Uniform Substitution for Dynamic Logic with Communicating Hybrid Programs -- An Isabelle/HOL Formalization of the SCL(FOL) Calculus -- SCL(FOL) Can Simulate Non-Redundant Superposition Clause Learning -- Formal Reasoning about Influence in Natural Sciences Experiments -- A Theory of Cartesian Arrays (with Applications in Quantum Circuit Verification) -- SAT-Based Subsumption Resolution -- A more Pragmatic CDCL for IsaSAT and targetting LLVM (Short Paper) -- Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper) -- COOL 2 - A Generic Reasoner for Modal Fixpoint Logics (System Description) -- Choose your Colour: Tree Interpolation for Quantified Formulas in SMT -- Proving Termination of C Programs with Lists -- Reasoning about Regular Properties: A Comparative Study -- Program Synthesis in Saturation -- A Uniform Formalisation of Three-Valued Logics in Bisequent Calculus -- Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs -- Verification of NP-hardness Reduction Functions for Exact Lattice Problems -- Buy One Get 14 Free: Evaluating Local Reductions for Modal Logic -- Left-Linear Completion with AC Axioms -- On P -interpolation in local theory extensions and applications to the study of interpolation in the description logics EL, EL+ -- Theorem Proving in Dependently-Typed Higher-Order Logic -- Towards Fast Nominal Anti-Unification of Letrec-Expressions -- Confluence Criteria for Logically Constrained Rewrite Systems -- Towards a Verified Tableau Prover for a Quantifier-Free Fragment of Set Theory -- An Experimental Pipeline for Automated Reasoning in Natural Language (Short paper) -- Combining Combination Properties: An Analysis of Stable-infiniteness, Convexity, and Politeness -- Decidability of difference logic over the reals with uninterpreted unary predicates -- Incremental Rewriting Modulo SMT -- Iscalc: an Interactive Symbolic Computation Framework (System Description). |
| Record Nr. | UNISA-996550559603316 |
|
Pientka Brigitte
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automated Reasoning with Analytic Tableaux and Related Methods [[electronic resource] ] : 32nd International Conference, TABLEAUX 2023, Prague, Czech Republic, September 18–21, 2023, Proceedings / / edited by Revantha Ramanayake, Josef Urban
| Automated Reasoning with Analytic Tableaux and Related Methods [[electronic resource] ] : 32nd International Conference, TABLEAUX 2023, Prague, Czech Republic, September 18–21, 2023, Proceedings / / edited by Revantha Ramanayake, Josef Urban |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (XXV, 482 p. 370 illus., 12 illus. in color.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Machine theory Computer science Software engineering Computer systems Microprogramming Artificial Intelligence Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Software Engineering Computer System Implementation Control Structures and Microprogramming |
| ISBN | 3-031-43513-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Range-Restricted and Horn Interpolation through Clausal Tableaux -- Non-Classical Logics in Satisfiability Modulo Theories -- DefTab: A Tableaux System for Sceptical Consequence in Default Modal Logics -- Non-distributive description logic -- A new calculus for intuitionistic Strong L\"ob logic: strong termination and cut-elimination, formalized -- Some Analytic Systems of Rules -- A cut-free, sound and complete Russellian theory of definite descriptions -- Towards Proof-Theoretic Formulation of the General Theory of Term-Forming Operators -- Lemmas: Generation, Selection, Application -- Machine-Learned Premise Selection for Lean -- gym-saturation: Gymnasium environments for saturation provers (System description) -- A linear perspective on cut-elimination for non-wellfounded sequent calculi with least and greatest fixed points -- Ill-founded Proof Systems For Intuitionistic Linear-time Temporal Logic -- Proof Systems for the Modal $\mu$-Calculus Obtained by Determinizing Automata -- Extensions of K5: Proof Theory and Uniform Lyndon Interpolation -- On intuitionistic diamonds (and lack thereof) -- NP Complexity for Combinations of Non-Normal Modal Logics -- Resolution-based Calculi for Non-Normal Modal Logics -- Canonicity of Proofs in Constructive Modal Logic -- Proof-theoretic Semantics for Intuitionistic Multiplicative Linear Logic -- The MaxSAT problem in the real-valued MV-algebra -- The Logic of Separation Logic: Models and Proofs -- Testing the Satisfiability of Formulas in Separation Logic with Permissions -- Nested Sequents for Quantified Modal Logics -- A Naive Prover for First-Order Logic: A Minimal Example of Analytic Completeness. |
| Record Nr. | UNISA-996550548203316 |
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automated Reasoning with Analytic Tableaux and Related Methods [[electronic resource] ] : 32nd International Conference, TABLEAUX 2023, Prague, Czech Republic, September 18–21, 2023, Proceedings / / edited by Revantha Ramanayake, Josef Urban
| Automated Reasoning with Analytic Tableaux and Related Methods [[electronic resource] ] : 32nd International Conference, TABLEAUX 2023, Prague, Czech Republic, September 18–21, 2023, Proceedings / / edited by Revantha Ramanayake, Josef Urban |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (XXV, 482 p. 370 illus., 12 illus. in color.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Machine theory Computer science Software engineering Computer systems Microprogramming Artificial Intelligence Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Software Engineering Computer System Implementation Control Structures and Microprogramming |
| ISBN | 3-031-43513-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Range-Restricted and Horn Interpolation through Clausal Tableaux -- Non-Classical Logics in Satisfiability Modulo Theories -- DefTab: A Tableaux System for Sceptical Consequence in Default Modal Logics -- Non-distributive description logic -- A new calculus for intuitionistic Strong L\"ob logic: strong termination and cut-elimination, formalized -- Some Analytic Systems of Rules -- A cut-free, sound and complete Russellian theory of definite descriptions -- Towards Proof-Theoretic Formulation of the General Theory of Term-Forming Operators -- Lemmas: Generation, Selection, Application -- Machine-Learned Premise Selection for Lean -- gym-saturation: Gymnasium environments for saturation provers (System description) -- A linear perspective on cut-elimination for non-wellfounded sequent calculi with least and greatest fixed points -- Ill-founded Proof Systems For Intuitionistic Linear-time Temporal Logic -- Proof Systems for the Modal $\mu$-Calculus Obtained by Determinizing Automata -- Extensions of K5: Proof Theory and Uniform Lyndon Interpolation -- On intuitionistic diamonds (and lack thereof) -- NP Complexity for Combinations of Non-Normal Modal Logics -- Resolution-based Calculi for Non-Normal Modal Logics -- Canonicity of Proofs in Constructive Modal Logic -- Proof-theoretic Semantics for Intuitionistic Multiplicative Linear Logic -- The MaxSAT problem in the real-valued MV-algebra -- The Logic of Separation Logic: Models and Proofs -- Testing the Satisfiability of Formulas in Separation Logic with Permissions -- Nested Sequents for Quantified Modal Logics -- A Naive Prover for First-Order Logic: A Minimal Example of Analytic Completeness. |
| Record Nr. | UNINA-9910744502303321 |
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Bridging the Gap Between AI and Reality [[electronic resource] ] : First International Conference, AISoLA 2023, Crete, Greece, October 23–28, 2023, Proceedings / / edited by Bernhard Steffen
| Bridging the Gap Between AI and Reality [[electronic resource] ] : First International Conference, AISoLA 2023, Crete, Greece, October 23–28, 2023, Proceedings / / edited by Bernhard Steffen |
| Autore | Steffen Bernhard |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (454 pages) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Software engineering Computers, Special purpose Computer systems Artificial intelligence Computer Science Logic and Foundations of Programming Software Engineering Special Purpose and Application-Based Systems Computer System Implementation Artificial Intelligence |
| ISBN |
9783031460029
9783031460012 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Verification meets Learning and Statistics -- Nature of AI-Based Systems -- Safety Verificatio of DNNs -- AI Assisted Programming. |
| Record Nr. | UNINA-9910770279103321 |
|
Steffen Bernhard
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Bridging the Gap Between AI and Reality [[electronic resource] ] : First International Conference, AISoLA 2023, Crete, Greece, October 23–28, 2023, Proceedings / / edited by Bernhard Steffen
| Bridging the Gap Between AI and Reality [[electronic resource] ] : First International Conference, AISoLA 2023, Crete, Greece, October 23–28, 2023, Proceedings / / edited by Bernhard Steffen |
| Autore | Steffen Bernhard |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (454 pages) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Software engineering Computers, Special purpose Computer systems Artificial intelligence Computer Science Logic and Foundations of Programming Software Engineering Special Purpose and Application-Based Systems Computer System Implementation Artificial Intelligence |
| ISBN |
9783031460029
9783031460012 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Verification meets Learning and Statistics -- Nature of AI-Based Systems -- Safety Verificatio of DNNs -- AI Assisted Programming. |
| Record Nr. | UNISA-996587869303316 |
|
Steffen Bernhard
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Categories and Types in Logic, Language, and Physics [[electronic resource] ] : Essays dedicated to Jim Lambek on the Occasion of this 90th Birthday / / edited by Claudia Casadio, Bob Coecke, Michael Moortgat, Philip Scott
| Categories and Types in Logic, Language, and Physics [[electronic resource] ] : Essays dedicated to Jim Lambek on the Occasion of this 90th Birthday / / edited by Claudia Casadio, Bob Coecke, Michael Moortgat, Philip Scott |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XII, 421 p. 61 illus.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science Computers—History Formal Languages and Automata Theory Theory of Computation Computer Science Logic and Foundations of Programming History of Computing Computer Science |
| ISBN | 3-642-54789-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Semantic Unification: A Sheaf Theoretic Approach to Natural Language -- On Residuation -- Type Similarity for the Lambek-Grishin Calculus Revisited -- NP-Completeness of Grammars Based Upon Products of Free Pregroups -- Distributional Semantics: A Montagovian View -- A Logical Basis for Quantum Evolution and Entanglement -- Learning Lambek Grammars from Proof Frames -- Multi-Sorted Residuation -- Italian Clitic Patterns in Pregroup Grammar: State of the Art -- On Associative Lambek Calculus Extended with Basic Proper Axioms -- Classical Structures Based on Unitaries -- Initial Algebras of Terms with Binding and Algebraic Structure -- Abstract Tensor Systems as Monoidal Categories -- On Canonical Embeddings of Residuated Groupoids -- L-Completeness of the Lambek Calculus with the Reversal Operation Allowing Empty Antecedents -- A Note on Multidimensional Dyck Languages -- Extended Lambek Calculi and First-Order Linear Logic -- A Categorial Type Logic -- Chasing Diagrams in Cryptography -- The Monotone Lambek Calculus Is NP-Complete -- A Mathematical Analysis of Masaccio’s Trinity -- Conjoin ability in 1-Discontinuous Lambek Calculus -- The Hidden Structural Rules of the Discontinuous Lambek Calculus. |
| Record Nr. | UNISA-996203614303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Categories and Types in Logic, Language, and Physics [[electronic resource] ] : Essays dedicated to Jim Lambek on the Occasion of this 90th Birthday / / edited by Claudia Casadio, Bob Coecke, Michael Moortgat, Philip Scott
| Categories and Types in Logic, Language, and Physics [[electronic resource] ] : Essays dedicated to Jim Lambek on the Occasion of this 90th Birthday / / edited by Claudia Casadio, Bob Coecke, Michael Moortgat, Philip Scott |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XII, 421 p. 61 illus.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science Computers—History Formal Languages and Automata Theory Theory of Computation Computer Science Logic and Foundations of Programming History of Computing Computer Science |
| ISBN | 3-642-54789-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Semantic Unification: A Sheaf Theoretic Approach to Natural Language -- On Residuation -- Type Similarity for the Lambek-Grishin Calculus Revisited -- NP-Completeness of Grammars Based Upon Products of Free Pregroups -- Distributional Semantics: A Montagovian View -- A Logical Basis for Quantum Evolution and Entanglement -- Learning Lambek Grammars from Proof Frames -- Multi-Sorted Residuation -- Italian Clitic Patterns in Pregroup Grammar: State of the Art -- On Associative Lambek Calculus Extended with Basic Proper Axioms -- Classical Structures Based on Unitaries -- Initial Algebras of Terms with Binding and Algebraic Structure -- Abstract Tensor Systems as Monoidal Categories -- On Canonical Embeddings of Residuated Groupoids -- L-Completeness of the Lambek Calculus with the Reversal Operation Allowing Empty Antecedents -- A Note on Multidimensional Dyck Languages -- Extended Lambek Calculi and First-Order Linear Logic -- A Categorial Type Logic -- Chasing Diagrams in Cryptography -- The Monotone Lambek Calculus Is NP-Complete -- A Mathematical Analysis of Masaccio’s Trinity -- Conjoin ability in 1-Discontinuous Lambek Calculus -- The Hidden Structural Rules of the Discontinuous Lambek Calculus. |
| Record Nr. | UNINA-9910484856503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Cellular Automata and Discrete Complex Systems [[electronic resource] ] : 25th IFIP WG 1.5 International Workshop, AUTOMATA 2019, Guadalajara, Mexico, June 26–28, 2019, Proceedings / / edited by Alonso Castillo-Ramirez, Pedro P. B. de Oliveira
| Cellular Automata and Discrete Complex Systems [[electronic resource] ] : 25th IFIP WG 1.5 International Workshop, AUTOMATA 2019, Guadalajara, Mexico, June 26–28, 2019, Proceedings / / edited by Alonso Castillo-Ramirez, Pedro P. B. de Oliveira |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XVII, 105 p. 318 illus., 2 illus. in color.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Artificial intelligence Numerical analysis Database management Theory of Computation Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Artificial Intelligence Numerical Analysis Database Management |
| ISBN | 3-030-20981-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On the Effects Offering Memory in the Dynamics of Conjunctive Networks -- Complexity-Theoretic Aspects of Expanding Cellular Automata -- Iterative Arrays with Finite Inter-Cell Communication -- Bounding the Minimal Number of Generators of Groups and Monoids of Cellular Automata -- Enhancement of Automata with Jumping Modes -- Iterative Arrays with Self-Verifying Communication Cell -- Generic Properties in Some Classes of Automation Groups. |
| Record Nr. | UNISA-996466284403316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Cellular Automata and Discrete Complex Systems [[electronic resource] ] : 25th IFIP WG 1.5 International Workshop, AUTOMATA 2019, Guadalajara, Mexico, June 26–28, 2019, Proceedings / / edited by Alonso Castillo-Ramirez, Pedro P. B. de Oliveira
| Cellular Automata and Discrete Complex Systems [[electronic resource] ] : 25th IFIP WG 1.5 International Workshop, AUTOMATA 2019, Guadalajara, Mexico, June 26–28, 2019, Proceedings / / edited by Alonso Castillo-Ramirez, Pedro P. B. de Oliveira |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XVII, 105 p. 318 illus., 2 illus. in color.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Artificial intelligence Numerical analysis Database management Theory of Computation Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Artificial Intelligence Numerical Analysis Database Management |
| ISBN | 3-030-20981-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On the Effects Offering Memory in the Dynamics of Conjunctive Networks -- Complexity-Theoretic Aspects of Expanding Cellular Automata -- Iterative Arrays with Finite Inter-Cell Communication -- Bounding the Minimal Number of Generators of Groups and Monoids of Cellular Automata -- Enhancement of Automata with Jumping Modes -- Iterative Arrays with Self-Verifying Communication Cell -- Generic Properties in Some Classes of Automation Groups. |
| Record Nr. | UNINA-9910337837203321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
