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.
Algorithmic Learning for Knowledge-Based Systems [[electronic resource] ] : GOSLER Final Report / / edited by Klaus P. Jantke, Steffen Lange
| Algorithmic Learning for Knowledge-Based Systems [[electronic resource] ] : GOSLER Final Report / / edited by Klaus P. Jantke, Steffen Lange |
| Edizione | [1st ed. 1995.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Descrizione fisica | 1 online resource (X, 522 p.) |
| Disciplina | 006.3/3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Computers
Artificial intelligence Mathematical logic Theory of Computation Artificial Intelligence Mathematical Logic and Formal Languages |
| ISBN | 3-540-44737-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Learning and consistency -- Error detecting in inductive inference -- Learning from good examples -- Towards reduction arguments for FINite learning -- Not-so-nearly-minimal-size program inference (preliminary report) -- Optimization problem in inductive inference -- On identification by teams and probabilistic machines -- Topological considerations in composing teams of learning machines -- Probabilistic versus deterministic memory limited learning -- Classification using information -- Classifying recursive predicates and languages -- A guided tour across the boundaries of learning recursive languages -- Pattern inference -- Inductive learning of recurrence-term languages from positive data -- Learning formal languages based on control sets -- Learning in case-based classification algorithms -- Optimal strategies — Learning from examples — Boolean equations -- Feature construction during tree learning -- On lower bounds for the depth of threshold circuits with weights from {?1,0,+1} -- Structuring neural networks and PAC-Learning -- Inductive synthesis of rewrite programs -- TLPS — A term rewriting laboratory (not only) for experiments in automatic program synthesis -- GoslerP — A logic programming tool for inductive inference. |
| Record Nr. | UNISA-996466130703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithmic Learning Theory [[electronic resource] ] : 14th International Conference, ALT 2003, Sapporo, Japan, October 17-19, 2003, Proceedings / / edited by Ricard Gavaldà, Klaus P. Jantke, Eiji Takimoto
| Algorithmic Learning Theory [[electronic resource] ] : 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 Mathematical logic 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. | UNISA-996465796603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
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 Mathematical logic 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 [[electronic resource] ] : 6th International Workshop, ALT '95, Fukuoka, Japan, October 18 - 20, 1995. Proceedings / / edited by Klaus P. Jantke, Takeshi Shinohara, Thomas Zeugmann
| Algorithmic Learning Theory [[electronic resource] ] : 6th International Workshop, ALT '95, Fukuoka, Japan, October 18 - 20, 1995. Proceedings / / edited by Klaus P. Jantke, Takeshi Shinohara, Thomas Zeugmann |
| Edizione | [1st ed. 1995.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Descrizione fisica | 1 online resource (XV, 324 p.) |
| Disciplina | 006.3/1 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Computers Artificial Intelligence Theory of Computation |
| ISBN | 3-540-47470-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Grammatical inference: An old and new paradigm -- Efficient learning of real time one-counter automata -- Learning strongly deterministic even linear languages from positive examples -- Language learning from membership queries and characteristic examples -- Learning unions of tree patterns using queries -- Inductive constraint logic -- Incremental learning of logic programs -- Learning orthogonal F-Horn formulas -- Learning nested differences in the presence of malicious noise -- Learning sparse linear combinations of basis functions over a finite domain -- Inferring a DNA sequence from erroneous copies (abstract) -- Machine induction without revolutionary paradigm shifts -- Probabilistic language learning under monotonicity constraints -- Noisy inference and oracles -- Simulating teams with many conjectures -- Complexity of network training for classes of Neural Networks -- Learning ordered binary decision diagrams -- Simple PAC learning of simple decision lists -- The complexity of learning minor closed graph classes -- Technical and scientific issues of KDD (or: Is KDD a science?) -- Analogical logic program synthesis algorithm that can refute inappropriate similarities -- Reflecting and self-confident inductive inference machines -- On approximately identifying concept classes in the limit -- Application of kolmogorov complexity to inductive inference with limited memory. |
| Record Nr. | UNISA-996466114403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithmic Learning Theory [[electronic resource] ] : 4th International Workshop on Analogical and Inductive Inference, AII '94, 5th International Workshop on Algorithmic Learning Theory, ALT '94, Reinhardsbrunn Castle, Germany, October 10 - 15, 1994. Proceedings / / edited by Setsuo Arikawa, Klaus P. Jantke
| Algorithmic Learning Theory [[electronic resource] ] : 4th International Workshop on Analogical and Inductive Inference, AII '94, 5th International Workshop on Algorithmic Learning Theory, ALT '94, Reinhardsbrunn Castle, Germany, October 10 - 15, 1994. Proceedings / / edited by Setsuo Arikawa, Klaus P. Jantke |
| Edizione | [1st ed. 1994.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 |
| Descrizione fisica | 1 online resource (XV, 581 p.) |
| Disciplina | 006.3/3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Computers
Artificial intelligence Mathematical logic Theory of Computation Artificial Intelligence Mathematical Logic and Formal Languages |
| ISBN | 3-540-49030-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Towards efficient inductive synthesis from input/output examples -- Deductive plan generation -- From specifications to programs: Induction in the service of synthesis -- Average case analysis of pattern language learning algorithms -- Enumerable classes of total recursive functions: Complexity of inductive inference -- Derived sets and inductive inference -- Therapy plan generation as program synthesis -- A calculus for logical clustering -- Learning with higher order additional information -- Efficient learning of regular expressions from good examples -- Identifying nearly minimal Gödel numbers from additional information -- Co-learnability and FIN-identifiability of enumerable classes of total recursive functions -- On case-based represent ability and learnability of languages -- Rule-generating abduction for recursive prolog -- Fuzzy analogy based reasoning and classification of fuzzy analogies -- Explanation-based reuse of prolog programs -- Constructive induction for recursive programs -- Training digraphs -- Towards realistic theories of learning -- A unified approach to inductive logic and case-based reasoning -- Three decades of team learning -- On-line learning with malicious noise and the closure algorithm -- Learnability with restricted focus of attention guarantees noise-tolerance -- Efficient algorithm for learning simple regular expressions from noisy examples -- A note on learning DNF formulas using equivalence and incomplete membership queries -- Identifying regular languages over partially-commutative monoids -- Classification using information -- Learning from examples with typed equational programming -- Finding tree patterns consistent with positive and negative examples using queries -- Program synthesis in the presence of infinite number of inaccuracies -- On monotonic strategies for learning r.e. languages -- Language learning under various types of constraint combinations -- Synthesis algorithm for recursive processes by ?-calculus -- Monotonicity versus efficiency for learning languages from texts -- Learning concatenations of locally testable languages from positive data -- Language learning from good examples -- Machine discovery in the presence of incomplete or ambiguous data -- Set-driven and rearrangement-independent learning of recursive languages -- Refutably probably approximately correct learning -- Inductive inference of an approximate concept from positive data -- Efficient distribution-free population learning of simple concepts -- Constructing predicate mappings for Goal-Dependent Abstraction -- Learning languages by collecting cases and tuning parameters -- Mutual information gaining algorithm and its relation to PAC-learning algorithm -- Inductive inference of monogenic pure context-free languages. |
| Record Nr. | UNISA-996466096003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithmic Learning Theory [[electronic resource] ] : 4th International Workshop, ALT '93, Tokyo, Japan, November 8-10, 1993. Proceedings / / edited by Klaus P. Jantke, Shigenobu Kobayashi, Etsuji Tomita, Takashi Yokomori
| Algorithmic Learning Theory [[electronic resource] ] : 4th International Workshop, ALT '93, Tokyo, Japan, November 8-10, 1993. Proceedings / / edited by Klaus P. Jantke, Shigenobu Kobayashi, Etsuji Tomita, Takashi Yokomori |
| Edizione | [1st ed. 1993.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 |
| Descrizione fisica | 1 online resource (XI, 428 p.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Mathematics Computers Artificial Intelligence Mathematics, general Theory of Computation Computation by Abstract Devices |
| ISBN | 3-540-48096-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Identifying and using patterns in sequential data -- Learning theory toward Genome Informatics -- Optimal layered learning: A PAC approach to incremental sampling -- Reformulation of explanation by linear logic toward logic for explanation -- Towards efficient inductive synthesis of expressions from input/output examples -- A typed ?-calculus for proving-by-example and bottom-up generalization procedure -- Case-based representation and learning of pattern languages -- Inductive resolution -- Generalized unification as background knowledge in learning logic programs -- Inductive inference machines that can refute hypothesis spaces -- On the duality between mechanistic learners and what it is they learn -- On aggregating teams of learning machines -- Learning with growing quality -- Use of reduction arguments in determining Popperian FIN-type learning capabilities -- Properties of language classes with finite elasticity -- Uniform characterizations of various kinds of language learning -- How to invent characterizable inference methods for regular languages -- Neural Discriminant Analysis -- A new algorithm for automatic configuration of Hidden Markov Models -- On the VC-dimension of depth four threshold circuits and the complexity of Boolean-valued functions -- On the sample complexity of consistent learning with one-sided error -- Complexity of computing Vapnik-Chervonenkis dimension -- ?-approximations of k-label spaces -- Exact learning of linear combinations of monotone terms from function value queries -- Thue systems and DNA — A learning algorithm for a subclass -- The VC-dimensions of finite automata with n states -- Unifying learning methods by colored digraphs -- A perceptual criterion for visually controlling learning -- Learning strategies using decision lists -- A decomposition based induction model for discovering concept clusters from databases -- Algebraic structure of some learning systems -- Induction of probabilistic rules based on rough set theory. |
| Record Nr. | UNISA-996466054403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithmic Learning Theory - ALT '92 [[electronic resource] ] : Third Workshop, ALT '92, Tokyo, Japan, October 20-22, 1992. Proceedings / / edited by Shuji Doshita, Koichi Furukawa, Klaus P. Jantke, Toyaki Nishida
| Algorithmic Learning Theory - ALT '92 [[electronic resource] ] : Third Workshop, ALT '92, Tokyo, Japan, October 20-22, 1992. Proceedings / / edited by Shuji Doshita, Koichi Furukawa, Klaus P. Jantke, Toyaki Nishida |
| Edizione | [1st ed. 1993.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 |
| Descrizione fisica | 1 online resource (XII, 264 p.) |
| Disciplina | 006.3/1 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Mathematics Computers Artificial Intelligence Mathematics, general Theory of Computation Computation by Abstract Devices |
| ISBN | 3-540-48093-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Discovery learning in intelligent tutoring systems -- From inductive inference to algorithmic learning theory -- A stochastic approach to genetic information processing -- On learning systolic languages -- A note on the query complexity of learning DFA -- Polynomial-time MAT learning of multilinear logic programs -- Iterative weighted least squares algorithms for neural networks classifiers -- Domains of attraction in autoassociative memory networks for character pattern recognition -- Regularization learning of neural networks for generalization -- Competitive learning by entropy minimization -- Inductive inference with bounded mind changes -- Efficient inductive inference of primitive Prologs from positive data -- Monotonic language learning -- Prudence in vacillatory language identification (Extended abstract) -- Implementation of heuristic problem solving process including analogical reasoning -- Planning with abstraction based on partial predicate mappings -- Learning k-term monotone Boolean formulae -- Some improved sample complexity bounds in the probabilistic PAC learning model -- An application of Bernstein polynomials in PAC model -- On PAC learnability of functional dependencies -- Protein secondary structure prediction based on stochastic-rule learning -- Notes on the PAC learning of geometric concepts with additional information. |
| Record Nr. | UNISA-996466053703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Analogical and Inductive Inference [[electronic resource] ] : International Workshop AII '92, Dagstuhl Castle, Germany, October 5-9, 1992. Proceedings / / edited by Klaus P. Jantke
| Analogical and Inductive Inference [[electronic resource] ] : International Workshop AII '92, Dagstuhl Castle, Germany, October 5-9, 1992. Proceedings / / edited by Klaus P. Jantke |
| Edizione | [1st ed. 1992.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 |
| Descrizione fisica | 1 online resource (X, 326 p.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Software engineering Computer programming Artificial Intelligence Software Engineering/Programming and Operating Systems Programming Techniques |
| ISBN | 3-540-47339-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Representing the spatial/kinematic domain and lattice computers -- A solution of the credit assignment problem in the case of learning rectangles -- Learning decision strategies with genetic algorithms -- Background knowledge and declarative bias in inductive concept learning -- Too much information can be too much for learning efficiently -- Some experiments with a learning procedure -- Unions of identifiable classes of total recursive functions -- Learning from multiple sources of inaccurate data -- Strong separation of learning classes -- Desiderata for generalization-to-N algorithms -- The power of probabilism in Popperian FINite learning -- An analysis of various forms of ‘jumping to conclusions’ -- An inductive inference approach to classification -- Asking questions versus verifiability -- Predictive analogy and cognition -- Learning a class of regular expressions via restricted subset queries -- A unifying approach to monotonic language learning on informant -- Characterization of finite identification -- A model of the ‘redescription’ process in the context of geometric proportional analogy problems -- Inductive strengthening: The effects of a simple heuristic for restricting hypothesis space search -- On identifying DNA splicing systems from examples. |
| Record Nr. | UNISA-996465495503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Analogical and Inductive Inference [[electronic resource] ] : International Workshop AII '89 Reinhardsbrunn Castle, GDR, October 1-6, 1989, Proceedings / / edited by Klaus P. Jantke
| Analogical and Inductive Inference [[electronic resource] ] : International Workshop AII '89 Reinhardsbrunn Castle, GDR, October 1-6, 1989, Proceedings / / edited by Klaus P. Jantke |
| Edizione | [1st ed. 1989.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 |
| Descrizione fisica | 1 online resource (IX, 338 p.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Computer programming Computer logic Mathematical logic Artificial Intelligence Programming Techniques Logics and Meanings of Programs Mathematical Logic and Foundations |
| ISBN | 3-540-46798-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Inductive inference from good examples -- Inductive inference, DFAs, and computational complexity -- Why and how program synthesis? -- Some thoughts on the role of examples in program transformation and its relevance for explanation-based learning -- Towards representation independence in PAC learning -- Learning context-free languages efficiently -- Learning programs with an easy to calculate set of errors -- Inductive inference up to immune sets -- Refined query inference -- Learning ?-regular languages from queries and counter-examples (a preliminary report) -- A refutation of Barzdins' conjecture -- Generalizing multiple examples in explanation based learning -- Nested hyper-rectangles for exemplar-based learning -- Second-order inductive learning -- Modes of analogy -- Some aspects of analogy in mathematical reasoning -- A sketch of analogy as reasoning with equality hypotheses -- Analogical inference as generalised inductive inference -- Analogical reasoning for second generation expert systems -- Probabilistic inductive inference of indices in enumerable classes of total recursive functions -- Inductive inference for solving divergence in Knuth-Bendix completion -- Towards a set of inference rules for solving divergence in Knuth-Bendix completion -- Inductive synthesis of programs for symbolic sequences processing -- Inductive synthesis of encoding for algebraic abstract data types. |
| Record Nr. | UNISA-996465729803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Analogical and Inductive Inference [[electronic resource] ] : International Workshop AII'86 Wendisch-Rietz, GDR, October 6-10, 1986, Proceedings / / edited by Klaus P. Jantke
| Analogical and Inductive Inference [[electronic resource] ] : International Workshop AII'86 Wendisch-Rietz, GDR, October 6-10, 1986, Proceedings / / edited by Klaus P. Jantke |
| Edizione | [1st ed. 1987.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1987 |
| Descrizione fisica | 1 online resource (VIII, 232 p.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Artificial intelligence
Artificial Intelligence |
| ISBN | 3-540-47739-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Towards the development of an analysis of learning algorithms -- Using the algorithm of analogy for generation of robot programs -- On the inference of sequences of functions -- Fixed point equations as hypotheses in inductive reasoning -- Inductive inference of functions from noised observations -- Reasoning by analogy as a partial identity between models -- Can missing information be also useful? -- A decidability problem of church-rosser specifications for program synthesis -- Some considerations about formalization of analogical reasoning -- Analogical reasoning using graph transformations -- Knowledge acquisition by inductive learning from examples -- On the inference of programs approximately computing the desired function -- Stratified inductive hypothesis generation -- A model theoretic oriented approach to analogy -- On the complexity of effective program synthesis -- On barzdin's conjecture. |
| Record Nr. | UNISA-996465827703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1987 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
