Backtracking and Qualified Number Restrictions: Some Preliminary Results.

摘要: Description Logics (DLs) are useful in the database domain, where they can be used to reason, e.g., about conceptual schemas and query containment. DL knowledge bases derived from relatively small UML diagrams have, however, proven difficult of impossible for state art systems solve. We show that FaCT system this problem results failure dependency directed backtracking prune search space caused by non-deterministic expansion qualified number restrictions. present an enhanced technique is able deal more effectively with these constructs, along empirical demonstrating that, after addition technique, much KBs.