Complexity of Recursive Normal Default Logic
Victor W. Marek, Anil Nerode, Jeffrey B. Remmel · Fundamenta Informaticae · 1997
Normal default logic, the fragment of default logic obtained by restricting defaults to rules of the form α:Mβ/β, is the most important and widely studied part of default logic. In [20], we proved a basis theorem for extensions of recursive propositi