We discuss language architecture for the Semantic Web, and in particular different proposals for extending this architecture
with a rules component. We argue that an architecture that maximises compatibility with existing languages, in particular
RDF and OWL, will benefit the development of the Semantic Web, and still allow for forms of closed world assumption and negation
as failure.