A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Algorithm 457: finding all cliques of an undirected graph
Communications of the ACM
Approximate reasoning by similarity-based SLD resolution
Theoretical Computer Science
Bousi~Prolog: a Prolog Extension Language for Flexible Query Answering
Electronic Notes in Theoretical Computer Science (ENTCS)
A declarative semantics for Bousi~Prolog
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Database summarization using fuzzy ISA hierarchies
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Fundamenta Informaticae
Classifying unlabeled short texts using a fuzzy declarative approach
Language Resources and Evaluation
| Hi-index | 0.00 |
In this work, a proximity-based generic method for discovery of generalized knowledge is presented and implemented in the framework of a fuzzy logic programming language with a weak unification procedure that uses proximity relations to model uncertainty. This method makes use of the concept of λ-block characterizing the notion of equivalence when working with proximity relations. When the universe of discourse is composed of concepts which are related by proximity, the sets of λ-blocks extracted from that proximity relation can be seen as hierarchical sets of concepts grouped by abstraction level. Then, each group (forming a λ-block) can be labeled, with user help, by way of a more general descriptor in order to simulate a generalization process based on proximity. Thanks to this process, the system can learn concepts that were unknown initially and reply queries that it was not able to answer. The novelty of this work is that it is the first time a method, with analogous features to the one aforementioned, has been implemented inside a fuzzy logic programming framework. In order to check the feasibility of the method we have developed a software tool which have been integrated into the Bousi~Prolog system.