Path: utzoo!utgpu!watmath!clyde!att!pacbell!ames!mailrus!tut.cis.ohio-state.edu!bloom-beacon!G.BBN.COM!MVILAIN
From: MVILAIN@G.BBN.COM (Marc Vilain)
Newsgroups: comp.ai.digest
Subject: Complexity and Decidability of Terminological Logics - Peter F. Patel-Schneider
Message-ID: <8811300507.AA25211@BLOOM-BEACON.MIT.EDU>
Date: 21 Nov 88 22:40:09 GMT
Sender: daemon@bloom-beacon.MIT.EDU
Organization: The Internet
Lines: 27
Approved: ailist@ai.ai.mit.edu


                    BBN Science Development Program
                       AI Seminar Series Lecture

          COMPLEXITY AND DECIDABILITY OF TERMINOLOGICAL LOGICS

                        Peter F. Patel-Schneider
                   AI Principles Research Department
                         AT&T Bell Laboratories
                         (pfps@allegra.att.com)

                                BBN Labs
                           10 Moulton Street
                    2nd floor large conference room
                     10:30 am, Tuesday November 29


Terminological Logics are important formalisms for representing
knowledge about concepts and objects, and are attractive for use in
Knowledge Representation systems.  However, Terminological Logics with
reasonable expressive power have poor computational properties, a fact
which has restricted their use and utility in Knowledge Representation
systems.  This talk gives a brief description of Terminological Logics,
presents some results concerning their tractability and decidability,
and discusses the role of Terminological Logics in Knowledge
Representation systems.
-------