[shex] semantics of recursive shapes ill-founded

• From: Peter F. Patel-Schneider via GitHub <sysbot+gh@w3.org>
• Date: Thu, 22 Mar 2018 15:26:43 +0000
• To: public-shex-dev@w3.org
• Message-ID: <issues.opened-307692806-1521732402-sysbot+gh@w3.org>

pfps has just created a new issue for https://github.com/shexSpec/shex:

== semantics of recursive shapes ill-founded ==
There is a fundamental problem in the semantics of ShEx 2.0.

Consider

  S = :a { :p @:a }
  G = ( :x :p :x . }
  m = { ( :x :a ) }

When trying to determine whether m is valid for S and G the semantics gets
into an infinite loop trying to determine the value of

  satisfies(:x, @:a, G, m)

Please view or discuss this issue at https://github.com/shexSpec/shex/issues/84 using your GitHub account

Received on Thursday, 22 March 2018 15:26:47 UTC