solved

P22418
predicate

Indicates that one entity has successfully found a solution or answer to a problem, task, or challenge involving another entity.

Try in SPARQL

All labels observed (5)

Label Occurrences
completeProblem 6
solved canonical 5
problemSolved 2

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: solved
Generated description
Indicates that one entity has successfully found a solution or answer to a problem, task, or challenge involving another entity.

Sample triples (15)

Subject Object
Oedipus the riddle of the Sphinx ⓘ
Millennium Prize Problem Poincaré conjecture via predicate surface "hasSolvedProblem" ⓘ
surface form: Poincaré Conjecture
Schwarzschild
surface form: Karl Schwarzschild
Einstein field equations for static spherically symmetric vacuum spacetime ⓘ
Grigori Perelman Poincaré conjecture ⓘ
Grigori Perelman geometrization conjecture ⓘ
surface form: geometrization conjecture (in dimension 3)
“Molecular computation of solutions to combinatorial problems”
surface form: Molecular computation of solutions to combinatorial problems
Hamiltonian path problem via predicate surface "demonstratedSolutionTo" ⓘ
John Harrison practical determination of longitude at sea via predicate surface "problemSolved" ⓘ
“Solutio problematis ad geometriam situs pertinentis”
surface form: Solutio problematis ad geometriam situs pertinentis
Seven Bridges of Königsberg via predicate surface "problemSolved" NERFINISHED ⓘ
complexity class NL
surface form: NL
directed s-t reachability via predicate surface "completeProblem" ⓘ
complexity class NL
surface form: NL
graph reachability via predicate surface "completeProblem" ⓘ
complexity class NL
surface form: NL
path existence in directed graphs via predicate surface "completeProblem" ⓘ
complexity class NL
surface form: NL
context-free grammar membership (under logspace reductions) via predicate surface "completeProblem" ⓘ
complexity class NL
surface form: NL
2-SAT (under logspace reductions) via predicate surface "completeProblem" ⓘ
complexity class NL
surface form: NL
ST-CONNECTIVITY via predicate surface "completeProblem" ⓘ
Yuri Matiyasevich Hilbert’s tenth problem (in the sense of proving its unsolvability) NERFINISHED ⓘ