Bounded fitting in ALC fragments with existential or universal restrictions is NP-complete even for a single positive and negative example, and a SAT-based implementation, ALC-SAT+, performs competitively with existing concept learners.
Cam- bridge Tracts in Theoretical Computer Science, Cambridge University Press (1992)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
SAT-Based Bounded Fitting for the Description Logic ALC
Bounded fitting in ALC fragments with existential or universal restrictions is NP-complete even for a single positive and negative example, and a SAT-based implementation, ALC-SAT+, performs competitively with existing concept learners.