Computer Science – Logic in Computer Science
Scientific paper
2003-01-09
Computer Science
Logic in Computer Science
14 pages. We have rewritten the old version according to the suggestions of some referees. The results are the same. The prese
Scientific paper
We relate two formerly independent areas: Formal concept analysis and logic of domains. We will establish a correspondene 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.
Hitzler Pascal
Wendt Matthias
No associations
LandOfFree
Formal Concept Analysis and Resolution in Algebraic Domains does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Formal Concept Analysis and Resolution in Algebraic Domains, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Formal Concept Analysis and Resolution in Algebraic Domains will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-231275