Table of Contents
MinPAL: An Efficient, Minimal Protégé-2000 Axiom
Language
Two main uses of Axioms
A sample constraint and deducer
Deduction-free constraints
Off-line deduction
Restrictions of minPAL constraints (I)
Restrictions of minPAL constraints (II)
Convenient distinction for constraints
Basic minPAL (+/-) constraints (I)
Basic minPAL (+/-) constraints (II)
Refining a class via (+/-) constraints: Challenge
from EON clinical protocols
From instance slots to constraints
MinPAL connectives
Attaching (local) constraints to classes
Global constraints across classes (I)
Global constraints across classes (II)
Global constraints across classes (III)
Global constraints across classes (IV/a)
Global constraints across classes (IV/b)
Global constraints across classes (V)
Constraint (-) checking as
‘look-up’: Implementing the local case
Constraint (-) checking as ‘look-up’:
Implementing the global case (a)
Constraint (-) checking as ‘look-up’:
Implementing the global case (b)
CLIPS-like formulation of the queries
Efficiency via indexing as in relational databases or
LP
Conclusions
References |