Dataset Viewer
Auto-converted to Parquet Duplicate
id
string
question_id
int64
chunk_index
int32
embedding_text
string
dense_tokens
int32
sparse_tokens
int32
languages
list
tags
list
payload_json
string
dense
list
sparse_indices
list
sparse_values
list
ef4ac792-7e85-50a3-8b24-5c5a59d4332e
181,855
0
Title: Integrating Prolog with C# Does anyone know of a nice (and preferably free) way to integrate Prolog and C#? Im looking to create a Prolog dll or similar to call from my managed code, and retrieve an answer once all the processing has been complete. Im looking for it to be predominantly one sided (c# calls Pro...
114
124
[ "c#", "prolog" ]
[ "c#", "prolog" ]
{"accepted_answer_id":null,"answer_count":7,"chunk_count":1,"chunk_index":0,"closed_date":"2014-07-17T02:31:21.423000+00:00","creation_date":"2008-10-08T08:41:31.797000+00:00","has_accepted_answer":false,"is_closed":true,"languages":["c#","prolog"],"last_activity_date":"2025-10-13T16:13:16.360000+00:00","last_edit_date...
[ -0.0181732177734375, -0.01045989990234375, -0.0005044937133789062, -0.00409698486328125, 0.0301361083984375, -0.021881103515625, 0.005321502685546875, 0.00885009765625, -0.015777587890625, 0.0026149749755859375, -0.03253173828125, -0.007442474365234375, 0.015899658203125, -0.00472259521484...
[ 7, 13, 47, 136, 238, 313, 501, 619, 678, 1250, 1295, 1632, 1916, 2773, 3370, 3714, 3917, 4092, 4867, 4904, 5609, 8999, 9433, 11782, 12601, 16487, 16981, 18151, 21373, 26147, 26267, 28282, 28484, 35166, 35672, 48962, 51592, 57143, 78779, 8...
[ 0.044189453125, 0.115234375, 0.012451171875, 0.15625, 0.0230712890625, 0.0859375, 0.0341796875, 0.05615234375, 0.162109375, 0.208984375, 0.0078125, 0.013427734375, 0.0810546875, 0.083984375, 0.0146484375, 0.0595703125, 0.0791015625, 0.09033203125, 0.302734375, 0.2353515625, 0...
b65baaf4-dc97-5ff8-aa58-ef0ebf657ca8
215,742
0
Title: What are the best uses of Logic Programming? By Logic Programming I mean the a sub-paradigm of declarative programming languages. Don't confuse this question with "What problems can you solve with if-then-else?" A language like Prolog is very fascinating, and it's worth learning for the sake of learning, but ...
124
142
[ "prolog" ]
[ "functional-programming", "prolog", "logic", "logic-programming", "minikanren" ]
{"accepted_answer_id":216302,"answer_count":8,"chunk_count":1,"chunk_index":0,"closed_date":null,"creation_date":"2008-10-18T23:50:45.763000+00:00","has_accepted_answer":true,"is_closed":false,"languages":["prolog"],"last_activity_date":"2021-01-20T22:20:41.877000+00:00","last_edit_date":"2021-01-20T21:42:27.393000+00:...
[ -0.0017232894897460938, -0.00548553466796875, 0.0014781951904296875, 0.01495361328125, 0.04925537109375, -0.03076171875, 0.0118865966796875, 0.0147705078125, 0.007965087890625, -0.004657745361328125, -0.04437255859375, 0.035552978515625, 0.0176544189453125, 0.01421356201171875, 0.0158081...
[ 7, 39, 70, 111, 136, 214, 238, 390, 398, 449, 621, 678, 831, 1250, 1614, 1916, 2174, 2773, 2965, 3311, 4527, 4552, 4803, 4865, 4867, 4935, 5557, 6044, 6276, 9351, 11389, 11522, 18507, 18986, 20117, 21635, 27958, 32195, 32316, 32554, 351...
[ 0.08056640625, 0.03466796875, 0.051025390625, 0.080078125, 0.003173828125, 0.15234375, 0.162109375, 0.005859375, 0.013427734375, 0.1220703125, 0.003173828125, 0.072265625, 0.05029296875, 0.146484375, 0.099609375, 0.07958984375, 0.1484375, 0.107421875, 0.1435546875, 0.0114746093...
169fe5ee-4478-533c-bf94-d8e38997ab37
275,660
0
"Title: Without creating a list, how can I query the integers between two values in Prolog?\n\nFor e(...TRUNCATED)
55
56
[ "prolog" ]
[ "prolog" ]
"{\"accepted_answer_id\":275693,\"answer_count\":1,\"chunk_count\":1,\"chunk_index\":0,\"closed_date(...TRUNCATED)
[-0.0007987022399902344,-0.023529052734375,0.006267547607421875,-0.0225830078125,0.0206756591796875,(...TRUNCATED)
[41,831,892,1193,1250,1294,1542,1884,2071,2806,3642,4867,5303,6626,7722,17721,26255,41206,48962,5525(...TRUNCATED)
[0.1513671875,0.0146484375,0.140625,0.099609375,0.1630859375,0.1826171875,0.099609375,0.018188476562(...TRUNCATED)
fc78413c-089e-5a3d-b0df-fba5fdd1c0d8
282,968
0
"Title: What's a good Prolog IDE for Linux?\n\nI need to write some Prolog programs for a class.\n \(...TRUNCATED)
30
31
[ "prolog" ]
[ "linux", "ide", "prolog" ]
"{\"accepted_answer_id\":282970,\"answer_count\":14,\"chunk_count\":1,\"chunk_index\":0,\"closed_dat(...TRUNCATED)
[-0.01232147216796875,-0.020050048828125,0.0186309814453125,-0.009552001953125,0.03277587890625,-0.0(...TRUNCATED)
[ 6, 100, 1250, 3060, 3871, 4127, 4867, 18507, 29908, 33022, 36497, 103391, 209236 ]
[0.001708984375,0.042236328125,0.158203125,0.015869140625,0.0771484375,0.0966796875,0.2578125,0.1269(...TRUNCATED)
048102f0-c644-5128-83c2-61990e5cb6ed
284,826
0
"Title: Trailing variable in a prolog list\n\nI'm on a beginner level course in prolog, doing a map (...TRUNCATED)
404
429
[ "prolog" ]
[ "prolog" ]
"{\"accepted_answer_id\":null,\"answer_count\":2,\"chunk_count\":1,\"chunk_index\":0,\"closed_date\"(...TRUNCATED)
[0.0007009506225585938,-0.00991058349609375,-0.0026111602783203125,-0.007297515869140625,0.014778137(...TRUNCATED)
[9,23,38,70,87,98,111,214,238,275,304,442,502,525,705,759,831,903,959,1052,1193,1484,1542,1679,1884,(...TRUNCATED)
[0.087890625,0.045654296875,0.045654296875,0.07177734375,0.0179443359375,0.0048828125,0.087890625,0.(...TRUNCATED)
a299c1a2-dbde-539d-a351-c2ea9015b991
297,996
0
"Title: Prolog: Filtering a list?\n\nI'm currently working on a very short project on Prolog, and ju(...TRUNCATED)
294
319
[ "prolog" ]
[ "list", "filter", "prolog", "meta-predicate" ]
"{\"accepted_answer_id\":299648,\"answer_count\":6,\"chunk_count\":1,\"chunk_index\":0,\"closed_date(...TRUNCATED)
[-0.0141448974609375,-0.005710601806640625,-0.00559234619140625,0.007434844970703125,0.0222473144531(...TRUNCATED)
[10,18,32,47,62,98,214,284,335,397,435,442,567,571,678,756,831,990,1193,1250,1542,1723,1810,2174,225(...TRUNCATED)
[0.043701171875,0.05810546875,0.011474609375,0.0439453125,0.0888671875,0.017578125,0.1005859375,0.06(...TRUNCATED)
b8326210-cb2d-581f-9f6c-98de49ff0213
317,740
0
"Title: prolog recursively find largest node\n\nJust a simple binary tree and i want to find the the(...TRUNCATED)
259
321
[ "prolog" ]
[ "prolog", "binary-tree" ]
"{\"accepted_answer_id\":318826,\"answer_count\":1,\"chunk_count\":1,\"chunk_index\":0,\"closed_date(...TRUNCATED)
[0.004764556884765625,0.0109710693359375,-0.0050048828125,-0.024932861328125,-0.008392333984375,-0.0(...TRUNCATED)
[18,70,95,110,112,304,339,363,502,617,711,756,758,808,818,866,910,966,988,1019,1052,1284,2174,2394,2(...TRUNCATED)
[0.039306640625,0.06201171875,0.001708984375,0.2060546875,0.185546875,0.0255126953125,0.0751953125,0(...TRUNCATED)
35273b02-2817-511e-817d-8d6e8c0226ce
321,974
0
"Title: How to verify if a rule exists in a prolog file clause database\n\nI'm working on a college (...TRUNCATED)
94
108
[ "prolog" ]
[ "prolog" ]
"{\"accepted_answer_id\":338681,\"answer_count\":2,\"chunk_count\":1,\"chunk_index\":0,\"closed_date(...TRUNCATED)
[-0.0233612060546875,-0.00283050537109375,0.014923095703125,-0.004749298095703125,-0.004158020019531(...TRUNCATED)
[7,10,13,23,47,162,237,493,502,674,707,997,1328,2174,4358,4527,4867,6528,8110,9351,10336,11249,11435(...TRUNCATED)
[0.0810546875,0.0224609375,0.1455078125,0.05126953125,0.05615234375,0.006591796875,0.011962890625,0.(...TRUNCATED)
44abc4eb-6bf4-51a4-b14a-bd055c396257
349,896
0
"Title: Passing results in prolog\n\nI'm trying to make a function that has a list of lists, it mult(...TRUNCATED)
93
103
[ "prolog" ]
[ "prolog" ]
"{\"accepted_answer_id\":null,\"answer_count\":3,\"chunk_count\":1,\"chunk_index\":0,\"closed_date\"(...TRUNCATED)
[0.0033664703369140625,0.00879669189453125,0.0034694671630859375,-0.00016880035400390625,0.048187255(...TRUNCATED)
[5,7,16,19,23,56,83,90,110,111,136,214,418,502,678,831,1193,1542,1810,2060,2109,2203,3249,4488,4867,(...TRUNCATED)
[0.00048828125,0.0009765625,0.000244140625,0.05029296875,0.00341796875,0.07470703125,0.1513671875,0.(...TRUNCATED)
5005c12c-768b-508f-b2d7-5cb5ed4fb25f
377,912
0
"Title: Prolog - outputting a list?\n\nI have the function\n \nsublist(_,[_],_) :-\n !.\nsublist((...TRUNCATED)
118
130
[ "prolog" ]
[ "prolog" ]
"{\"accepted_answer_id\":null,\"answer_count\":2,\"chunk_count\":1,\"chunk_index\":0,\"closed_date\"(...TRUNCATED)
[-0.0059967041015625,-0.0125885009765625,0.002658843994140625,-0.01459503173828125,0.012466430664062(...TRUNCATED)
[10,18,20,32,47,70,71,83,111,163,454,567,618,627,711,765,903,990,1052,1193,1250,1284,1511,1542,1614,(...TRUNCATED)
[0.0078125,0.043212890625,0.0693359375,0.001953125,0.1201171875,0.01220703125,0.0302734375,0.0751953(...TRUNCATED)
End of preview. Expand in Data Studio

Stack2Graph vector database: prolog

This release contains 14216 text chunks from Stack Overflow with dense and sparse embeddings, selected by the producer's programming-language memberships. Memberships can overlap: a chunk may occur in several language datasets. These labels describe programming languages, not the natural language of the text. extra-languages, when present, contains source rows without a language match. An absent language is never replaced with an empty dataset.

Files and fields

data/vectors-*.parquet contains Zstandard-compressed tables. Each row has a stable id, question_id, chunk_index, embedding_text, model token counts, languages, tags, dense, sparse_indices, sparse_values and payload_json. The last field preserves the complete original Qdrant payload, including source snapshot identity, source dates, scores and answer flags when available. Dense values are float32 representations of the producer's stored float16 values; this does not recover precision discarded during embedding. Sparse weights preserve float32 values and uint32 token indices.

On Hugging Face, load the vectors config with datasets.load_dataset and use streaming for large releases. The dataset viewer uses only the explicitly listed Parquet files. data/dataset.tar.gz is the portable package also used by MDC: extract it to obtain the same Parquet bytes, README and publication.json. The archive is an exchange dataset, not a Qdrant binary snapshot. Import in bounded batches using each row's id, named dense/sparse vectors and decoded payload_json. Recreate collection settings deliberately for your Qdrant version.

Provenance and reproducibility

{
  "after_id": -9223372036854775808,
  "chunk_overlap": 128,
  "chunk_tokens": 1024,
  "collection": "stackoverflow_questions",
  "dense_dimension": 4096,
  "dense_model": "Qwen/Qwen3-Embedding-8B",
  "dense_revision": "1d8ad4ca9b3dd8059ad90a75d4983776a23d44af",
  "question_limit": null,
  "registry_digest": "d2a7357c04e7f47d9bb598189aeeb7db0680d6b35f0d9695d8d2e544121afb8e",
  "snapshot_digest": "56fe643952cec74b17ea13d91edc8ad95181326156177c94cce48d3fed9834b9",
  "snapshot_id": "stackexchange_20260630_sakura",
  "sparse_model": "BAAI/bge-m3",
  "sparse_revision": "5617a9f61b028005a4858fdac845db406aefb181"
}

Export identity: bc9f696c9588560e3be547879c58b96c50c64e3828495471bee43e504392ec7f. Point-ID configuration digest: d16d58c9e7b8007664e3f77b4e9f4a1689a8b8de2c6727b479595621b25e3460. Point IDs use the same snapshot/configuration/question/chunk UUID derivation as the project's Qdrant loader. publication.json lists exact file sizes, SHA-256 hashes, row count, source identity and model/chunking settings. On HF, release.json additionally verifies all managed remote files. Only locally finalized runs with matching stage/report counts are published. The uploader does not re-embed text or query a running database.

Uses and limitations

Intended for dense, sparse and hybrid retrieval, retrieval-augmented generation and reproducible search experiments. Retrieval quality depends on the pinned models and chunking configuration. Overlapping chunks and language memberships are not independent samples; split evaluations by source question to avoid leakage. Source questions can contain personal data, obsolete code, errors and biases. Source-window limits are recorded above. No retrieval benchmark or completeness beyond the recorded source window is claimed.

Attribution and licensing

Derived from Stack Overflow content. Preserve the original post/author attribution and applicable Stack Overflow licensing when redistributing or displaying source content. Question IDs and source snapshot are retained to resolve source posts. This publication declares CC BY-SA 4.0; embedding model licenses and any upstream obligations still apply. Pinned model names and revisions above identify their model cards for review.

Source and procedures: https://github.com/tha-atlas/Stack2Graph. When citing this dataset, include the dataset repository, immutable release revision, source snapshot, export identity, model revisions and the project.

Project citation: Kleybolte, Ventura and Zarcone (2026), Stack2Graph, KG-LLM at LREC26. https://doi.org/10.63317/583q4d3mwbdu.

Downloads last month
47

Collection including Mo7art/Stack2Graph_VD_prolog