We relate two formerly independent areas: Formal concept analysis and logic of domains. We will establish a correspondence between contextual attribute logic on formal contexts resp. concept lattices and a clausal logic on coherent algebraic cpos. We show how to identify the notion of formal concept in the domain theoretic setting. In particular, we show that a special instance of the resolution rule from the domain logic coincides with the concept closure operator from formal concept analysis. The results shed light on the use of contexts and domains for knowledge representation and reasoning purposes
Recent literature reports the growing interests in data analysis using FormalConceptAnalysis (FCA), ...
AbstractWe introduce a domain-theoretic foundation for disjunctive logic programming. This foundatio...
Knowledge discovery is important for systems that have computational intelligence in helping them l...
We relate two formerly independent areas: Formal concept analysis and logic of domains. We will esta...
We related two formerly independent areas: Formal concept analysis and logic of domains. We will est...
AbstractIn this paper, we investigate the representation of algebraic domains by means of Formal Con...
AbstractThis paper serves to bring three independent but important areas of computer science to a co...
Abstract. Formal concept analysis has grown from a new branch of the mathematical field of lattice t...
Formal concept analysis (FCA) as introduced in [4] deals with contexts and concepts. Roughly speakin...
Recent studies showed how a seamless integration of formal concept analysis (FCA), logic of domains,...
Formal concept analysis has grown from a new branch of the mathematical field of lattice theory to a...
Infinite contexts and their corresponding lattices are of theoretical and practical interest since t...
Abstract. Formal Concept Analysis (FCA) appears to be ideal for in-terpreting data in domains that a...
Formal concept analysis has grown from a new branch of the mathematical field of lattice theory to a...
International audienceIn this chapter, we introduce Formal Concept Analysis (FCA) and some of its ex...
Recent literature reports the growing interests in data analysis using FormalConceptAnalysis (FCA), ...
AbstractWe introduce a domain-theoretic foundation for disjunctive logic programming. This foundatio...
Knowledge discovery is important for systems that have computational intelligence in helping them l...
We relate two formerly independent areas: Formal concept analysis and logic of domains. We will esta...
We related two formerly independent areas: Formal concept analysis and logic of domains. We will est...
AbstractIn this paper, we investigate the representation of algebraic domains by means of Formal Con...
AbstractThis paper serves to bring three independent but important areas of computer science to a co...
Abstract. Formal concept analysis has grown from a new branch of the mathematical field of lattice t...
Formal concept analysis (FCA) as introduced in [4] deals with contexts and concepts. Roughly speakin...
Recent studies showed how a seamless integration of formal concept analysis (FCA), logic of domains,...
Formal concept analysis has grown from a new branch of the mathematical field of lattice theory to a...
Infinite contexts and their corresponding lattices are of theoretical and practical interest since t...
Abstract. Formal Concept Analysis (FCA) appears to be ideal for in-terpreting data in domains that a...
Formal concept analysis has grown from a new branch of the mathematical field of lattice theory to a...
International audienceIn this chapter, we introduce Formal Concept Analysis (FCA) and some of its ex...
Recent literature reports the growing interests in data analysis using FormalConceptAnalysis (FCA), ...
AbstractWe introduce a domain-theoretic foundation for disjunctive logic programming. This foundatio...
Knowledge discovery is important for systems that have computational intelligence in helping them l...