Introduction to logical information systems

Information Processing and Management

Volumn 40, Issue 3, 2004, Pages 383-419

  Ferre S ^a   Ridoux, O ^b  

^a UWA   (United Kingdom)

^b CAMPUS DE BEAULIEU   (France)

Author keywords

Deduction and theorem proving; Information search and retrieval; Information systems; Query formulation; Representation languages

Indexed keywords

ABSTRACTING; COMPUTER PROGRAMMING; DATA PROCESSING; FORMAL LOGIC; HIERARCHICAL SYSTEMS; INFORMATION RETRIEVAL; PROBLEM SOLVING; PROGRAM DEBUGGING; SOFTWARE ENGINEERING; SYSTEM PROGRAM DOCUMENTATION; TERMINOLOGY; WORLD WIDE WEB;

DEDUCTION AND THEOREM PROVING; INFORMATION SEARCH AND RETRIEVAL; INFORMATION SYSTEMS; QUERY FORMULATION; REPRESENTATION LANGUAGES;

DATABASE SYSTEMS;

EID: 1842843691     PISSN: 03064573     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0306-4573(03)00018-9     Document Type: Article

References (40)

1. Barbut M., Monjardet B. Ordre et classification - Algèbre et combinatoire (2 tomes). 1970;Hachette, Paris.
2. Belleannée C., Brisset P., Ridoux O. A pragmatic reconstruction of. λ prolog The Journal of Logic Programming. 41:1999;67-102.
3. Brachman R.J. On the epistemological status of semantic nets. Findler N.V. Associative Networks: Representation of Knowledge and Use of Knowledge by Examples. 1979;Academic Press, New York.
4. Chaudron L., Maille N. 1st order logic formal concept analysis: from logic programming to theory. Computer and Information Science. 13(3):1998.
5. Chiaramella Y. Browsing and querying: two complementary approaches for multimedia information retrieval. Fuhr G.N., Dittrich K.T. Hypermedia - Information Retrieval - Multimedia. 1997;9-26 Universitätsverlag Konstanz.
6. Cole, R., & Stumme, G. (2000). CEM - a conceptual email manager. In G. Mineau, B. Ganter (Eds.), Int. Conf. Conceptual Structures. LNCS 1867 (pp. 438-452). Springer.
7. Crestani, F., & Lalmas, M. (2001). Logic and uncertainty in information retrieval. In Lectures in Information Retrieval. LNCS 1980 (pp. 179-207).
8. Davey B.A., Priestley H.A. Introduction to Lattices and Order. 1990;Cambridge University Press.
9. Di Cosmo, R. (1995). Isomorphisms of Types: from λ -calculus to information retrieval and language design. Progress in theoretical computer science. Birkhäuser.
10. Ferré S. Complete and incomplete knowledge in logical information systems. Benferhat S., Besnard P. Symbolic and Quantitative Approaches to Reasoning with Uncertainty. LNCS 2143. 2001;782-791 Springer.
11. Ferré, S. (2002a). Incremental concept formation made more efficient by the use of associative concepts. Research Report RR-4569, Inria, Institut National de Recherche en Informatique et en Automatique. URL http://www.inria.fr/RRRT/RR-4569.html.
12. Ferré, S. (2002b). Systèmes d'information logiques: un paradigme logico-contextuel pour interroger, naviguer et apprendre. Thèse d'université, Université de Rennes 1, accessible en ligne à l'adresse http://www.irisa.fr/bibli/publi/theses/theses02.html. URL http://www.irisa.fr/bibli/publi/theses/theses02.html.
13. Ferré, S., & Ridoux, O. (1999). Une généralisation logique de l'analyse de concepts formels. Technical Report RR-3820, Inria, Institut National de Recherche en Informatique et en Automatique, an english version is available at http://www.irisa.fr/lande/ferre.
14. Ferré, S., & Ridoux, O. (2000). A logical generalization of formal concept analysis. In G. Mineau, B. Ganter (Eds.), Int. Conf. Conceptual Structures. LNCS 1867 (pp. 371-384). Springer.
15. Ferré S., Ridoux O. A framework for developing embeddable customized logics. Pettorossi A. Int. Work. Logic-based Program Synthesis and Transformation. LNCS 2372. 2002;191-215 Springer.
16. Ferré, S., & Ridoux, O. (2002b). The use of associative concepts in the incremental building of a logical context. In D. U. Priss, & G. A. Corbett (Eds.), Int. Conf. Conceptual Structures. LNCS 2393 (pp. 299-313). Springer.
17. Ganter, B., & Kuznetsov, S. (2001). Pattern structures and their projections. In H. S. Delugach, & G. Stumme (Eds.), Int. Conf. Conceptual Structures. LNCS 2120 (pp. 129-142). Springer.
18. Ganter B., Wille R. Formal Concept Analysis - Mathematical Foundations. 1999;Springer.
19. Gifford, D. K., Jouvelot, P., Sheldon, M. A., & O'Toole, J. W. J. (1991). Semantic file systems. In 13th ACM Symposium on Operating Systems Principles. ACM SIGOPS (pp. 16-25).
20. Godin R., Missaoui R., April A. Experimental comparison of navigation in a Galois lattice with conventional information retrieval methods. International Journal of Man-Machine Studies. 38(5):1993;747-767.
21. Godin R., Missaoui R., Alaoui H. Incremental concept formation algorithms based on Galois (concept) lattices. Computational Intelligence. 11(2):1995.
22. Gopal, B., & Manber, U. (1999). Integrating content-based access mechanisms with hierarchical file systems. In Third symposium on Operating Systems Design and Implementation (pp. 265-278). USENIX Association.
23. Herzig A., Rifi O. Propositional belief update and minimal change. Artificial Intelligence. 115(1):1999;107-138.
24. Keller, A. M. (1985). Algorithms for translating view updates to database updates for views involving selections, projections, and joins. In 4th ACM Symp. Principles of Database Systems (pp. 154-163).
25. Krone, M., & Snelting, G. (1994). On the inference of configuration structures from source code. In Int. Conf. Software Engineering (pp. 49-58). IEEE Computer Society Press.
26. Kuznetsov S. Learning of simple conceptual graphs from positive and negative examples. Żytkow J.M., Rauch J. Principles of Data Mining and Knowledge Discovery. LNAI 1704. 1999;384-391 Springer.
27. Kuznetsov S., Objedkov S. Comparing performance of algorithms for generating concept lattice. Journal of Experimental and Theoretical Artificial Intelligence. 14(2/3):2001;189-216.
28. Lamport L. LATEX - A Document Preparation System. 2nd ed. 1985;Addison-Wesley.
29. Levesque H. All I know: a study in autoepistemic logic. Artificial Intelligence. 42(2):1990.
30. Lindig, C. (1995). Concept-based component retrieval. In IJCAI95 Workshop on Formal Approaches to the Reuse of Plans, Proofs, and Programs.
31. Meghini, M., Sebastiani, F., Straccia, U., & Thanos, C. (1993). A Model of information Retrieval based on Terminological Logic. In 16th Annual Int. ACM SIGIR Conference on Research and Development in Information Retrieval (pp. 298-307).
32. Miller, D. A., & Nadathur, G. (1986). Higher-order logic programming. In E. Shapiro (Ed.), Third Int. Conf. Logic Programming. LNCS (pp. 448-462). Springer-Verlag, London.
33. Napoli, A. (1997). Une introduction aux logiques de descriptions. Rapport de recherche RR-3314, Inria, Institut National de Recherche en Informatique et en Automatique.
34. Prediger, S. (1997). Logical scaling in formal concept analysis. LNCS 1257 (pp. 332-341).
35. Prediger, S., & Stumme, G. (1999). Theory-driven logical scaling. In International Workshop on Description Logics, Vol. 22. Sweden.
36. Snelting G. Concept analysis - A new framework for program understanding. ACM SIGPLAN Notices. 33(7):1998;1-10.
37. Ullman J.D. Principles of Database and Knowledge-Base Bystems. 1989;Computer Science Press, Rockville, Maryland.
38. Van Rijsbergen, C. J. (1986). A new theoretical framework for information retrieval. In Int. ACM SIGIR Conference on Research and Development in Information Retrieval. ACM (pp. 194-200).
39. Vogt, F., & Wille, R. (1994). TOSCANA - a graphical tool for analyzing and exploring data. In Symposium on Graph Drawing. LNCS 894 (pp. 226-233).
40. Wille, R. (1982). Ordered Sets. Reidel, Dordrecht Boston, Ch. Restructuring lattice theory: an approach based on hierarchies of concepts (pp. 445-470).