October 2026 main drop: mirror from GitHub

.gitignore

@@ -0,0 +1,14 @@
+# Godot
+.godot/
+*.translation
+export_presets.cfg
+
+# OS
+.DS_Store
+Thumbs.db
+
+# IDE
+.vscode/
+.idea/
+*.swp
+*~

LICENSE

@@ -0,0 +1,661 @@
+                    GNU AFFERO GENERAL PUBLIC LICENSE
+                       Version 3, 19 November 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU Affero General Public License is a free, copyleft license for
+software and other kinds of works, specifically designed to ensure
+cooperation with the community in the case of network server software.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+our General Public Licenses are intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  Developers that use our General Public Licenses protect your rights
+with two steps: (1) assert copyright on the software, and (2) offer
+you this License which gives you legal permission to copy, distribute
+and/or modify the software.
+
+  A secondary benefit of defending all users' freedom is that
+improvements made in alternate versions of the program, if they
+receive widespread use, become available for other developers to
+incorporate.  Many developers of free software are heartened and
+encouraged by the resulting cooperation.  However, in the case of
+software used on network servers, this result may fail to come about.
+The GNU General Public License permits making a modified version and
+letting the public access it on a server without ever releasing its
+source code to the public.
+
+  The GNU Affero General Public License is designed specifically to
+ensure that, in such cases, the modified source code becomes available
+to the community.  It requires the operator of a network server to
+provide the source code of the modified version running there to the
+users of that server.  Therefore, public use of a modified version, on
+a publicly accessible server, gives the public access to the source
+code of the modified version.
+
+  An older license, called the Affero General Public License and
+published by Affero, was designed to accomplish similar goals.  This is
+a different license, not a version of the Affero GPL, but Affero has
+released a new version of the Affero GPL which permits relicensing under
+this license.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU Affero General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Remote Network Interaction; Use with the GNU General Public License.
+
+  Notwithstanding any other provision of this License, if you modify the
+Program, your modified version must prominently offer all users
+interacting with it remotely through a computer network (if your version
+supports such interaction) an opportunity to receive the Corresponding
+Source of your version by providing access to the Corresponding Source
+from a network server at no charge, through some standard or customary
+means of facilitating copying of software.  This Corresponding Source
+shall include the Corresponding Source for any work covered by version 3
+of the GNU General Public License that is incorporated pursuant to the
+following paragraph.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the work with which it is combined will remain governed by version
+3 of the GNU General Public License.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU Affero General Public License from time to time.  Such new versions
+will be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU Affero General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU Affero General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU Affero General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Affero General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Affero General Public License for more details.
+
+    You should have received a copy of the GNU Affero General Public License
+    along with this program.  If not, see <https://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If your software can interact with users remotely through a computer
+network, you should also make sure that it provides a way for users to
+get its source.  For example, if your program is a web application, its
+interface could display a "Source" link that leads users to an archive
+of the code.  There are many ways you could offer source, and different
+solutions will be better for different programs; see section 13 for the
+specific requirements.
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU AGPL, see
+<https://www.gnu.org/licenses/>.

README.md

@@ -0,0 +1,16 @@
+---
+license: agpl-3.0
+tags:
+- snapkitty
+- october-2026-drop
+- gdscript
+- godot
+- javascript
+- horn-clauses
+- logic-programming
+- intent-engine
+- agents
+---
+
+> Mirrored from [https://github.com/SNAPKITTYWEST/horn-intent-engine](https://github.com/SNAPKITTYWEST/horn-intent-engine) at commit `7029aa0`. Part of the **SnapKitty October 2026 main drop**.
+

main.gd

@@ -0,0 +1,92 @@
+extends Node
+
+func _ready() -> void:
+	print("=== Horn Clause Engine Tests ===")
+	test_horn_engine()
+	
+	print("\n=== Intent Engine Tests ===")
+	test_intent_engine()
+	
+	print("\n=== Combined NLP + Horn Query ===")
+	test_combined()
+
+func test_horn_engine() -> void:
+	var engine := HornEngine.new()
+	
+	engine.add_fact("item", ["item_1"])
+	engine.add_fact("color", ["item_1", "red"])
+	engine.add_fact("stored_item", ["item_1", "storage_a"])
+	engine.add_fact("location", ["storage_a", "warehouse"])
+	
+	engine.add_rule(
+		{"pred": "in_warehouse", "args": ["?X"]},
+		[
+			{"pred": "stored_item", "args": ["?X", "?S"]},
+			{"pred": "location", "args": ["?S", "warehouse"]}
+		]
+	)
+	
+	var results := engine.query({"pred": "in_warehouse", "args": ["?X"]})
+	
+	for answer in results:
+		print("Proof substitution: ", answer)
+		print("Resolved item: ", engine.walk("?X", answer))
+	
+	var multi_results := engine.solve([
+		{"pred": "color", "args": ["?X", "red"]},
+		{"pred": "in_warehouse", "args": ["?X"]}
+	])
+	
+	print("Multi-goal results count: ", multi_results.size())
+	for answer in multi_results:
+		print("Red in warehouse: ", engine.walk("?X", answer))
+
+func test_intent_engine() -> void:
+	var engine := IntentEngine.new()
+	var action_handlers := ActionHandlers.new()
+	var intent_registry := IntentRegistry.new()
+	
+	add_child(engine)
+	add_child(action_handlers)
+	add_child(intent_registry)
+	
+	engine.configure(action_handlers)
+	intent_registry.install(engine)
+	
+	test_utterance(engine, "Show me the inventory")
+	test_utterance(engine, "Go left")
+	test_utterance(engine, "Do something unknown")
+	test_utterance(engine, "Cancel")
+
+func test_utterance(engine: IntentEngine, text: String) -> void:
+	var intent := engine.resolve(text)
+	print("Resolution: ", intent)
+	
+	if intent["status"] == "matched":
+		var result: Variant = engine.dispatch(intent)
+		print("Execution result: ", result)
+
+func test_combined() -> void:
+	var engine := HornEngine.new()
+	engine.add_fact("item", ["item_1"])
+	engine.add_fact("color", ["item_1", "red"])
+	engine.add_fact("stored_item", ["item_1", "storage_a"])
+	engine.add_fact("location", ["storage_a", "warehouse"])
+	
+	engine.add_rule(
+		{"pred": "in_warehouse", "args": ["?X"]},
+		[
+			{"pred": "stored_item", "args": ["?X", "?S"]},
+			{"pred": "location", "args": ["?S", "warehouse"]}
+		]
+	)
+	
+	var goals := [
+		{"pred": "color", "args": ["?X", "red"]},
+		{"pred": "in_warehouse", "args": ["?X"]}
+	]
+	
+	var results := engine.solve(goals)
+	print("Combined query results:")
+	for answer in results:
+		print("  Found: ", engine.walk("?X", answer))

main.tscn

@@ -0,0 +1,6 @@
+[gd_scene load_steps=2 format=3 uid="uid://bqx8k2m3n4p5q"]
+
+[ext_resource type="Script" path="res://main.gd" id="1_main"]
+
+[node name="Main" type="Node"]
+script = ExtResource("1_main")

nlp/action_handlers.gd

@@ -0,0 +1,30 @@
+extends Node
+class_name ActionHandlers
+
+func handle_open_inventory(intent: Dictionary) -> Dictionary:
+	return {
+		"status": "success",
+		"action": "open_inventory"
+	}
+
+func handle_move_left(intent: Dictionary) -> Dictionary:
+	return {
+		"status": "success",
+		"action": "move_left"
+	}
+
+func handle_cancel_action(intent: Dictionary) -> Dictionary:
+	return {
+		"status": "success",
+		"action": "cancel_action"
+	}
+
+func handle_find_red_in_warehouse(intent: Dictionary) -> Dictionary:
+	return {
+		"status": "success",
+		"action": "query_horn",
+		"goals": [
+			{"pred": "color", "args": ["?X", "red"]},
+			{"pred": "in_warehouse", "args": ["?X"]}
+		]
+	}

nlp/horn_engine.gd

@@ -0,0 +1,143 @@
+extends RefCounted
+class_name HornEngine
+
+var facts: Array = []
+var rules: Array = []
+var fresh_counter: int = 0
+
+const MAX_DEPTH := 64
+const MAX_RESULTS := 100
+
+func add_fact(pred: String, args: Array) -> void:
+	facts.append({"pred": pred, "args": args.duplicate(true)})
+
+func add_rule(head: Dictionary, body: Array) -> void:
+	rules.append({
+		"head": head.duplicate(true),
+		"body": body.duplicate(true)
+	})
+
+func is_variable(term: Variant) -> bool:
+	if not term is String:
+		return false
+	return term.begins_with("?")
+
+func walk(term: Variant, env: Dictionary) -> Variant:
+	var current = term
+	var steps := 0
+	while is_variable(current) and env.has(current):
+		current = env[current]
+		steps += 1
+		if steps > MAX_DEPTH:
+			break
+	return current
+
+func unify(a: Variant, b: Variant, env: Dictionary):
+	a = walk(a, env)
+	b = walk(b, env)
+	
+	if a == b:
+		return env
+	
+	if is_variable(a):
+		var next_env = env.duplicate(true)
+		next_env[a] = b
+		return next_env
+	
+	if is_variable(b):
+		var next_env = env.duplicate(true)
+		next_env[b] = a
+		return next_env
+	
+	if a is Dictionary and b is Dictionary:
+		if a.get("pred") != b.get("pred"):
+			return null
+		return unify(a.get("args", []), b.get("args", []), env)
+	
+	if a is Array and b is Array:
+		if a.size() != b.size():
+			return null
+		var current_env = env
+		for i in range(a.size()):
+			current_env = unify(a[i], b[i], current_env)
+			if current_env == null:
+				return null
+		return current_env
+	
+	return null
+
+func freshen(value: Variant, mapping: Dictionary) -> Variant:
+	if is_variable(value):
+		if not mapping.has(value):
+			fresh_counter += 1
+			mapping[value] = "?_v" + str(fresh_counter)
+		return mapping[value]
+	
+	if value is Array:
+		var result := []
+		for item in value:
+			result.append(freshen(item, mapping))
+		return result
+	
+	if value is Dictionary:
+		var result := {}
+		for key in value:
+			result[key] = freshen(value[key], mapping)
+		return result
+	
+	return value
+
+func solve(
+	goals: Array,
+	env: Dictionary = {},
+	depth: int = 0
+) -> Array:
+	if goals.is_empty():
+		return [env]
+	
+	if depth >= MAX_DEPTH:
+		return []
+	
+	var goal: Dictionary = goals[0]
+	var remaining: Array = goals.slice(1)
+	var answers: Array = []
+	
+	# First: match database facts.
+	for fact in facts:
+		if fact["pred"] != goal["pred"]:
+			continue
+		
+		var next_env = unify(goal, fact, env)
+		
+		if next_env != null:
+			answers.append_array(
+				solve(remaining, next_env, depth + 1)
+			)
+		
+		if answers.size() >= MAX_RESULTS:
+			return answers.slice(0, MAX_RESULTS)
+	
+	# Second: prove the goal using Horn clauses.
+	for stored_rule in rules:
+		var mapping := {}
+		var rule = freshen(stored_rule, mapping)
+		
+		var next_env = unify(goal, rule["head"], env)
+		
+		if next_env == null:
+			continue
+		
+		var new_goals: Array = rule["body"].duplicate(true)
+		new_goals.append_array(remaining)
+		
+		answers.append_array(
+			solve(new_goals, next_env, depth + 1)
+		)
+		
+		if answers.size() >= MAX_RESULTS:
+			return answers.slice(0, MAX_RESULTS)
+	
+	return answers
+
+func query(goal: Dictionary) -> Array:
+	return solve([goal])

nlp/intent_engine.gd

@@ -0,0 +1,79 @@
+extends Node
+class_name IntentEngine
+
+var registry: Array[Dictionary] = []
+var handlers: Object
+
+func configure(handler_object: Object) -> void:
+	handlers = handler_object
+
+func register_intent(
+	intent_id: String,
+	patterns: Array[String],
+	handler_name: String,
+	priority: int = 0
+) -> bool:
+	if handlers == null:
+		return false
+	
+	if not handlers.has_method(handler_name):
+		push_error("Unknown handler: " + handler_name)
+		return false
+	
+	registry.append({
+		"id": intent_id,
+		"patterns": patterns,
+		"handler": handler_name,
+		"priority": priority
+	})
+	
+	registry.sort_custom(
+		func(a: Dictionary, b: Dictionary) -> bool:
+			return a["priority"] > b["priority"]
+	)
+	
+	return true
+
+func resolve(utterance: String) -> Dictionary:
+	var normalized := utterance.strip_edges().to_lower()
+	
+	for intent in registry:
+		for pattern in intent["patterns"]:
+			var regex := RegEx.new()
+			
+			if regex.compile(pattern) != OK:
+				continue
+			
+			var result := regex.search(normalized)
+			
+			if result != null:
+				return {
+					"status": "matched",
+					"intent": intent["id"],
+					"handler": intent["handler"],
+					"matched_text": result.get_string(),
+					"captures": result.strings,
+					"source": utterance
+				}
+	
+	return {
+		"status": "unmatched",
+		"source": utterance
+	}
+
+func dispatch(intent_result: Dictionary) -> Variant:
+	if intent_result.get("status") != "matched":
+		return {
+			"status": "rejected",
+			"reason": "No matching intent"
+		}
+	
+	var handler_name: String = intent_result["handler"]
+	
+	if handlers == null or not handlers.has_method(handler_name):
+		return {
+			"status": "rejected",
+			"reason": "Handler unavailable"
+		}
+	
+	return handlers.callv(handler_name, [intent_result])

nlp/intent_registry.gd

@@ -0,0 +1,47 @@
+extends Node
+class_name IntentRegistry
+
+func install(engine: IntentEngine) -> void:
+	engine.register_intent(
+		"open_inventory",
+		[
+			"^open my inventory$",
+			"^show me the inventory$",
+			"^show inventory$"
+		],
+		"handle_open_inventory",
+		100
+	)
+	
+	engine.register_intent(
+		"move_left",
+		[
+			"^move left$",
+			"^go left$",
+			"^turn left$"
+		],
+		"handle_move_left",
+		90
+	)
+	
+	engine.register_intent(
+		"cancel_action",
+		[
+			"^cancel$",
+			"^cancel that action$",
+			"^stop what you are doing$"
+		],
+		"handle_cancel_action",
+		110
+	)
+	
+	engine.register_intent(
+		"find_red_in_warehouse",
+		[
+			"^find red items in the warehouse$",
+			"^show red items in warehouse$",
+			"^find red items in warehouse$"
+		],
+		"handle_find_red_in_warehouse",
+		80
+	)

project.godot

@@ -0,0 +1,21 @@
+; Engine configuration file.
+; It's best edited using the editor UI and not directly,
+; since the parameters that go here are not all obvious.
+;
+; Format:
+;   [section] ; section goes between []
+;   param=value ; assign values to parameters
+
+config_version=5
+
+[application]
+
+config/name="HornIntentEngine"
+run/main_scene="res://main.tscn"
+config/features=PackedStringArray("4.3", "GL Compatibility")
+config/icon="res://icon.svg"
+
+[rendering]
+
+renderer/rendering_method="gl_compatibility"
+renderer/rendering_method.mobile="gl_compatibility"

web/index.html

@@ -0,0 +1,530 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+<meta charset="UTF-8">
+<meta name="viewport" content="width=device-width, initial-scale=1.0">
+<title>Horn Intent Engine — Demo</title>
+<style>
+:root {
+  --bg: #0c0d0f;
+  --paper: #eceae4;
+  --steel: #9aabba;
+  --steel-dim: #6a7a88;
+  --accent: #c8d4de;
+  --border: #2a2c30;
+  --success: #7dcea0;
+  --warn: #e8b86d;
+  --error: #e07a7a;
+  --mono: "SF Mono", "Cascadia Code", "Consolas", monospace;
+  --sans: system-ui, -apple-system, sans-serif;
+}
+* { box-sizing: border-box; }
+body {
+  margin: 0;
+  background: var(--bg);
+  color: var(--paper);
+  font-family: var(--sans);
+  font-size: 14px;
+  line-height: 1.5;
+  min-height: 100vh;
+}
+header {
+  padding: 1.5rem 2rem;
+  border-bottom: 1px solid var(--border);
+  display: flex;
+  justify-content: space-between;
+  align-items: center;
+}
+h1 {
+  margin: 0;
+  font-weight: 500;
+  font-size: 1.25rem;
+  letter-spacing: -0.02em;
+  color: var(--accent);
+}
+h1 span { color: var(--steel); font-weight: 400; }
+.license {
+  font-size: 0.75rem;
+  color: var(--steel-dim);
+  font-family: var(--mono);
+}
+main {
+  display: grid;
+  grid-template-columns: 1fr 1fr;
+  gap: 1px;
+  background: var(--border);
+  min-height: calc(100vh - 70px);
+}
+@media (max-width: 900px) {
+  main { grid-template-columns: 1fr; }
+}
+.panel {
+  background: var(--bg);
+  padding: 1.5rem;
+  overflow: auto;
+}
+.panel h2 {
+  margin: 0 0 1rem;
+  font-size: 0.85rem;
+  font-weight: 500;
+  text-transform: uppercase;
+  letter-spacing: 0.08em;
+  color: var(--steel);
+}
+textarea, input[type="text"] {
+  width: 100%;
+  background: #141618;
+  border: 1px solid var(--border);
+  color: var(--paper);
+  font-family: var(--mono);
+  font-size: 12.5px;
+  padding: 0.75rem;
+  border-radius: 4px;
+  resize: vertical;
+}
+textarea:focus, input:focus {
+  outline: none;
+  border-color: var(--steel);
+}
+button {
+  background: transparent;
+  border: 1px solid var(--steel);
+  color: var(--accent);
+  font-family: var(--sans);
+  font-size: 13px;
+  padding: 0.5rem 1rem;
+  border-radius: 4px;
+  cursor: pointer;
+  margin-right: 0.5rem;
+  margin-top: 0.5rem;
+}
+button:hover {
+  background: rgba(154, 171, 186, 0.1);
+}
+button.primary {
+  background: var(--steel);
+  color: var(--bg);
+  border-color: var(--steel);
+}
+button.primary:hover {
+  background: var(--accent);
+}
+.results {
+  margin-top: 1rem;
+  font-family: var(--mono);
+  font-size: 12px;
+  background: #101214;
+  border: 1px solid var(--border);
+  border-radius: 4px;
+  padding: 1rem;
+  min-height: 120px;
+  white-space: pre-wrap;
+  color: var(--steel);
+}
+.results .ok { color: var(--success); }
+.results .fail { color: var(--error); }
+.results .bind { color: var(--warn); }
+.facts-list, .rules-list {
+  font-family: var(--mono);
+  font-size: 12px;
+  color: var(--steel-dim);
+  margin: 0.5rem 0 1rem;
+}
+.facts-list div, .rules-list div {
+  padding: 0.25rem 0;
+  border-bottom: 1px solid #1a1c1f;
+}
+.tabs {
+  display: flex;
+  gap: 0;
+  margin-bottom: 1rem;
+  border-bottom: 1px solid var(--border);
+}
+.tab {
+  padding: 0.5rem 1rem;
+  background: none;
+  border: none;
+  border-bottom: 2px solid transparent;
+  color: var(--steel-dim);
+  cursor: pointer;
+  margin: 0;
+  border-radius: 0;
+}
+.tab.active {
+  color: var(--accent);
+  border-bottom-color: var(--steel);
+}
+.tab-content { display: none; }
+.tab-content.active { display: block; }
+.example-btn {
+  font-size: 12px;
+  padding: 0.3rem 0.6rem;
+  margin: 0.25rem 0.25rem 0 0;
+}
+footer {
+  padding: 1rem 2rem;
+  border-top: 1px solid var(--border);
+  font-size: 0.75rem;
+  color: var(--steel-dim);
+  text-align: center;
+}
+</style>
+</head>
+<body>
+<header>
+  <h1>Horn Intent Engine <span>— interactive demo</span></h1>
+  <div class="license">AGPL-3.0</div>
+</header>
+<main>
+  <div class="panel">
+    <div class="tabs">
+      <button class="tab active" data-tab="horn">Horn Resolver</button>
+      <button class="tab" data-tab="intent">Intent Matching</button>
+    </div>
+    
+    <div id="horn" class="tab-content active">
+      <h2>Facts</h2>
+      <div class="facts-list" id="factsList"></div>
+      <textarea id="factInput" rows="2" placeholder="item item_1&#10;color item_1 red&#10;stored_item item_1 storage_a&#10;location storage_a warehouse"></textarea>
+      <button onclick="addFacts()">Add Facts</button>
+      <button onclick="clearFacts()">Clear</button>
+      
+      <h2 style="margin-top:1.5rem">Rules</h2>
+      <div class="rules-list" id="rulesList"></div>
+      <textarea id="ruleInput" rows="3" placeholder="in_warehouse ?X :- stored_item ?X ?S, location ?S warehouse"></textarea>
+      <button onclick="addRule()">Add Rule</button>
+      <button onclick="clearRules()">Clear</button>
+      
+      <h2 style="margin-top:1.5rem">Query</h2>
+      <input type="text" id="queryInput" placeholder="in_warehouse ?X" value="in_warehouse ?X">
+      <div>
+        <button class="primary" onclick="runQuery()">Run Query</button>
+        <button class="example-btn" onclick="loadExample()">Load Warehouse Example</button>
+      </div>
+      <div class="results" id="hornResults">Results will appear here.</div>
+    </div>
+    
+    <div id="intent" class="tab-content">
+      <h2>Utterance</h2>
+      <input type="text" id="utteranceInput" placeholder="Show me the inventory" value="Show me the inventory">
+      <div>
+        <button class="primary" onclick="resolveIntent()">Resolve</button>
+        <button class="example-btn" onclick="document.getElementById('utteranceInput').value='Go left'">Go left</button>
+        <button class="example-btn" onclick="document.getElementById('utteranceInput').value='Cancel'">Cancel</button>
+        <button class="example-btn" onclick="document.getElementById('utteranceInput').value='Find red items in the warehouse'">Find red…</button>
+      </div>
+      <div class="results" id="intentResults">Intent resolution will appear here.</div>
+    </div>
+  </div>
+  
+  <div class="panel">
+    <h2>Proof / Substitution</h2>
+    <div class="results" id="proofView" style="min-height:300px">Select a query or intent to see bindings and proof steps.</div>
+    <h2 style="margin-top:1.5rem">About</h2>
+    <p style="color:var(--steel-dim);font-size:13px">
+      This is a pure-JavaScript reimplementation of the GDScript Horn engine for demonstration.
+      Facts are ground atoms. Rules are Horn clauses. Queries use depth-first backward chaining with unification.
+      Variables are prefixed with <code>?</code>.
+    </p>
+    <p style="color:var(--steel-dim);font-size:13px">
+      The original source lives in <code>nlp/*.gd</code> and runs inside Godot 4.
+      This web demo is provided under the same AGPL-3.0 license.
+    </p>
+  </div>
+</main>
+<footer>
+  Horn Intent Engine · SnapKitty Research Lab · AGPL-3.0
+</footer>
+
+<script>
+// --- Horn Engine (JS port of the GDScript logic) ---
+class HornEngine {
+  constructor() {
+    this.facts = [];
+    this.rules = [];
+    this.freshCounter = 0;
+    this.MAX_DEPTH = 64;
+    this.MAX_RESULTS = 50;
+  }
+  addFact(pred, args) {
+    this.facts.push({ pred, args: [...args] });
+  }
+  addRule(head, body) {
+    this.rules.push({ head, body });
+  }
+  isVariable(term) {
+    return typeof term === 'string' && term.startsWith('?');
+  }
+  walk(term, env) {
+    let current = term;
+    let steps = 0;
+    while (this.isVariable(current) && env.has(current)) {
+      current = env.get(current);
+      steps++;
+      if (steps > this.MAX_DEPTH) break;
+    }
+    return current;
+  }
+  unify(a, b, env) {
+    a = this.walk(a, env);
+    b = this.walk(b, env);
+    if (a === b) return env;
+    if (this.isVariable(a)) {
+      const next = new Map(env);
+      next.set(a, b);
+      return next;
+    }
+    if (this.isVariable(b)) {
+      const next = new Map(env);
+      next.set(b, a);
+      return next;
+    }
+    if (Array.isArray(a) && Array.isArray(b)) {
+      if (a.length !== b.length) return null;
+      let current = env;
+      for (let i = 0; i < a.length; i++) {
+        current = this.unify(a[i], b[i], current);
+        if (!current) return null;
+      }
+      return current;
+    }
+    return null;
+  }
+  freshen(value, mapping) {
+    if (this.isVariable(value)) {
+      if (!mapping.has(value)) {
+        this.freshCounter++;
+        mapping.set(value, '?_v' + this.freshCounter);
+      }
+      return mapping.get(value);
+    }
+    if (Array.isArray(value)) {
+      return value.map(v => this.freshen(v, mapping));
+    }
+    if (value && typeof value === 'object') {
+      const result = {};
+      for (const k of Object.keys(value)) {
+        result[k] = this.freshen(value[k], mapping);
+      }
+      return result;
+    }
+    return value;
+  }
+  solve(goals, env = new Map(), depth = 0) {
+    if (goals.length === 0) return [env];
+    if (depth >= this.MAX_DEPTH) return [];
+    const goal = goals[0];
+    const remaining = goals.slice(1);
+    const answers = [];
+    // Facts
+    for (const fact of this.facts) {
+      if (fact.pred !== goal.pred) continue;
+      const nextEnv = this.unify(goal.args, fact.args, env);
+      if (nextEnv) {
+        answers.push(...this.solve(remaining, nextEnv, depth + 1));
+      }
+      if (answers.length >= this.MAX_RESULTS) return answers.slice(0, this.MAX_RESULTS);
+    }
+    // Rules
+    for (const stored of this.rules) {
+      const mapping = new Map();
+      const rule = this.freshen(stored, mapping);
+      const nextEnv = this.unify(goal.args, rule.head.args, env);
+      if (!nextEnv) continue;
+      const newGoals = rule.body.map(g => ({ pred: g.pred, args: g.args })).concat(remaining);
+      answers.push(...this.solve(newGoals, nextEnv, depth + 1));
+      if (answers.length >= this.MAX_RESULTS) return answers.slice(0, this.MAX_RESULTS);
+    }
+    return answers;
+  }
+  query(pred, args) {
+    return this.solve([{ pred, args }]);
+  }
+}
+
+// --- Intent Engine (simplified) ---
+const INTENTS = [
+  { id: 'open_inventory', patterns: [/^open my inventory$/, /^show me the inventory$/, /^show inventory$/], handler: 'handle_open_inventory', priority: 100 },
+  { id: 'move_left', patterns: [/^move left$/, /^go left$/, /^turn left$/], handler: 'handle_move_left', priority: 90 },
+  { id: 'cancel_action', patterns: [/^cancel$/, /^cancel that action$/, /^stop what you are doing$/], handler: 'handle_cancel_action', priority: 110 },
+  { id: 'find_red_in_warehouse', patterns: [/^find red items in the warehouse$/, /^show red items in warehouse$/, /^find red items in warehouse$/], handler: 'handle_find_red_in_warehouse', priority: 80 }
+];
+
+function resolveIntentText(utterance) {
+  const normalized = utterance.trim().toLowerCase();
+  const sorted = [...INTENTS].sort((a, b) => b.priority - a.priority);
+  for (const intent of sorted) {
+    for (const pat of intent.patterns) {
+      if (pat.test(normalized)) {
+        return { status: 'matched', intent: intent.id, handler: intent.handler, source: utterance };
+      }
+    }
+  }
+  return { status: 'unmatched', source: utterance };
+}
+
+// --- UI ---
+const engine = new HornEngine();
+
+function parseTerm(s) {
+  return s.trim();
+}
+
+function parseArgs(str) {
+  return str.trim().split(/\s+/).filter(Boolean).map(parseTerm);
+}
+
+function addFacts() {
+  const text = document.getElementById('factInput').value.trim();
+  if (!text) return;
+  const lines = text.split('\n').map(l => l.trim()).filter(Boolean);
+  for (const line of lines) {
+    const parts = line.split(/\s+/);
+    if (parts.length < 1) continue;
+    const pred = parts[0];
+    const args = parts.slice(1);
+    engine.addFact(pred, args);
+  }
+  document.getElementById('factInput').value = '';
+  renderFacts();
+}
+
+function clearFacts() {
+  engine.facts = [];
+  renderFacts();
+}
+
+function addRule() {
+  const text = document.getElementById('ruleInput').value.trim();
+  if (!text) return;
+  // Format: headPred ?A ?B :- bodyPred1 ?X ?Y, bodyPred2 ?Z
+  const m = text.match(/^(\S+)\s+(.*?)\s*:-\s*(.+)$/);
+  if (!m) {
+    alert('Rule format: headPred ?X :- bodyPred ?A ?B, otherPred ?C');
+    return;
+  }
+  const headPred = m[1];
+  const headArgs = parseArgs(m[2]);
+  const bodyParts = m[3].split(',').map(s => s.trim());
+  const body = bodyParts.map(bp => {
+    const p = bp.split(/\s+/);
+    return { pred: p[0], args: p.slice(1) };
+  });
+  engine.addRule({ pred: headPred, args: headArgs }, body);
+  document.getElementById('ruleInput').value = '';
+  renderRules();
+}
+
+function clearRules() {
+  engine.rules = [];
+  renderRules();
+}
+
+function renderFacts() {
+  const el = document.getElementById('factsList');
+  if (engine.facts.length === 0) {
+    el.innerHTML = '<div style="color:#555">(no facts)</div>';
+    return;
+  }
+  el.innerHTML = engine.facts.map(f => 
+    `<div>${f.pred}(${f.args.join(', ')})</div>`
+  ).join('');
+}
+
+function renderRules() {
+  const el = document.getElementById('rulesList');
+  if (engine.rules.length === 0) {
+    el.innerHTML = '<div style="color:#555">(no rules)</div>';
+    return;
+  }
+  el.innerHTML = engine.rules.map(r => {
+    const head = `${r.head.pred}(${r.head.args.join(', ')})`;
+    const body = r.body.map(g => `${g.pred}(${g.args.join(', ')})`).join(', ');
+    return `<div>${head} :- ${body}</div>`;
+  }).join('');
+}
+
+function runQuery() {
+  const q = document.getElementById('queryInput').value.trim();
+  if (!q) return;
+  const parts = q.split(/\s+/);
+  const pred = parts[0];
+  const args = parts.slice(1);
+  const results = engine.query(pred, args);
+  const out = document.getElementById('hornResults');
+  const proof = document.getElementById('proofView');
+  if (results.length === 0) {
+    out.innerHTML = '<span class="fail">No solutions.</span>';
+    proof.textContent = 'No proof found.';
+    return;
+  }
+  let html = `<span class="ok">${results.length} solution(s)</span>\n\n`;
+  results.forEach((env, i) => {
+    html += `Solution ${i + 1}:\n`;
+    for (const [k, v] of env) {
+      if (k.startsWith('?')) {
+        html += `  <span class="bind">${k}</span> = ${v}\n`;
+      }
+    }
+    html += '\n';
+  });
+  out.innerHTML = html;
+  proof.textContent = JSON.stringify(
+    results.map(env => Object.fromEntries(env)),
+    null, 2
+  );
+}
+
+function loadExample() {
+  engine.facts = [];
+  engine.rules = [];
+  engine.addFact('item', ['item_1']);
+  engine.addFact('color', ['item_1', 'red']);
+  engine.addFact('stored_item', ['item_1', 'storage_a']);
+  engine.addFact('location', ['storage_a', 'warehouse']);
+  engine.addRule(
+    { pred: 'in_warehouse', args: ['?X'] },
+    [
+      { pred: 'stored_item', args: ['?X', '?S'] },
+      { pred: 'location', args: ['?S', 'warehouse'] }
+    ]
+  );
+  document.getElementById('queryInput').value = 'in_warehouse ?X';
+  renderFacts();
+  renderRules();
+  runQuery();
+}
+
+function resolveIntent() {
+  const text = document.getElementById('utteranceInput').value;
+  const result = resolveIntentText(text);
+  const out = document.getElementById('intentResults');
+  const proof = document.getElementById('proofView');
+  if (result.status === 'matched') {
+    out.innerHTML = `<span class="ok">matched</span>\nintent: ${result.intent}\nhandler: ${result.handler}`;
+    if (result.intent === 'find_red_in_warehouse') {
+      proof.textContent = 'This intent maps to Horn goals:\n[\n  color(?X, red),\n  in_warehouse(?X)\n]\n\nLoad the warehouse example on the other tab and run the multi-goal query.';
+    } else {
+      proof.textContent = JSON.stringify(result, null, 2);
+    }
+  } else {
+    out.innerHTML = '<span class="fail">unmatched</span>';
+    proof.textContent = 'No matching intent.';
+  }
+}
+
+// Tabs
+document.querySelectorAll('.tab').forEach(tab => {
+  tab.addEventListener('click', () => {
+    document.querySelectorAll('.tab').forEach(t => t.classList.remove('active'));
+    document.querySelectorAll('.tab-content').forEach(c => c.classList.remove('active'));
+    tab.classList.add('active');
+    document.getElementById(tab.dataset.tab).classList.add('active');
+  });
+});
+
+renderFacts();
+renderRules();
+</script>
+</body>
+</html>