Knowledge discovery by logical resolution with usefulness measure

Authors:
Eiko Yamamoto;Kyoji Umemura
Affiliations:
Toyohashi Univ. of Technology, Japan;Toyohashi Univ. of Technology, Japan
Venue:
Information organization and databases
Year:
2000

Citing 7
Cited 0

Saturation, nonmonotonic reasoning and the closed-world assumption

Artificial Intelligence
Linear resolution for consequence finding

Artificial Intelligence
The KDD process for extracting useful knowledge from volumes of data

Communications of the ACM
The process of knowledge discovery in databases

Advances in knowledge discovery and data mining
Inductive logic programming and knowledge discovery in databases

Advances in knowledge discovery and data mining
A completeness theorem and a computer program for finding theorems derivable from given axioms

A completeness theorem and a computer program for finding theorems derivable from given axioms
Automated theorem proving: A logical basis (Fundamental studies in computer science)

Automated theorem proving: A logical basis (Fundamental studies in computer science)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a new method for KDD using SOL resolution. SOL resolution is a procedure which can solve a clause finding problem completely. We regard the clause as knowledge and apply SOL resolution to KDD. We verify that certain knowledge is discovered from the data.