<br><br><div class="gmail_quote">2010/7/11 Norbert E. Fuchs <span dir="ltr"><<a href="mailto:fuchs@ifi.uzh.ch">fuchs@ifi.uzh.ch</a>></span><br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">
<div class="im"><br>
On 11 Jul 2010, at 15:21, Gabriele Kahlout wrote:<br>
<br>
> I'm still not able to express certain mutual exclusiveness with Attempo.<br>
><br>
> I want to say:<br>
> ∀x. IsInserted(x) ⇒ ¬∃y. IsInserted(y) ∧ x ≠y<br>
><br>
> My expected translation of that would be:<br>
> If there exists an x that is inserted then there does not exist a y different from x that is inserted.<br>
> OR (inclusive!):<br>
> For every x that is inserted there is no y different from x that is inserted.<br>
> Tersely: Only one object could be inserted.<br>
><br>
> How could this exclusiveness be expressed?<br>
<br>
</div>As in your FOL formula just express that x is not y, i.e. use "is not" in ACE.<br>
<br>
See section "2.3.3 Negating Verb Phrases" in the document "ACE Construction Rules" (<a href="http://attempto.ifi.uzh.ch/site/docs/ace_constructionrules.html" target="_blank">http://attempto.ifi.uzh.ch/site/docs/ace_constructionrules.html</a>).<br>
<br>
We are certainly happy to answer your questions, but may I suggest again that you have a look at the documentation?</blockquote><div>Norbert is right.</div><div><br></div><div>I enjoyed this problem, and here is my solution :</div>
<div><br></div><div> ./ape.exe -guess -text 'For everything X that is a:inserted there is no thing Y such that Y is a:inserted, and Y is not X.' -solo drspp</div><div>[]</div><div> [A, B, C]</div><div> object(A, something, dom, na, na, na)-1/3</div>
<div> property(B, inserted, pos)-1/9</div><div> predicate(C, be, A, B)-1/6</div><div> =></div><div> [D, E, F]</div><div> NOT</div><div> [G]</div><div> object(G, thing, countable, na, eq, 1)-1/13</div>
<div> object(D, something, dom, na, na, na)-1/17</div><div> property(E, inserted, pos)-1/21</div><div> predicate(F, be, D, E)-1/18</div><div> NOT</div><div> [H]</div><div> predicate(H, be, D, A)-1/25</div>
</div>-- <br>Jean-Marc Vanel<br>Consulting, services, training,<br>Rule-based programming, Semantic Web<br><a href="http://jmvanel.free.fr/">http://jmvanel.free.fr/</a><br>EulerGUI, a turntable GUI for Semantic Web + rules, XML, UML, eCore, Java bytecode<br>
+33 (0)6 89 16 29 52 -- +33 (0)1 39 55 58 16<br>( we rarely listen to voice messages, please send a mail instead )<br>