Parallel Attribute Exploration

Research output: Contribution to book/Conference proceedings/Anthology/ReportConference contributionContributedpeer-review

Contributors

Abstract

The canonical base of a formal context is a minimal set of implications that is sound and complete. A recent paper has provided a new algorithm for the parallel computation of canonical bases. An important extension is the integration of expert interaction for Attribute Exploration in order to explore implicational bases of inaccessible formal contexts. This paper presents and analyzes an algorithm that allows for Parallel Attribute Exploration.

Details

Original languageEnglish
Title of host publicationGraph-Based Representation and Reasoning
EditorsOllivier Haemmerlé, Gem Stapleton, Catherine Faron-Zucker
PublisherSpringer, Berlin [u. a.]
Pages91-106
Number of pages16
Publication statusPublished - 5 Jul 2016
Peer-reviewedYes

Publication series

SeriesLecture Notes in Computer Science, Volume 9717
ISSN0302-9743

External IDs

Scopus 84977592920
ORCID /0000-0003-0219-0330/work/153109403

Keywords

Library keywords