Fixpoint strategies for deductive databases
✍ Scribed by Irène Guessarian
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 422 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
This paper is a study of the problem of relevance in inductive concept learning. It gives definitions of irrelevant literals and irrelevant examples and presents ecient algorithms that enable their elimination. The proposed approach is directly applicable in propositional learning and in relation le
Identifying relevant clauses before attempting a proof may lead to more efficient automated theorem proving. Relevance is here defined relative to a given set of clauses S and one or more distinguished sets of support T . The role of a set of support T can be played by the negation of the theorem to
A vast quantity of data in the form of correlations is available for use in design and analysis. Even using hitherto-available databases there are significant difficulties in obtaining the best correlation for a particular purpose. The limitations of current databases in this respect are discussed a