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.
In: Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, ICAPS
1 Pith paper cite this work, alongside 85 external citations. Polarity classification is still indexing.
1
Pith paper citing it
85
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.AI 1years
2025 1verdicts
ACCEPT 1roles
background 1polarities
unclear 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.