BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260920T141623Z
UID:Seminar-dept-267@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20111018T160000
DTEND:20111018T170000
SUMMARY:School Seminar Series
DESCRIPTION:Dr. Bernardo Cuenca Grau: Completeness Guarantees for Incomplete Ontology Reasoners: Theory and Practice\n\nDue to the practical need for scalable query answering, developers of \n\nontology-based applications are often forced to use incomplete\n\nreasoners---that is, reasoners which fail to derive all answers for at least\n\none query, ontology, and data set accepted as valid inputs.\n\n\n\nThe lack of completeness guarantees, however, may be unacceptable for \n\napplications in areas such as health care and defence, where missing answers\n\ncan adversely affect the application's functionality. Furthermore, even if an \n\napplication can tolerate some level of incompleteness, it is often \n\nadvantageous to estimate how many and what kind of answers are being lost.\n\n\n\nIn this talk, I will present a novel logic-based framework that allows one\n\nto check whether a reasoner is complete for a fixed query Q and ontology\n\nT---that is, whether the reasoner is guaranteed to compute all answers to\n\nQ w.r.t. T and an arbitrary data set D. Since ontologies are often fixed at \n\napplication design time (or change relatively infrequently), this approach \n\nallows application developers to check whether a reasoner known to be \n\nincomplete in general is actually complete for the kinds of input relevant for\n\nthe application at hand.\n\n\n\nThese results provide a theoretical and practical foundation for the design\n\nof future ontology-based information systems that maximise scalability while \n\nminimising or even eliminating incompleteness of query answers.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=267
LOCATION:ALT
END:VEVENT
END:VCALENDAR