Abstract: A method of facilitating construction of a user interface for policing input of user-defined data to a database. An ontology expressed in a first-order logic language is obtained, the ontology describing one or more predefined classes, a plurality of predefined properties and at least one predefined restriction. Data useable to identify a first class is received, and in response, an intermediate data structure is generated for the first class, the intermediate data structure configured to facilitate construction of a user interface for policing input of user-defined data to the database. Generating the intermediate data structure comprises identifying a property from the ontology that is applicable to the first class, determining a property restriction function indicating whether the at least one restriction is applicable to the property, and associating the at least one restriction with the property in the intermediate data structure.

Abstract: A method of facilitating construction of a user interface for policing input of user-defined data to a database. An ontology expressed in a first-order logic language is obtained, the ontology describing one or more predefined classes, a plurality of predefined properties and at least one predefined restriction. Data useable to identify a first class is received, and in response, an intermediate data structure is generated for the first class, the intermediate data structure configured to facilitate construction of a user interface for policing input of user-defined data to the database. Generating the intermediate data structure comprises identifying a property from the ontology that is applicable to the first class, determining a property restriction function indicating whether the at least one restriction is applicable to the property, and associating the at least one restriction with the property in the intermediate data structure.

Abstract: A method for querying a graph database is provided. The graph database includes a plurality of nodes connected by edges, the edges indicating relationships between nodes in the plurality of nodes. The method comprises receiving a database query describing a graph database pattern, wherein the database query is expressed using a modal logic query language that includes at least one fixed-point operator. The graph database is searched using the database query. In response to the searching, at least one Kripke structure is obtained, each of the at least one Kripke structure representing a fragment of the graph database that corresponds to the graph database pattern. The method further comprises outputting data, based on the at least one Kripke structure, to provide a response to the database query.