The answer to the main question asked in the following blog article:
http://labs.jboss.com/portal/index.html?ctrl:cmd=render&ctrl:window=default.blog.PrjBlogPortletWindowDefaultBlog&project=jbossrules&from=1&link=Are_Rule_Engines_Turing_Complete%3F#Are_Rule_Engines_Turing_Complete%3F
is: YES, rule engines are Turing complete. It was proved in the
following paper:
Jon Sneyers, Tom Schrijvers and Bart Demoen. The Computational Power and
Complexity of Constraint Handling Rules. 2nd Workshop on Constraint
Handling Rules (CHR'05) at ICLP'05, Sitges, Spain, October 2005. Best
Paper Award
http://www.cs.kuleuven.ac.be/~jon/papers/chr_complexity.ps
http://www.cs.kuleuven.ac.be/~jon/papers/chr_complexity.pdf
You do not even need syntactic sugar like 'exist', 'accumulate',
'forall' or even 'not'...
CHeeRs,
Peter
begin:vcard
fn:Peter Van Weert
n:Van Weert;Peter
org:K.U.Leuven;Computer Science
adr:room 01.08;;Celestijnenlaan 200A;Heverlee;;3001;Belgium
email;internet:[EMAIL PROTECTED]
title:DTAI (Declarative Languages and Artificial Intelligence)
tel;work:+ 32 16 327064
x-mozilla-html:TRUE
url:http://www.cs.kuleuven.be/~petervw/
version:2.1
end:vcard
---------------------------------------------------------------------
To unsubscribe from this list please visit:
http://xircles.codehaus.org/manage_email
