the generation and testing of hypotheses is widely considered to be the primary method by which Science progresses. So much so, that it is still common to find a scientific proposal or an intellectual argument damned ...
详细信息
ISBN:
(纸本)3540229418
the generation and testing of hypotheses is widely considered to be the primary method by which Science progresses. So much so, that it is still common to find a scientific proposal or an intellectual argument damned on the grounds that it has no hypothesis being tested, it is merely a fishing expedition, and so on. Extreme versions run if there is no hypothesis, it is not Science, the clear implication being that hypothesis-driven programmes (as opposed to data-driven studies) are the only contributor to the scientific endeavour. this misrepresents how knowledge and understanding are actually generated from the study of natural phenomena and laboratory experiments. Hypothesis-driven and inductive modes of reasoning are not competitive, but complementary, and both are required in post-genomic biology.
In this paper we present goal-directed deduction methods for Lukasiewicz infinite-valued logic L, giving logicprogramming style algorithms which both have a logical interpretation and provide a suitable basis for imp...
详细信息
ISBN:
(纸本)3540230246
In this paper we present goal-directed deduction methods for Lukasiewicz infinite-valued logic L, giving logicprogramming style algorithms which both have a logical interpretation and provide a suitable basis for implementation. We begin by considering a basic version with connections to calculi for other logics, then make refinements to obtain greater efficiency and termination properties, and to deal with further connectives and truth constants. We finish by considering applications of these algorithms to fuzzy logicprogramming.
ILP systems induce first-order clausal theories performing a search through very large hypotheses spaces containing redundant hypotheses. the generation of redundant hypotheses may prevent the systems from finding goo...
详细信息
A tableau calculus for a logic with constructive negation and an implementation of the related decision procedure is presented. this logic is an extension of Nelson logic and it has been used in the framework of progr...
详细信息
ISBN:
(纸本)3540230246
A tableau calculus for a logic with constructive negation and an implementation of the related decision procedure is presented. this logic is an extension of Nelson logic and it has been used in the framework of program verification and timing analysis of combinatorial circuits. the decision procedure is tailored to shrink the search space of proofs and it is proved correct by using a semantical technique. It has been implemented in C++ language.
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. Specifically, it has been found that i...
详细信息
Query optimization is used frequently in relational database management systems. Most existing techniques axe based on reordering the relational operators, where the most selective operators are executed first. In thi...
详细信息
ISBN:
(纸本)3540201440
Query optimization is used frequently in relational database management systems. Most existing techniques axe based on reordering the relational operators, where the most selective operators are executed first. In this work we evaluate a similar approach in the context of inductivelogicprogramming (ILP). there are some important differences between relational database management systems and ILP systems. We describe some of these differences and list the resulting requirements for a reordering transformation suitable for ILP. We propose a transformation that meets these requirements and an algorithm for estimating the computational cost of literals, which is required by the transformation. Our transformation yields a significant improvement in execution time on the Carcinogenesis data set.
this work aims at improving the scalability of memory usage in inductivelogicprogramming systems. In this context, we propose two efficient data structures: the Trie, used to represent lists and clauses;and the RL-T...
详细信息
ISBN:
(纸本)3540201440
this work aims at improving the scalability of memory usage in inductivelogicprogramming systems. In this context, we propose two efficient data structures: the Trie, used to represent lists and clauses;and the RL-Tree, a novel data structure used to represent the clauses coverage. We evaluate their performance in the April system using well known datasets. Initial results show a substantial reduction in memory usage without incurring extra execution time overheads. Our proposal is applicable in any ILP system.
the learning system Progo15 and the underlying inference method of Bottom Generalisation are firmly established within inductivelogicprogramming (ILP). But despite their success, it is known that Bottom Generalisati...
详细信息
ISBN:
(纸本)3540201440
the learning system Progo15 and the underlying inference method of Bottom Generalisation are firmly established within inductivelogicprogramming (ILP). But despite their success, it is known that Bottom Generalisation, and therefore Progo15, are restricted to finding hypotheses that lie within the semantics of Plotkin's relative subsumption. this paper exposes a previously unknown incompleteness of Progo15 with respect to Bottom Generalisation, and proposes a new approach, called Hybrid Abductive inductive Learning, that integrates the ILP principles of Progo15 with Abductive logicprogramming (ALP). A proof procedure is proposed, called HAIL, that not only overcomes this newly discovered incompleteness, but further generalises Progo15 by computing multiple clauses in response to a single seed example and deriving hypotheses outside Plotkin's relative subsumption. A semantics is presented, called Kernel Generalisation, which extends that of Bottom Generalisation. and includes the hypotheses constructed by HAIL.
Previous papers have studied learning of Stochastic logic Programs (SLPs) either as a purely parametric estimation problem or separated structure learning and parameter estimation into separate phases. In this paper w...
详细信息
ISBN:
(纸本)3540005676
Previous papers have studied learning of Stochastic logic Programs (SLPs) either as a purely parametric estimation problem or separated structure learning and parameter estimation into separate phases. In this paper we consider ways in which boththe structure and the parameters of an SLP can be learned simultaneously. the paper assumes an ILP algorithm, such as Progol or FOIL, in which clauses are constructed independently. We derive analytical and numerical methods for efficient computation of the optimal probability parameters for a single clause choice within such a search.
暂无评论