Back to Results
First PageMeta Content
Is-a / Knowledge representation and reasoning / Description logic / Logic / Knowledge / Knowledge representation / Science / Vivification


From: AAAI-92 Proceedings. Copyright ©1992, AAAI (www.aaai.org). All rights reserved. Computing Least Common Subsumers in Description Logics William W. Cohen
Add to Reading List

Document Date: 2006-01-09 20:51:50


Open Document

File Size: 1,17 MB

Share Result on Facebook

City

Denver / Boston / Portland / Los Angeles / Toronto / San Jose / Murray Hill / /

Company

Knowledge-Based Systems / CNF / MIT Press / Artifi- Terminological Press / Edinburgh University Press / W. Cohen AT&T Bell Laboratories / /

Currency

USD / /

/

Facility

Computer Science Rutgers University / University of Pennsylvania / /

IndustryTerm

resentation systems / software information bases / polynomial-time algorithm / Knowledge base management systems / recursive structural subsumption algorithm / algorithms-algorithms / software information system / query processing technique / semantic networks / experimental learning systems / computing / non-structural subsumption algorithm / /

Organization

Austrian AI / University of Pennsylvania / MIT / Rutgers University / /

Person

Tony Bonner Cohen / Springsteen / V ORGANIST (Jill) / Hector Levesque / Peter Patel-Schneider / Bart Selman / Nicholas Flann / Dieter Schewe / Alex Borgida / John E. Hopcroft / Klaus Dieter / Jeffrey D. Ullman / Michael Kifer / Ron Brachman / Hassan Ait-Kaci / Entitysituation / Thomas Dietterich / /

/

Position

vp / KEYBOARD-PLAYER / PIANIST / model / structural data model for objects / representative / /

ProvinceOrState

New Jersey / Oregon / Pennsylvania / California / Massachusetts / Colorado / Ontario / /

PublishedMedium

Machine Learning / Communications of the ACM / /

Technology

recursive LCS algorithm / Machine Learning / recursive structural subsumption algorithm / non-structural subsumption algorithm / polynomial-time algorithm / /

URL

www.aaai.org / /

SocialTag