{"action":"opened","issue":{"url":"https://api.github.com/repos/santiontanon/RHOG/issues/3","repository_url":"https://api.github.com/repos/santiontanon/RHOG","labels_url":"https://api.github.com/repos/santiontanon/RHOG/issues/3/labels{/name}","comments_url":"https://api.github.com/repos/santiontanon/RHOG/issues/3/comments","events_url":"https://api.github.com/repos/santiontanon/RHOG/issues/3/events","html_url":"https://github.com/santiontanon/RHOG/issues/3","id":174527760,"number":3,"title":"Question about subsumption/refinement operators","user":{"login":"YPares","id":1377233,"avatar_url":"https://avatars.githubusercontent.com/u/1377233?v=3","gravatar_id":"","url":"https://api.github.com/users/YPares","html_url":"https://github.com/YPares","followers_url":"https://api.github.com/users/YPares/followers","following_url":"https://api.github.com/users/YPares/following{/other_user}","gists_url":"https://api.github.com/users/YPares/gists{/gist_id}","starred_url":"https://api.github.com/users/YPares/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/YPares/subscriptions","organizations_url":"https://api.github.com/users/YPares/orgs","repos_url":"https://api.github.com/users/YPares/repos","events_url":"https://api.github.com/users/YPares/events{/privacy}","received_events_url":"https://api.github.com/users/YPares/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2016-09-01T13:46:31Z","updated_at":"2016-09-01T13:46:31Z","closed_at":null,"body":"Hi!\r\nI have a question related to graph vs. tree version of refinement operators and subsumption when using a PartialOrder to anti-unify (for instance POTransSubsumption vs. TreePOTransSubsumption and POTransRefinement vs. TreePOTransRefinement)\r\n\r\nShould I use the Tree version : \r\n- when PartialOrder is a tree\r\n- when DLGs to anti-unify are TreeDLGs\r\n- when both are trees?"}}
{"actor":{"display_login":"YPares"}}