Learn More
We present an innovative approach to information retrieval for domain-specific digital library collections. We use a combination of Formal Concept Analysis (FCA) and a notion of information anchors to facilitate information delivery to the end user. This approach (1) uses ranked objects in attribute concepts to facilitate topical queries for experts and(More)
This paper serves to bring three independent but important areas of computer 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(More)
In this paper we show that the Mastermind Satisfiability Problem (MSP) is NP-complete. Mastermind is a popular game which can be turned into a logical puzzle called the Mastermind Satisfiability Problem in a similar spirit to the Minesweeper puzzle [5]. By proving that MSP is NP-complete, we reveal its intrinsic computational property that makes it(More)
We introduce a framework for the study of formal contexts and their lattices induced by the additional structure of self-relations on top of the traditional incidence relation. The induced contexts use subsets as objects and attributes, hence the name power context and power concept. Six types of new incidence relations are introduced by taking into account(More)
Co-infection of hepatitis B virus (HBV) and/or hepatitis C virus (HCV) with human immunodeficiency virus (HIV) has an adverse effect on liver disease progression. This study investigated the prevalence of HBV and/or HCV co-infection in HIV-infected patients in Central China. A total of 978 HIV-infected patients from Hunan Province were enrolled. HBV serum(More)
We present the design and implementation of VISAGE (VISual AGgregator and Explorer), a query interface for clinical research. We follow a user-centered development approach and incorporate visual, ontological, searchable and explorative features in three interrelated components: Query Builder, Query Manager and Query Explorer. The Query Explorer provides(More)
We introduce a domain-theoretic foundation for disjunctive logic programming. This foundation is built on clausal logic, a representation of the Smyth powerdomain of any coherent algebraic dcpo. We establish the completeness of a resolution rule for inference in such a clausal logic; we introduce a natural declarative semantics and a fixed-point semantics(More)