Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
In this paper we compare the semantical and syntactical definitions of extensions for open default theories. We prove that, over monadic languages, these definitions are equivalent and do not depend on the cardinality of the underlying infinite world. We also show that, under the domain closure assumption, one free variable open default theories are decidable. © 2006 Elsevier B.V. All rights reserved.
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
Bowen Zhou, Bing Xiang, et al.
SSST 2008
Liat Ein-Dor, Y. Goldschmidt, et al.
IBM J. Res. Dev
Chi-Leung Wong, Zehra Sura, et al.
I-SPAN 2002