outputProperty
P77812
predicate
Indicates that a property or attribute is produced, exposed, or yielded as the output of a process, function, or system.
All labels observed (3)
| Label | Occurrences |
|---|---|
| outputProperty canonical | 10 |
| outputField | 6 |
| definesOutput | 1 |
Description generation (PDg)
The one-sentence description above was generated by prompting gpt-5.1 with the predicate name and this instruction.
Instruction
Given a predicate that represents a relationship or action between entities, generate a one-sentence description explaining its meaning. # Instructions Focus on describing the relationship, not the entities themselves. # Response Format Begin the description with \' Indicates...\'
Input
Predicate: outputProperty
Generated description
Indicates that a property or attribute is produced, exposed, or yielded as the output of a process, function, or system.
Sample triples (17)
| Subject | Object |
|---|---|
| Alexandrov compactification | compactness ⓘ |
| Alexandrov compactification | Hausdorff if the original space is locally compact Hausdorff ⓘ |
| ICC Test Team Rankings | team name via predicate surface "outputField" ⓘ |
| ICC Test Team Rankings | matches via predicate surface "outputField" ⓘ |
| ICC Test Team Rankings | points via predicate surface "outputField" ⓘ |
| ICC Test Team Rankings | rating via predicate surface "outputField" ⓘ |
| Gale’s top trading cycles algorithm | no agent can be made better off without making another worse off ⓘ |
| Gale’s top trading cycles algorithm | no coalition of agents can reassign their initial endowments to make all its members strictly better off ⓘ |
| ChooseColor | lpcc->rgbResult via predicate surface "outputField" ⓘ |
| ChooseColor | lpcc->lpCustColors via predicate surface "outputField" ⓘ |
| Secure Hash Standard | fixed-size cryptographic hash values via predicate surface "definesOutput" ⓘ |
| Naor–Yung encryption paradigm | IND-CCA security ⓘ |
| Naor–Yung encryption paradigm | security against chosen-ciphertext attacks ⓘ |
| Rabin–Scott powerset construction | resulting DFA is deterministic ⓘ |
| Rabin–Scott powerset construction | resulting DFA has no epsilon-transitions ⓘ |
| Yao’s garbled circuits | evaluator learns only the function output ⓘ |
| Yao’s garbled circuits | garbler learns nothing about evaluator’s input ⓘ |