17:59:52 RRSAgent has joined #sw-team 17:59:58 SW_SWAD()2:00PM has now started 17:59:59 +DanC 18:00:17 +DanBri 18:00:33 JosD has joined #sw-team 18:00:37 -DanBri 18:00:46 reagleMIT has joined #sw-team 18:01:03 +DanBri 18:01:38 +Marja 18:01:44 +??P8 18:01:59 +??P9 18:02:07 +TimBL 18:02:30 ryan-lap has joined #sw-team 18:02:38 zakim, who is here? 18:02:38 On the phone I see DanC, DanBri, Marja, JosD, ??P9, TimBL 18:02:39 On IRC I see ryan-lap, reagleMIT, JosD, RRSAgent, Zakim, marja, danbri, RalphS, Nobu, emscribe, dom, DanC, sandro, ericP, Ralph 18:02:47 Danny-DC has joined #sw-team 18:03:18 Danny, are you joining us today? 18:03:19 tim-mit has joined #sw-team 18:03:27 yes, I am. 18:04:20 DeborahMc has joined #sw-team 18:04:53 JosD has joined #sw-team 18:04:53 tim-mit has joined #sw-team 18:04:53 DeborahMc has joined #sw-team 18:04:58 odd... 18:05:01 Zakim, Stanford/KSL holds DebM, Paulo 18:05:01 +DebM, Paulo; got it 18:05:15 Zakim, who's on the phone? 18:05:15 On the phone I see DanC, DanBri, Marja, JosD, Stanford/KSL, TimBL 18:05:16 Stanford/KSL has DebM, Paulo 18:05:28 +Danny 18:05:49 Zakim, TimBL is really TimsOffice 18:05:49 +TimsOffice; got it 18:06:09 Zakim, TimsOffice holds TimBL, Sandro, Ryan, EricP 18:06:09 +TimBL, Sandro, Ryan, EricP; got it 18:07:02 +EMiller 18:07:55 RRSAgent, pointer? 18:07:55 See http://www.w3.org/2003/04/29-sw-team-irc#T18-07-55 18:08:40 [[ The IRC log will 18:08:40 appear at http://www.w3.org/2003/04/29-sw-team-irc. ]] 18:09:16 ------- convene 18:09:19 proposed agenda: http://www.w3.org/2003/04/29/swad/ 18:09:58 sandro: what do we do with the irc log of this conference? 18:10:11 debM: public is OK with us 18:10:18 [no objections] 18:10:22 RESOLVED record of this meeting be public 18:10:50 q+ to be an example 18:11:07 ack ericP-scribe 18:11:07 ericP-scribe, you wanted to be an example 18:12:18 sandro: this is DAML-funded research, _not_ rec track or member-supported 18:12:40 sandro: we'll discuss follow up meetings in the last 15 mins of this meeting 18:12:51 (although we hope some Members are supportive of these efforts... they're just not funding it via Member fees) 18:13:11 [tim returns] 18:13:40 sandro: goal: to plan and design for interop between planners, reasoners and explainers 18:14:52 debm cant hear either 18:15:10 debM, can you hear sandro? 18:15:20 yes sorry - it was just eric 18:15:33 danc: proving to humans is interesting, but a side goal 18:15:48 *not* a goal, to me, to prove things to human 18:15:54 might be a side benefit 18:15:58 sandro: debM's interest is in explainer UIs, nto verifiers 18:16:37 sandro: if PPF works for a verifier, that's just gravy? 18:17:05 debM: yes, one datapoint of buy-in from the verifyer community 18:17:11 http://www.w3.org/2003/04/29/swad/ 18:18:13 debM: may want to add use cases, perhaps in follow-up email 18:18:43 sandro: coordinating multiple reasoners, JTP and cwm work on common proof 18:19:06 exactly 18:19:13 paulo: if reasoner B uses reasoner A, it can use the PPF context 18:19:45 jos: +testing 2nd opinions by idependent reasoners 18:19:55 2nd opinion test cases... pointer? could you follow up in email with pointers? 18:20:56 paulo: multiple justifications makes proof more complex but allows one to detect contradictions 18:21:18 agenda + reductio ad absurdum, LEM (under C. Issues) 18:21:34 will do that (but proofs are kind of not very human readable...) 18:21:43 agenda + how registration works with registered stuff (under C. Issues) 18:21:54 paulo: general plan it to focus on justification 18:22:09 debm: today we provide a proof browser. 18:22:35 ... using rewrite rules to transform proof trace into an explaination, abstracting away some details. 18:22:56 ... could make it more understandable for any particular audience. 18:23:20 Tim look in w3c archive at http://lists.w3.org/Archives/Public/www-archive/2003Apr/0065.html 18:23:35 paulo: one way of seeing how a machine arrived at a proof is by verifying the proof 18:23:39 there is the pointer to the original as well 18:23:44 proposed proof language in DAML: http://www.ksl.stanford.edu/software/IW/spec/iw.daml not sure if there's a prose write-up. but that's what I found from the agenda. 18:23:50 http://belo.stanford.edu:8080/iwbrowser/WffBrowser?url=http://www.ksl.stanford.edu/software/IW/sample/TS/IW1.daml 18:24:28 sandro: i found it easiest to play with browser making chagnes and examining RDF. 18:24:33 ... do you have a prepared path? 18:24:45 debm: planned to be responsive to your needs. 18:24:56 [debm walks us trhough tony is a seafood] 18:26:03 danc, it's all onclick events 18:26:36 http://belo.stanford.edu:8080/iwbrowser/WffBrowser?url=http://www.ksl.stanford.edu/software/IW/sample/TS/IW1.daml 18:27:59 [viewing with proof style: proof, sentence format: english, lens mag: 3 18:28:00 ] 18:29:02 I'm at http://belo.stanford.edu:8080/iwbrowser/WffBrowser?url=http://www.ksl.stanford.edu/software/IW/sample/TS/IW1.daml 18:29:46 I see what danc is seeing 18:29:59 premises to ultimate conclusions I see is "For all values of ?inst: ?inst is a seafood when ?inst is a crab." and "Tony is a crab." 18:30:11 http://belo.stanford.edu:8080/iwbrowser/index.jsp 18:30:59 now I'm at http://belo.stanford.edu:8080/iwbrowser/WffBrowser?url=http://www.ksl.stanford.edu/software/IW/tmp/IW1.daml 18:31:43 eek! same address as before, but different stuff on the screen! 18:33:21 timbl: this is an example of why web architecture says URIs should be unambiguous. 18:34:05 RalphS has joined #sw-team 18:34:09 debm: we want feedback on the explainations (rules product) 18:37:58 in N3, { :shellfish s:subClassOf :seafood } is log:includes of [ is log:semantics of ] 18:38:59 deb: side conditions are more premises that we dont anticipate you'd want to see in the proof 18:40:05 patterns of sentences... that resulted in wtr in earlier KIF versions. i.e. quoting ;-) but I gather the CL folks threw out quoting recently 18:40:35 jos: how can I see what the bindings are? 18:40:47 paulo: there;s a supporting document that's not available now 18:40:56 deb: click on "v" box 18:41:08 [[ ?x = |http://www.ksl.stanford.edu/DAML/query-answer/wines-short2.daml#|::|SEAFOOD| ]] 18:41:56 (the "v" box is after "Tony is a seafood.") 18:42:02 paulo: most reasoners seem to lose bindings when they dump a proof 18:42:16 ack DanC 18:42:16 DanC, you wanted to check that we're all on the same page and to note including source info in the logic 18:42:51 danc: having source info off to the side... this is a critical part of the proof. in N3 it's part of the formula. 18:42:56 in N3, { :shellfish s:subClassOf :seafood } is log:includes of [ is log:semantics of ] 18:43:08 debm: some folks just dump (provenence) on the floor. 18:43:31 sandro: look at format behinde this? 18:43:42 zakim, drop danbri 18:43:42 DanBri is being disconnected 18:43:43 -DanBri 18:44:04 debm: first, following danc's comment, click on second explaination point. 18:44:38 "!" are "explanation points" 18:45:02 paulo: a large proof will have a huge contribution from ground facts. 18:45:25 danc: you believe this or you don't. 18:45:32 tim: you can go back to the sources. 18:46:13 tim: presumably you gave it these documents. to make it complete, you can point back to where you gave it the documents. 18:46:30 paulo: every step can be related to many documents. 18:46:55 debm: in this particular case, all came from wine-test. 18:47:18 tim: you told it where where to get these documents. 18:47:30 ... the eventual proof will be "you told me so". 18:47:49 ... interesting to know what docs were used. 18:47:57 tim: "this is very nice" :-) 18:48:13 ... eg, filling out a tax form and discovering it used a documment you thought was private/personal... 18:48:31 one take away we will add is a summary of all documents used (along with the listing we already have of all ground axioms used) 18:48:56 paulo: ... creating an annotation mechanism for annotating the sources of ground axioms of your proof. 18:49:09 sandro: maybe you can point that out in the format. 18:50:01 drewmcd has joined #sw-team 18:50:15 debm: the document icon will take you to the source document of the current node 18:50:28 paulo: each node of the proof is a separate file. 18:50:39 Welcome, Drew. Are you going to call in? 18:50:45 ... could combine them; there's a tradeoff 18:51:00 visual comments: why are the right side lines and left side lines not at the same level? and some more space between the sides would be nice 18:51:01 I don't think I'm going to call in 18:51:30 expected you might want to see the whole inference web spec, but it may be easier via this example. 18:52:01 debm: we are now looking at the node "the type of tony is seafood." 18:52:39 sandro: not quite following. these files have a single proof step. are there others that have combinded proof steps? 18:52:51 (timecheck... agenda calls for us to move on to the 2nd C at xx:45) 18:52:53 http://www.ksl.stanford.edu/software/IW/tmp/ is a listing of all of the files used 18:52:57 paulo: not now. we have generated some cases but not using them now. 18:53:14 Nobu0 has joined #sw-team 18:53:31 [when I follow the source link (document icon), I get an RDF/XML source node that doesn't fit in the fixed-sized browser popup window and the window (is presumably forced) to have no scrollbars] 18:53:34 paulo: one thing you can do is load a proof as an ontology [rdf graph]. 18:54:14 debm: http://www.ksl.stanford.edu/software/IW/tmp/ has all the files that lead to tony is a seafood. 18:54:28 ... you'll see the 13 pieces of the proof. 18:54:35 danc, understood. 18:54:44 ... now looking at IW1.daml 18:55:05 http://www.ksl.stanford.edu/software/IW/tmp/IW1.daml 18:55:09 sandro: could you walk us through it more closely? 18:55:27 paulo: releven part is the iw:WFF 18:55:28 [I confirm that the first part of http://www.ksl.stanford.edu/software/IW/tmp/IW1.daml appears to match the thing I can't scroll in the source node popup] 18:56:34 (type Tony SEAFOOD) is a label from the for a node in this proof. 18:56:49 debm: if you wanted to check this proof, you'd get that string out. 18:57:05 q+ 18:57:30 q+ to ask if iw:KIF denotes contents are parsable as KIF 18:57:58 tim: proof is no longer an RDF graph, it has embedded KIF. 18:58:23 paulo: it's difficult to get as good as KIF 18:58:35 tim: why use any RDF at all? 18:58:49 debm: want to be compatable with RDF and web. 18:59:05 zakim, q? 18:59:05 I see JosD, ericP-scribe on the speaker queue 18:59:20 danc: would make sense to do it all in KIF or RDF 18:59:45 timbl notes connection between (type Tony SEAFOOD) and |http://www.ksl.stanford.edu/DAML/query-answer/wines-short2.daml#|::|SEAFOOD| 19:00:02 tim: when i parse that KIF, i have to take it on faith that their aren't two SEAFOODs. 19:00:12 debm: this is the one without namespaces. 19:00:59 (I've got this paper that sandro mentioned, from Maimi, entitled "Inference Web: Portable Explanations for the Web"; I wonder if I can share it with those present via http URI) 19:01:31 ericP: you can do namespaces as a pre-processor 19:01:31 ack JosD 19:01:54 JosD: Tony, SEAFOOD, etc should be URIs or qnames or something 19:02:25 paulo: we can support that. it's just a hack. could have it by afternoon^H^H^H^H^Hevening 19:02:41 ah... http://www.ksl.stanford.edu/people/pp/papers/McGuinness_SSS_2003.pdf has pretty much the same content as the paper Sandro mentioned, with the WFF spelled out as an s-expression in RDF. 19:02:51 jos: see no convention for labeling rules 19:02:55 from InferenceWeb publications http://www.ksl.stanford.edu/software/IW/papers/ 19:03:09 paulo: there is no inference step related to IW1. 19:03:16 ... but you can in this format. 19:03:34 ... each inference step is the application of one inference rule. 19:04:40 ... can have link to other antecedents of this rule 19:05:01 "hasVariableMapping" == "binding" 19:05:33 debm: node lable (kif), consequent of inf step using GMP using inf engine JTP. 19:05:43 ... two antecedents IW2 and IW6 19:05:55 ... variable binding ?x := SEAFOOD. 19:08:04 somewhat updated http://www.w3.org/2003/04/29/swad/ 19:08:16 q+ 19:08:47 ack JosD 19:08:47 ack JosD 19:08:52 ericP: connection between "SEAFOOD" in "(type Tony SEAFOOD)" and ?x iw:Term "...SEAFOOD". 19:09:15 jos: what is the label of the implication itself? 19:09:19 19:09:47 debm: it's in the inference step. 19:09:53 ... you have the rule: GMP 19:10:04 ... antecedents: IW2, IW6 19:10:10 ... and the consequence. 19:10:58 debm: either IW2 or IW6 is the implication 19:11:13 i.e. 19:11:14 19:11:15 sandro: the inference step and the rule have the same URI 19:11:59 ... if you separate them, you can graph merge these files. 19:12:11 sandro: if you give the formula in IW2 its own name, you can merge it into the proof file. 19:13:04 jos: came to the conclusion that "Tony is a seafood", but where is it written? 19:13:17 danc: how is that not http://www.ksl.stanford.edu/software/IW/tmp/IW2.daml ? 19:13:28 (<= (type Tony ?x) (subClassOf CRAB ?x)) 19:14:18 Nobu has joined #sw-team 19:14:56 http://www.w3.org/2000/10/swap/test/reason/t4.proof <- comparable cwm proof. Use of {} in place of embedding kif in rdf,... variable names are uris,....parsing,.... 19:15:21 debm: we could record how the statement was proved, not just the value of it. 19:15:31 ... seems hard; what's the value? 19:15:56 tim: suppose we com across this implication and we want to use it elsewhere. 19:16:12 ... you refer to it via the proof step that led to it. 19:16:49 sandro: hasAntecedent points to the file 19:17:07 tim: semantics to the extra step. 19:17:21 Nobu has joined #sw-team 19:17:21 sandro: need about="" to keep filename 19:17:49 would be better, yes 19:17:52 about="#wff" 19:18:23 19:19:13 debM: small addition to PPF, which is fine. 19:19:30 we do not see it 19:20:22 -Danny 19:20:35 bye DanC 19:20:54 tim compares http://www.w3.org/2000/10/swap/test/reason/t4.proof to PPF... 19:20:59 not, that was Danny Weitzner excusing himself; I'm still here. 19:21:35 Nobu has joined #sw-team 19:21:46 tim: one question, how often do you give a copy of the conclusion? 19:21:56 I think "erasure" is a more traditional term than "extraction". hmm... part-of-speech mismatch. 19:22:06 ... ... denoted by "gives" here. 19:22:24 ... use/mention bug in non-quoted variables 19:23:13 jos: i think you can perfectly use it if you say that verable=that value as part of the explaination. 19:23:25 jos: another option is to say = 19:23:39 i.e. really use the variable, rather than mentioning it in a binding 19:24:33 timbl: problem with referential transparency... if x is bound elsewhere to d, we conclude c=d, no? [DanC wonders...] 19:24:34 drewmcd has joined #sw-team 19:24:52 http://www.agfa.com/w3c/euler/gedcom-proof.n3 19:25:35 sandro: tim, you have a good sense of what inference is doing. do you think cwm could output their files. 19:25:48 what I meant was eg {?C2 = :Rita. ?F = :dp. ?C2 gc:childIn ?F} => {:Rita gc:childIn :dp}. 19:26:02 doing the design in KIF and putting the <>s on later would be easier, for me 19:26:22 tim: problem is the mixture of KIF. 19:26:36 ... the KIF can be arbitrarily complex 19:26:49 KIF syntax is *much* simpler than s-expr-in-RDF syntax. 19:28:59 I've implemented URI namespaces in KIF 19:29:02 sandro: KIF is easy to parse. 19:29:21 ... but we need a standard for what URIs mean in KIF. 19:29:36 debm: namespace issue is not a big one for KIF. 19:29:45 http://www.w3.org/2000/10/swap/kifExpr.html 19:30:10 wineSEAFOOD 19:30:33 http://www.w3.org/2000/10/swap/KIFSink.py 19:30:57 sandro: the iw:KIF element is a crucial part of this proof. 19:31:21 What would a "standard for what URIs mean" look like? 19:31:30 debm: it would be easy to add 19:31:47 debm: ansi-KIF and ansi-stamped 19:31:54 danc: is it the bible? 19:32:03 Nobu has joined #sw-team 19:32:07 debm: nah. we use ansi kiff. 19:32:28 debm: we can read either 19:32:35 Deb: a lot of people still using KIF 3.0 because ansi kif dropped some things people cared about 19:32:46 ... some use kif3.0 'cause ansi dropped a couple things that people care about 19:32:49 ack DanC 19:32:49 DanC, you wanted to talk about registration and verification 19:33:11 dabc: stronger form of weakly queue is the one i care about. 19:33:21 s/weakly queue/wtr/ 19:33:27 (weakly true) 19:33:33 tim: brackets are for putting n3 in n3 19:33:35 deb, are you there? 19:33:38 DEB -- we cant hear ytou 19:33:44 s/one I care about/one that seems most relevant/ 19:33:51 zakim, who is here? 19:33:51 On the phone I see DanC, Marja, JosD, Stanford/KSL, TimsOffice, EMiller 19:33:53 Stanford/KSL has DebM, Paulo 19:33:54 TimsOffice has TimBL, Sandro, Ryan, EricP, RalphS 19:33:55 On IRC I see Nobu, drewmcd, RalphS, DeborahMc, tim-mit, JosD, Danny-DC, ryan-lap, reagleMIT, RRSAgent, Zakim, marja, danbri, em, dom, DanC, sandro, ericP-scribe, Ralph 19:34:15 ... want to use n3 on the inside and the outside. 19:34:44 danc: cheaper to get rid of the points and use KIF. 19:35:43 tim: declare the ns at the top and quote the document 19:35:47 I prefer uniform, self-similar syntax to any particular syntax. i.e. all-RDF or all KIF or all N3 is preferable to XML/KIF or KIF/N3 mix. 19:35:49 drewmcd has joined #sw-team 19:36:00 tim: It would be great to have a std way to put URIs into and out of KIF. 19:36:12 tim: If we had that, write your proof language in KIF. 19:36:24 ...: If you need the power of KIF, you need the power of KIF. 19:36:43 ...: the mixture of RDF/XML and KIF seems messy. 19:37:17 q+ 19:37:18 Deb: followup on NS in KIF 19:37:20 debm: action item for a subset of us to have conversation on ns in kiff? 19:37:40 danc: that's not my biggest issue with this PPF. 19:37:48 q- 19:37:58 MAJOR ISSUE: KIF 19:38:23 Nobu has joined #sw-team 19:38:23 ... point of a proof lang from my angle is that a verifier is a small bit of code. 19:38:39 ... that code is the proof checker. 19:39:10 ... when you install it locally, you have it sign its output. 19:39:25 Nobu has joined #sw-team 19:40:14 ... i want my locally installation of JTP to sign it's output. 19:40:38 ... and tell proofchecker the corresponsing pub key. 19:41:01 ... one way: everyone signs up with stanford. 19:41:26 ... other way: trust the signatures you know. 19:41:48 debm: expect both to happn 19:42:23 sandro: do you wnat proof format to distinguish between ... 19:42:30 signature checking as a proof step is an extension we will add 19:42:37 DanC: I just want signature verification to be a proof step 19:42:45 tim: other way to support trust is to look it up on the web. 19:43:05 ... anything that document A references is true. 19:43:28 danc: that's an innovation in theorum provers. 19:43:39 tim: do you have arithmatics built in? 19:43:51 debm: minimally. 19:44:41 danc: they have no builtins, just registered theorums and provers. 19:45:01 ... a certain number of these have to be blessed in a special way. 19:45:31 ... the proof check must know about a certain nnumber of inference rules. 19:46:05 debm: i think we'll have to do some registration for internal proof checking. 19:46:14 tim: crypto rules are particularly interesting 19:46:27 debm: we would expect to partner on this. 19:46:44 danc: have you looked at Felton's work? 19:46:47 jos: i have 19:47:02 danc: 'cause they are working on caching and speeding up 19:47:23 jos: putting burden on client makes job more modular. 19:47:48 burden on the client to generate the proof 19:47:57 Felten and company on PCA http://www.cs.princeton.edu/sip/projects/pca/ 19:48:47 Absolutely 19:49:00 jos: my making refrences to pieces that you would otherwise not know, you are proving ... 19:49:28 --------------------------------- 19:49:31 sandro: what next? 19:49:33 sandro: what happens next? 19:49:50 debm: one thing would be a small PP extension 19:49:57 "portable proof extension?" 19:50:21 ... converstaion between me and someone on that side, dunno who is best 19:50:27 tim: extension for what? 19:50:35 debm: premise labeling 19:51:17 debm: we need to get your infrence rules registered 19:51:35 ... paulo didn't think it looked hard either. 19:51:39 quit phone call 19:51:58 jos: puting it in n3 is the matter of a couple hundred lines. 19:52:18 debm: some experts on the phone were not confident. 19:52:44 debm: what we have registered is what we display. 19:53:16 [scribe is verrry sleepy now] 19:53:26 [to hot in here] 19:54:11 sandro: what about tim's point that KIF in RDF is ugly. need all round brackets or all pointy brackets. 19:54:25 so hot that... 19:55:02 debm: not a big prob. JTP does it all in KIF. with Jessica in the room, the problem will be solved. 19:55:51 danc: cwm could spit out nonsense and it (IW) would say "nifty". 19:56:07 debm: yes, today. but tomorrow, hopefully not. 19:56:36 i.e. IW sorta assumes the registered provers produce coherent/sound/valid/whatever proofs 19:57:07 but of course some verifier could work in parallel on the same inputs.... 19:57:36 tim: you are going to a higher level of abstraction 19:57:59 jos: some more built-ins would be very relevent. 19:58:09 ... cwm has close to 80 or so. 19:58:18 ... mathematics and crypto. 19:58:23 builtins == "procedural attachments" in RuleML-speak 19:58:32 ... how would that be done in KIF? 19:59:06 debm: tim: i think they'll be some standardization of these. 19:59:14 s/^debm: // 19:59:44 tim: for instance, the community will assume RDF can use the XML query primitives. 19:59:59 http://www.w3.org/2000/10/swap/doc/CwmBuiltins 20:00:12 ^ List of cwm's current built ins 20:00:53 I'll send a pointer to www-archive and us. 20:00:56 sandro: could send pointer to minutes to and archive, or www-rdf-logic or www-rdf-rules. 20:01:16 debm, danc: just archive. 20:01:17 ADJOURN 20:01:21 [closed] 20:01:32 -EMiller 20:01:43 -DanC 20:01:46 thanks folks, have to run 20:02:10 -JosD 20:02:15 -Marja 20:03:07 -TimsOffice 20:06:02 we hung up but are still on irc 20:06:30 SW_SWAD()2:00PM has ended 20:07:21 RalphS has left #sw-team 20:13:17 Nobu has joined #sw-team 20:24:55 reagleMIT has left #sw-team 20:25:35 rrsagent, please excuse us 20:25:35 I see no action items