14:39:42 RRSAgent has joined #rif 14:39:43 logging to http://www.w3.org/2009/03/17-rif-irc 14:39:54 rrsagent, make log public 14:40:27 Regrets: JosDeBruijn, AxelPolleres 14:40:40 Chair: Christian de Sainte Marie 14:40:48 zakim, clear agenda 14:40:48 agenda cleared 14:40:57 agendum+ Admin 14:41:06 agendum+ Liaisons 14:41:18 agendum+ F2F13 14:41:30 agendum+ Actions review 14:41:42 agendum+ ISSUE-92 14:41:50 agendum+ ISSUE-91 14:42:04 agendum+ ISSUE-80 14:42:15 agendum+ ISSUE-37 14:42:24 agendum+ AOB 14:43:16 rrsagent, make minutes 14:43:16 I have made the request to generate http://www.w3.org/2009/03/17-rif-minutes.html csma 14:43:24 Meeting: RIF Telecon 17 March 2009 14:44:02 Agenda: http://lists.w3.org/Archives/Public/public-rif-wg/2009Mar/0077.html 15:00:44 SW_RIF()11:00AM has now started 15:00:53 +Sandro 15:00:57 DaveReynolds has joined #rif 15:01:23 +??P61 15:01:37 zakim, ??P61 is me 15:01:37 +csma; got it 15:01:47 +??P72 15:02:27 AdrianP has joined #rif 15:03:29 cke has joined #RIF 15:03:32 +??P36 15:05:16 +??P37 15:05:35 Zakim, +??P37 is me 15:05:47 Zakim, ??P37 is me 15:05:55 Scribe: Adrian Paschke 15:05:57 sorry, AdrianP, I do not recognize a party named '+??P37' 15:05:58 zakim, +??p36 is me 15:06:03 +AdrianP; got it 15:06:09 scribenick: AdrianP 15:06:15 sorry, cke, I do not recognize a party named '+??p36' 15:06:56 *PROPOSED:* accept minutes of telecon March 3 [1] 15:06:58 PROPOSED: to approve the minutes of March 3 telecon 15:07:00 http://lists.w3.org/Archives/Public/public-rif-wg/2009Mar/0035.html 15:07:07 Zakim, +??P36 is me 15:07:28 sorry, cke, I do not recognize a party named '+??P36' 15:07:41 zakim, ??P36 is cke 15:07:52 +cke; got it 15:08:04 RESOLVED: to approve the minutes of March 3 15:08:14 PROPOSED: to approve the minutes of March 10 15:08:32 http://lists.w3.org/Archives/Public/public-rif-wg/2009Mar/att-0051/2009-03-10-rif-minutes.html 15:08:51 RESOLVED: to approve the minutes of March 10 15:09:02 next item 15:09:16 zakim, close item 1 15:09:16 agendum 1, Admin, closed 15:09:17 I see 7 items remaining on the agenda; the next one is 15:09:19 2. Liaisons [from csma] 15:09:26 next item 15:10:36 Sandro: datatypes in OWL RL 15:11:05 Sandro: we need to decide if we object on any of these datatypes 15:11:12 Sandro: go for joint value spaces 15:11:22 Sandro: list datatypes in OWL RL 15:11:25 +Gary 15:11:56 Gary_Hallmark has joined #rif 15:12:16 next item 15:12:30 Adrian: HCLS looks into query federation for the distributed HCLS KB in Deri and FU Berlin 15:12:59 next item 15:13:01 Adrian: + linked open data interfaces ontop of the KBs 15:13:12 zakim, close item 3 15:13:12 agendum 3, F2F13, closed 15:13:13 I see 5 items remaining on the agenda; the next one is 15:13:14 4. Actions review [from csma] 15:13:16 next item 15:14:20 Action 711 closed 15:14:20 Sorry, couldn't find user - 711 15:14:53 action 708 continued 15:14:53 Sorry, couldn't find user - 708 15:14:56 Harold has joined #rif 15:15:09 action 701 continued 15:15:09 Sorry, couldn't find user - 701 15:15:30 continued action 692 15:15:42 cke: waiting on feedback from Harold 15:15:43 +[NRCC] 15:16:26 Harold: should have something for the next telecon 15:17:26 cmsa: think there is a test case on UCR 4.1 proposed by Stella 15:17:34 Michael_Kifer has joined #rif 15:18:19 next item 15:18:57 + +1.631.833.aaaa 15:19:12 zakim, aaaa is me 15:19:12 +Michael_Kifer; got it 15:19:22 1. Make it clear this is only shorthand for the purposes of writing DTB, and 15:19:23 that all rulesets must use a fixed arity function/predicate 15:19:23 1a. specify one rather than n different functions. So, in the case of concat we 15:19:23 would only have a binary string concatenation function. Clearly all the others 15:19:23 can be built from this base case. 15:19:23 3a. Remove all the well-formedness requirements. The same symbol can have 15:19:25 several arities, can be a pred, func, and an individual in different contexts. 15:19:27 3b. To keep the separation between preds, funcs, and individuals, but pred, 15:19:29 func, external symbols can have multiple arities. 15:19:31 3c. To keep things as before, but for external symbols to allow multiple arities 15:19:33 (and maybe even allow them to be funcs and preds in different contexts). 15:20:40 csma: the different options we have 15:22:12 -0 option 1 (don't much like it, but it's okay) 15:22:14 0 15:22:16 0 15:22:19 -0 15:22:19 0 15:22:23 -1 opt 1 15:22:23 0 15:22:54 1 15:22:57 0 option 1a 15:22:58 +0.5 15:23:04 +0 option 1a (only have binary strcat), fixed arity. 15:23:08 -0 15:23:13 -1, I dont understand 1a 15:23:49 -0.5 15:24:04 (mk changes after verbal explanation) 15:24:24 Michael_Kifer has joined #rif 15:24:38 +1 for 3a 15:24:54 -1 option 3a (I don't think we can get it to work right -- +1 if we could actually implement it) 15:25:11 -1 option 3a 15:25:19 jos: -1 option 3a (from e-mail) 15:25:23 +0.5 option 3a if it can be done 15:25:38 -0.1 15:25:49 csma: option 3b 15:25:57 +1 option 3b 15:26:00 +1 option 3b 15:26:13 +1, 3b 15:26:20 axel: +1 option 3b (from e-mail) 15:26:23 +1 for 3b 15:26:25 cmsa: Axel prefers 3b 15:26:34 +1, 3b 15:26:37 0 15:26:44 cmsa: Jos prefers 1 or 1a 15:26:50 option 3c 15:26:58 +0.5 option 3c 15:27:01 +0.5 option 3c 15:27:05 +0.3, 3c 15:27:09 0, option 3c 15:27:13 +0.75 15:27:19 +0, 3c 15:28:22 PROPOSED: To keep the separation between preds, funcs, and individuals, but pred, func, external symbols can have multiple arities. Closing ISSUE-92. 15:29:11 -DaveReynolds 15:29:19 ciao DaveReynolds 15:29:46 csma: do this proposal next week 15:29:56 next item 15:30:07 csma: proposed solutions will be resolved next week 15:30:30 csma: bounded quantifiers 15:30:47 http://www.w3.org/2005/rules/wg/meeting/2009-01-14 15:32:29 csma: reason for bounded quantifiers in PRD 15:32:48 csma: most PRD engines have them for the reason of efficiency 15:32:54 csma: PRR has them 15:33:04 its trivial syntactic sugar, how can it affect performance? 15:33:05 cmsa: will be needed for an else part 15:33:39 its an annoying difference between PRD and Core -- should be in both or better, in neither 15:34:49 forall ?x, if cond(?x) then action1(?x) else action2(?x) 15:35:10 adrianpaschke has joined #rif 15:35:29 just use 2 rules 15:35:38 sandro2 has joined #rif 15:35:52 testing. 15:36:03 just dropped out of irc 15:36:06 not need in Oracle Business Rules, maybe ILOG 15:36:36 not a great reason to add to PRD either, IMHO 15:36:49 csma: logic rules do not have an else part? 15:37:01 csma: what would be a reason to add else in Core? 15:37:12 Sandro: convient write rules as if-then-else rules 15:37:29 cke has joined #RIF 15:37:46 not "else" -- just Bounded Quantifiers are nice. 15:37:52 you really want people trying to "performance tune" their rules by moving conditions to different parts of a rule? 15:38:10 Sandro: write rules with bounded quantifiers - readability issue 15:38:13 Christian mentioned performance 15:38:32 Sandro: for me the reason is just readability 15:38:35 this is a semantic issue: bounded quantifier qualify the objects for if / else rules 15:38:41 csma: perfomance was the reason for PRD 15:39:40 I don't think this is a common issue 15:40:15 csma: bounded quantifier - would they effect the safeness condition 15:40:42 Bounded quantifiers remind me of sorted variables, which came into BLD, then were taken out... 15:41:37 csma: if bounded quantifier tells which are all the values you can bind -> you are safe 15:42:12 I think no impact on safeness 15:42:32 Harold: bounded quantifiers are not in BLD 15:43:00 Harold: similar to sorted variables, which were taken out 15:43:06 Harold: not in last call BLD 15:43:31 michael: I don't we can add them to Core without changing BLD 15:44:14 csma: just try to understand the impact - if there is a reason for a second last call 15:44:26 michael: impact is - redo BLD 15:44:45 Sandro: for BLD it is just syntactic sugar 15:44:54 michael: need to check consistency 15:45:19 Sandro: not a priority issue - just if we have time 15:45:41 michael: in general bounded quantifiers are useful 15:45:52 michael: will make it easier to express things 15:46:08 michael: optimization 15:46:43 remove from PRD: +1, add to Core: +0.5, leave in PRD but nowhere else: -0.5 15:46:44 can we keep bounded quantifier in PRD, even it is not in Core? 15:46:45 michael: it is syntactic sugar that helps 15:47:53 csma: wondering if in other logical dialects bounded quantifiers are more than syntacty sugar 15:48:04 michael: onyl few languages have them 15:48:08 miachel: e.g. mecury 15:48:36 csma: not so many benefits to add them to Core 15:48:58 csma: not priority to add them in Core 15:49:17 csma: I'm hearing not much enthusiasm for them in Core. 15:50:24 michael: in the body of a rule such a quantifier is not very useful 15:50:36 michael: useful for universal quantifiers 15:50:43 Couldn't bounded quantifiers become another syntactic desugaring effort on top of RIF, rather than part of RIF? 15:50:52 PROPOSED: (Only if we're doing a second last call of BLD anyway) Add Bounded Quantifiers to Core and BLD. 15:51:03 An example of rule with bounded quantifier: (forall customers such that age > 18 and city is Paris) (if the customer is rich then do something else do something). The first part is a bounded quantifier, it defines the objects for the rule. 15:51:23 michael: univerisal quantifiers in the rules body help simplify the expression 15:51:56 +1 (but not enough to slip the schedule more than about two weeks) 15:52:24 (THIS IS A STRAWPOLL REALLY) 15:53:10 +0.5 (but rather remove from PRD) 15:53:21 -0.5 15:53:26 -0.1 15:53:26 +1 15:54:20 for translating from PRD into Core a translator would need to create two rules from one with bounded quantifiers 15:54:33 sandro, I think thee sched will slip > 2 wks because of these quantifiers 15:54:52 next item 15:56:02 (2) Leave pred:literal-equal as is 15:56:02 [on the grounds of symmetry with pred:literal-not-equal, accepting there 15:56:02 is some redundancy.] 15:56:02 (1) Drop pred:literal-equal (retaining pred:literal-not-equal) 15:56:02 [This still leaves me able to shorten the OWL 2 RL and similar rules.] 15:56:03 (3) Redefine pred:literal-equal to perform all the datatype specific 15:56:05 equality tests (and redefine pred:literal-not-equal compatibly so that 15:56:07 for any pair of literals exactly one of these predicates is true). 15:56:09 [This means I can't use those predicates for the OWL 2 RL rules easily 15:56:11 (assuming OWL opt for disjoint value spaces). However, there may still 15:56:13 be value in such predicates for other users.] 15:56:15 (0) Drop both pred:literal-equal and pred:literal-not-equal 15:56:17 http://lists.w3.org/Archives/Public/public-rif-wg/2009Mar/0076.html 15:56:35 csma: four options 15:57:35 csma: pred_literal-equal(x,y) 15:57:45 csma x and y are literal and x=y 15:57:46 sandro: "as is" is: literal-equal(x,y) iff literal(x) and literal(y) and x=y 15:58:34 LeoraMorgenstern has joined #rif 15:59:14 +Leora_Morgenstern 15:59:50 RRSAgent, pointer? 15:59:50 See http://www.w3.org/2009/03/17-rif-irc#T15-59-50 16:00:00 LeoraMorgenstern, you can see the IRC log so far there. 16:01:29 strawpoll: option "(2)" pred:literal-equal "as is" --- literal-equal(x,y) iff literal(x) and literal(y) and x=y 16:01:47 +0.5 16:01:52 +0.5 16:02:05 -0.1 16:02:27 -0.5 16:02:37 Dave: +1 (according to his email) 16:03:21 Jos: prefers not to have generic predicates and if we have them prefers XPath built-ins (by email) 16:03:37 Jos: -0.5 (according to email) 16:03:42 STRAWPOLL: option "(1)" Drop pred:literal-equal (retaining pred:literal-not-equal) 16:03:52 +1 16:04:00 -1 16:04:12 -0.99 16:04:22 +0.8 16:04:57 yes, for usability reasons it is good to have them both 16:05:02 STRAWPOLL: option "(3)" Redefine pred:literal-equal to perform all the datatype specific ... ("xpath equality") 16:05:27 +0.99 16:05:29 +0 nice for users, maybe hard to implement 16:05:30 +1 16:06:11 Dave: -0.5. (according to email) 16:06:22 Jos: -0.5 (according to email) 16:06:27 0 16:06:45 cke: 0 16:06:47 STRAWPOLL: option "(0)" Drop both pred:literal-equal and pred:literal-not-equal 16:06:55 +1 16:07:00 -0.25 16:07:12 +1 16:07:52 Jos: +1 (according to email) 16:08:00 -1 16:08:11 (it's about extensibility) 16:08:18 -0.9 16:09:04 (it's about being able to write an OWL-RL ruleset that doesn't know what datatypes are supported.) 16:09:29 Dave: -0.5 (according to e-mail) 16:09:42 csma: probably option 3 16:09:57 0 16:10:01 theory guys: I guess adding != (i.e. Not(a=b)) breaks everything? 16:10:48 seems like we are hung up on owl:different 16:11:02 csma: we have discussed this issue from the OWL-RL point of view 16:11:43 csma: general literal-equal will provide extensibility 16:11:53 Sandro: except of a non-identity test 16:12:09 Sandro: can have all the XPath indentity tests 16:13:41 STRAWPOLL: Have xpath-style-equals, xpath-style-not-equals, AND non-identical-literals (eg for OWL RL). 16:14:29 "non-identical-literals" == current pred:literal-not-equals 16:14:43 +0.5 it'd be nice, but it sounds like too much work. 16:14:55 +0.5 16:14:57 0 16:14:59 +0.5 16:14:59 +9 16:15:05 oops, +.9 16:17:09 PROPOSED: Have xpath-style-equals, xpath-style-not-equals, AND pred:literal-not-equal for non-identical-literals (eg for OWL RL). Closing ISSUE-80. 16:18:34 Sandro: worried about the work 16:18:44 * Axel is DTB author ;-) 16:19:07 next item 16:19:20 zakim, take up item 8 16:19:21 agendum 8. "ISSUE-37" taken up [from csma] 16:20:04 csma: important issue for PRD 16:20:14 csma: almost finished by new strawman 16:20:23 csma: and we have Gary starwman 16:21:04 -1 16:21:17 -9 16:21:30 no, -9 16:23:09 csma: big benefit is simplicity and implementability of the proposal 16:23:43 csma: two cons; XML document without a schema, you need a schema 16:24:02 csma: cannot work with data without a schema 16:24:15 csma: second issue, if we import RDF document as XML 16:24:27 csma: will have a completey different RIF document 16:24:39 csma: than if we use SWC for RDF intergration 16:25:20 csma: my proposal can handel data with and without schema 16:26:07 csma: compatible with SWC in the sense that if you import RDf document as RDF/XML (given a view conventions) you will have the same document 16:26:14 csma: with the same interpretation 16:26:32 csma: contrast to Michael - I think it is quite elegant 16:26:42 csma: but strawman is not finished yet 16:27:01 csma: not sure how easily implementable it is 16:27:29 csma: easy if you know the schema and mapping to your platform-sepcific language 16:27:38 csma: if you need to do the mapping on the fly 16:28:05 csma: proposal orthorgonal to Gary's proposal 16:28:57 didn't read it yet, sorry :-( 16:29:30 michael: proposal is a good starting point - send an email about what I don't like 16:29:42 michael: can be probably improved 16:31:03 csma: would like that someone takes a look if it is compatible with SWC 16:31:31 -[NRCC] 16:31:35 -Michael_Kifer 16:31:36 -Leora_Morgenstern 16:32:01 -Gary 16:32:08 -cke 16:32:22 zakim, list attendees 16:32:22 As of this point the attendees have been Sandro, csma, DaveReynolds, AdrianP, cke, Gary, [NRCC], +1.631.833.aaaa, Michael_Kifer, Leora_Morgenstern 16:32:29 rrsagent, make minutes 16:32:29 I have made the request to generate http://www.w3.org/2009/03/17-rif-minutes.html csma 16:33:36 -AdrianP 16:33:50 zakim, who is on the phone? 16:33:50 On the phone I see Sandro, csma 16:36:22 -Sandro 16:36:23 -csma 16:36:25 SW_RIF()11:00AM has ended 16:36:26 Attendees were Sandro, csma, DaveReynolds, AdrianP, cke, Gary, [NRCC], +1.631.833.aaaa, Michael_Kifer, Leora_Morgenstern 18:00:18 AdrianP has joined #rif 18:01:39 csma has left #rif