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.
Algebraic Methodology and Software Technology : 9th International Conference, AMAST 2002, Saint-Gilles-les- Bains, Reunion Island, France, September 9-13, 2002. Proceedings / / edited by Helene Kirchner, Christophe Ringeissen
| Algebraic Methodology and Software Technology : 9th International Conference, AMAST 2002, Saint-Gilles-les- Bains, Reunion Island, France, September 9-13, 2002. Proceedings / / edited by Helene Kirchner, Christophe Ringeissen |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (XII, 508 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Software engineering Algebra Computer logic Logic, Symbolic and mathematical Theory of Computation Software Engineering/Programming and Operating Systems Logics and Meanings of Programs Mathematical Logic and Formal Languages Software Engineering |
| ISBN | 3-540-45719-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- From Specifications to Code in Casl -- Automata and Games for Synthesis -- Pragmatics of Modular SOS -- Tool-Assisted Specification and Verification of the JavaCard Platform -- Higher-Order Quantification and Proof Search* -- Algebraic Support for Service-Oriented Architecture -- Regular Papers -- Fully Automatic Adaptation of Software Components Based on Semantic Specifications* -- HasCasl: Towards Integrated Specification and Development of Functional Programs -- Removing Redundant Arguments of Functions* -- A Class of Decidable Parametric Hybrid Systems -- Vacuity Checking in the Modal Mu-Calculus* -- On Solving Temporal Logic Queries -- Modelling Concurrent Behaviours by Commutativity and Weak Causality Relations* -- An Algebra of Non-safe Petri Boxes -- Refusal Simulation and Interactive Games -- A Theory of May Testing for Asynchronous Calculi with Locality and No Name Matching -- Equational Axioms for Probabilistic Bisimilarity -- Bisimulation by Unification* -- Transforming Processes to Check and Ensure Information Flow Security* -- On Bisimulations for the Spi Calculus* -- Specifying and Verifying a Decimal Representation in Java for Smart Cards* -- A Method for Secure Smartcard Applications -- Extending JML Specifications with Temporal Logic -- Algebraic Dynamic Programming -- Analyzing String Buffers in C -- A Foundation of Escape Analysis* -- A Framework for Order-Sorted Algebra -- Guarded Transitions in Evolving Specifications -- Revisiting the Categorical Approach to Systems* -- Proof Transformations for Evolutionary Formal Software Development -- Sharing Objects by Read-Only References -- Class-Based versus Object-Based: A Denotational Comparison -- System Descriptions -- BRAIN: Backward Reachability Analysis with Integers -- The Development Graph Manager Maya. |
| Record Nr. | UNINA-9910768450903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algebraic Methodology and Software Technology : 8th International Conference, AMAST 2000 Iowa City, Iowa, USA, May 20-27, 2000 Proceedings / / edited by Teodor Rus
| Algebraic Methodology and Software Technology : 8th International Conference, AMAST 2000 Iowa City, Iowa, USA, May 20-27, 2000 Proceedings / / edited by Teodor Rus |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XI, 545 p.) |
| Disciplina | 005.1/01/512 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Data structures (Computer science) Algebra Computer logic Software engineering Logic, Symbolic and mathematical Theory of Computation Data Structures and Information Theory Logics and Meanings of Programs Software Engineering Mathematical Logic and Formal Languages |
| ISBN | 3-540-45499-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Education Day -- Invited Talk: A Software Engineering Program of Lasting Value (Abstract) -- Invited Talk: Weaving Formal Methods into the Undergraduate Computer Science Curriculum (Extended Abstract) -- Technical Meetings -- Invited Talk: Making Mathematical Methods More Practical for Software Developers (Abstract) -- Step by Step to Histories -- Distance Functions for Defaults in Reactive Systems -- Generalizing the Modal and Temporal Logic of Linear Time -- Process Algebra versus Axiomatic Specification of a Real-Time Protocol -- Practical Application of Functional and Relational Methods for the Specification and Verification of Safety Critical Software -- Algebraic State Machines -- Meta Languages in Algebraic Compilers -- Random Access to Abstract Data Types -- A Monad for Basic Java Semantics -- A Global Semantics for Views -- Analysis of Downward Closed Properties of Logic Programs -- Invited Talk: ASM Formalware in the Software Engineering Cycle -- Process Calculi for Coordination: From Linda to JavaSpaces -- The Algebra of Multi-tasking -- A Causal Semantics for Timed Default Concurrent Constraint Programming -- Casl-Chart: A Combination of Statecharts and of the Algebraic Specification Language Casl -- Message Authentication through Non Interference -- Plugging Data Constructs into Paradigm-Specific Languages: Towards an Application to UML -- An ASM Semantics for UML Activity Diagrams -- Approximate Bisimilarity -- Time and Probability in Process Algebra -- A Modal Logic for Klaim -- Kleene under a Demonic Star -- Pointwise Relational Programming -- Towards a Toolkit for Actor System Specification -- Maude Action Tool: Using Reflection to Map Action Semantics to Rewriting Logic -- The Extensibility of Maude’s Module Algebra -- A Reuse-Oriented Framework for Hierarchical Specifications -- MIX(FL): A Kernel Language of Mixin Modules -- Behavioural Subtyping Relations for Object-Oriented Formalisms -- Applying Category Theory to Derive Engineering Software from Encoded Knowledge -- A New Logic for Electronic Commerce Protocols -- Extended Institutions for Testing -- Testing from Structured Algebraic Specifications. |
| Record Nr. | UNINA-9910143631003321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algebraic Methodology and Software Technology [[electronic resource] ] : 6th International Conference, AMAST '97, Sydney, Australia, Dezember 13-17, 1997. Proceedings / / edited by Michael Johnson
| Algebraic Methodology and Software Technology [[electronic resource] ] : 6th International Conference, AMAST '97, Sydney, Australia, Dezember 13-17, 1997. Proceedings / / edited by Michael Johnson |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (X, 602 p.) |
| Disciplina | 005.1/01/512 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computers Computer logic Computers, Special purpose Logic, Symbolic and mathematical Software Engineering/Programming and Operating Systems Theory of Computation Software Engineering Logics and Meanings of Programs Special Purpose and Application-Based Systems Mathematical Logic and Formal Languages |
| ISBN | 3-540-69661-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Software configuration with information systems -- Head-tactics simplification -- Iteration 2-theories: Extended Abstract -- Model checking and fault tolerance -- Deadlock analysis for a fault-tolerant system -- From sequential to multi-threaded Java: An event-based operational semantics -- Permissive subsorted partial logic in CASL -- Specification of timing constraints within the circal process algebra -- On the specification and verification of performance properties for a timed process algebra -- Abstract interpretation of algebraic polynomial systems (Extended abstract) -- Modular refinement and model building -- A linear temporal logic approach to objects with transactions -- Software design, specification, and verification: Lessons learned from the Rether case study -- Refinement rules for real-time multi-tasking programs -- Rigorous object-oriented modeling: Integrating formal and informal notations -- Completeness in abstract interpretation: A domain perspective -- Floating point verification in HOL light: The exponential function -- Verification of distributed real-time and fault-tolerant protocols -- Invariants, bisimulations and the correctness of coalgebraic refinements -- On bisimulation, fault-monotonicity and provable fault-tolerance -- Span(Graph): A categorical algebra of transition systems -- Representing place/transition nets in Span(Graph) -- Invariants of parameterized binary tree networks as greatest fixpoints -- Modelling specification construction by successive approximations -- On partial validation of logic programs -- Preservation and reflection in specification -- Case studies in using a meta-method for formal method integration -- The update calculus -- Selective attribute elimination for categorical data specifications -- ATM switch design: Parametric high-level modeling and formal verification -- The hidden function question revisited -- Synchronization of logics with mixed rules: Completeness preservation -- Symbolic bisimulation for Full LOTOS -- Algebraic composition and refinement of proofs -- Ensuring streams flow -- Extending process languages with time -- Parametric analysis of computer systems -- CAMILA: Prototyping and refinement of constructive specifications -- PAMELA+PVS -- The circal system -- A refinement-type checker for standard ML -- Recording HOL proofs in a structured browsable format -- Analysing multi-agent system traces with IDaF -- DOVE: A tool for design oriented verification and evaluation -- The B method and the B toolkit -- An algebraic language processing environment -- The Cogito development system. |
| Record Nr. | UNINA-9910144902403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algebraic perspectives on substructural logics / / Davide Fazio, Antonio Ledda, Francesco Paoli, editors
| Algebraic perspectives on substructural logics / / Davide Fazio, Antonio Ledda, Francesco Paoli, editors |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2021] |
| Descrizione fisica | 1 online resource (X, 193 p. 25 illus.) |
| Disciplina | 511.3 |
| Collana | Trends in logic |
| Soggetto topico |
Logic, Symbolic and mathematical
Algebra, Abstract |
| ISBN | 3-030-52163-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Chapter 1. Introduction -- Chapter 2. Distributivity and Varlet Distributivity (Paolo Aglianò) -- Chapter 3. On Distributive Join Semilattices (Rodolfo C. Ertola-Biraben, Francesc Esteva, and Lluìs Godo) -- Chapter 4. Implication in Weakly and Dually Weakly Orthomodular Lattices (Ivan Chajda, Helmut Länger) -- Chapter 5. Residuated Operators And Dedekind-Macneille Completion (Ivan Chajda, Helmut Länger, Jan Paseka) -- Chapter 6. Pbz* -Lattices: Ordinal And Horizontal Sums (Roberto Giuntini, Claudia Murešan, Francesco Paoli) -- Chapter 7. Emv-Algebras - Extended MV-Algebras (Anatolij Dvurečenskij, Omid Zahiri) -- Chapter 8. Quasi-Nelson; or, Non-Involutive Nelson Algebras (Umberto Rivieccio, Matthew Spinks) -- Chapter 9. Hyperdoctrines and the Ontology of Stratified Semantics (Shay Allen Logan). |
| Record Nr. | UNINA-9910483349103321 |
| Cham, Switzerland : , : Springer, , [2021] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithmic composition [e-book] : paradigms of automated music generation / by Gerhard Nierhaus
| Algorithmic composition [e-book] : paradigms of automated music generation / by Gerhard Nierhaus |
| Autore | Nierhaus, Gerhard |
| Pubbl/distr/stampa | Vienna : Springer, 2009 |
| Descrizione fisica | v.: digital |
| Soggetto topico |
Algorithms
Computer science - Mathematics Information systems Logic, Symbolic and mathematical Mathematics Music |
| ISBN | 9783211755402 |
| Formato | Software  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991000526099707536 |
Nierhaus, Gerhard
|
||
| Vienna : Springer, 2009 | ||
| Software | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Algorithmic Learning Theory : 24th International Conference, ALT 2013, Singapore, October 6-9, 2013, Proceedings / / edited by Sanjay Jain, Rémi Munos, Frank Stephan, Thomas Zeugmann
| Algorithmic Learning Theory : 24th International Conference, ALT 2013, Singapore, October 6-9, 2013, Proceedings / / edited by Sanjay Jain, Rémi Munos, Frank Stephan, Thomas Zeugmann |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVIII, 397 p. 30 illus.) |
| Disciplina | 006.31 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Logic, Symbolic and mathematical Algorithms Computers Computer logic Pattern perception Artificial Intelligence Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity Computation by Abstract Devices Logics and Meanings of Programs Pattern Recognition |
| ISBN | 3-642-40935-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Editors’ Introduction -- Learning and Optimizing with Preferences -- Efficient Algorithms for Combinatorial Online Prediction -- Exact Learning from Membership Queries: Some Techniques, Results and New Directions -- Online Learning Universal Algorithm for Trading in Stock Market Based on the Method of Calibration -- Combinatorial Online Prediction via Metarounding -- On Competitive Recommendations -- Online PCA with Optimal Regrets -- Inductive Inference and Grammatical Inference Partial Learning of Recursively Enumerable Languages -- Topological Separations in Inductive Inference -- PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data -- Universal Knowledge-Seeking Agents for Stochastic Environments -- Teaching and Learning from Queries Order Compression Schemes -- Learning a Bounded-Degree Tree Using Separator Queries -- Faster Hoeffding Racing: Bernstein Races via Jackknife Estimates -- Robust Risk-Averse Stochastic Multi-armed Bandits -- An Efficient Algorithm for Learning with Semi-bandit Feedback -- Differentially-Private Learning of Low Dimensional Manifolds -- Generalization and Robustness of Batched Weighted Average Algorithm with V-Geometrically Ergodic Markov Data -- Adaptive Metric Dimensionality Reduction -- Dimension-Adaptive Bounds on Compressive FLD Classification -- Bayesian Methods for Low-Rank Matrix Estimation: Short Survey and Theoretical Study -- Concentration and Confidence for Discrete Bayesian Sequence Predictors -- Algorithmic Connections between Active Learning and Stochastic Convex Optimization -- Unsupervised/Semi-Supervised Learning Unsupervised Model-Free Representation Learning -- Fast Spectral Clustering via the Nyström Method -- Nonparametric Multiple Change Point Estimation in Highly Dependent Time Series. |
| Record Nr. | UNINA-9910484834203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithmic Learning Theory : 15th International Conference, ALT 2004, Padova, Italy, October 2-5, 2004. Proceedings / / edited by Shai Ben David, John Case, Akira Maruoka
| Algorithmic Learning Theory : 15th International Conference, ALT 2004, Padova, Italy, October 2-5, 2004. Proceedings / / edited by Shai Ben David, John Case, Akira Maruoka |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XIV, 514 p.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Computers Algorithms Logic, Symbolic and mathematical Natural language processing (Computer science) Artificial Intelligence Computation by Abstract Devices Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages Natural Language Processing (NLP) |
| ISBN | 3-540-30215-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- String Pattern Discovery -- Applications of Regularized Least Squares to Classification Problems -- Probabilistic Inductive Logic Programming -- Hidden Markov Modelling Techniques for Haplotype Analysis -- Learning, Logic, and Probability: A Unified View -- Regular Contributions -- Learning Languages from Positive Data and Negative Counterexamples -- Inductive Inference of Term Rewriting Systems from Positive Data -- On the Data Consumption Benefits of Accepting Increased Uncertainty -- Comparison of Query Learning and Gold-Style Learning in Dependence of the Hypothesis Space -- Learning r-of-k Functions by Boosting -- Boosting Based on Divide and Merge -- Learning Boolean Functions in AC 0 on Attribute and Classification Noise -- Decision Trees: More Theoretical Justification for Practical Algorithms -- Application of Classical Nonparametric Predictors to Learning Conditionally I.I.D. Data -- Complexity of Pattern Classes and Lipschitz Property -- On Kernels, Margins, and Low-Dimensional Mappings -- Estimation of the Data Region Using Extreme-Value Distributions -- Maximum Entropy Principle in Non-ordered Setting -- Universal Convergence of Semimeasures on Individual Random Sequences -- A Criterion for the Existence of Predictive Complexity for Binary Games -- Full Information Game with Gains and Losses -- Prediction with Expert Advice by Following the Perturbed Leader for General Weights -- On the Convergence Speed of MDL Predictions for Bernoulli Sequences -- Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm -- On the Complexity of Working Set Selection -- Convergence of a Generalized Gradient Selection Approach for the Decomposition Method -- Newton Diagram and Stochastic Complexity in Mixture of Binomial Distributions -- Learnability of Relatively Quantified Generalized Formulas -- Learning Languages Generated by Elementary Formal Systems and Its Application to SH Languages -- New Revision Algorithms -- The Subsumption Lattice and Query Learning -- Learning of Ordered Tree Languages with Height-Bounded Variables Using Queries -- Learning Tree Languages from Positive Examples and Membership Queries -- Learning Content Sequencing in an Educational Environment According to Student Needs -- Tutorial Papers -- Statistical Learning in Digital Wireless Communications -- A BP-Based Algorithm for Performing Bayesian Inference in Large Perceptron-Type Networks -- Approximate Inference in Probabilistic Models. |
| Record Nr. | UNINA-9910144344903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithmic Learning Theory : 14th International Conference, ALT 2003, Sapporo, Japan, October 17-19, 2003, Proceedings / / edited by Ricard Gavaldà, Klaus P. Jantke, Eiji Takimoto
| Algorithmic Learning Theory : 14th International Conference, ALT 2003, Sapporo, Japan, October 17-19, 2003, Proceedings / / edited by Ricard Gavaldà, Klaus P. Jantke, Eiji Takimoto |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (XII, 320 p.) |
| Disciplina | 006.3/1 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Computers Algorithms Logic, Symbolic and mathematical Natural language processing (Computer science) Artificial Intelligence Computation by Abstract Devices Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages Natural Language Processing (NLP) |
| ISBN | 3-540-39624-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Abduction and the Dualization Problem -- Signal Extraction and Knowledge Discovery Based on Statistical Modeling -- Association Computation for Information Access -- Efficient Data Representations That Preserve Information -- Can Learning in the Limit Be Done Efficiently? -- Inductive Inference -- Intrinsic Complexity of Uniform Learning -- On Ordinal VC-Dimension and Some Notions of Complexity -- Learning of Erasing Primitive Formal Systems from Positive Examples -- Changing the Inference Type – Keeping the Hypothesis Space -- Learning and Information Extraction -- Robust Inference of Relevant Attributes -- Efficient Learning of Ordered and Unordered Tree Patterns with Contractible Variables -- Learning with Queries -- On the Learnability of Erasing Pattern Languages in the Query Model -- Learning of Finite Unions of Tree Patterns with Repeated Internal Structured Variables from Queries -- Learning with Non-linear Optimization -- Kernel Trick Embedded Gaussian Mixture Model -- Efficiently Learning the Metric with Side-Information -- Learning Continuous Latent Variable Models with Bregman Divergences -- A Stochastic Gradient Descent Algorithm for Structural Risk Minimisation -- Learning from Random Examples -- On the Complexity of Training a Single Perceptron with Programmable Synaptic Delays -- Learning a Subclass of Regular Patterns in Polynomial Time -- Identification with Probability One of Stochastic Deterministic Linear Languages -- Online Prediction -- Criterion of Calibration for Transductive Confidence Machine with Limited Feedback -- Well-Calibrated Predictions from Online Compression Models -- Transductive Confidence Machine Is Universal -- On the Existence and Convergence of Computable Universal Priors. |
| Record Nr. | UNINA-9910144028803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithmic Learning Theory : 12th International Conference, ALT 2001, Washington, DC, USA, November 25-28, 2001. Proceedings. / / edited by Naoki Abe, Roni Khardon, Thomas Zeugmann
| Algorithmic Learning Theory : 12th International Conference, ALT 2001, Washington, DC, USA, November 25-28, 2001. Proceedings. / / edited by Naoki Abe, Roni Khardon, Thomas Zeugmann |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XII, 388 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Computer programming
Artificial intelligence Computers Algorithms Logic, Symbolic and mathematical Natural language processing (Computer science) Programming Techniques Artificial Intelligence Computation by Abstract Devices Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages Natural Language Processing (NLP) |
| ISBN | 3-540-45583-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Editors’ Introduction -- Editors’ Introduction -- Invited Papers -- The Discovery Science Project in Japan -- Queries Revisited -- Robot Baby 2001 -- Discovering Mechanisms: A Computational Philosophy of Science Perspective -- Inventing Discovery Tools: Combining Information Visualization with Data Mining -- Complexity of Learning -- On Learning Correlated Boolean Functions Using Statistical Queries (Extended Abstract) -- A Simpler Analysis of the Multi-way Branching Decision Tree Boosting Algorithm -- Minimizing the Quadratic Training Error of a Sigmoid Neuron Is Hard -- Support Vector Machines -- Learning of Boolean Functions Using Support Vector Machines -- A Random Sampling Technique for Training Support Vector Machines -- New Learning Models -- Learning Coherent Concepts -- Learning Intermediate Concepts -- Real-Valued Multiple-Instance Learning with Queries -- Online Learning -- Loss Functions, Complexities, and the Legendre Transformation -- Non-linear Inequalities between Predictive and Kolmogorov Complexities -- Inductive Inference -- Learning by Switching Type of Information -- Learning How to Separate -- Learning Languages in a Union -- On the Comparison of Inductive Inference Criteria for Uniform Learning of Finite Classes -- Refutable Inductive Inference -- Refutable Language Learning with a Neighbor System -- Learning Recursive Functions Refutably -- Refuting Learning Revisited -- Learning Structures and Languages -- Efficient Learning of Semi-structured Data from Queries -- Extending Elementary Formal Systems -- Learning Regular Languages Using RFSA -- Inference of ?-Languages from Prefixes. |
| Record Nr. | UNINA-9910767574803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithmic Learning Theory [[electronic resource] ] : 8th International Workshop, ALT '97, Sendai, Japan, October 6-8, 1997. Proceedings / / edited by Ming Li, Akira Maruoka
| Algorithmic Learning Theory [[electronic resource] ] : 8th International Workshop, ALT '97, Sendai, Japan, October 6-8, 1997. Proceedings / / edited by Ming Li, Akira Maruoka |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XIV, 470 p.) |
| Disciplina | 006.3/1 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Logic, Symbolic and mathematical Artificial Intelligence Mathematical Logic and Formal Languages |
| ISBN | 3-540-69602-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Program error detection/correction: Turning PAC learning into Perfect learning -- Team learning as a game -- Inferability of recursive real-valued functions -- Learning of R.E. Languages from good examples -- Identifiability of subspaces and homomorphic images of zero-reversible languages -- On exploiting knowledge and concept use in learning theory -- Partial occam's razor and its applications -- Derandomized learning of boolean functions -- Learning DFA from simple examples -- PAC learning under helpful distributions -- PAC learning using Nadaraya-Watson estimator based on orthonormal systems -- Monotone extensions of boolean data sets -- Classical Brouwer-Heyting-Kolmogorov interpretation -- Inferring a system from examples with time passage -- Polynomial time inductive inference of regular term tree languages from positive data -- Synthesizing noise-tolerant language learners -- Effects of Kolmogorov complexity present in inductive inference as well -- Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries -- Oracles in ? 2 p are sufficient for exact learning -- Exact learning via teaching assistants (Extended abstract) -- An efficient exact learning algorithm for ordered binary decision diagrams -- Probability theory for the Brier game -- Learning and revising theories in noisy domains -- A note on a scale-sensitive dimension of linear bounded functionals in Banach Spaces -- On the relevance of time in neural computation and learning -- A simple algorithm for predicting nearly as well as the best pruning labeled with the best prediction values of a decision tree -- Learning disjunctions of features -- Learning simple deterministic finite-memory automata -- Learning acyclic first-order horn sentences from entailment -- On learning disjunctions of zero-one threshold functions with queries. |
| Record Nr. | UNINA-9910768453403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
