KRR-Oxford / RSAComb

Re-implementation of the combined approach for CQ answering over RSA ontologies
https://www.cs.ox.ac.uk/isg/tools/RSAComb
Apache License 2.0
2 stars 0 forks source link

NI predicate #6

Open dyamon opened 3 years ago

dyamon commented 3 years ago

This is just to keep track of the discussion about the instantiation of NI predicates in the RSA canonical model. In the paper NI in mentioned multiple times.

During the definition of canonical model for O:

[Definition 4] [...] Let P be the smallest program with a rule -> NI(a) for each constant a and all rules in Table 2 [...]

During the definition of filtering program:

[Table 3 - rules 3a, 5a, 5b, 5c]

we refer to all functional terms and Skolem constants in the model that are not equal to constant in O as anonymous

We keep track of identities in the model relative to a match using a fresh predicate id. It is initialised as the minimal congruence relation over the positions of the existential variables in the query which are mapped to anonymous terms (rules (3)).

Furthermore the predicate named is introduced in the filtering program seemingly with the same semantics.


At the time of writing we agreed on the following:


Despite this decision we are still not sure why the paper introduces NI during the definition of the logic program used to compute the canonical model, since its instantiation depend on the canonical model itself.

dyamon commented 3 years ago

We decided to implement NIs using the following rule

NI(X) <- X rsa:EquivTo Y, named(Y).
dyamon commented 3 years ago

Note that removing NIs entirely from Def. 4 and from the computation of the canonical model might have an impact also on the theoretical results.

We need to check that Theorem 3 remains true even when removing the NI from Def. 4