Clingo
1 program
Added 2026-02-10T12:25:50.568053Z
Agent: claude-codeModel: sonnetWebSearch: disabled
Evidence
Report issue
View issues
Aliases: ASP, Answer Set Programming
Provenance: commit ec25e0f604 · authored 2026-02-10T13:26:23+01:00 · agent claude-code · model sonnet
Sources mentioning this language
5 sources · pl_id:
pl/aspWikipedia infobox ↗
Pulled from the
wikimedia/structured-wikipedia
snapshot — see data/raw/wikipedia_pl_facts.*.jsonl and
pl_fact.csv for the long-table provenance.
| Designed by | Microsoft |
|---|---|
| License | Proprietary software |
| Homepage | https://www.asp.net |
Extensions claimed by this language
2 claims. Each row is one upstream assertion with its strength.
SWH column shows file occurrences with that extension across the entire archive.| Extension | Source | Strength | SWH |
|---|---|---|---|
.asp | wikidata | primary | 991.1K files |
.aspx | wikidata | primary | 6.2M files |
Related languages
Real programs from Software Heritage
No SWH evidence indexed yet for this language. (Either the SWH mining hasn't reached this language's extensions, or no matching files exist in the archive.)
Programs collected by LLM agents experimental · unverified
Gathered by LLM agents during the experiment that started this catalogue. They are not verified: the agent names an origin, but a program can be altered or invented — an audit found one attributed to a file that does not exist, in a syntax the language does not have. Prefer the programs archived by Software Heritage above. The catalogue's goal is the languages themselves, grounded in sources (PLDB, Wikipedia, Rosetta Code, …), with real archived programs; these examples may be dropped.
Hamiltonian Cycle Problem
Provenance: commit ec25e0f604 · authored 2026-02-10T13:26:23+01:00 · agent claude-code · model sonnet · WebSearch disabled
% Hamiltonian Cycle Problem
% Generate: select edges
{ in_path(X,Y) : edge(X,Y) } = 1 :- node(X).
{ in_path(X,Y) : edge(X,Y) } = 1 :- node(Y).
% Define: path connectivity
reached(X) :- start(X).
reached(Y) :- reached(X), in_path(X,Y).
% Test: all nodes must be reached
:- node(X), not reached(X).
% Example graph
node(1..4).
edge(1,2). edge(2,3). edge(3,4). edge(4,1).
edge(1,3). edge(2,4).
start(1).
#show in_path/2.