How to Analyze Graph-Based Models - Www-st.inf.tu-dresden.de ...
How to Analyze Graph-Based Models - Www-st.inf.tu-dresden.de ...
How to Analyze Graph-Based Models - Www-st.inf.tu-dresden.de ...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Central Theorem of Datalog/DL/EARS<br />
► Any Datalog program or EARS graph rewrite sy<strong>st</strong>em can be<br />
transformed in<<strong>st</strong>rong>to</<strong>st</strong>rong> an equivalent one<br />
■ That is free of recursion<br />
■ And only applies the opera<<strong>st</strong>rong>to</<strong>st</strong>rong>r TransitiveClosure<br />
■ (The ransitive closure uses direct recursion, but encapsulates it)<br />
► What does this mean in practice? (Remember, Datalog/EARS can<br />
be used <<strong>st</strong>rong>to</<strong>st</strong>rong> specify consi<strong>st</strong>ency con<strong>st</strong>raint on graph-based<br />
specifications)<br />
Prof. Uwe Aßmann, Softwaretechnologie II<br />
69