APPROXIMABLE CONCEPTS, CHU SPACES, AND INFORMATION SYSTEMS

This paper serves to bring three independent but important areas of com- puter science to a common meeting point: Formal Concept Analysis (FCA), Chu Spaces, and Domain Theory (DT). Each area is given a perspective or reformulation that is conducive to the flow of ideas and to the exploration of cross-disciplinary connections. Among other results, we show that the notion of state in Scott's information system corresponds precisely to that of formal concepts in FCA with respect to all finite Chu spaces, and the entailment relation corresponds to "association rules". We introduce, moreover, the notion of approximable concept and show that approximable concepts rep- resent algebraic lattices which are identical to Scott domains except the inclusion of a top element. This notion serves as a stepping stone in the recent work (Hitzler and Zhang, 2004) in which a new notion of morphism on formal contexts results in a cate- gory equivalent to (a) the category of complete algebraic lattices and Scott continuous functions, and (b) a category of information systems and approximable mappings.

[1]  Michael Barr,et al.  *-Autonomous categories and linear logic , 1991, Mathematical Structures in Computer Science.

[2]  Samson Abramsky,et al.  Domain theory , 1995, LICS 1995.

[3]  K. Hofmann,et al.  Continuous Lattices and Domains , 2003 .

[4]  Guo-Qiang Zhang.  Chu Spaces, Concept Lattices, and Domains , 2003, MFPS.

[5]  François Lamarche.  From Chu Spaces to Cpos , 1994, Theory and Formal Methods.

[6]  Guo-Qiang Zhang,et al.  Clausal Logic and Logic Programming in Algebraic Domains , 2001, Inf. Comput..

[7]  Vaughan Pratt,et al.  Chu spaces as a semantic bridge between linear logic and mathematics , 2003, Theor. Comput. Sci..

[8]  R. A. G. Seely,et al.  Linear Logic, -Autonomous Categories and Cofree Coalgebras , 1989 .

[9]  Austin Melton,et al.  Lagois Connections - a Counterpart to Galois Connections , 1994, Theor. Comput. Sci..

[10]  Pascal Hitzler,et al.  A Cartesian Closed Category of Approximable Concept Structures , 2004, ICCS.

[11]  Vaughan R. Pratt,et al.  The Stone gamut: a coordinatization of mathematics , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[12]  Michael Huth.  A Maximal Monoidal Closed Category of Distributive Algebraic Domains , 1995, Inf. Comput..

[13]  Jon Barwise,et al.  Information Flow: The Logic of Distributed Systems , 1997 .

[14]  Guo-Qiang Zhang.  Logic of Domains , 1991, Progress in Theoretical Computer Science.

[15]  Vaughan R. Pratt,et al.  Higher dimensional automata revisited , 2000, Mathematical Structures in Computer Science.

[16]  Vaughan R. Pratt,et al.  Chu Spaces from the Representational Viewpoint , 1999, Ann. Pure Appl. Log..

[17]  Pascal Hitzler,et al.  A Categorical View on Algebraic Lattices in Formal Concept Analysis , 2004, Fundam. Informaticae.

[18]  Marcel Erné,et al.  General Stone duality , 2004 .

[19]  Carl A. Gunter,et al.  Semantic Domains , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[20]  James A. Hendler,et al.  The Semantic Web" in Scientific American , 2001 .

[21]  Pascal Hitzler,et al.  Default Reasoning over Domains and Concept Hierarchies , 2004, KI.

[22]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[23]  Austin Melton,et al.  A Category of Galois Connections , 1987, Category Theory and Computer Science.

[24]  Vaughan R. Pratt.  Towards full completeness of the linear logic of Chu spaces , 1997, MFPS.

[25]  Roberto M. Amadio,et al.  Domains and lambda-calculi , 1998, Cambridge tracts in theoretical computer science.

[26]  Marcelo P Fiore,et al.  Topology via Logic , 1999 .

[27]  G. Winskel.  The formal semantics of programming languages , 1993 .

[28]  Bernhard Ganter,et al.  Using Conceptual Structures: Contributions to ICCS 2003 , 2003 .

[29]  L. Beran,et al.  [Formal concept analysis]. , 1996, Casopis lekaru ceskych.

[30]  Gerd Stumme,et al.  Formal Concept Analysis: Theory and Applications , 2004, Journal of universal computer science (Online).

[31]  David A. Schmidt,et al.  Calois Connections and Computer Science Applications , 1985, CTCS.

[32]  Thierry Coquand,et al.  Sequents, Frames, and Completeness , 2000, CSL.

[33]  Vaughan R. Pratt,et al.  Chu Spaces and Their Interpretation as Concurrent Objects , 1995, Computer Science Today.

[34]  Pascal Hitzler,et al.  Formal Concept Analysis and Resolution in Algebraic Domains , 2003, ArXiv.