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.
Relational and Algebraic Methods in Computer Science [[electronic resource] ] : 16th International Conference, RAMiCS 2017, Lyon, France, May 15-18, 2017, Proceedings / / edited by Peter Höfner, Damien Pous, Georg Struth
| Relational and Algebraic Methods in Computer Science [[electronic resource] ] : 16th International Conference, RAMiCS 2017, Lyon, France, May 15-18, 2017, Proceedings / / edited by Peter Höfner, Damien Pous, Georg Struth |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XIV, 323 p. 24 illus.) |
| Disciplina | 511.324 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science—Mathematics Computer science Software engineering Artificial intelligence Discrete mathematics Formal Languages and Automata Theory Symbolic and Algebraic Manipulation Computer Science Logic and Foundations of Programming Software Engineering Artificial Intelligence Discrete Mathematics in Computer Science |
| ISBN | 3-319-57418-3 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algebra for Quantitative Information Flow -- Dual space of a lattice as the completion of a Pervin space -- Images as relations under RelView -- Tool-Based Relational Investigation of Closure-Interior Relatives for Finite Topological Spaces -- Varieties of Cubical Sets -- Non-Associative Kleene Algebra and Temporal Logics -- Algebraic Investigation of Connected Components -- Stone Relation Algebras -- Relation algebras, idempotent semirings and generalized bunched implication algebras -- Parsing and Printing of and with Triples -- Software Development in Relation Algebra with Ampersand -- Allegories and Collagories for Transformation of Graph Structures Considered as Coalgebras -- Aggregation of Votes with Multiple Positions on Each Issue -- Complete solution of an optimization problem in tropical semifield -- Concurrency-Preserving Minimal Process Representation -- Embeddability into relational lattices is undecibable -- Tower Induction and Up-To Techniques for CCS with Fixed Points -- Reasoning about Cardinalities of Relations with Applications Supported by Proof Assistants -- Type-n Arrow Categories. |
| Record Nr. | UNISA-996466226503316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Relational and Algebraic Methods in Computer Science : 16th International Conference, RAMiCS 2017, Lyon, France, May 15-18, 2017, Proceedings / / edited by Peter Höfner, Damien Pous, Georg Struth
| Relational and Algebraic Methods in Computer Science : 16th International Conference, RAMiCS 2017, Lyon, France, May 15-18, 2017, Proceedings / / edited by Peter Höfner, Damien Pous, Georg Struth |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XIV, 323 p. 24 illus.) |
| Disciplina | 511.324 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science—Mathematics Computer science Software engineering Artificial intelligence Discrete mathematics Formal Languages and Automata Theory Symbolic and Algebraic Manipulation Computer Science Logic and Foundations of Programming Software Engineering Artificial Intelligence Discrete Mathematics in Computer Science |
| ISBN | 3-319-57418-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algebra for Quantitative Information Flow -- Dual space of a lattice as the completion of a Pervin space -- Images as relations under RelView -- Tool-Based Relational Investigation of Closure-Interior Relatives for Finite Topological Spaces -- Varieties of Cubical Sets -- Non-Associative Kleene Algebra and Temporal Logics -- Algebraic Investigation of Connected Components -- Stone Relation Algebras -- Relation algebras, idempotent semirings and generalized bunched implication algebras -- Parsing and Printing of and with Triples -- Software Development in Relation Algebra with Ampersand -- Allegories and Collagories for Transformation of Graph Structures Considered as Coalgebras -- Aggregation of Votes with Multiple Positions on Each Issue -- Complete solution of an optimization problem in tropical semifield -- Concurrency-Preserving Minimal Process Representation -- Embeddability into relational lattices is undecibable -- Tower Induction and Up-To Techniques for CCS with Fixed Points -- Reasoning about Cardinalities of Relations with Applications Supported by Proof Assistants -- Type-n Arrow Categories. |
| Record Nr. | UNINA-9910483670003321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Rudiments of [mu]-calculus [e-book] / A. Arnold, D. Niwiński
| Rudiments of [mu]-calculus [e-book] / A. Arnold, D. Niwiński |
| Autore | Arnold, André |
| Pubbl/distr/stampa | Amsterdam ; New York : Elsevier, 2001 |
| Descrizione fisica | xvii, 277 p. : ill. ; 23 cm |
| Disciplina | 511.324 |
| Altri autori (Persone) | Niwiński, Damian |
| Collana | Studies in logic and the foundations of mathematics, 0049-237X ; v. 146 |
| Soggetto topico |
Algebraic logic
Monotonic functions Fixed point theory Lattice theory Machine theory |
| ISBN |
9780444506207
0444506209 |
| Formato | Risorse elettroniche  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991003279989707536 |
Arnold, André
|
||
| Amsterdam ; New York : Elsevier, 2001 | ||
| Risorse elettroniche | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Schaum's outline of theory and problems of Boolean algebra and switching circuits / by Elliott Mendelson
| Schaum's outline of theory and problems of Boolean algebra and switching circuits / by Elliott Mendelson |
| Autore | Mendelson, Elliott |
| Pubbl/distr/stampa | New York : McGraw-Hill, 1970 |
| Descrizione fisica | 213 p. : ill. ; 28 cm. |
| Disciplina | 511.324 |
| Collana | Schaum's outline series |
| Soggetto topico |
Boolean algebra
Switching theory |
| ISBN | 0070414602 |
| Classificazione | AMS 06E |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991001312859707536 |
|
Mendelson, Elliott
|
||
| New York : McGraw-Hill, 1970 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Theory and Applications of Satisfiability Testing – SAT 2008 [[electronic resource] ] : 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008, Proceedings / / edited by Hans Kleine Büning, Xishun Zhao
| Theory and Applications of Satisfiability Testing – SAT 2008 [[electronic resource] ] : 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008, Proceedings / / edited by Hans Kleine Büning, Xishun Zhao |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (X, 305 p.) |
| Disciplina | 511.324 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Algorithms Operating systems (Computers) Numerical analysis Artificial intelligence Mathematical logic Formal Languages and Automata Theory Operating Systems Numerical Analysis Artificial Intelligence Mathematical Logic and Foundations |
| ISBN | 3-540-79719-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Modelling Max-CSP as Partial Max-SAT -- A Preprocessor for Max-SAT Solvers -- A Generalized Framework for Conflict Analysis -- Adaptive Restart Strategies for Conflict Driven SAT Solvers -- New Results on the Phase Transition for Random Quantified Boolean Formulas -- Designing an Efficient Hardware Implication Accelerator for SAT Solving -- Attacking Bivium Using SAT Solvers -- SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers -- Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms -- Complexity and Algorithms for Well-Structured k-SAT Instances -- A Decision-Making Procedure for Resolution-Based SAT-Solvers -- Online Estimation of SAT Solving Runtime -- A Max-SAT Inference-Based Pre-processing for Max-Clique -- SAT, UNSAT and Coloring -- Computation of Renameable Horn Backdoors -- A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors -- Improvements to Hybrid Incremental SAT Algorithms -- Searching for Autarkies to Trim Unsatisfiable Clause Sets -- Nenofex: Expanding NNF for QBF Solving -- SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions -- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms -- A CNF Class Generalizing Exact Linear Formulas -- How Many Conflicts Does It Need to Be Unsatisfiable? -- Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning -- Local Restarts -- Regular and General Resolution: An Improved Separation -- Finding Guaranteed MUSes Fast. |
| Record Nr. | UNISA-996465321603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theory and Applications of Satisfiability Testing – SAT 2008 : 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008, Proceedings / / edited by Hans Kleine Büning, Xishun Zhao
| Theory and Applications of Satisfiability Testing – SAT 2008 : 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008, Proceedings / / edited by Hans Kleine Büning, Xishun Zhao |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (X, 305 p.) |
| Disciplina | 511.324 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Algorithms Operating systems (Computers) Numerical analysis Artificial intelligence Mathematical logic Formal Languages and Automata Theory Operating Systems Numerical Analysis Artificial Intelligence Mathematical Logic and Foundations |
| ISBN | 3-540-79719-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Modelling Max-CSP as Partial Max-SAT -- A Preprocessor for Max-SAT Solvers -- A Generalized Framework for Conflict Analysis -- Adaptive Restart Strategies for Conflict Driven SAT Solvers -- New Results on the Phase Transition for Random Quantified Boolean Formulas -- Designing an Efficient Hardware Implication Accelerator for SAT Solving -- Attacking Bivium Using SAT Solvers -- SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers -- Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms -- Complexity and Algorithms for Well-Structured k-SAT Instances -- A Decision-Making Procedure for Resolution-Based SAT-Solvers -- Online Estimation of SAT Solving Runtime -- A Max-SAT Inference-Based Pre-processing for Max-Clique -- SAT, UNSAT and Coloring -- Computation of Renameable Horn Backdoors -- A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors -- Improvements to Hybrid Incremental SAT Algorithms -- Searching for Autarkies to Trim Unsatisfiable Clause Sets -- Nenofex: Expanding NNF for QBF Solving -- SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions -- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms -- A CNF Class Generalizing Exact Linear Formulas -- How Many Conflicts Does It Need to Be Unsatisfiable? -- Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning -- Local Restarts -- Regular and General Resolution: An Improved Separation -- Finding Guaranteed MUSes Fast. |
| Record Nr. | UNINA-9910483691503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theory and Problems of Boolean Algebra and Switching Circuits / by E. Mendelson
| Theory and Problems of Boolean Algebra and Switching Circuits / by E. Mendelson |
| Autore | Mendelson, Elliott |
| Pubbl/distr/stampa | New York : McGraw-Hill Book Company, 1970 |
| Descrizione fisica | 213 p. ; 28 cm |
| Disciplina | 511.324 |
| Collana | Schaum's outline series |
| ISBN | 07-041460-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | ita |
| Record Nr. | UNINA-990000851340403321 |
|
Mendelson, Elliott
|
||
| New York : McGraw-Hill Book Company, 1970 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
