eyelang 1.1.19 → 1.2.0

package/docs/guide.md

@@ -302,10 +302,8 @@ Use `holds/2` when you want to match the member term directly, for example `name
 
 ## Example catalog
 
-Each example has a checked golden output in `examples/output`.
-
-| Example | What it demonstrates | Golden output |
-|---|---|---|
+| Example | Description | Golden output |
+| --- | --- | --- |
 | [`access-control-policy.pl`](../examples/access-control-policy.pl) | Evaluates role and condition based access decisions. | [`output/access-control-policy.pl`](../examples/output/access-control-policy.pl) |
 | [`ackermann.pl`](../examples/ackermann.pl) | Computes Ackermann-style hyperoperation values. | [`output/ackermann.pl`](../examples/output/ackermann.pl) |
 | [`age.pl`](../examples/age.pl) | Checks whether people meet age thresholds. | [`output/age.pl`](../examples/output/age.pl) |
@@ -385,6 +383,7 @@ Each example has a checked golden output in `examples/output`.
 | [`gdpr-compliance.pl`](../examples/gdpr-compliance.pl) | Checks GDPR-style processing compliance. | [`output/gdpr-compliance.pl`](../examples/output/gdpr-compliance.pl) |
 | [`good-cobbler.pl`](../examples/good-cobbler.pl) | Demonstrates term-level structure with a good-cobbler statement. | [`output/good-cobbler.pl`](../examples/output/good-cobbler.pl) |
 | [`gps.pl`](../examples/gps.pl) | Finds and verifies route paths. | [`output/gps.pl`](../examples/output/gps.pl) |
+| [`graph.pl`](../examples/graph.pl) | Derives transitive paths over French-city road links while showing the productive recursive rule order. | [`output/graph.pl`](../examples/output/graph.pl) |
 | [`graph-reachability.pl`](../examples/graph-reachability.pl) | Derives reachable nodes in a graph. | [`output/graph-reachability.pl`](../examples/output/graph-reachability.pl) |
 | [`gray-code-counter.pl`](../examples/gray-code-counter.pl) | Generates Gray-code counter states. | [`output/gray-code-counter.pl`](../examples/output/gray-code-counter.pl) |
 | [`greatest-lower-bound-uniqueness.pl`](../examples/greatest-lower-bound-uniqueness.pl) | Shows uniqueness of greatest lower bounds in a finite order instance. | [`output/greatest-lower-bound-uniqueness.pl`](../examples/output/greatest-lower-bound-uniqueness.pl) |
@@ -452,10 +451,12 @@ Each example has a checked golden output in `examples/output`.
 | [`turing.pl`](../examples/turing.pl) | Simulates a binary-increment Turing machine. | [`output/turing.pl`](../examples/output/turing.pl) |
 | [`vector-similarity.pl`](../examples/vector-similarity.pl) | Computes dot product, norm, and cosine similarity. | [`output/vector-similarity.pl`](../examples/output/vector-similarity.pl) |
 | [`vulnerability-impact.pl`](../examples/vulnerability-impact.pl) | Analyzes vulnerable transitive dependencies and urgent patch impact. | [`output/vulnerability-impact.pl`](../examples/output/vulnerability-impact.pl) |
+| [`web-names.pl`](../examples/web-names.pl) | Uses compact `web(Space, Local)` terms as readable global names and expands selected names to URIs. | [`output/web-names.pl`](../examples/output/web-names.pl) |
 | [`weighted-interval-scheduling.pl`](../examples/weighted-interval-scheduling.pl) | Selects the best non-overlapping weighted intervals with memoized dynamic programming. | [`output/weighted-interval-scheduling.pl`](../examples/output/weighted-interval-scheduling.pl) |
 | [`witch.pl`](../examples/witch.pl) | Derives the classic “burn the witch” rule chain. | [`output/witch.pl`](../examples/output/witch.pl) |
 | [`wolf-goat-cabbage.pl`](../examples/wolf-goat-cabbage.pl) | Solves the wolf-goat-cabbage river crossing. | [`output/wolf-goat-cabbage.pl`](../examples/output/wolf-goat-cabbage.pl) |
 | [`zebra.pl`](../examples/zebra.pl) | Solves the zebra logic puzzle. | [`output/zebra.pl`](../examples/output/zebra.pl) |
+
 ## Golden outputs, tests, and conformance
 
 Golden answer outputs live in [`examples/output`](../examples/output). `npm run test:eyelang` covers the eyelang integration check, conformance cases, regression checks, runnable examples, and proof-output examples. A curated proof-output suite for `.pl` examples lives in [`examples/proof`](../examples/proof). Example tests pin `local_time/1` to `2026-05-30` so date-dependent examples stay deterministic. Regenerate them after an intentional output or explanation change:

package/docs/language-reference.md

@@ -119,7 +119,7 @@ The punctuation tokens are:
 (  )  [  ]  ,  |  .  :-
 ```
 
-A colon outside `:-` is not part of the language. Namespace-like names SHOULD be written as plain atom constants such as `person_type` or `odrl_permission`.
+A colon outside `:-` is not part of the language. Namespace-like names SHOULD be written as plain atom constants such as `person_type`, `odrl_permission`, or dotted atom constants such as `org.schema`.
 
 ### 3.4 Variables
 
@@ -138,12 +138,15 @@ Each `_` anonymous variable occurrence is fresh.
 
 ### 3.5 Atom constants
 
-A plain atom constant starts with a lowercase ASCII letter and is followed by zero or more ASCII letters, digits, or underscores. This follows the usual Prolog unquoted-atom shape; names such as `a-b` or `http://example` MUST be quoted if they are meant as one atom constant:
+A plain atom constant starts with a lowercase ASCII letter and is followed by zero or more ASCII letters, digits, or underscores. For compact globally scoped names, eyelang also permits dot-separated plain atom segments, such as `be.ugent`, `org.schema`, or `eyereasoner.github`. A dot ends a clause only when it is not followed by another lowercase-starting segment. Names such as `a-b` or `http://example` MUST still be quoted if they are meant as one atom constant:
 
 ```prolog
 pat
 type
 case_123
+be.ugent
+org.schema
+eyereasoner.github
 'a-b'
 'http://example'
 ```
@@ -655,7 +658,7 @@ eyelang source is intended to be a subset of familiar Prolog term and Horn-claus
 - no variables in functor or predicate position;
 - no occurs check in unification.
 
-Programs intended to be portable to eyelang SHOULD avoid ISO-specific syntax and keep terms explicit. Atom names that are not plain lowercase-starting names or graphic atom tokens SHOULD be written as quoted atoms, for example `'a-b'`.
+Programs intended to be portable to eyelang SHOULD avoid ISO-specific syntax and keep terms explicit. Atom names that are not plain lowercase-starting names, dot-separated plain names, or graphic atom tokens SHOULD be written as quoted atoms, for example `'a-b'`.
 
 ## 16. Examples
 

package/examples/complex.pl

@@ -8,7 +8,8 @@
 % The example derives arithmetic identities, polar conversions, powers, roots,
 % exponential/trigonometric functions, and distance/normalization results from
 % a small complex-number toolkit.
-materialize(is, 2).
+materialize(complex_power, 4).
+materialize(complex_function, 4).
 
 % Program structure: facts set up the scenario, and rules derive the materialized conclusions.
 pi(3.141592653589793).
@@ -110,17 +111,23 @@ complex_dial(X, Y, T, Tp) :-
   mul(Pi, 2, Z1),
   sub(Z1, T, Tp).
 
-is(test, (
-  complex_exponentiation(input(exponentiation, [-1, 0], [0.5, 0]), C1),
-  complex_exponentiation(input(exponentiation, [2.718281828459045, 0], [0, 3.141592653589793]), C2),
-  complex_exponentiation(input(exponentiation, [0, 1], [0, 1]), C3),
-  complex_exponentiation(input(exponentiation, [2.718281828459045, 0], [-1.57079632679, 0]), C4),
-  complex_asin(input(asin, [2, 0]), C5),
-  complex_acos(input(acos, [2, 0]), C6)
-)) :-
-  complex_exponentiation([-1, 0], [0.5, 0], C1),
-  complex_exponentiation([2.718281828459045, 0], [0, 3.141592653589793], C2),
-  complex_exponentiation([0, 1], [0, 1], C3),
-  complex_exponentiation([2.718281828459045, 0], [-1.57079632679, 0], C4),
-  complex_asin([2, 0], C5),
-  complex_acos([2, 0], C6).
+% Named result rows keep the example output readable.  Each row records the
+% operation name, the input value(s), and the computed complex result rather
+% than packing all assertions into one large nested term.
+complex_power(sqrt_minus_one, [-1, 0], [0.5, 0], Result) :-
+  complex_exponentiation([-1, 0], [0.5, 0], Result).
+
+complex_power(e_to_i_pi, [2.718281828459045, 0], [0, 3.141592653589793], Result) :-
+  complex_exponentiation([2.718281828459045, 0], [0, 3.141592653589793], Result).
+
+complex_power(i_to_i, [0, 1], [0, 1], Result) :-
+  complex_exponentiation([0, 1], [0, 1], Result).
+
+complex_power(e_to_minus_pi_over_two, [2.718281828459045, 0], [-1.57079632679, 0], Result) :-
+  complex_exponentiation([2.718281828459045, 0], [-1.57079632679, 0], Result).
+
+complex_function(asin, two, [2, 0], Result) :-
+  complex_asin([2, 0], Result).
+
+complex_function(acos, two, [2, 0], Result) :-
+  complex_acos([2, 0], Result).

package/examples/graph.pl

@@ -0,0 +1,35 @@
+% Transitive graph paths over a small map of French cities.
+%
+% The base relation is directed: oneway(A, B) means there is a road from A
+% to B.  The derived relation path(A, B) is the transitive closure: B is
+% reachable from A by one or more directed legs.
+%
+% The recursive rule is written in a productive, right-recursive form:
+%
+%     path(A, C) :- oneway(A, B), path(B, C).
+%
+% That order matters in a goal-directed reasoner.  A left-recursive closure
+% rule such as `path(A, C) :- path(A, B), path(B, C).` starts by asking for
+% the same open relation it is currently proving, so eyelang's recursion guard
+% must stop it to avoid an infinite loop.  The result is under-generation: only
+% direct edges are printed.  Starting with the concrete generator `oneway/2`
+% first makes each recursive step smaller and yields the complete closure.
+
+materialize(path, 2).
+
+oneway(paris, orleans).
+oneway(paris, chartres).
+oneway(paris, amiens).
+oneway(orleans, blois).
+oneway(orleans, bourges).
+oneway(blois, tours).
+oneway(chartres, lemans).
+oneway(lemans, angers).
+oneway(lemans, tours).
+oneway(angers, nantes).
+
+path(A, B) :-
+    oneway(A, B).
+path(A, C) :-
+    oneway(A, B),
+    path(B, C).

package/examples/output/complex.pl

@@ -1 +1,6 @@
-is(test, (complex_exponentiation(input(exponentiation, [-1, 0], [0.5, 0]), [6.123233995736766e-17, 1.0]), complex_exponentiation(input(exponentiation, [2.718281828459045, 0], [0, 3.141592653589793]), [-1.0, 1.2246467991473532e-16]), complex_exponentiation(input(exponentiation, [0, 1], [0, 1]), [0.20787957635076193, 0.0]), complex_exponentiation(input(exponentiation, [2.718281828459045, 0], [-1.57079632679, 0]), [0.20787957635177984, 0.0]), complex_asin(input(asin, [2, 0]), [1.5707963267948966, 1.3169578969248166]), complex_acos(input(acos, [2, 0]), [0.0, -1.3169578969248166]))).
+complex_power(sqrt_minus_one, [-1, 0], [0.5, 0], [6.123233995736766e-17, 1.0]).
+complex_power(e_to_i_pi, [2.718281828459045, 0], [0, 3.141592653589793], [-1.0, 1.2246467991473532e-16]).
+complex_power(i_to_i, [0, 1], [0, 1], [0.20787957635076193, 0.0]).
+complex_power(e_to_minus_pi_over_two, [2.718281828459045, 0], [-1.57079632679, 0], [0.20787957635177984, 0.0]).
+complex_function(asin, two, [2, 0], [1.5707963267948966, 1.3169578969248166]).
+complex_function(acos, two, [2, 0], [0.0, -1.3169578969248166]).

package/examples/output/graph.pl

@@ -0,0 +1,21 @@
+path(paris, orleans).
+path(paris, chartres).
+path(paris, amiens).
+path(orleans, blois).
+path(orleans, bourges).
+path(blois, tours).
+path(chartres, lemans).
+path(lemans, angers).
+path(lemans, tours).
+path(angers, nantes).
+path(paris, blois).
+path(paris, bourges).
+path(paris, tours).
+path(paris, lemans).
+path(paris, angers).
+path(paris, nantes).
+path(orleans, tours).
+path(chartres, angers).
+path(chartres, tours).
+path(chartres, nantes).
+path(lemans, nantes).

package/examples/output/web-names.pl

@@ -0,0 +1,10 @@
+web_uri(web(be.ugent, jos), "https://data.ugent.be/id/jos").
+web_uri(web(com.example, jos), "https://example.com/id/jos").
+web_uri(web(be.ugent, idlab), "https://data.ugent.be/id/idlab").
+web_uri(web(be.ugent, ugent), "https://data.ugent.be/id/ugent").
+web_uri(web(eyereasoner.github, eyelang), "https://github.com/eyereasoner/eyelang").
+web_uri(web(org.schema, maintainer), "https://schema.org/maintainer").
+affiliated_with(web(be.ugent, jos), web(be.ugent, idlab)).
+affiliated_with(web(be.ugent, jos), web(be.ugent, ugent)).
+project_contact(web(eyereasoner.github, eyelang), web(be.ugent, jos), "josderoo@gmail.com").
+same_local_name(web(be.ugent, jos), web(com.example, jos), jos).

package/examples/web-names.pl

@@ -0,0 +1,83 @@
+% Compact web-style names without full URIs or global prefix tables.
+%
+% RDF-style URIs are globally meaningful but long, while QNames such as
+% schema:Person depend on an external prefix declaration.  This example uses an
+% eyelang-native alternative: web(Space, Local).  The first argument is a dotted
+% atom that names a vocabulary, organization, or authority; the second argument
+% is the local name inside that space.
+%
+% The important property is that the complete term is self-contained.  The local
+% name jos can safely occur in two spaces: web(be.ugent, jos) and
+% web(com.example, jos) are different Herbrand terms, so there is no hidden
+% prefix context and no accidental collision.  Tooling can still expand selected
+% web/2 terms to full URI strings when a base is known.
+
+materialize(web_uri, 2).
+materialize(affiliated_with, 2).
+materialize(project_contact, 3).
+materialize(same_local_name, 3).
+
+% Optional URI bases for spaces that we want to publish or display.
+space_base(be.ugent, "https://data.ugent.be/id/").
+space_base(com.example, "https://example.com/id/").
+space_base(eyereasoner.github, "https://github.com/eyereasoner/").
+space_base(org.schema, "https://schema.org/").
+
+% A tiny graph using globally scoped web names as ordinary eyelang terms.
+triple(web(be.ugent, jos), web(org.schema, name), "Jos De Roo").
+triple(web(be.ugent, jos), web(org.schema, email), "josderoo@gmail.com").
+triple(web(be.ugent, jos), web(org.schema, affiliation), web(be.ugent, idlab)).
+triple(web(be.ugent, idlab), web(org.schema, parentOrganization), web(be.ugent, ugent)).
+
+triple(web(eyereasoner.github, eyelang), web(org.schema, name), "eyelang").
+triple(web(eyereasoner.github, eyelang), web(org.schema, codeRepository), "https://github.com/eyereasoner/eyelang").
+triple(web(eyereasoner.github, eyelang), web(org.schema, maintainer), web(be.ugent, jos)).
+
+% Same local spelling, different global identity.
+triple(web(com.example, jos), web(org.schema, name), "Another Jos in another space").
+
+% Keep URI expansion explicit and optional: reasoning uses web/2 terms, while
+% web_uri/2 is only a presentation bridge for selected names.
+published_name(web(be.ugent, jos)).
+published_name(web(com.example, jos)).
+published_name(web(be.ugent, idlab)).
+published_name(web(be.ugent, ugent)).
+published_name(web(eyereasoner.github, eyelang)).
+published_name(web(org.schema, maintainer)).
+
+web_uri(web(Space, Local), URI) :-
+    published_name(web(Space, Local)),
+    space_base(Space, Base),
+    atom_string(Local, LocalText),
+    str_concat(Base, LocalText, URI).
+
+% Organization membership follows parentOrganization links transitively.
+parent_organization(Unit, Org) :-
+    triple(Unit, web(org.schema, parentOrganization), Org).
+parent_organization(Unit, Org) :-
+    triple(Unit, web(org.schema, parentOrganization), Mid),
+    parent_organization(Mid, Org).
+
+affiliated_with(Person, Org) :-
+    triple(Person, web(org.schema, affiliation), Org).
+affiliated_with(Person, Org) :-
+    triple(Person, web(org.schema, affiliation), Unit),
+    parent_organization(Unit, Org).
+
+% A project contact is derived by joining the project's maintainer with the
+% maintainer's email.  The join works because both facts use the same complete
+% web(be.ugent, jos) term.
+project_contact(Project, Person, Email) :-
+    triple(Project, web(org.schema, maintainer), Person),
+    triple(Person, web(org.schema, email), Email).
+
+% Demonstrate that local names are not global names.  This reports the deliberate
+% local-name collision without treating the two people as equal.
+local_name(Entity, Local) :-
+    triple(Entity, web(org.schema, name), _),
+    eq(Entity, web(_, Local)).
+
+same_local_name(A, B, Local) :-
+    local_name(A, Local),
+    local_name(B, Local),
+    lt(A, B).

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "eyelang",
-  "version": "1.1.19",
+  "version": "1.2.0",
   "description": "A small Prolog-syntax-subset logic programming language for rules, goals, answers, and proofs.",
   "type": "module",
   "main": "./index.js",

package/playground.html

@@ -434,156 +434,158 @@
 
   <script type="module">
     const EXAMPLES = [
-      "access-control-policy",
-      "ackermann",
-      "age",
-      "aliases-and-namespaces",
-      "alignment-demo",
-      "allen-interval-calculus",
-      "ancestor",
-      "animal",
-      "annotation",
-      "auroracare",
-      "backward",
-      "basic-monadic",
-      "bayes-diagnosis",
-      "bayes-therapy",
-      "beam-deflection",
-      "binomial-vandermonde",
-      "blocks-world-planning",
-      "bmi",
-      "braking-safety-worlds",
-      "buck-converter-design",
-      "cache-performance",
-      "canary-release",
-      "cat-koko",
-      "catalan-convolution",
-      "chart-parser",
-      "clinical-trial-screening",
-      "collatz-1000",
-      "combinatorics-findall-sort",
-      "competitive-enzyme-kinetics",
-      "complex",
-      "composition-of-injective-functions-is-injective",
-      "context-association",
-      "context-schema-audit",
-      "continued-fraction-sqrt2",
-      "control-system",
-      "critical-path-schedule",
-      "cyclic-path",
-      "d3-group",
-      "dairy-energy-balance",
-      "data-negotiation",
-      "deep-taxonomy-10",
-      "deep-taxonomy-100",
-      "deep-taxonomy-1000",
-      "deep-taxonomy-10000",
-      "deep-taxonomy-100000",
-      "delfour",
-      "deontic-logic",
-      "derived-backward-rule",
-      "derived-rule",
-      "diamond-property",
-      "dijkstra",
-      "dijkstra-findall-sort",
-      "dijkstra-risk-path",
-      "dining-philosophers",
-      "dog",
-      "dpv-odrl-purpose-mapping",
-      "drone-corridor-planner",
-      "easter-computus",
-      "electrical-rc-filter",
-      "epidemic-policy",
-      "equivalence-classes-overlap-implies-same-class",
-      "eulerian-path",
-      "ev-range-worlds",
-      "existential-rule",
-      "exoplanet-validation-worlds",
-      "expression-eval",
-      "family-cousins",
-      "fastpow",
-      "fft8-numeric",
-      "fibonacci",
-      "field-nitrogen-balance",
-      "flandor",
-      "floating-point",
-      "four-color-map",
-      "fundamental-theorem-arithmetic",
-      "gd-step-certified",
-      "gdpr-compliance",
-      "good-cobbler",
-      "gps",
-      "graph-reachability",
-      "gray-code-counter",
-      "greatest-lower-bound-uniqueness",
-      "group-inverse-uniqueness",
-      "hamiltonian-path",
-      "hamming-code",
-      "hanoi",
-      "heat-loss",
-      "heron-theorem",
-      "ideal-gas-law",
-      "illegitimate-reasoning",
-      "integer-partitions",
-      "intuitionistic-logic-kripke",
-      "job-shop-scheduling",
-      "knapsack-optimization",
-      "knowledge-engineering-alignment-flow",
-      "law-of-cosines",
-      "least-squares-regression",
-      "linear-logic-resources",
-      "list-collection",
-      "lldm",
-      "manufacturing-quality-control",
-      "matrix-chain-order",
-      "microgrid-dispatch",
-      "missionaries-cannibals",
-      "modal-logic-kripke",
-      "modular-exponentiation",
-      "monkey-bananas",
-      "n-queens-8",
-      "network-sla",
-      "newton-raphson",
-      "nixon-diamond",
-      "observability-log-correlation",
-      "odrl-dpv-fpv-trust-flow",
-      "odrl-dpv-healthcare-risk-ranked",
-      "odrl-dpv-risk-ranked",
-      "orbital-transfer-design",
-      "path-discovery",
-      "peano-arithmetic",
-      "peasant",
-      "pell-equation",
-      "pendulum-period",
-      "polynomial",
-      "proof-contrapositive",
-      "quadratic-formula",
-      "radioactive-decay",
-      "reusable-builtins",
-      "riemann-hypothesis",
-      "security-incident-correlation",
-      "send-more-money",
-      "service-impact",
-      "sieve",
-      "skolem-functions",
-      "socket-age",
-      "socket-family",
-      "socrates",
-      "stable-marriage",
-      "statistics-summary",
-      "stirling-bell-numbers",
-      "sudoku-4x4",
-      "superdense-coding",
-      "term-tools",
-      "totient-summatory",
-      "trust-flow-provenance-threshold",
-      "turing",
-      "vector-similarity",
-      "vulnerability-impact",
-      "weighted-interval-scheduling",
-      "witch",
-      "wolf-goat-cabbage",
-      "zebra"
+          "access-control-policy",
+          "ackermann",
+          "age",
+          "aliases-and-namespaces",
+          "alignment-demo",
+          "allen-interval-calculus",
+          "ancestor",
+          "animal",
+          "annotation",
+          "auroracare",
+          "backward",
+          "basic-monadic",
+          "bayes-diagnosis",
+          "bayes-therapy",
+          "beam-deflection",
+          "binomial-vandermonde",
+          "blocks-world-planning",
+          "bmi",
+          "braking-safety-worlds",
+          "buck-converter-design",
+          "cache-performance",
+          "canary-release",
+          "cat-koko",
+          "catalan-convolution",
+          "chart-parser",
+          "clinical-trial-screening",
+          "collatz-1000",
+          "combinatorics-findall-sort",
+          "competitive-enzyme-kinetics",
+          "complex",
+          "composition-of-injective-functions-is-injective",
+          "context-association",
+          "context-schema-audit",
+          "continued-fraction-sqrt2",
+          "control-system",
+          "critical-path-schedule",
+          "cyclic-path",
+          "d3-group",
+          "dairy-energy-balance",
+          "data-negotiation",
+          "deep-taxonomy-10",
+          "deep-taxonomy-100",
+          "deep-taxonomy-1000",
+          "deep-taxonomy-10000",
+          "deep-taxonomy-100000",
+          "delfour",
+          "deontic-logic",
+          "derived-backward-rule",
+          "derived-rule",
+          "diamond-property",
+          "dijkstra",
+          "dijkstra-findall-sort",
+          "dijkstra-risk-path",
+          "dining-philosophers",
+          "dog",
+          "dpv-odrl-purpose-mapping",
+          "drone-corridor-planner",
+          "easter-computus",
+          "electrical-rc-filter",
+          "epidemic-policy",
+          "equivalence-classes-overlap-implies-same-class",
+          "eulerian-path",
+          "ev-range-worlds",
+          "existential-rule",
+          "exoplanet-validation-worlds",
+          "expression-eval",
+          "family-cousins",
+          "fastpow",
+          "fft8-numeric",
+          "fibonacci",
+          "field-nitrogen-balance",
+          "flandor",
+          "floating-point",
+          "four-color-map",
+          "fundamental-theorem-arithmetic",
+          "gd-step-certified",
+          "gdpr-compliance",
+          "good-cobbler",
+          "gps",
+          "graph",
+          "graph-reachability",
+          "gray-code-counter",
+          "greatest-lower-bound-uniqueness",
+          "group-inverse-uniqueness",
+          "hamiltonian-path",
+          "hamming-code",
+          "hanoi",
+          "heat-loss",
+          "heron-theorem",
+          "ideal-gas-law",
+          "illegitimate-reasoning",
+          "integer-partitions",
+          "intuitionistic-logic-kripke",
+          "job-shop-scheduling",
+          "knapsack-optimization",
+          "knowledge-engineering-alignment-flow",
+          "law-of-cosines",
+          "least-squares-regression",
+          "linear-logic-resources",
+          "list-collection",
+          "lldm",
+          "manufacturing-quality-control",
+          "matrix-chain-order",
+          "microgrid-dispatch",
+          "missionaries-cannibals",
+          "modal-logic-kripke",
+          "modular-exponentiation",
+          "monkey-bananas",
+          "n-queens-8",
+          "network-sla",
+          "newton-raphson",
+          "nixon-diamond",
+          "observability-log-correlation",
+          "odrl-dpv-fpv-trust-flow",
+          "odrl-dpv-healthcare-risk-ranked",
+          "odrl-dpv-risk-ranked",
+          "orbital-transfer-design",
+          "path-discovery",
+          "peano-arithmetic",
+          "peasant",
+          "pell-equation",
+          "pendulum-period",
+          "polynomial",
+          "proof-contrapositive",
+          "quadratic-formula",
+          "radioactive-decay",
+          "reusable-builtins",
+          "riemann-hypothesis",
+          "security-incident-correlation",
+          "send-more-money",
+          "service-impact",
+          "sieve",
+          "skolem-functions",
+          "socket-age",
+          "socket-family",
+          "socrates",
+          "stable-marriage",
+          "statistics-summary",
+          "stirling-bell-numbers",
+          "sudoku-4x4",
+          "superdense-coding",
+          "term-tools",
+          "totient-summatory",
+          "trust-flow-provenance-threshold",
+          "turing",
+          "vector-similarity",
+          "vulnerability-impact",
+          "web-names",
+          "weighted-interval-scheduling",
+          "witch",
+          "wolf-goat-cabbage",
+          "zebra"
     ];
     const FALLBACK_SOURCE = `materialize(answer, 1).
 answer(ok) :- eq(ok, ok).

package/src/parser.js

@@ -23,6 +23,10 @@ function isNameContinueCode(code) {
   return code === 95 || isAsciiLetterCode(code) || isDigitCode(code);
 }
 
+function isDottedAtomContinue(source, pos) {
+  return source[pos] === '.' && isPlainAtomStartCode((source[pos + 1] ?? '').charCodeAt(0));
+}
+
 function isVariableStart(text) {
   const code = text.charCodeAt(0);
   return code === 95 || (code >= 65 && code <= 90);
@@ -151,7 +155,18 @@ class Parser {
     if (isPlainAtomStartCode(ch.charCodeAt(0))) {
       const start = this.pos;
       this.take();
-      while (isNameContinueCode(this.peek().charCodeAt(0))) this.take();
+      while (true) {
+        if (isNameContinueCode(this.peek().charCodeAt(0))) {
+          this.take();
+          continue;
+        }
+        if (isDottedAtomContinue(this.source, this.pos)) {
+          this.take();
+          this.take();
+          continue;
+        }
+        break;
+      }
       return { type: TOK.ATOM, text: this.source.slice(start, this.pos), line };
     }
 
@@ -316,7 +331,7 @@ const SIMPLE_NUMBER = /^-?\d+(?:\.\d+)?(?:[eE][+-]?\d+)?$/;
 const FAST_BINARY_FACT = /^([a-z][A-Za-z0-9_]*)\(\s*([^,\s()[\]|"']+)\s*,\s*([^,\s()[\]|"']+)\s*\)\.$/;
 const FAST_BINARY_RULE = /^([a-z][A-Za-z0-9_]*)\(\s*([^,\s()[\]|"']+)\s*,\s*([^,\s()[\]|"']+)\s*\)\s*:-\s*([a-z][A-Za-z0-9_]*)\(\s*([^,\s()[\]|"']+)\s*,\s*([^,\s()[\]|"']+)\s*\)\.$/;
 const SIMPLE_VARIABLE = /^[_A-Z][A-Za-z0-9_]*$/;
-const SIMPLE_ATOM = /^[a-z][A-Za-z0-9_]*$/;
+const SIMPLE_ATOM = /^[a-z][A-Za-z0-9_]*(?:\.[a-z][A-Za-z0-9_]*)*$/;
 const GRAPHIC_ATOM = /^[#$&*+\-\/<=>?@^~\\]+$/;
 
 function parseClausesFastNoSource(source) {

package/src/term.js

@@ -138,7 +138,7 @@ const graphicAtomChars = new Set('#$&*+-/<=>?@^~\\'.split(''));
 function atomNeedsQuotes(name) {
   if (!name) return true;
   if (name === '[]') return false;
-  if (/^[a-z][A-Za-z0-9_]*$/.test(name)) return false;
+  if (/^[a-z][A-Za-z0-9_]*(?:\.[a-z][A-Za-z0-9_]*)*$/.test(name)) return false;
   for (const ch of name) if (!graphicAtomChars.has(ch)) return true;
   return false;
 }

package/test/run-regression.mjs

@@ -476,6 +476,13 @@ function whiteBoxCases() {
         assertEqual(termToString(goal, new Env(), true), 'member(X, [a, b])', 'goal');
       },
     },
+    {
+      name: 'parser preserves dotted atom constants for web-style names',
+      run: () => {
+        const clauses = parseProgramText('p(web(be.ugent, jos), org.schema).\n');
+        assertEqual(termToString(clauses[0].head, new Env(), true), 'p(web(be.ugent, jos), org.schema)', 'head');
+      },
+    },
     {
       name: 'list construction round-trips through properListItems',
       run: () => {