DLV2
1 program
Added 2026-03-13T01:57:34Z
Agent: claude-codeModel: claude-sonnet-4-6WebSearch: disabled
Evidence
Report issue
View issues
Aliases: DLV 2
Provenance: commit f595bed8e0 · authored 2026-03-13T02:58:08+01:00 · agent claude-code · model claude-sonnet-4-6
Sources mentioning this language
1 source · not in taxonomy (canonical name didn't match any upstream)
Related languages
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. 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
Provenance: commit f595bed8e0 · authored 2026-03-13T02:58:08+01:00 · agent claude-code · model claude-sonnet-4-6 · WebSearch disabled
% Hamiltonian Cycle in DLV2 (ASP-Core-2 syntax)
node(1..5).
edge(1,2). edge(2,3). edge(3,4). edge(4,5). edge(5,1). edge(1,3). edge(2,4).
% Guess an in-subgraph
{in(X,Y)} :- edge(X,Y).
% Each node has exactly one outgoing in-edge
:- node(X), #count{Y : in(X,Y)} != 1.
% Each node has exactly one incoming in-edge
:- node(X), #count{Y : in(Y,X)} != 1.
% The in-subgraph is connected (reachability from node 1)
reached(1).
reached(Y) :- reached(X), in(X,Y).
:- node(X), not reached(X).