A resolution based description logic calculus

Authors:
Zsolt Zombori
Affiliations:
Budapest University of Technology and Economics, Department of Computer Science and Information Theory
Venue:
Acta Cybernetica
Year:
2010

Citing 5
Cited 1

The description logic handbook: theory, implementation, and applications

The description logic handbook: theory, implementation, and applications
A Description Logic with Transitive and Converse Roles Role Hierarchies and Qualifying Number Restrictions

A Description Logic with Transitive and Converse Roles Role Hierarchies and Qualifying Number Restrictions
The birth of Prolog

History of programming languages---II
Pellet: A practical OWL-DL reasoner

Web Semantics: Science, Services and Agents on the World Wide Web
Efficient description logic reasoning in prolog: The dlog system

Theory and Practice of Logic Programming

Two phase description logic reasoning for efficient information retrieval

ESWC'10 Proceedings of the 7th international conference on The Semantic Web: research and Applications - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a resolution based reasoning algorithm called DL calculus that decides concept satisfiability for the SHQ language. Unlike existing resolution based approaches, the DL calculus is defined directly on DL expressions. We argue that working on this high level of abstraction provides an easier to grasp algorithm with less intermediary transformation steps and increased efficiency. We give a proof of the completeness of our algorithm that relies solely on the ALCHQ tableau method, without requiring any further background knowledge.