Communications of the ACM
Making believers out of computers
Artificial Intelligence
Generalized subsumption and its applications to induction and redundancy
Artificial Intelligence
A four-valued semantics for terminological logics
Artificial Intelligence
CLASSIC: a structural data model for objects
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
LaSSIE: a knowledge-based software information system
Communications of the ACM - Special issue on software engineering
Hierarchical knowledge bases and efficient disjunctive reasoning
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
A Study of Explanation-Based Methods for Inductive Learning
Machine Learning
Classification as a Query Processing Technique in the CANDIDE Semantic Data Model
Proceedings of the Fifth International Conference on Data Engineering
Variant Construction Using Constraint Propagation Techniques over Semantic Networks
5. Österreichische Artificial Intelligence-Tagung
Data Models in Knowledge Representation System: A Case Study
GWAI-86 und 2. Österreichische Artificial-Intelligence-Tagung
Entity-Situation: A Model for the Knowledge Representation Module of a KBMS
EDBT '88 Proceedings of the International Conference on Extending Database Technology: Advances in Database Technology
A lattice theoretic approach to computation based on a calculus of partially ordered type structures (property inheritance, semantic nets, graph unification)
On scene interpretation with description logics
Image and Vision Computing
Semantic routing of search queries in P2P networks
Journal of Parallel and Distributed Computing
A Unified Framework for Non-standard Reasoning Services in Description Logics
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Class expression learning for ontology engineering
Web Semantics: Science, Services and Agents on the World Wide Web
A practical approach for computing generalization inferences in EL
ESWC'11 Proceedings of the 8th extended semantic web conference on The semantic web: research and applications - Volume Part I
ESWC'11 Proceedings of the 8th extended semantic web conference on The semanic web: research and applications - Volume Part II
Introduction to linked data and its lifecycle on the web
RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
Automating competence management through non-standard reasoning
Engineering Applications of Artificial Intelligence
Tractable feature generation through description logics with value and number restrictions
IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
An output-polynomial time algorithm for mining frequent closed attribute trees
ILP'05 Proceedings of the 15th international conference on Inductive Logic Programming
Using ontology modularization for efficient negotiation over ontology correspondences in MAS
ArgMAS'09 Proceedings of the 6th international conference on Argumentation in Multi-Agent Systems
Product recommendation with temporal dynamics
Expert Systems with Applications: An International Journal
Universal OWL axiom enrichment for large knowledge bases
EKAW'12 Proceedings of the 18th international conference on Knowledge Engineering and Knowledge Management
Semantic content-based recommendation of software services using context
ACM Transactions on the Web (TWEB)
Introduction to linked data and its lifecycle on the web
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
| Hi-index | 0.00 |
Description logics are a popular formalism for knowledge representation and reasoning. This paper introduces a new operation for description logics: computing the "least common subsumer" of a pair of descriptions. This operation computes the largest set of commonalities between two descriptions. After arguing for the usefulness of this operation, we analyze it by relating computation of the least common subsumer to the well-understood problem of testing subsumption; a close connection is shown in the restricted case of "structural subsumption". We also present a method for computing the least common subsumer of "attribute chain equalities" , and analyze the tractability of computing the least common subsumer of a set of descriptions--an important operation in inductive learning.