1st Order Logic Formal Concept Analysis: from logic programming to theory (1998) [2 citations — 0 self]
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Vol Nr and Laurent Chaudron and C Fl Laurent Chaudron and Nicolas Maille and Nicolas Maille},
title = {1st Order Logic Formal Concept Analysis: from logic programming to theory},
journal = {Computer and Information Science},
year = {1998},
volume = {13}
}
Bookmarks
OpenURL
Abstract:
In this paper, we analyze and define the introduction of 1st order logic in Formal Concept Analysis (FCA); the aims are both theoretical (as a complete model is needed) and applied (so as to improve expression power of FCA as a knowledge mining tool and the relevance of its results). Our contribution consists in: i) the implementation of classical FCA in logic programming and the analysis of real cases, ii) the design of a complete 1st order FCA model, iii) the implementation of this 1st order FCA. Keywords: Formal Concept Analysis, Knowledge Representation, Concepts Discovery, Rule induction, Logic Programming. Authors' affiliation and address: Onera Cert 2 avenue Edouard Belin BP 4025 F-31055 Toulouse Cedex 04 - FRANCE Phone: +33 5 62 25 26 55 Fax: +33 5 62 25 25 93 fchaudron, mailleg@cert.fr 1 Introduction As far as knowledge information is concerned, the induction of concepts from data and information is a pivotal topic; generally, if numerical valuations (belief measures, pr...
