Article ID Journal Published Year Pages File Type
439344 Theoretical Computer Science 2006 13 Pages PDF
Abstract

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.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics