John M. Boyer, Charles F. Wiecha
DocEng 2009
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.
John M. Boyer, Charles F. Wiecha
DocEng 2009
György E. Révész
Theoretical Computer Science
Fan Zhang, Junwei Cao, et al.
IEEE TETC
Elliot Linzer, M. Vetterli
Computing