- From: Dieter Fensel <dieter.fensel@deri.org>
- Date: Thu, 09 Feb 2006 12:24:19 +0100
- To: Francois Bry <bry@ifi.lmu.de>, public-rif-wg@w3.org
At 11:15 AM 2/9/2006 +0100, Francois Bry wrote:
>Dieter Fensel wrote:
>
>
>>3) What is the computational complexity of disjunctive consequences
>>(answer set programming)
>>compared with standard approaches in rule languages?
>>
>The question is imprecise. If one means an IC with disjubtie consequent,
>then the evlaution is polynpomial in the size of the IC.
>--
>Francois
Lets re-phrase my question:
1. Disjunctive heads are out of the scope of phase 1. Do you agree
(have you read the charter)?
2. There does not exist any scalable and commercial implementation
of a rule engine for rules with disjunctive heads?
Existing inference engines that support such type of languages are
toys for academics, only?
----------------------------------------------------------------
Dieter Fensel, http://www.deri.org/
Tel.: +43-512-5076485/8
Skype: dieterfensel
Received on Thursday, 9 February 2006 11:24:36 UTC