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.
Applications and Theory of Petri Nets [[electronic resource] ] : 30th International Conference, PETRI NETS 2009, Paris, France, June 22-26, 2009, Proceedings / / edited by Giuliana Franceschinis, Karsten Wolf
| Applications and Theory of Petri Nets [[electronic resource] ] : 30th International Conference, PETRI NETS 2009, Paris, France, June 22-26, 2009, Proceedings / / edited by Giuliana Franceschinis, Karsten Wolf |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XII, 353 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer science—Mathematics Discrete mathematics Algorithms Software engineering Machine theory Theory of Computation Discrete Mathematics in Computer Science Software Engineering Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming |
| ISBN | 3-642-02424-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Component-Based Construction of Heterogeneous Real-Time Systems in Bip -- Unifying Petri Net Semantics with Token Flows -- Reaction Systems: A Formal Framework for Processes -- Full Papers -- Simple Composition of Nets -- Towards a Standard for Modular Petri Nets: A Formalisation -- Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication -- Pomset Languages of Finite Step Transition Systems -- Deficiency Zero Petri Nets and Product Form -- Bisimilarity Minimization in O(m logn) Time -- P-Semiflow Computation with Decision Diagrams -- Orthomodular Lattices in Occurrence Nets -- Hasse Diagram Generators and Petri Nets -- Modeling and Analysis of Transportation Networks Using Batches Petri Nets with Controllable Batch Speed -- Oclets – Scenario-Based Modeling with Petri Nets -- Hornets: Nets within Nets Combined with Net Algebra -- Monotonicity in Service Orchestrations -- Compositional Service Trees -- Tool Papers -- ASAP: An Extensible Platform for State Space Analysis -- The Access/CPN Framework: A Tool for Interacting with the CPN Tools Simulator -- DSSZ-MC – A Tool for Symbolic Analysis of Extended Petri Nets -- Workcraft – A Framework for Interpreted Graph Models -- PDETool: A Multi-formalism Modeling Tool for Discrete-Event Systems Based on SDES Description. |
| Record Nr. | UNINA-9910484784803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Artificial Intelligence Applications and Innovations [[electronic resource] ] : 15th IFIP WG 12.5 International Conference, AIAI 2019, Hersonissos, Crete, Greece, May 24–26, 2019, Proceedings / / edited by John MacIntyre, Ilias Maglogiannis, Lazaros Iliadis, Elias Pimenidis
| Artificial Intelligence Applications and Innovations [[electronic resource] ] : 15th IFIP WG 12.5 International Conference, AIAI 2019, Hersonissos, Crete, Greece, May 24–26, 2019, Proceedings / / edited by John MacIntyre, Ilias Maglogiannis, Lazaros Iliadis, Elias Pimenidis |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XXIV, 689 p. 265 illus., 185 illus. in color.) |
| Disciplina | 006.3 |
| Collana | IFIP Advances in Information and Communication Technology |
| Soggetto topico |
Artificial intelligence
Data mining Computer vision Information storage and retrieval systems Application software Machine theory Artificial Intelligence Data Mining and Knowledge Discovery Computer Vision Information Storage and Retrieval Computer and Information Systems Applications Formal Languages and Automata Theory |
| ISBN | 3-030-19823-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910337841503321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Artificial Intelligence Logic and Applications [[electronic resource] ] : The 3rd International Conference, AILA 2023, Changchun, China, August 5–6, 2023, Proceedings / / edited by Songmao Zhang, Yonggang Zhang
| Artificial Intelligence Logic and Applications [[electronic resource] ] : The 3rd International Conference, AILA 2023, Changchun, China, August 5–6, 2023, Proceedings / / edited by Songmao Zhang, Yonggang Zhang |
| Autore | Zhang Songmao |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (459 pages) |
| Disciplina | 005.131 |
| Altri autori (Persone) | ZhangYonggang |
| Collana | Communications in Computer and Information Science |
| Soggetto topico |
Machine theory
Computer science Artificial intelligence Computer science - Mathematics Software engineering Formal Languages and Automata Theory Theory of Computation Artificial Intelligence Mathematics of Computing Software Engineering |
| ISBN | 981-9978-69-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | AI Logic Foundation -- AI Logic Reasoning -- AI Logic Applications. |
| Record Nr. | UNINA-9910763599003321 |
Zhang Songmao
|
||
| Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Artificial Intelligence Logic and Applications [[electronic resource] ] : The 3rd International Conference, AILA 2023, Changchun, China, August 5–6, 2023, Proceedings / / edited by Songmao Zhang, Yonggang Zhang
| Artificial Intelligence Logic and Applications [[electronic resource] ] : The 3rd International Conference, AILA 2023, Changchun, China, August 5–6, 2023, Proceedings / / edited by Songmao Zhang, Yonggang Zhang |
| Autore | Zhang Songmao |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (459 pages) |
| Disciplina | 005.131 |
| Altri autori (Persone) | ZhangYonggang |
| Collana | Communications in Computer and Information Science |
| Soggetto topico |
Machine theory
Computer science Artificial intelligence Computer science - Mathematics Software engineering Formal Languages and Automata Theory Theory of Computation Artificial Intelligence Mathematics of Computing Software Engineering |
| ISBN | 981-9978-69-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | AI Logic Foundation -- AI Logic Reasoning -- AI Logic Applications. |
| Record Nr. | UNISA-996565863503316 |
|
Zhang Songmao
|
||
| Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
At the Intersection of Language, Logic, and Information [[electronic resource] ] : ESSLLI 2018 Student Session, Sofia, Bulgaria, August 6–17, 2018, Selected Papers / / edited by Jennifer Sikos, Eric Pacuit
| At the Intersection of Language, Logic, and Information [[electronic resource] ] : ESSLLI 2018 Student Session, Sofia, Bulgaria, August 6–17, 2018, Selected Papers / / edited by Jennifer Sikos, Eric Pacuit |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (VIII, 225 p. 72 illus., 16 illus. in color.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Expert systems (Computer science) Natural language processing (Computer science) Information storage and retrieval systems Formal Languages and Automata Theory Knowledge Based Systems Natural Language Processing (NLP) Information Storage and Retrieval |
| ISBN | 3-662-59620-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Simulating the No Alternatives Argument in a Social Setting -- Readings of Plurals and Common Ground -- Towards an analysis of the agent-oriented manner verb sorgfältig (‘carefully’) -- Social Choice and the Problem of Recommending Essential Readings -- Towards a 2-Multiple Context-Free Grammar for the 3-dimensional Dyck Language -- Compositionality in Privative Adjectives: Extending Dual Content Semantics -- Definiteness with Bare Nouns in Shan -- The challenge of metafictional anaphora -- Rule-based reasoners in epistemic logic -- Free Relatives, Feature Recycling, and Reprojection in Minimalist Grammars -- Playing with Information Source -- Disjunction under Deontic Modals: Experimental Data -- “First Things First”: an Inquisitive Plausability-Urgency Model -- Interpreting Intensifiers for Relative Adjectives: Comparing Models and Theories. . |
| Record Nr. | UNISA-996466449503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
At the Intersection of Language, Logic, and Information [[electronic resource] ] : ESSLLI 2018 Student Session, Sofia, Bulgaria, August 6–17, 2018, Selected Papers / / edited by Jennifer Sikos, Eric Pacuit
| At the Intersection of Language, Logic, and Information [[electronic resource] ] : ESSLLI 2018 Student Session, Sofia, Bulgaria, August 6–17, 2018, Selected Papers / / edited by Jennifer Sikos, Eric Pacuit |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (VIII, 225 p. 72 illus., 16 illus. in color.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Expert systems (Computer science) Natural language processing (Computer science) Information storage and retrieval systems Formal Languages and Automata Theory Knowledge Based Systems Natural Language Processing (NLP) Information Storage and Retrieval |
| ISBN | 3-662-59620-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Simulating the No Alternatives Argument in a Social Setting -- Readings of Plurals and Common Ground -- Towards an analysis of the agent-oriented manner verb sorgfältig (‘carefully’) -- Social Choice and the Problem of Recommending Essential Readings -- Towards a 2-Multiple Context-Free Grammar for the 3-dimensional Dyck Language -- Compositionality in Privative Adjectives: Extending Dual Content Semantics -- Definiteness with Bare Nouns in Shan -- The challenge of metafictional anaphora -- Rule-based reasoners in epistemic logic -- Free Relatives, Feature Recycling, and Reprojection in Minimalist Grammars -- Playing with Information Source -- Disjunction under Deontic Modals: Experimental Data -- “First Things First”: an Inquisitive Plausability-Urgency Model -- Interpreting Intensifiers for Relative Adjectives: Comparing Models and Theories. . |
| Record Nr. | UNINA-9910349308203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automata, Languages and Programming [[electronic resource] ] : 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2010. Proceedings, Part II / / edited by Luca Aceto, Monika Henzinger, Jiri Sgall
| Automata, Languages and Programming [[electronic resource] ] : 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2010. Proceedings, Part II / / edited by Luca Aceto, Monika Henzinger, Jiri Sgall |
| Edizione | [1st ed. 2011.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
| Descrizione fisica | 1 online resource (XXVI, 666 p.) |
| Disciplina | 005.1015113 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Software engineering Machine theory Computer networks Algorithms Computer Science Logic and Foundations of Programming Software Engineering Formal Languages and Automata Theory Computer Communication Networks Theory of Computation |
| ISBN | 3-642-22012-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465552603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
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 | ||
| ||
