FaCT++ crashes on inconsistent ontology with irreflexive property chain

Issue #16 resolved
Dmitry Tsarkov repo owner created an issue

Original [issue 16](https://code.google.com/p/factplusplus/issues/detail?id=16) created by dtsarkov on 2009-08-27T17:26:58.000Z:

<b>What steps will reproduce the problem?</b> 1.Define AP1, AP2 on (A x P). AP1 and AP2 functional. 2.Define PP21 as chain (inv(P2) o P1). Declare PP21 irreflexive. 3.Individuals in AP1 include (a1,p1). Individuals in AP2 include (a1,p1). 4.A and P are disjoint

<b>What is the expected output? What do you see instead?</b> &quot;NonSimpleRoleInNumberRestrictionException&quot; but FaCT++ crashes. I get this exception message and FaCT++ does not crash if the inconsistency is removed.

<b>What version of the product are you using? On what operating system?</b> Protege P4 distribution, build 118.

<b>Please provide any additional information below.</b> It is unfortunate that this assertion/axiom pattern cannot be handled by the current reasoner. Under closed world, a simple algorithm exists to verify consistency - join across the two relations and check the resulting tuples for (n,n) pairs. Unclear to me why the blocking strategy does not handle this case, but I'm not an expert. This sort of co-occurrence restriction is frequently found in ontology. In banking, for example, a loan approver is not allowed to be the owner of the loan.

Comments (2)

  1. Dmitry Tsarkov reporter

    Comment [#1](https://code.google.com/p/factplusplus/issues/detail?id=16#c1) originally posted by dtsarkov on 2009-09-10T14:46:24.000Z:

    It doesn't crash with P4 and the SVN version of FaCT++. So probably fixed. If you can confirm that it is really the case, I'll close the bug. I can't say when the new version will be released though, so it is unknown when this problem will be fixed in the binary release.

  2. Log in to comment