Triple
T11090175
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Satisfiability Modulo Theories |
E262229
|
entity |
| Predicate | typicalArchitecture |
P607
|
FINISHED |
| Object |
DPLL(T)
DPLL(T) is a framework that extends the classic DPLL SAT-solving algorithm with theory solvers to efficiently decide satisfiability modulo background theories such as arithmetic, arrays, or bit-vectors.
|
E904156
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69d6aa9a40d88190a373e2c7e48285db |
elicitation | completed |
| NER | batch_69d799e96ca08190838c8a04d1eb2a16 |
ner | completed |
| NED1 | batch_69e3e7c586808190a576803b7406a49e |
ned_source_triple | completed |
| NED2 | batch_69e3f488819081908f9a4225279cde6b |
ned_description | completed |
| NEDg | batch_69e3f2cafc008190a3504999297f1e4e |
nedg | completed |
Created at: April 8, 2026, 9:27 p.m.