Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9655954 | Electronic Notes in Theoretical Computer Science | 2005 | 11 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Michael Kaminski, Julia Mosin,