formula-aware store is expected not to include quoted statements when matching such a query. N3 Round Trip This refers to the requirements on a formula-aware RDF store's persistence mechanism necessary for it to be properly populated by a N3 parser and rendered as syntax by a N3 serializer. Transactional Store An RDF store capable of providing transactional integrity to the RDF operations performed on it. Interpreting syntax The following Notation 3 document: {?x a :N3Programmer} => {?x :has [a :Migraine]} Could cause the following statements to be asserted in the store: _:a log:implies _:b This statement would be asserted in the partition associated with quoted statements (in a formula named _:a) ?x rdf:type :N3Programmer Finally, these statements would be asserted in the same partition (in a formula named _:b) ?x :has _:c _:c rdf:type :Migraine Formulae and Variables as Terms Formulae and variables are distinguishable from URI references, Literals, and BNodes by the following syntax: { .. } - Formula ?x - Variable They must also be distinguishable in persistence to ensure they can be round tripped. Other issues regarding the persistence of N3 terms. Database management An RDF store should provide standard interfaces for the management of database connections. Such interfaces are standard to most database management systems (Oracle, MySQL, Berkeley DB, Postgres, etc..) The following methods are defined to provide this capability: - Opens the store specified by the configuration string. If create is True a store will be created if it does not already exist. If create is False and a store does not already exist an exception is raised. An exception is also raised if a store exists, but there is insufficient permissions to open the store. - This closes the database connection. The commit_pending_transaction parameter specifies whether to commit all pending transactions before closing (if the store is transactional). - This destroys the instance of the store identified by the configuration string. The configuration string is understood by the store implementation and represents all the necessary parameters needed to locate an individual instance of a store. This could be similar to an ODBC string, or in fact be an ODBC string if the connection protocol to the underlying database is ODBC. The open function needs to fail intelligently in order to clearly express that a store (identified by the given configuration string) already exists or that there is no store (at the location specified by