György E. Révész
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.
György E. Révész
Theoretical Computer Science
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009
Rajeev Gupta, Shourya Roy, et al.
ICAC 2006
Nanda Kambhatla
ACL 2004