Formal Concept Analysis and Resolution in Algebraic Domains
| dc.creator | Hitzler, Pascal | |
| dc.creator | Wendt, Matthias | |
| dc.date | 2003-01-09 | |
| dc.date | 2003-05-01 | |
| dc.date.accessioned | 2026-07-07T03:19:20Z | |
| dc.date.available | 2026-07-07T03:19:20Z | |
| dc.description | 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. | |
| dc.description | 14 pages. We have rewritten the old version according to the suggestions of some referees. The results are the same. The presentation is completely different | |
| dc.identifier | https://arxiv.org/abs/cs/0301008 | |
| dc.identifier | http://arxiv.org/abs/cs/0301008 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31422 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | Artificial Intelligence | |
| dc.subject | F.4.1;I.2.3;I.2.4 | |
| dc.title | Formal Concept Analysis and Resolution in Algebraic Domains | |
| dc.type | text |