ppy/chat-transcript_unedited_20131121a.txt ------ Chat transcript from room: ontolog_20131121 2013-11-21 GMT-08:00 [PST] ------ [9:03] PeterYim: Welcome to the = RulesReasoningLP: mini-series session-03 - Thu 2013-11-21 = Program: Ontology, Rules, and Logic Programming for Reasoning and Applications (RulesReasoningLP) Mini-series of virtual panel sessions Topic: Concepts and Foundations of Rules and Ontologies: Logic Programs, Classical Logic, and Semantic Web - II Session Co-chairs: Dr. LeoObrst (Ontolog; MITRE) & Professor PascalHitzler (Wright State U) Panelists / Briefings: * Dr. MarkusKroetzsch (Technische Universität Dresden) - "Existential Rules in Ontological Modelling" * Dr. HectorPerezUrbina (Clark & Parsia, LLC) - "Modeling with Rules in Practice" * Professor HassanAitKaci (Université Claude Bernard Lyon 1) - "Reasoning and the Semantic Web" * Professor EnricoFranconi (Free University of Bozen-Bolzano) - "The Logic of Extensional RDFS" Logistics: * Refer to details on session page at: http://ontolog.cim3.net/cgi-bin/wiki.pl?ConferenceCall_2013_10_31 * (if you haven't already done so) please click on "settings" (top center) and morph from "anonymous" to your RealName * Mute control (phone keypad): *7 to un-mute ... *6 to mute * Attn: Skype users ... see: http://ontolog.cim3.net/cgi-bin/wiki.pl?ConferenceCall_2013_11_21#nid3ZVN ** you may connect to (the skypeID) "joinconference" whether or not it indicates that it is online (i.e. even if it says it is "offline," you should still be able to connect to it.) ** if you are using skype and the connection to "joinconference" is not holding up, try using (your favorite POTS or VoIP line, etc.) either your phone, skype-out or google-voice and call the US dial-in number: +1 (206) 402-0100 ... when prompted enter Conference ID: 141184# ** Can't find Skype Dial pad? *** for Windows Skype users: Can't find Skype Dial pad? ... it's under the "Call" dropdown menu as "Show Dial pad" *** for Linux Skype users: please stay with (or downgrade to) Skype version 2.x for now (as a Dial pad seems to be missing on Linux-based Skype v4.x for skype-calls.) . == Proceedings == . [9:16] anonymous morphed into BrandonWhitehaed [9:23] anonymous1 morphed into HectorPerezUrbina [9:23] anonymous1 morphed into EFranconi [9:26] anonymous morphed into EFranconi1 [9:29] anonymous morphed into Markus Kroetzsch [9:30] BrandonWhitehaed: Thanks Peter! It's better now...I much prefer 0630 to 0530. :) [9:30] anonymous morphed into ElieAbiLahoud [9:32] EFranconi1: Apparently 141184# is not a valid phone conference ID? [9:33] FrancescaQuattri: I just dialed that ID [9:33] AliHashemi: @EFranconil - it should be [9:33] anonymous morphed into Pascal Hitzler [9:33] HassanAitKaci: It worked for me ... [9:34] FrancescaQuattri: to@EFranconi1- are you calling from Skype? [9:34] GenZou: On Skype sometimes if I click "11" too quick it would be recognized as a single "1", and then the ID becomes invalid. [9:35] HectorPerezUrbina morphed into Hector Perez-Urbina [9:35] HassanAitKaci: I can hear [9:36] Hector Perez-Urbina: you may also be muted, try dialing *7 [9:36] HassanAitKaci: You can't I looks like [9:36] HassanAitKaci: I'm on Skype [9:36] Markus Kroetzsch: I'm on Skype too [9:36] Pascal Hitzler: Apologies I'm having technical issues with the connection [9:36] ElieAbiLahoud: Skype usually works fine for me [9:37] HassanAitKaci: Apparently you can't hear me ... but all lines are open [9:37] HassanAitKaci: I'll hang up and dial again [9:39] Pascal Hitzler: I can hear you [9:39] Pascal Hitzler: can you hear me? [9:40] Pascal Hitzler: let me try to reconnect [9:41] Pascal Hitzler: I can hear you [9:41] Pascal Hitzler: you can't hear me [9:41] Pascal Hitzler: agreed [9:41] Pascal Hitzler: okay [9:41] Pascal Hitzler: I'll keep searching [9:41] Pascal Hitzler: perhaps to avoid further loss of time [9:42] Pascal Hitzler: Leo can make an intro [9:42] Pascal Hitzler: and you can start? [9:42] anonymous morphed into ConradBock [9:43] PeterYim: == LeoObrst & PascalHitzler starts the session - see slides under http://ontolog.cim3.net/cgi-bin/wiki.pl?ConferenceCall_2013_11_21#nid3ZV8 [9:46] anonymous morphed into OnnoPaap [9:46] PeterYim: == MarkusKroetzsch presenting ... [9:48] anonymous morphed into Chuck Rehberg [9:51] PeterYim: @Leo @Pascal - we have 37 people on the voice bridge, but only 26 in the chat-room now; so, at the next opportunity (transition to next speaker,) please prompt people to join us in the chat room [9:54] anonymous morphed into DavidMendes [9:54] AmandaVizedom: @MarkusKroetzsch -- In ontological modeling of complex structures and domains, a classic approach (in AI applications but not DL traditions, of course) is to model many of the relatively stable complex relationships between things *as rules*. To me, it seems that removing rules *as a means of representing complex relationships* from the ontological toolkit makes ontology work much harder and less effective. So, to me, these views seem to overlap. Do you not agree? Or do you think that the complex relationships that exist are not to be ontologically (and declaratively) modeled, or should be modeled in some other way? [9:57] AmandaVizedom: @MarkusKroetzch - the above comment/question was a reaction to your slide 2; I see on slide 6 that you begin to address this. [9:58] MichaelGruninger: Speaking controversially, there are many people who equate ontologies with logical theories which are definable in OWL or RDF, and for such people, anything expressed with rules is something that is outside any ontology. Hopefully, this Ontolog mini-series will dispel this misconception. [9:59] SimonSpero: If you look at some of the gene and phenotype ontologies, the force fitting into DL for reactions, enzymes etc is especially noticeable [9:59] Pascal Hitzler: @AmandaVizedom: I'm not Markus, of course, but let me add my own perspective here: The paradigms recently seem to be converging, and in particular work done and initiated by Markus is central for this convergence. Perhaps a good starting point for looking into this is Markus Krtzsch, Frederick Maier, Adila Alfa Krisnadhi, Pascal Hitzler, A Better Uncle For OWL - Nominal Schemas for Integrating Rules and Ontologies. In: S. Sadagopan, Krithi Ramamritham, Arun Kumar, M.P. Ravindra, Elisa Bertino, Ravi Kumar (eds.), WWW '11 20th International World Wide Web Conference, Hyderabad, India, March/April 2011. ACM, New York, 2011, pp. 645-654. [10:00] Pascal Hitzler: @MichaelGruninger: I very much agree :) [10:00] AmandaVizedom: +1 for dispelling that. I'm aware of it, and am happy to acknowledge that as a choice people can make in the type of ontology they work with, but it is frustrating to see people re-define ontology so as to exclude much of its historical and continuing development and application! [10:00] anonymous morphed into Aida Gandara [10:01] SimonSpero: @michaelgruninger: that's not real world controversial, let alone Toronto :-) [10:01] EFranconi1: (A technical question: is VNC up? I can't connect) [10:01] anonymous morphed into NaicongLi [10:02] Pascal Hitzler: I freely admit that I'm usually using rules when modeling OWL. Or more precisely, I start with writing rules (which is easier for my brain), or some hybrid (informal) rules/DL notation and then convert them to OWL. [10:02] Hector Perez-Urbina: @AmandaVizedom, I found this paper particularly helpful: http://www.cs.ox.ac.uk/boris.motik/pubs/mr10mknf-rules.pdf [10:02] Pascal Hitzler: @EFranconi: I'm using VNC, so it's working for me [10:02] PeterYim: @EnricoFranconi - don't worry, some people cannot connect properly to the vnc server ... just use you local slides, and remember to prompt slide advances and the slide number verbally [10:02] EFranconi1: ok, thanx [10:03] EFranconi1 morphed into EFranconi [10:04] AmandaVizedom: Thanks, @Hector. Reconciliation, hmmm. :-) [10:04] Pascal Hitzler: Above mentioned paper is here: http://korrekt.org/page/A_Better_Uncle_For_OWL [10:06] Pascal Hitzler: Boris' paper is a landmark. There's some work tightening the integration which follows up on this, e.g. Matthias Knorr, Pascal Hitzler, Frederick Maier, Reconciling OWL and Non-monotonic Rules for the Semantic Web. In: De Raedt, L., Bessiere, C., Dubois, D., Doherty, P., Frasconi, P., Heintz, F., Lucas, P. (eds.), ECAI 2012, 20th European Conference on Artificial Intelligence, 27-31 August 2012, Montpellier, France. Frontiers in Artificial Intelligence and Applications, Vol. 242, IOS Press, Amsterdam, 2012, pp. 474-479. http://knoesis.wright.edu/faculty/pascal/pub/KHM-ECAI12.pdf [10:06] MichaelGruninger: @MarkusKroetzch: Are the rules used in the chemistry example on slide 12 available online? [10:07] AmandaVizedom: Pascal, when have worked in OWL, I do the same thing. Having academic logic training, then beginning my work in applied ontology with 6 years working in CycL, I also find it much easier to my brain to come up with rules. Translation follows, though sometimes it is not feasible in a given OWL/ application infrastructure and some of the knowledge available for semantic capture simply gets left out. Sometimes that's OK. Sometimes it entails reuse problems down the road. [10:08] PeterYim: == HectorPerezUrbina presenting ... [10:08] Markus Kroetzsch is trying to catch up with the chat now ... [10:09] AmandaVizedom: @MarkusKroetzsch: By no tools / libraries, did you mean no *open source* tools libraries? I agree with the latter but not the former, obviously. [10:10] Pascal Hitzler: @AmandaVizedom: For me, the cases where we're *not* able to make the transformation into OWL, are particularly interesting (as a researcher). They point towards limitations of the OWL standard which are worthwhile to work on in attempts to overcome them :) [10:10] anonymous morphed into Ryan Hohimer [10:11] EFranconi: I guess that the real challenge with rules as an ontology language is their integration with more classical FOL-based ontology languages (such as OWL and stuff). Obvious mismatches, as already noticed, are closed vs open world assumption, standard/unique name assumption, active domains, etc. [10:11] AmandaVizedom: @Pascal: I agree! I also think that research to identify the patterns of these cases would be both interesting and valuable. The value I'm thinking of is particularly in the area of guidance for choosing ontology types for particular uses. [10:12] AliHashemi: Is this non-standard language. Or OWL-centric thinking? Axioms don't have variables? I guess it's a very specific notion of axiom? [10:13] MichaelGruninger: @EFranconi: You comment implies that you are assuming that rules are necessarily nonmonotonic. One can also consider rules to simply be a syntactic restriction with a monotonic semantics. [10:13] AmandaVizedom: @EFranconi: Do you mean rules in a particular syntax? I ask because classical and current ontology languages that are based on FOL or HOL of course have rule representation (and use) as an integral part of them. [10:14] Harold Boley: RE Slide 4: SWRL can also be serialized in RuleML/XML (rather than in RDF/XML). [10:15] Harold Boley: http://www.w3.org/Submission/SWRL/#5.1 [10:15] EFranconi: @Hector: why are you ignoring the W3C standard RIF syntax? http://www.w3.org/2005/rules/wiki/Primer [10:16] Markus Kroetzsch: @AmandaVizedom: I mainly meant that the rule-related tools/libraries world is quite fragmented. There is RIF, which I am not aware of libraries for. Almost all reasoners that can handle Datalog and its extensions are from the ASP and LP world, using some (more or less uniform) Prolog-style syntax, which I don't know how to specify datatypes and URI-based identifiers in. The ontology world has SWRL but the tools that support this are AFAIK not happy with some 80k rules as in my example. And LP tools do not support SWRL or RIF syntax. [10:17] AmandaVizedom: Regarding Open/Closed World -- it's also worth noting that it is not necessary that a *language* make an open/closed world commitment. IMHO, this is more properly something that characterizes reasoning -- an inference parameter. And it can be treated that way, by supporting explicit declaration: either in an ontology module, stating that it should be interpreted with OW or CW, or in an application or particular query. [10:18] HassanAitKaci: Good point Amanda. But which would the default be? [10:18] EFranconi: @AmandaVizedom: Open/Closed World assumption regards the semantics of the data! The different languages (and their reasoners) that operate on the data have to respect their meaning, and adopt the right assumption. [10:18] Markus Kroetzsch: @MichaelGruninger: "many people [...] equate ontologies with logical theories which are definable in OWL" I have not witnessed this a lot. At least the Description Logic community is quite open to this (the work I mentioned was presented at DL workshop even). I would not call Existential Rules a type of Description Logic, but calling them an ontology language seems fine. [10:19] EFranconi: @Markus: +1 [10:20] AmandaVizedom: @MarkusKroetzch: Very true in the OSS and for standard languages. This is IMHO a critical problem. The tools, and considerable integrated support, exist in proprietary software and languages. We need them in the open standard-based world, too. [10:21] ConradBock: Maybe tools could let users know when they go outside profiles as they enter rules. [10:22] Markus Kroetzsch: @AmandaVizedom: Are there specific closed tools and standards you are thinking about? I recall how the RIF Working Group decided to ignore the ISO Prolog standard because most group members had no access to this closed standard. But many Prolog tools are free. [10:22] SimonSpero2: @HassanAitKaci: CWA/OWA in Cyc is configurable on a per predicate basis, with NAF settable on per query basis with default of off [10:23] HassanAitKaci: @SimonSpero2 - good for Cyc then ... [10:24] AmandaVizedom: @EFranconi: Some models made such assumptions and some don't. I absolutely agree that when they do, it needs to be explicit. That is why I say that it is important to be able to make explicit that a particular ontology/module (or even rule) has one or the other assumption as part of its semantics. [10:27] AmandaVizedom: @Markus: CycL / the Cyc system have the most comprehensive support for all of this that I have worked with. However, I've also worked with a number of organizations that have developed their own KR language and tools, for internal use, that have some subset of these thing that fit what they need for their application type(s) and typical domain problem. [10:27] EFranconi: I insist that CWA/OWA is a property of your data: either we know all of your children or only the ones I'm certain about. I can not use an OWA reasoner on top of some data which states complete knowledge about children, say. Or I can not use a CWA reasoner if the data I have is incomplete. We had an extensive discussion on this at last year ISWC: Peter F. Patel-Schneider and Enrico Franconi. Ontology constraints in incomplete and complete data. In ISWC 2012 - 11th International Semantic Web Conference, volume 7649 of Lecture Notes in Computer Science, pages 444459. Springer-Verlag, 2012. [10:31] PeterYim: == HassanAitKaci presenting ... [10:31] Harold Boley: The relational SWRL Built-Ins were complemented by the functional RIF Built-Ins. [10:31] Harold Boley: http://www.w3.org/TR/rif-dtb/ [10:32] AmandaVizedom: @Efranconi: In domains in which the data are almost always incomplete, it is quite common to want to reason with that unknownness explicit in some contexts and for other purposes to reason as if (some of) the data were complete, to explore hypotheses and possibilities. Again, why do you think that when it is a property of the data, it cannot be simply stated and reasoned on appropriately? Why make that a fixed feature of a language or reasoner instead? [10:35] Hector Perez-Urbina: @Amanda, suppose you want to enforce that every instance of the class Employee in your ontology has to have a SSN; under OWA, we couldn't enforce this. We'd have to resort to CWA to be able to find this kind of violation. However, on the other hand, I would still want to infer (under open world) that all employees are people. [10:35] Hector Perez-Urbina: As Enrico says, whether you want to use OWA or CWA, depends on the nature of your data [10:35] Hector Perez-Urbina: regardless of the specific formalism you're using to model it [10:36] EFranconi: Well, what I'm saying is that you may want to consider your *data* open or closed - the choice is up to you . BUT you should never use different assumptions at the same time over the same set of data. [10:36] Markus Kroetzsch: @Hector Perez-Urbina: ... and on the context (the same data might be OWA when viewed as an ontology and CWA when viewed as a list of axioms that I want to search through) [10:36] Markus Kroetzsch: @AmandaVizedom: Can you recommend any references on the CWA/OWA combination that you refer to? [10:37] Hector Perez-Urbina: oh, I disagree. Using the previous example, you could first use OWA to infer that Hector is an Employee, and then CWA to determine that, since Hector doesn't have a SSN, the ontology is invalid. [10:37] AmandaVizedom: @Hector, of the data *and* of the reasoning you want to do, no? Again, I'm not arguing that the assumptions should be ignored; I'm arguing that they should be explicitly statable and the reasoners should be able to understand that and use it. [10:37] SimonSpero2: @Efranconi: agree if it's just assumptions that you;re talking about - if an epistemic axiom is asserted, then it stops being an assumption [10:38] SimonSpero2: Driveby coverage in 12.8 of http://download.springer.com/static/pdf/413/bok%253A978-90-481-8847-5.pdf?auth66=1385231714_9584f2c63627ff5bd4692a4020bf3d52&ext=.pdf [10:39] AmandaVizedom: @Hector: Your constraint-violation case is an excellent example of a common use case that comes up with OWL ontologies. when you are looking for (potential) violations, you may want to temporarily use CWA, rather than use OWA and infer missing statements. [10:39] AmandaVizedom: Okay, I need to stop typing and pay attention to Hassan for a bit! [10:40] Pascal Hitzler: Regarding the open/closed world discussion: What is really needed are languages which combine open world and closed world features, in such a way that you can decide what's supposed to be closed and what's supposed to be open. The keyword sometimes used is "local closed world". There's quite a bit of work under way how to do this (see e.g. the paper by Motik referenced above), but the quest is not yet conclusive, in particular in practical terms. [10:40] Hector Perez-Urbina: @Amanda, certainly. In Stardog, for example, we allow to validate integrity constraints (under CWA) and usual OWL inference (under OWA), but it is necessary for the user to clearly specify which things are to be taken under which semantics. [10:40] AmandaVizedom: @PascalHitzler: Exactly! [10:41] AmandaVizedom: @Hector: Excellent. :-) [10:41] Hector Perez-Urbina: @Amanda, you might find this interesting: http://docs.stardog.com/icv/ [10:42] AmandaVizedom: Thanks Hector, I'll check it out. [10:45] EFranconi: Again, in my paper I argue why epistemic axioms can be very misleading. In your simple example with SSN, this approach may work. But since you expect two different beahviours from your data stemming form conflicting assumptions, there will always be counterexamples where your get unexpected inferences. [10:46] EFranconi: @Hector: really look at our paper on why you shouldn't validate integrity constraints with a different semantics from the underlying ontology language. [10:46] Hector Perez-Urbina: @Enrico, yes, it helps that we consider relatively unexpressive logics (i.e., OWL profiles) [10:47] Markus Kroetzsch: +1 to epistemic axioms being confusing [10:47] EFranconi: :-) [10:47] EFranconi: Mmhh, I guess I can build some nasty counterexamples with dl-lite as well, but I have to think about it. [10:48] Hector Perez-Urbina: @Enrico, will do. I would say, however, that we are yet to see these nasty examples in practice. [10:48] AmandaVizedom: @EFranconi: Do you have a link to your paper? I would like to understand why you think that support for making assumptions explicit is inferior to being restricted to one of the assumptions. [10:48] EFranconi: OK. [10:49] PeterYim: == EnricoFranconi presenting ... [10:51] SimonSpero2: Hector: If every employee has a known ssn and hector does not have a known ssn then hector is not an employee [10:51] AmandaVizedom: Epistemic axioms may be confusing, but IMHO the better way of addressing this is to make clear and explicit which axioms are epistemic and what they apply to (even if as metadata). Otherwise, users and modelers tend to *make* epistemic assumptions anyway, without making the explicit, and sometimes slide between epistemic assumptions within the same model or set of models, without being able to indicate this. This causes problems for model accuracy, usability, evaluation, quality control / truth maintenance (as the model evolves), and reuse. [10:52] Hector Perez-Urbina: @Simon, that's under OWA [10:54] Hector Perez-Urbina: Consider the ontology O = {1. Employee subClassOf hasSSN some SSN, 2. Hector a Employee} . Under OWA, we would infer the existence of an anonymous individual, instance of SSN, related to Hector via hasSSN. [10:54] Hector Perez-Urbina: However, sometimes, we don't want this behavior; instead, we want the reasoner to let us know that our data is invalid (because every employee must have a SSN) [10:55] Hector Perez-Urbina: We can accomplish this by interpreting axiom 2 in O under CWA. [10:55] Hector Perez-Urbina: sorry, axiom 1. [10:57] Alan Rector (2): Shouldn't be that some ice cream is food, rather than that all ice cream is food/ice cream is subset of food? [10:58] Pascal Hitzler: @Alan, I believe in the example, ice cream is an individual, while food is a class? [10:58] AmandaVizedom: @Hector: yes, and more: we may want to validate/ declare that invalid. Or, we may want to identify gaps in our knowledge. Or, in more sophisticated reasoning, analyze our model to identify *patterns* of missing information. The known unknowns can be very important in some applications! [10:59] SimonSpero2: Hector: But you leave out the axiom hasSSN(X) -> K[hasSSN(X)] [11:00] MikeBennett: OWA and CWA: it seems to me that the use oase of determining whether some data is valid (per @Hector above), and the use case whereby we want to reason over assertions about real things in the world (not data) are two very different requirements. My hunch would be that to talk about data rather than actual things, one must need the CWA? [11:00] MikeBennett: Apologies, have to leave now. [11:00] FrancescaQuattri: @EFranconi: Beth Levin's work could provide a great deal of inspiration for defining what is (or should be defined) subclass of what [11:02] Hector Perez-Urbina: @Harold, I've just seen your comments; thank you very much for your pointers. [11:03] Hector Perez-Urbina: @Simon, yes, we want to stay within OWL and SWRL [11:03] HassanAitKaci: @EFranconiL This is a CWA construction! :-) [11:04] anonymous morphed into NancyWiegand [11:05] Hector Perez-Urbina: @Amanda, yes. In practice, people produce some RDF out of an ETL process, and they need to check whether certain integrity constraints (a la DB) hold. [11:07] Alan Rector (2): Apolgies. I have to leave now [11:07] PeterYim: == Q&A and open discussion now [11:08] List of members: Aida Gandara, Alan Rector (2), AliHashemi, AmandaVizedom, Chuck Rehberg, ConradBock, DavidMendes, DennisPierson, EFranconi, ElieAbiLahoud, FrancescaQuattri, Gary Gannon, GenZou, Harold Boley, HassanAitKaci, Hector Perez-Urbina, HensonGraves, LeoObrst, Markus Kroetzsch, MichaelGruninger, MikeBennett, NancyWiegand, OliverKutz, Pascal Hitzler, patrickmaroney, PeterYim, Ryan Hohimer, SimonSpero, SimonSpero2, TaraAthan, Todd Pehle, vnc2 [11:09] anonymous morphed into Dennis Wisnosky [11:10] anonymous1 morphed into lakhdar [11:11] AmandaVizedom: @Hector, this is one type of case. But I am also thinking of another case in which a user is using an ontological KB for situation awareness, risk analysis, or similar. In these cases, while much of the use of the model involves reasoning about the modeled things (or digesting views of a situation that are based on model), it can be an essential part of this use to also (manually or automatically in side processes) identify the known unknowns and spot patterns in them. This can be critical. [11:12] Hector Perez-Urbina: @Amanda, yes, this sounds quite interesting/important. [11:13] EFranconi: My paper on "Ontology constraints in incomplete and complete data" can be found at http://iswc2012.semanticweb.org/sites/default/files/76490433.pdf [11:13] Hector Perez-Urbina: @Enrico, thank you [11:13] AmandaVizedom: @EFranconi: Thanks, I will read it. [11:16] EFranconi: Just do (:yourLocalProperty rdfs:subProperty :globalPropert)! [11:16] PeterYim: @EnricoFranconi - (recapping my verbal comment) it would be great to further expose your work to PatHayes, and convince him and those who are working on the next iteration of RDF/RDFS, so your work can be taken into consideration in that W3C standard ... [I will try to forward this to PatHayes, copying you too, after the session] [11:17] EFranconi: @PeterYim: thanks [11:17] FrancescaQuattri: yup, clear [11:20] EFranconi: Official link: http://link.springer.com/content/pdf/10.1007/978-3-642-41335-3_7.pdf [11:20] EFranconi: Unofficial link: http://users.dcc.uchile.cl/~cgutierr/papers/iswc2013.pdf [11:21] PeterYim: ^[in response to PatrickMaroney's question on where details of EnricoFranconi's work (the evaluations, in particular) can be accessed] [11:22] SimonSpero2: RDF Semantics 1.1 just went to Candidate Rec status on Nov 5th, ( last step before final) http://www.w3.org/blog/news/archives/3389 [11:22] EFranconi: "Work as expected" means complete & terminating in the fragment of the use case. [11:23] EFranconi: So, you DO care! [11:24] PeterYim: @lakhdar - (for the record, and for attribution purposes) may we have (kindly morph into) your full name, please [11:25] Markus Kroetzsch: Sorry, I got distracted by my phone call. To clarify: in the context of ontology "undecidable" = "not sufficiently studied to understand when it will work" (it's different for programming and problem solving languages, where undecidability is necessary to express arbitrarily complex computations/problems. [11:26] Harold Boley: Regarding decidable <> efficient etc., average-case complexity should be considered, rather than (only) worst-case complexity. [11:26] PeterYim: Join us again, in two week (Thu 2013-12-05) for the OntologySummit2014 Pre-Launch Community Session, when we will collaboratively work up a program for the next OntologySummit. [11:26] PeterYim: That will be followed (on Dec-12) by session-07 of the OntologyBasedStandards miniseries - "How ontologies can help with the formal specification of the natural language standards" - Co-chairs: SimonSpero & KenBaclawski [11:26] HassanAitKaci: +1 Harold [11:26] Hector Perez-Urbina: @Harold +1 [11:26] PeterYim: The next event (session-04) for this RulesReasoningLP mini-series will then come up on Dec-19 - "Guide to Reasoning Applications Development and Cases" - Co-chairs: HensonGraves & KenBaclawski [11:27] EFranconi: @Harold: yes, but sill in the context of complete and terminating fragments. [11:27] Hector Perez-Urbina: also, so-called data complexity is quite important [11:27] PeterYim: Great session! [11:27] EFranconi: @hector +1 [11:28] AmandaVizedom: Thanks, all! [11:28] HassanAitKaci: bye & thanks [11:28] EFranconi: bye [11:28] Pascal Hitzler: thanks! [11:28] PeterYim: -- session ended: 11:28am PST -- [11:28] LeoObrst: Thanks, All! Very interesting session. [11:28] List of attendees: Aida Gandara, Alan Rector (2), AliHashemi, AmandaVizedom, BrandonWhitehaed, Chuck Rehberg, ConradBock, DavidMendes, Dennis Wisnosky, DennisPierson, EFranconi, EFranconi1, ElieAbiLahoud, FrancescaQuattri, Gary Gannon, GenZou, Harold Boley, HassanAitKaci, Hector Perez-Urbina, HectorPerezUrbina, HensonGraves, JackRing, JackRing1, JackRing2, LeoObrst, Markus Kroetzsch, MichaelGruninger, MikeBennett, NaicongLi, NancyWiegand, OliverKutz, OnnoPaap, Pascal Hitzler, PeterYim, Richard Martin, Ryan Hohimer, SimonSpero, SimonSpero1, SimonSpero2, TaraAthan, Todd Pehle, anonymous, anonymous1, lakhdar, lamarhenderson, patrickmaroney, vnc2 [11:28] Hector Perez-Urbina: good bye everyone [11:28] Markus Kroetzsch: Bye, thanks. ------