Theory VT-DESIGN

This ontology specializes the configuration design task for the VT problem. It defines the type of components that are to be designed and the restricted set of operators that may appear in constraints. It specializes the more general configuration design theory by adding commitments to a notion of optimality based on a cost function.

• Source code: vt-design.lisp
• List of other known theories

Theories included by Vt-Design:

    Configuration-Design
       Frame-Ontology
          Kif-Relations
             Kif-Sets
             Kif-Lists
                Kif-Numbers
       Kif-Meta
          Kif-Sets
          Kif-Lists ...
    Scalar-Quantities
       Physical-Quantities
          Frame-Ontology ...
          Abstract-Algebra
             Frame-Ontology ...
    Standard-Units
       Physical-Quantities ...

Theories that include Vt-Design:

    Simple-Bikes
    Vt-Domain
       Vt-Example

4 classes defined:

    Cost-Quantity
    Vt-Component
    Vt-Constraint
    Vt-Constraint-Sentence

1 relation defined:

• Optimal-Component

1 function defined:

• Component.Cost

No instances defined.

The following constants were used from included theories:

• =< defined as a relation in theory Kif-Numbers
• Arity defined as a function in theory Frame-Ontology
• Class defined as a class in theory Frame-Ontology
• Component defined as a class in theory Configuration-Design
• Component-Class defined as a class in theory Configuration-Design
• Constraint defined as a class in theory Configuration-Design
• Constraint-Expression defined as a class in theory Configuration-Design
• Constraint.Expression defined as a function in theory Configuration-Design
• Currency-Dimension defined as a object in theory Standard-Units
• Documentation defined as a relation in theory Frame-Ontology
• Domain defined as a relation in theory Frame-Ontology
• Function defined as a class in theory Kif-Relations
• Function defined as a class in theory Frame-Ontology
• Has-Attribute defined as a relation in theory Configuration-Design
• Has-Constraint defined as a relation in theory Configuration-Design
• Instance-Of defined as a relation in theory Frame-Ontology
• One-Of defined as a function in theory Frame-Ontology
• Quantity.Dimension defined as a function in theory Physical-Quantities
• Range defined as a relation in theory Frame-Ontology
• Relation defined as a class in theory Kif-Relations
• Relation defined as a class in theory Frame-Ontology
• Restricted-Constraint-Sentence defined as a relation in theory Configuration-Design
• Scalar-Quantity defined as a class in theory Scalar-Quantities
• Subclass-Of defined as a relation in theory Frame-Ontology
• Subrelation-Of defined as a relation in theory Frame-Ontology
• Value-Type defined as a relation in theory Frame-Ontology

All constants that were mentioned were defined.

Class VT-CONSTRAINT

All VT constraints have a restricted form, specified by vt-constraint-sentence.

Subclass-Of: Constraint

Slots Of Instances:

Constraint.Expression:

Slot-Value-Type: Vt-constraint-sentence

• Defined in theory: Vt-design
• Source code: vt-design.lisp

Class VT-CONSTRAINT-SENTENCE

A VT constraint-sentence is a constraint-sentence with the logical operators, relational constants, and attribute operators restricted as listed below.

Subclass-Of: Constraint-expression

Axioms:

(=> (Vt-Constraint-Sentence ?Sentence) 
    (Restricted-Constraint-Sentence ?Sentence
                                    (One-Of 'And
                                            'Or
                                            'Not
                                            '=>
                                            '<=
                                            '<=>)
                                    (One-Of '=
                                            '/=
                                            '<
                                            '>
                                            '=<
                                            '>=
                                            'Member)
                                    (One-Of '+
                                            '-
                                            '*
                                            '/
                                            'Setof)))

• Defined in theory: Vt-design
• Source code: vt-design.lisp

Class VT-COMPONENT

A VT component is just a component as defined by the configuration-design ontology, except that we define a slot for the cost.

Subclass-Of: Component

Slots Of Instances:

Component.Cost:

Slot-Value-Type: Cost-quantity

Has-Attribute: Component.cost

Has-Constraint:

Slot-Value-Type: Vt-constraint

• Defined in theory: Vt-design
• Source code: vt-design.lisp

Function COMPONENT.COST

The monetary cost of a component in a design.

Arity: 2

Domain: Component

Range: Cost-quantity

• Defined in theory: Vt-design
• Source code: vt-design.lisp

Class COST-QUANTITY

A scalar quantity of the physical dimension 'currency'. By use of the standard-dimensions-and-units theory, costs can be stated in a variety of known currencies, and translation can be accomodated.

Subclass-Of: Scalar-quantity

Slots Of Instances:

Quantity.Dimension: Currency-dimension

• Defined in theory: Vt-design
• Source code: vt-design.lisp

Relation OPTIMAL-COMPONENT

An optimal-component is the least costly instance of a component class. To evaluate this relation will require making some kind of closed-world assumption over possible components.

Arity: 2

Domain: Component

Range: Component-class

Subrelation-Of: Instance-of

Axioms:

(<=> (Optimal-Component ?Comp ?Component-Class) 
     (And (Component ?Comp) 
          (Component-Class ?Component-Class) 
          (Instance-Of ?Comp ?Component-Class) 
          (=> (Instance-Of ?Other-Component ?Component-Class) 
              (=< (Component.Cost ?Comp) 
                  (Component.Cost ?Other-Component) ))))

• Defined in theory: Vt-design
• Source code: vt-design.lisp