Triple
T2384403
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Leonardo de Moura |
E46384
|
entity |
| Predicate | contributedTo |
P37
|
FINISHED |
| Object |
Satisfiability Modulo Theories (SMT)
Satisfiability Modulo Theories (SMT) is a framework in computer science and mathematical logic for deciding the satisfiability of logical formulas with respect to background theories such as arithmetic, bit-vectors, arrays, and data types, widely used in verification, synthesis, and automated reasoning.
|
E262229
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69a88a1554a48190a0180682bcf099be |
elicitation | completed |
| NER | batch_69abc7bc87d0819090cd9d19d748bcc3 |
ner | completed |
| NED1 | batch_69aeb3ccec008190b21c0bf84f8ecd09 |
ned_source_triple | completed |
| NED2 | batch_69aeb4a713508190a9b06ba88364d4d4 |
ned_description | completed |
| NEDg | batch_69aeb43a78f88190a152c8fa83823202 |
nedg | completed |
Created at: March 4, 2026, 7:57 p.m.