2962 search results - page 173 / 593 » Reasoning on Association Rules |
178
click to vote
APIN
2000
15 years 6 months ago
2000
The Context Interchange Project presents a unique approach to the problem of semantic conflict resolution among multiple heterogeneous data sources. The system presents a semantic...
170
click to vote
CL
2000
Springer
15 years 10 months ago
2000
Springer
Boolean circuits offer a natural, structured, and compact representation of Boolean functions for many application domains. In this paper a tableau method for solving satisfiabilit...
172
click to vote
SEMWEB
2009
Springer
16 years 1 months ago
2009
Springer
Being able to extend an OWL ontology with some form of rules is a feature that many ontology developers consider as very important. Nevertheless, working with rules in practice can...
154
click to vote
SIGECOM
2008
ACM
15 years 6 months ago
2008
ACM
The Gibbard-Satterthwaite Theorem states that (in unrestricted settings) any reasonable voting rule is manipulable. Recently, a quantitative version of this theorem was proved by ...
161
click to vote
ILP
1999
Springer
15 years 10 months ago
1999
Springer
This paper presents an application of Inductive Logic Programming (ILP) and Backpropagation Neural Network (BNN) to the problem of Thai character recognition. In such a learning pr...