Lean Kernels in Description Logics  thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Lean Kernels in Description Logics

Published on Jul 10, 2017878 Views

Lean kernels (LKs) are an effective optimization for deriving the causes of unsatisfiability of a propositional formula. Interestingly, no analogous notion exists for explaining consequences of descri

Related categories

Chapter list

Lean Kernels in Description Logics00:00
Understanding Consequences00:23
Desiderata02:36
Propositional Logic05:23
Lean Kernels06:21
Lean Kernels are Good07:29
Consequence-based Reasoning08:35
Subsumption in ALC10:35
Consequence-based Rules for ALC11:14
Lean Kernels for Consequence-based Algorithms12:35
Example13:36
LK Extensions15:41
Example17:50
Evaluation19:07
Good Approximation?20:04
Proportional Improvement vs. Star-module21:16
99.9% confidence intervals do not overlap22:34
Efficiently computable?23:02
Conclusions23:54