Expressions in OWL-S

> [$Aj;AX(B $AQn(B]
>   I'm doing a research about semantic web service matching and
>   composition, and I have noted that in the article "OWL-S: Semantic
>   Markup for Web Services ", you have mentioned:
>   "our approach is to treat expressions as literals, either string
>   literals or XML literals. The latter case is used for languages
>   whose standard encoding is in XML, such as SWRL [8] or RDF
>   [11]. The former case is for other languages such as KIF [10] and
>   PDDL [6]. "
>   My question is: Is there other ways to describe the P.E
>   "expressions" except SWRL, RDF, KIF and PDDL, e.g., using the
>   Description Logic formula?

No, not in general.  DL is a subset of first-order logic (FOL), so if you
need all of FOL you can't use it.

>   I want to try this way because the DL reasoner is already made, so
>   please tell me is this method feasible?

There are reasoners for FOL, too, and there are other interesting
subsets besides DL.  SWRL uses essentially Horn clauses, which means
that a logic-programming system can process it with reasonable
efficiency in many cases.  Even though DL reasoners come with some
guarantees that other reasoning systems don't, that doesn't always
mean they're more efficient in particular problem areas.

-- 
                                                -- Drew McDermott
                                                   Yale Computer
                                                   Science Department

Received on Thursday, 12 October 2006 18:57:19 UTC