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.
Logic, Language, Information and Computation [[electronic resource] ] : 17th International Workshop, WoLLIC 2010, Brasilia, Brazil, July 6-9, 2010, Proceedings / / edited by Anuj Dawar, Ruy de Queiroz
| Logic, Language, Information and Computation [[electronic resource] ] : 17th International Workshop, WoLLIC 2010, Brasilia, Brazil, July 6-9, 2010, Proceedings / / edited by Anuj Dawar, Ruy de Queiroz |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (X, 259 p. 28 illus.) |
| Disciplina | 005.13 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Programming languages (Electronic computers)
Computer programming Computers Mathematical logic Computer logic Algorithms Programming Languages, Compilers, Interpreters Programming Techniques Theory of Computation Mathematical Logic and Formal Languages Logics and Meanings of Programs Algorithm Analysis and Problem Complexity |
| ISBN |
1-280-38743-2
9786613565358 3-642-13824-1 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Entailment Multipliers: An Algebraic Characterization of Validity for Classical and Modal Logics -- A CTL-Based Logic for Program Abstractions -- Application of Logic to Integer Sequences: A Survey -- The Two-Variable Fragment with Counting Revisited -- Intuitionistic Logic and Computability Theory -- Foundations of Satisfiability Modulo Theories -- Logical Form as a Determinant of Cognitive Processes -- Formal Lifetime Reliability Analysis Using Continuous Random Variables -- Modal Logics with Counting -- Verification of the Completeness of Unification Algorithms à la Robinson -- Mechanisation of PDA and Grammar Equivalence for Context-Free Languages -- On the Role of the Complementation Rule for Data Dependencies over Incomplete Relations -- Decidability and Undecidability Results on the Modal ?-Calculus with a Natural Number-Valued Semantics -- Solving the Implication Problem for XML Functional Dependencies with Properties -- On Anaphora and the Binding Principles in Categorial Grammar -- Feasible Functions over Co-inductive Data -- Interval Valued Fuzzy Coimplication -- Reduction of the Intruder Deduction Problem into Equational Elementary Deduction for Electronic Purse Protocols with Blind Signatures -- Intersection Type Systems and Explicit Substitutions Calculi -- Generalising Conservativity. |
| Record Nr. | UNISA-996465619303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logic, Language, Information and Computation [[electronic resource] ] : 16th International Workshop, WoLLIC 2009, Tokyo, Japan, June 21-24, 2009, Proceedings / / edited by Hiroakira Ono, Makoto Kanazawa, Ruy de Queiroz
| Logic, Language, Information and Computation [[electronic resource] ] : 16th International Workshop, WoLLIC 2009, Tokyo, Japan, June 21-24, 2009, Proceedings / / edited by Hiroakira Ono, Makoto Kanazawa, Ruy de Queiroz |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XI, 409 p.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Computers Algorithms Mathematical logic Computer science—Mathematics Artificial Intelligence Theory of Computation Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages Mathematics of Computing Discrete Mathematics in Computer Science |
| Soggetto genere / forma |
Kongress.
Tokio (2009) |
| ISBN |
1-280-38296-1
9786613560872 3-642-02261-8 |
| Classificazione | SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Tutorials and Invited Talks -- A Characterisation of Definable NP Search Problems in Peano Arithmetic -- Algebraic Valuations as Behavioral Logical Matrices -- Query Answering in Description Logics: The Knots Approach -- Mathematical Logic for Life Science Ontologies -- Recognizability in the Simply Typed Lambda-Calculus -- Logic-Based Probabilistic Modeling -- Contributed Papers -- Completions of Basic Algebras -- Transformations via Geometric Perspective Techniques Augmented with Cycles Normalization -- Observational Completeness on Abstract Interpretation -- SAT in Monadic Gödel Logics: A Borderline between Decidability and Undecidability -- Learning by Questions and Answers: From Belief-Revision Cycles to Doxastic Fixed Points -- First-Order Linear-Time Epistemic Logic with Group Knowledge: An Axiomatisation of the Monodic Fragment -- On-the-Fly Macros -- Abductive Logic Grammars -- On the Syntax-Semantics Interface: From Convergent Grammar to Abstract Categorial Grammar -- Observational Effort and Formally Open Mappings -- Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus -- Property Driven Three-Valued Model Checking on Hybrid Automata -- Team Logic and Second-Order Logic -- Ludics and Its Applications to Natural Language Semantics -- Spoilt for Choice: Full First-Order Hierarchical Decompositions -- Classic-Like Analytic Tableaux for Finite-Valued Logics -- A Duality for Algebras of Lattice-Valued Modal Logic -- An Independence Relation for Sets of Secrets -- Expressing Extension-Based Semantics Based on Stratified Minimal Models -- Deep Inference in Bi-intuitionistic Logic -- : An Action-Based Logic for Reasoning about Contracts -- Ehrenfeucht-Fraïssé Games on Random Structures -- Sound and Complete Tree-Sequent Calculus for Inquisitive Logic -- The Arrow Calculus as a Quantum Programming Language -- Knowledge, Time, and Logical Omniscience. |
| Record Nr. | UNISA-996465412003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logic, Language, Information and Computation [[electronic resource] ] : 15th International Workshop, WoLLIC 2008 Edinburgh, UK, July 1-4, 2008, Proceedings / / edited by Wilfrid Hodges, Ruy de Queiroz
| Logic, Language, Information and Computation [[electronic resource] ] : 15th International Workshop, WoLLIC 2008 Edinburgh, UK, July 1-4, 2008, Proceedings / / edited by Wilfrid Hodges, Ruy de Queiroz |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (VIII, 313 p.) |
| Disciplina | 160 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Logic
Artificial intelligence Computer programming Computers Algorithms Mathematical logic Artificial Intelligence Programming Techniques Theory of Computation Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages |
| ISBN | 3-540-69937-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Tutorials and Invited Lectures -- Inter-deriving Semantic Artifacts for Object-Oriented Programming -- On the Descriptive Complexity of Linear Algebra -- Talks on Quantum Computing -- On Game Semantics of the Affine and Intuitionistic Logics -- The Grammar of Scope -- Contributed Papers -- Conjunctive Grammars and Alternating Pushdown Automata -- Expressive Power and Decidability for Memory Logics -- Reasoning with Uncertainty by Nmatrix–Metric Semantics -- A Propositional Dynamic Logic for CCS Programs -- Towards Ontology Evolution in Physics -- Nominal Matching and Alpha-Equivalence -- Interval Additive Generators of Interval T-Norms -- Propositional Dynamic Logic as a Logic of Belief Revision -- Time Complexity and Convergence Analysis of Domain Theoretic Picard Method -- On the Formal Semantics of IF-Like Logics -- One-and-a-Halfth Order Terms: Curry-Howard and Incomplete Derivations -- Labelled Calculi for ?ukasiewicz Logics -- An Infinitely-Often One-Way Function Based on an Average-Case Assumption -- On Characteristic Constants of Theories Defined by Kolmogorov Complexity -- Adversary Lower Bounds for Nonadaptive Quantum Algorithms -- On Second-Order Monadic Groupoidal Quantifiers -- Inference Processes for Quantified Predicate Knowledge -- Using ? -ctl to Specify Complex Planning Goals -- Hyperintensional Questions -- Skolem Theory and Generalized Quantifiers -- On a Graph Calculus for Algebras of Relations. |
| Record Nr. | UNISA-996465736503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logic, Language, Information, and Computation : 30th International Workshop, WoLLIC 2024, Bern, Switzerland, June 10-13, 2024, Proceedings
| Logic, Language, Information, and Computation : 30th International Workshop, WoLLIC 2024, Bern, Switzerland, June 10-13, 2024, Proceedings |
| Autore | Metcalfe George |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing AG, , 2024 |
| Descrizione fisica | 1 online resource (309 pages) |
| Altri autori (Persone) |
StuderThomas
de QueirozRuy |
| Collana | Lecture Notes in Computer Science Series |
| ISBN |
9783031626876
9783031626869 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Invited Talks -- Model Theory of Gödel Logic -- Nøthing is Logical -- Probability and Nondeterminism with Multiset Semantics -- Theory and Practice of Uniform Interpolation -- Pride and Probability -- Contents -- Strict-Tolerant Conditional Logics -- 1 Introduction -- 2 Semantics -- 3 A Labelled Sequent Calculus for stC -- 4 Extensions -- 4.1 ID -- 4.2 MP -- 4.3 ID+MP -- 5 Connexivity -- 6 Conclusion -- References -- A Linear Proof Language for Second-Order Intuitionistic Linear Logic -- 1 Introduction -- 2 The LS2-Calculus -- 3 Correctness -- 4 Encodings -- 4.1 Vectors -- 4.2 Matrices -- 4.3 Matrix Iterator -- 5 Linearity -- 6 Conclusion -- A Proof of Section3 -- B Proof of Section5 -- References -- A Logic of Isolation -- 1 Introduction -- 2 Syntax, Proof System, and Relational Semantics -- 2.1 Axiom System -- 2.2 Relational Semantics -- 3 Neighborhood Semantics for Si -- 3.1 Semantic Insensitivities -- 3.2 Soundness and Completeness -- 4 Discrete Neighborhood Systems -- 4.1 Discrete Topologies -- 5 Conclusion and Future Work -- References -- A Simple Loopcheck for Intuitionistic K -- 1 Introduction -- 2 Preliminaries -- 3 Labelled Sequent Calculus labIKs -- 4 Models from Sequents -- 5 The Proof-Search Algorithm -- 6 Conclusions and Future Work -- A Proofs -- B Examples -- References -- A Compositional Theory of Krivine's Classical Realisability -- 1 Introduction -- 1.1 Conventions and Notations -- 1.2 Classical Compositional Truth -- 2 Classical Realisability -- 2.1 Classical Number Realisability -- 2.2 Compositional Theory for Realisability -- 3 Formalised Realisation of Peano Arithmetic -- 4 Proof-Theoretic Strength of Compositional Realisability -- 4.1 Compositional Realisability as Compositional Truth -- 4.2 Compositional Realisability with the Reflection Rule -- 5 Future Work.
A Well-Ordering Proof in Compositional Realisability -- References -- Intersection Types via Finite-Set Declarations -- 1 The Troublesome Intersection-Introduction Rule -- 2 Finite-Set Declarations and Encoding -Types -- 3 Extending the Syntax of the -cube -- 4 Implementing Intersection Types -- 4.1 Simple Examples -- 4.2 Typing Urzyczyn's Untypable Term -- 5 Conclusion -- References -- Syntactic Concept Lattice Models for Infinitary Action Logic -- 1 Introduction -- 2 Syntactic Concept Lattices -- 3 Completeness Proof and Corollaries -- 4 SCL-Models over a Two-Letter Alphabet -- 5 Regular SCL-Models -- References -- Rules of Partial Orthomodularity -- 1 Introduction -- 2 Preliminaries -- 3 Rules of Partial Orthomodularity -- 4 A Forbidden Subalgebra Theorem for Partial Orthomodularity -- 5 A Representation Theorem for Partial Orthomodularity -- 6 Related Work -- 7 Conclusion -- References -- Labelled Sequent Calculi for Inquisitive Modal Logics -- 1 Introduction -- 2 Inquisitive Modal Logic -- 3 Labelled Sequent Calculi for Inquisitive Modal Logics -- 4 Structural Properties -- 5 Soundness and Completeness -- 6 Conclusion -- A Proof of Theorem 1 -- B Derivations for Some of the Axioms from Figure1 -- C Derivations for the Special Axioms from Table1 -- References -- Correspondence Theory on Vector Spaces -- 1 Introduction -- 2 Preliminaries -- 2.1 Algebras over a Field and Their Complex Algebras -- 2.2 Analytic Inductive Inequalities in Residuated Lattices -- 3 Rewriting Analytic Inductive Inequalities -- 3.1 Analytic Inductive Shape in Residuated Lattices -- 3.2 Solving in the Positive Coordinates -- 3.3 From Analytic Inductive to Quasi Left Primitive -- 4 Correspondence -- 5 Conclusions -- A Examples -- References -- An EXPTIME-Complete Entailment Problem in Separation Logic -- 1 Introduction -- 2 Separation Logic with Inductive Definitions. 3 The Entailment Problem Ent(DSH,HC) -- 4 Abstracting Structures -- 5 Computing Abstractions -- 6 Conclusion -- A Proof of Lemma 4.10 -- B Proof of Lemma 4.11 -- C Proof of Lemma 5.3 -- D Proof of Lemma 5.5 -- References -- (In)consistency Operators on Quasi-Nelson Algebras -- 1 Introduction -- 2 Quasi-Nelson Logic and Algebras -- 3 Inconsistency Operators -- 3.1 The min and B min Operators -- 3.2 The min B Operator -- 3.3 Twist Representation -- 3.4 Filters and Congruences -- 4 Future Work -- 4.1 Consistency Operators -- 4.2 LFIs Based on Quasi-Nelson Algebras -- 4.3 (In)consistency Operators Beyond the Quasi-Nelson Setting -- References -- Lambek Calculus with Banged Atoms for Parasitic Gaps -- 1 Introduction -- 2 The System -- 3 Cut Elimination -- 4 A One-Sided System -- 5 Proof Nets -- 6 Decidability and Complexity -- 7 Application to Relativisation in Natural Language -- 8 Discussion and Conclusion -- A Appendix -- References -- Completeness of Finitely Weighted Kleene Algebra with Tests -- 1 Introduction -- 2 Semirings and Weighted Structures -- 3 Weighted Kleene Algebra with Tests -- 3.1 Kleene Algebras -- 3.2 Kleene Algebras with Tests -- 3.3 Weighted Programs -- 4 Language Completeness -- 4.1 Guarded Strings -- 4.2 The Language Completeness Result -- 5 Relational Completeness -- 5.1 Transition Systems -- 5.2 The Relational Completeness Result -- 6 Conclusion -- A Technical appendix -- A.1 Proof of Lemma 2 -- A.2 Proof of Theorem 3 -- References -- Modal Hyperdoctrine: Higher-Order and Non-normal Extensions -- 1 Introduction -- 2 Hyperdoctrine Semantics -- 3 Typed First-Order Non-normal Modal Logic -- 3.1 Term Calculus -- 3.2 Logical Calculus -- 4 Hyperdoctrine Semantics for TFOL + EX -- 4.1 Modal Hyperdoctrine Semantics -- 4.2 Soundness and Completeness -- 4.3 Hyperdoctrinal Translation Theorem for TFOL + S4. 5 Higher-Order Modal Hyperdoctrine -- 5.1 Higher-Order Modal Logic -- 5.2 Modal Tripos -- 5.3 Soundness and Completeness -- 6 Conclusion -- A Soundness of Modal Hyperdoctrine Semantics -- B Completeness of Modal Hyperdoctrine Semantics -- References -- Validity in Contexts -- 1 Introduction -- 2 McGee's Semantics and Three Forms of Inferences -- 2.1 McGee's Semantics -- 2.2 Three Forms of Inferences -- 3 A New Language and Semantics -- 3.1 Problems of McGee's Semantics -- 3.2 A New Language -- 3.3 A New Semantics -- 3.4 Semantic Properties -- 4 Applications -- 4.1 Modus Ponens -- 4.2 Or-to-If -- 4.3 Conditional Proof -- 4.4 Moore Sentences -- 4.5 Conditional Excluded Middle -- 4.6 Infelicitous Statements Involving Conditionals -- 5 Conclusion and Future Work -- References -- Logical Expressibility of Syntactic NL for Complementarity and Maximization -- 1 Background and Main Contributions -- 1.1 Motivational Discussion on Syntactic NL -- 1.2 Major Contributions -- 2 Basic Notions and Notation -- 2.1 Numbers, Machines, and Reducibility -- 2.2 Syntactic NL (or SNL) -- 3 Structural Properties of SNL -- 3.1 Basic Closure Properties and L-m-Reductions -- 3.2 Complementary Problems and SNL -- 4 Maximal SNL (or MAXSNL) -- 5 Brief Conclusion and Open Questions -- References -- Polyadic Quantifiers on Dependent Types -- 1 Introduction -- 1.1 Dependent Types -- 1.2 Polyadic Quantifiers -- 1.3 Polyadic Quantifiers on Dependent Types -- 1.4 Previous Work -- 2 Fibrations -- 2.1 Basic Fibration of a Topos -- 2.2 Cartesian Monads over a Topos -- 3 Strengths on a Cartesian Monad -- 3.1 Strength -- 3.2 Right Strength -- 3.3 Left Strength -- 3.4 Pile'up -- 3.5 Case Study: Continuation Monad on the Fundamental Fibration of Set -- 4 Conclusion -- References -- Author Index. |
| Record Nr. | UNINA-9910865249003321 |
Metcalfe George
|
||
| Cham : , : Springer International Publishing AG, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Logic, Language, Information, and Computation [[electronic resource] ] : 26th International Workshop, WoLLIC 2019, Utrecht, The Netherlands, July 2-5, 2019, Proceedings / / edited by Rosalie Iemhoff, Michael Moortgat, Ruy de Queiroz
| Logic, Language, Information, and Computation [[electronic resource] ] : 26th International Workshop, WoLLIC 2019, Utrecht, The Netherlands, July 2-5, 2019, Proceedings / / edited by Rosalie Iemhoff, Michael Moortgat, Ruy de Queiroz |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XXI, 662 p. 1480 illus., 29 illus. in color.) |
| Disciplina | 005.131 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science Algorithms Software engineering Artificial intelligence Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Software Engineering Artificial Intelligence |
| ISBN | 3-662-59533-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Formal Logic. Computing. Programming Theory -- Natural Language -- Reasoning. |
| Record Nr. | UNISA-996466311903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logic, Language, Information, and Computation : 26th International Workshop, WoLLIC 2019, Utrecht, The Netherlands, July 2-5, 2019, Proceedings / / edited by Rosalie Iemhoff, Michael Moortgat, Ruy de Queiroz
| Logic, Language, Information, and Computation : 26th International Workshop, WoLLIC 2019, Utrecht, The Netherlands, July 2-5, 2019, Proceedings / / edited by Rosalie Iemhoff, Michael Moortgat, Ruy de Queiroz |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XXI, 662 p. 1480 illus., 29 illus. in color.) |
| Disciplina | 005.131 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science Algorithms Software engineering Artificial intelligence Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Software Engineering Artificial Intelligence |
| ISBN | 3-662-59533-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Formal Logic. Computing. Programming Theory -- Natural Language -- Reasoning. |
| Record Nr. | UNINA-9910337843203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Logic, Language, Information, and Computation [[electronic resource] ] : 25th International Workshop, WoLLIC 2018, Bogota, Colombia, July 24-27, 2018, Proceedings / / edited by Lawrence S. Moss, Ruy de Queiroz, Maricarmen Martinez
| Logic, Language, Information, and Computation [[electronic resource] ] : 25th International Workshop, WoLLIC 2018, Bogota, Colombia, July 24-27, 2018, Proceedings / / edited by Lawrence S. Moss, Ruy de Queiroz, Maricarmen Martinez |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XVIII, 325 p. 29 illus.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Artificial intelligence Computer programming Compilers (Computer programs) Software engineering Numerical analysis Formal Languages and Automata Theory Artificial Intelligence Programming Techniques Compilers and Interpreters Software Engineering Numerical Analysis |
| ISBN | 3-662-57669-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465708703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logic, Language, Information, and Computation : 25th International Workshop, WoLLIC 2018, Bogota, Colombia, July 24-27, 2018, Proceedings / / edited by Lawrence S. Moss, Ruy de Queiroz, Maricarmen Martinez
| Logic, Language, Information, and Computation : 25th International Workshop, WoLLIC 2018, Bogota, Colombia, July 24-27, 2018, Proceedings / / edited by Lawrence S. Moss, Ruy de Queiroz, Maricarmen Martinez |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XVIII, 325 p. 29 illus.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Artificial intelligence Computer programming Compilers (Computer programs) Software engineering Numerical analysis Formal Languages and Automata Theory Artificial Intelligence Programming Techniques Compilers and Interpreters Software Engineering Numerical Analysis |
| ISBN | 3-662-57669-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910349430703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Logic, Language, Information, and Computation [[electronic resource] ] : 23rd International Workshop, WoLLIC 2016, Puebla, Mexico, August 16-19th, 2016. Proceedings / / edited by Jouko Väänänen, Åsa Hirvonen, Ruy de Queiroz
| Logic, Language, Information, and Computation [[electronic resource] ] : 23rd International Workshop, WoLLIC 2016, Puebla, Mexico, August 16-19th, 2016. Proceedings / / edited by Jouko Väänänen, Åsa Hirvonen, Ruy de Queiroz |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XXII, 447 p. 32 illus.) |
| Disciplina | 005.131 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Artificial intelligence Computer science—Mathematics Computer science Algorithms Formal Languages and Automata Theory Artificial Intelligence Symbolic and Algebraic Manipulation Computer Science Logic and Foundations of Programming |
| ISBN | 3-662-52921-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Formal logic -- Computing. -Programming theory -- Natural language and reasoning. |
| Record Nr. | UNISA-996465308203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logic, Language, Information, and Computation : 23rd International Workshop, WoLLIC 2016, Puebla, Mexico, August 16-19th, 2016. Proceedings / / edited by Jouko Väänänen, Åsa Hirvonen, Ruy de Queiroz
| Logic, Language, Information, and Computation : 23rd International Workshop, WoLLIC 2016, Puebla, Mexico, August 16-19th, 2016. Proceedings / / edited by Jouko Väänänen, Åsa Hirvonen, Ruy de Queiroz |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XXII, 447 p. 32 illus.) |
| Disciplina | 005.131 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Artificial intelligence Computer science—Mathematics Computer science Algorithms Formal Languages and Automata Theory Artificial Intelligence Symbolic and Algebraic Manipulation Computer Science Logic and Foundations of Programming |
| ISBN | 3-662-52921-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Formal logic -- Computing. -Programming theory -- Natural language and reasoning. |
| Record Nr. | UNINA-9910484554503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
