2,658 research outputs found
Approaches and Applications of Inductive Programming (Dagstuhl Seminar 17382)
No full textThis report documents the program and the outcomes of Dagstuhl Seminar 17382 "Approaches and Applications of Inductive Programming". After a short introduction to the state of the art to
inductive programming research, an overview of the introductory tutorials, the talks, program demonstrations, and the outcomes of discussion groups is given
Service-oriented models for audiovisual content storage
No full textWhat are the important topics to understand if involved with storage services to hold digital audiovisual content? This report takes a look at how content is created and moves into and out of storage; the storage service value networks and architectures found now and expected in the future; what sort of data transfer is expected to and from an audiovisual archive; what transfer protocols to use; and a summary of security and interface issues
05051 Executive Summary – Probabilistic, Logical and Relational Learning - Towards a Synthesis
No full textA short report on the Dagstuhl seminar on Probabilistic, Logical and Relational Learning – Towards a Synthesis is given
05051 Abstracts Collection – Probabilistic, Logical and Relational Learning - Towards a Synthesis
No full textFrom 30.01.05 to 04.02.05, the Dagstuhl Seminar 05051 ``Probabilistic, Logical and Relational Learning - Towards a Synthesis'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available
Approaches and Applications of Inductive Programming (Dagstuhl Seminar 19202)
No full textIn this report the program and the outcomes of Dagstuhl Seminar 19202 "Approaches and Applications of Inductive Programming" is documented. After a short introduction to the state of the art to inductive programming research, an overview of the introductory tutorials, the talks, program demonstrations, and the outcomes of discussion groups is given
07161 Abstracts Collection – Probabilistic, Logical and Relational Learning - A Further Synthesis
No full textFrom April 14 – 20, 2007, the Dagstuhl Seminar 07161 ``Probabilistic, Logical and Relational Learning - A Further Synthesis'' was held
in the International Conference and Research Center (IBFI),
Schloss Dagstuhl.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available
The PITA System for Logical-Probabilistic Inference
No full textIntroduction,
Probabilistic Logic Programming,
The PITA System,
Experiments,
Bibliograph
Machine learning a probabilistic network of ecological interactions
No full textAbstract. In this paper we demonstrate that machine learning (using Abductive ILP) can generate plausible and testable food webs from eco-logical data. In this approach, unlike previous applications of Abductive ILP, the abductive predicate ‘eats ’ is entirely undefined before the start of the learning. We also explore a new approach, called Hypothesis Fre-quency Estimation (HFE), for estimating probabilities for hypothetical ‘eats ’ facts based on their frequency of occurrence when randomly sam-pling the hypothesis space. The results of cross-validation tests suggest that the trophic networks with probabilities have higher predictive accura-cies compared to the networks without probabilities. The proposed trophic networks have been examined by domain experts and comparison with the literature shows that many of the links are corroborated by the literature. In particular, links ascribed with high frequency are shown to correspond well with those having multiple references in the literature. In some cases novel high frequency links are suggested, which could be tested.
Approaches and Applications of Inductive Programming (Dagstuhl Seminar 15442)
No full textThis report documents the program and the outcomes of Dagstuhl Seminar 15442 "Approaches and Applications of Inductive Programming". After a short introduction to the state of the art to inductive programming research, an overview of the talks and the outcomes of discussion groups is given
Completing Inverse Entailment
No full text. Yamamoto has shown that the Inverse Entailment (IE) mechanism described previously by the author is complete for Plotkin's relative subsumption but incomplete for entailment. That is to say, an hypothesised clause H can be derived from an example E under a background theory B using IE if and only if H subsumes E relative to B in Plotkin's sense. Yamamoto gives examples of H for which B [ H j= E but H cannot be constructed using IE from B and E. The main result of the present paper is a theorem to show that by enlarging the bottom set used within IE, it is possible to make a revised version of IE complete with respect to entailment for Horn theories. Furthermore, it is shown for function-free definite clauses that given a bound k on the arity of predicates used in B and E, the cardinality of the enlarged bottom set is bounded above by the polynomial function p(c + 1) k , where p is the number of predicates in B; E and c is the number of constants in B [E. 1 Introduction In [5] Yam..
- …
