Fixed-Parameter Algorithms for Closed World Reasoning

Abstract

Closed world reasoning and circumscription are essential tasks in AI. However, their high computational complexity is a serious obstacle for their practical application. In this work we employ the framework of parameterized complexity theory in order to search for fixed-parameter algorithms. We consider eleven parameters describing different characteristics… (More)
DOI: 10.3233/978-1-61499-098-7-492

Topics

1 Figure or Table

Slides referencing similar topics