Journal article icon

Journal article

Deciding expressive description logics in the framework of resolution.

Abstract:
We present a decision procedure for the description logic SHIQ based on the basic superposition calculus, and show that it runs in exponential time for unary coding of numbers. To derive our algorithm, we extend basic superposition with a decomposition inference rule, which transforms conclusions of certain inferences into equivalent, but simpler clauses. This rule can be used for general first-order theorem proving with any resolution-based calculus compatible with the standard notion of redundancy. © 2007.
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1016/j.ic.2007.11.006

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author


Publisher:
Elsevier
Journal:
Inf. Comput. More from this journal
Volume:
206
Issue:
5
Pages:
579-601
Publication date:
2008-01-01
DOI:
EISSN:
1090-2651
ISSN:
0890-5401


Language:
English
Keywords:
UUID:
uuid:a2969f65-bf29-487f-9d71-472f0238015d
Local pid:
pubs:290224
Source identifiers:
290224
Deposit date:
2012-12-19

Terms of use



Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP