Uniform Knowledge Representation in PRODIGY

Uniform Knowledge Representation in PRODIGY

All knowledge in PRODIGY -- control rules, domain knowledge, learned knowledge -- is represented in the PRODIGY description language (PDL). PDL is based on first-order predicate calculus and includes variables, disjunction and conjunction, universal and existential quantification, and conditional representation. Operators are STRIPS-like with pre-condition expressions that must be satisfied for an operator to be applied and post-conditions which describe the changes to the world (state) through the addition and deletion of atomic formulas in the current state. The representation is driven by the problem that there is too much knowledge in the world and the way in which software engineering has addressed this problem in large-knowledge domains. This uniform representation enables a system-wide uniform access to knowledge but results in fixed language for action with limited expressibility.

Press UP to return to the property list.

Press HOME to return to the top of PRODIGY.