SAT-Based PAC Learning of Description Logic Concepts

Balder Ten Cate, Jean Jung, Carsten Lutz, Maurice Funk

arXiv · PDF · Open in the Atlas

Code that ran

We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. If it links a repository, it is listed below.

Abstract

We propose bounded fitting as a scheme for learning description logic concepts in the presence of ontologies. A main advantage is that the resulting learning algorithms come with theoretical guarantees regarding their generalization to unseen examples in the sense of PAC learning. We prove that, in contrast, several other natural learning algorithms fail to provide such guarantees. As a further contribution, we present the system SPELL which efficiently implements bounded fitting for the description logic ELH r based on a SAT solver, and compare its performance to a state-of-the-art learner.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2305.08511")
get_code_for_paper("2305.08511")
have("2305.08511")

Connect an agent — have() is free.