2014/05/28 by Linh Anh Nguyen, Nguyen, Linh Anh, Joanna Golińska‐Pilarek +2
Computer Science · #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Natural Language Processing Techniques #Semantic Web and Ontologies #cs.LO
paper · pdf · doi:10.48550/arxiv.1405.7221
arXiv admin note: substantial text overlap with arXiv:1205.5838
openalex publication_date 2014/05/28 · arxiv created 2014/07/21 · arxiv updated 2014/07/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We give the first ExpTime (complexity-optimal) tableau decision procedure for checking satisfiability of a knowledge base in the description logic SHOQ, which extends the basic description logic ALC with transitive roles, hierarchies of roles, nominals and quantified number restrictions. The complexity is measured using unary representation for numbers. Our procedure is based on global caching and integer linear feasibility checking.