PROPOSAL to close ISSUE-41: processor graph vocabulary

If there are no objections to this proposal in 7 days, we will close
ISSUE-41: processor graph vocabulary.

http://www.w3.org/2010/02/rdfa/track/issues/41

The RDFa WG has discussed the issue and decided that it would take more
time than we have available (in the RDFa WG telecons) to generate a
solid processor graph vocabulary before the October 2010 deadline for
our Last Call Working Draft for RDFa Core. We simultaneously recognize
that one would need an RDFa Processor Graph vocabulary for
interoperability purposes.

The RDFa WG proposes that the group of individuals that are interested
in working on such a vocabulary do so and release the work as a W3C Note
by July 2011. An optional part of the test suite may also be created to
ensure interoperability of errors and warnings generated by the RDFa
processor and placed into the processor graph.

Specifically, ISSUE-41 questions whether this definition should be a
part of RDFa Core. The WG has found that it should not be a part of RDFa
Core, but is important and thus should live external to the core
specification.

Please comment in 7 days from this post if you object to this proposal.
If there are no objections within 7 days, ISSUE-41 will be closed.

-- manu

-- 
Manu Sporny (skype: msporny, twitter: manusporny)
President/CEO - Digital Bazaar, Inc.
blog: WebID - Universal Login for the Web
http://blog.digitalbazaar.com/2010/08/07/webid/2/

Received on Sunday, 3 October 2010 16:44:11 UTC