email   Email Us: info@lupinepublishers.com phone   Call Us: +1 (914) 407-6109   57 West 57th Street, 3rd floor, New York - NY 10019, USA

Lupine Publishers Group

Lupine Publishers

  Submit Manuscript

ISSN: 2643-6744

Current Trends in Computer Sciences & Applications

Research ArticleOpen Access

Canonically Open, Quasi-Desargues Paths Volume 3 - Issue 5

Christian Mancas*1, Diana Christina Mancas2

  • 1,2 Mathematics and Computer Science Department, Ovidius University at Constanta, Romania

Received:March 29, 2026;   Published:April 08, 2026

*Corresponding author: Christian Mancas, Ovidius University, Bd. Mamaia 124, Constanta, CT, Romania


DOI: 10.32474/CTCSA.2026.03.000171

Abstract PDF

Abstract

This research paper describes how to reverse engineer relational database schemas into (Elementary) Mathematical Data Model ones. Four tools are used to simplify this job, using the same example of a medium complex MS Access database: MatBase, ChatGPT, Gemini AI, and Claude AI, each one with its advantages and disadvantages.

Keywords: (Elementary) Mathematical Data Model; Reverse Database and Software Engineering; MatBase; ChatGPT; Gemini Ai; Claude Ai

Introduction

Be it in production, design, scientific research, or Education, forward database (db) and software engineering (se) is almost the sole direction in these fields, harnessed even more in these latest years by the race in Artificial Intelligence (AI), and, especially, by the Large Language Models (LLMs) explosion.

However, there is still and always there be a need for reverse database and software engineering, which should not for ever remain the Cinderella of Computer Science (CS) and Information Technology (IT) [1]. The IT state of the art is still dominated by lot of legacy db software applications (apps) which are poorly documented (if any), working almost fine, but needing extensions from time to time, and even refactoring or completely replacing them with newer technology ones, without losing any of their useful functionalities.

Even extending them, not to mention refactoring (e.g., switching to a safe web interface) or complete replacement, the database and software “surgeons” need a deep, full, and precise knowledge of some, if not even all, of their conceptual and technological de tails, not only to fulfill their tasks, but also not to tamper with the functioning of the rest of these apps. Of course, before understanding the apps’ code, you must first understand the underlying dbs’ structure.

Up to now, reverse db and se required highly skilled db and software architects and developers, with extensive knowledge in the corresponding legacy programming languages and technologies. Even only the reverse engineering of legacy dbs was often a big challenge. Especially if your target is not a plain English verbose novel, but a formal, concise mathematical schema. This paper reports on our latest research results in reverse db engineering towards concise and accurate mathematical schemas, with the help of AI, which considerably alleviates these prerequisites.

The goal of this research was to compare the capabilities of our long date tool MatBase [2,3] with three of the top current AI tools, namely (in chronological order of their public availability) ChatGPT [4], Gemini [5], and Claude [6] in reverse db engineering, the common target formalism being our (Elementary) Mathematical Data Model ((E)MDM) schemes [7]. (E)MDM is based on the semi-naïve theory of sets, relations, and functions (SNTSRF) [8], the temporal first-order predicate logic with equality (TFOPL) [9,10], and Datalog ¬ [11,12].

MatBase is our intelligent data and knowledge base management system prototype, mainly based on (E)MDM, but also on Datalog, the Relational (RDM) [11,13,14] and Entity-Relationship (E-R) [14-16] Data Models.

MatBase was designed to accept (E)MDM schemas (which include Datalog ¬ programs), translate them to relational databases (rdbs) and automatically code generated database (db) applications (apps), to accept and import rdbs and translate them to (E) MDM schemas, to accept E-R Diagrams and translate them to (E) MDM schemas, as well as, again dually, to translate (E)MDM schemas into E-R diagrams [14-16]. The main goal was always to reach modeling as programming [17] and, especially, mathematical data modeling. Currently, MatBase has two versions, one developed in MS Access and VBA, for small dbs, and one in MS C# and SQL Server, for large dbs.

ChatGPT, Gemini, and Claude are AI agent tools.

The next Section mentions related work. The third one is dedicated to the materials and methods used. The fourth one presents and discusses the results obtained. The paper ends with conclusions and a list of references.

Related Work

The FOPL component of MatBase was described in [18]. The relationship between ChatGPT and mathematics is the topic of several published articles, e.g. [19,20]. Similarly, for Gemini AI see, e.g., [21,22], and for Claude AI, e.g., [23,24]. A comparison between mathematical capabilities of ChatGPT 5, Claude 4.1 Opus, Gemini 2.5 Pro, and Grok 4 can be found in [25].

Materials and Methods

We used our two Toshiba Satellite Intel CORE i7 running MS Windows 10, Google Chrome browser’s current version (146.0.7680.81), MS Access 365 (v. 2603), MS SQL Server 2025, MS SQL Server Management Studio v. 21.4.12, MS SQL Server Migration Assistant for Access (SSMAA) [26] v. 17, MatBase 5.2 Access, ChatGPT Plus 5.3, Gemini 3, and Claude Sonnet 4.6.

We started to refactor a legacy MS Access Geography app managed by MatBase into a MS Razor C#ASP web one, over MS SQL Server. The architecture of this app is fine: a Geography.mdb pure VBA code one (i.e., containing only forms, VBA code for enforcing non-relational constraints, and a menu) uses links to the tables of two pure data dbs: a GeographyDB.mdb storing the fundamental data, and a GeographyTmp.mdb storing the temporary tables. The GeographyTmp.mdb has only 3 empty tables and was immediately and correctly imported into a SQL Server db by SSMAA.

The GeographyDB.mdb has 389 objects (62 tables, each with its own surrogate primary key, other 106 unique keys, 11 non-unique indexes, and 148 foreign keys) storing 3.75MB+ of data. The MS Access Database Documenter generated for this db a .pdf file of 449 A4 pages of documentation (taking 1.35MB+).

SSMAA took almost half an hour to import it and managed only partially: it wrote 510 statistics.html files taking 4,55MB, other 4 .html ones, 1 .xml, 12 .js, 7 .css, 1 .ttf taking, and 81 .gif ones, in total, other 4.2MB, only for displaying the import statistics, plus a 60 A4 pages .txt file with the table import list. Unfortunately, the instances of 10 tables were lost. The T-SQL script of the imported db schema generated by the SQL Server has 5,650 lines.

MatBase exports the managed dbs in either XML, HTML, PDF, or DOCX formats, by simply clicking on its submenu option /Manage Databases/ Export Database; moreover, after any successful execution triggered by its submenu option Other Databases/Import Relational Database, MatBase also generates a HTML file with the (E) MDM schema of the newly imported db.

With the three AI we considered for this research, we started the dialog by proposing them the GeographyDB.mdb file and asking for the corresponding formalization of its structure using SNTSRF and FOPL.

Results and Discussion

Here are the results obtained with each one of these 4 tools.

MatBase 5.2 Access

MatBase wrote in some 2 minutes a .pdf file of 20 pages, taking almost 300KB. Figures 1 to 4 show a fragment of it (the scheme of 9 tables out of 62, having a total of 51 columns, i.e., mathematical functions).

As detailed in [7], (E)MDM uses the following abbreviations and conventions:
• Entity-type sets are written in bold and italic.
• Relationship-type sets (e.g., GALAXIES_NEIGHBORHOOD from the bottom of Figure 4) are similarly written but followed by parentheses with their canonical projections.
• Attributes (e.g., x), i.e., the functions taking values from data types or their subsets, are written under the name of their corresponding domain sets, indented, without explicitly mentioning them.
• Structural functions (e.g., GalacticSuperCluster), i.e., functions taking values from object sets (i.e., corresponding to foreign keys), are written without any abbreviation.
• Explicit constraints are prefixed by the letter C having as subscript the corresponding unique identification value from Mat- Base CONSTRAINTS metacatalog table [3], followed, in parentheses, by their name, unique within the db.
obid is the abbreviation for object identifier; auton. is the abbreviation for autonumbering.
• The double arrow is used for injective (one-to-one) functions.
• NAT(n) stands for the subset of naturals having at most n digits.
• ASCII(n) stands for the subset of strings over the ASCII alphabet having maximum length n.
• The total constraint means that the corresponding function is totally defined (i.e., the corresponding table column has a NOT NULL constraint).
• Computed sets (e.g., *STARS from Figure 3) and functions (e.g., *OrbitCenterName from Figure 2) have their names prefixed by ‘*’.
• ° is the function composition operator, while • is the function product one.
• ¬| − f • g is the notation for the non-existence constraint [27], meaning that, for no element x of their domain set, may both f(x) and g(x) be defined (i.e., not null).
• key (see the constraint C38 on the last line of Figure 4) is the abbreviation for minimal injective.
• The parentheses following set names, function and constraint definitions are comments (stored in MS Access dbs in the optional Description column).

As MatBase also manages the corresponding app stored in Geography.mdb (which mainly enforces the non-relational constraints), this (E)MDM schema contains explicit constraints as well. Were MatBase only importing GeographyDB.mdb, no such constraints would be present in this schema, except for C38.

Figure 1: Fragment of the (E)MDM schema generated by MatBase (1 of 4).

Lupinepublishers-openaccess-computer-sciences-journal

Figure 2: Fragment of the (E)MDM schema generated by MatBase (2 of 4).

Lupinepublishers-openaccess-computer-sciences-journal

Figure 3: Fragment of the (E)MDM schema generated by MatBase (3 of 4).

Lupinepublishers-openaccess-computer-sciences-journal

Figure 4: Fragment of the (E)MDM schema generated by MatBase (4 of 4).

Lupinepublishers-openaccess-computer-sciences-journal

ChatGPT Plus 5.3

ChatGPT does not accept binary files like the .mdb ones. When we provided the .pdf one exported by the MS Access Database Documenter, it rejected it too, as being too long. In the end, it accepted the .sql script generated by the SQL Server after the SSMAA import. From the options it offered, we chose the maximum rigor ones (i.e., both functions and constraints, full 3-valued logic, including null values, and the logic textbook style). Figures 5 to 10 show the schema fragment corresponding to the one in Figures 1 to 4. Figure 11 shows almost everything we could then obtain when asking again for the formalizations of constraints as well. Please note the following:

• The answer is only about 6 of the 9 tables from the astronomy section of the db. Generally, even after insisting several times, we could not obtain the whole formalized schema, without getting any No to our requests: ChatGPT always tries to deflect your queries by providing other options to choose from.
• ChatGPT sometimes used the name of our db schema tables and columns, sometimes abbreviated, and sometimes even changed them (e.g. from x to id_abbrev.SetName).
• Function codomains do not take into consideration corresponding check constraints: they are only specifying the mathematical sets corresponding to the data types (e.g., the naturals, the integers, the reals, etc.).
• Primary key constraints (see Figure 8) are not compactly written as, at least, injective, or one-to-one, or key, but using explicit one-to-oneness definition (unfortunately, using their id notation instead of x). Even worse (see Figure 10) the injectivity of the Continent, which stores continent names, is misidentified as primary as well, although the corresponding CONTINENTS table also has a surrogate, AutoNumber primary key x. Generally, of course, primary does not make sense in SNTSRF.
• Both totality and not totality are also verbosely described (see Figure 8).
• Similar verbosity is used for foreign keys (see Figure 9). Even worse, all foreign keys are described as being totally defined, which, for their majority, is not the case.
• Generally, ChatGPT is extremely verbose, not rigorous, and mainly uses plain English spiced with logic quantifiers and symbols (e.g., ≠,⇒,¬,∈), rather than the “logic textbook style” and “maximum rigor” advertised. Unfortunately, when you copy its answers from the browsers, they are verbosely written using Latex conventions: if you do not know them and do not want to learn them either, you must take screen shots and manually replace the Latex commands with the corresponding math symbols.
• Only one positive remark: although the T-SQL schema does not include our non-existential constraint ¬| − River • Lake • Sea • Ocean • GeographicUnit (Rivers may flow in only one of these: another river, a lake, sea, ocean, or a geographic unit, e.g., desert, cave, etc.), at the end of Figure 10 ChatGPT added the non-existence constraint Sea ¬| − Ocean, but not its dual and using a rather Prolog-like notation.

Figure 5: Fragment of the math schema generated by ChatGPT (1 of 6).

Lupinepublishers-openaccess-computer-sciences-journal

Figure 6: Fragment of the math schema generated by ChatGPT (2 of 6).

Lupinepublishers-openaccess-computer-sciences-journal

Figure 7: Fragment of the math schema generated by ChatGPT (3 of 6).

Lupinepublishers-openaccess-computer-sciences-journal

Figure 8: Fragment of the math schema generated by ChatGPT (4 of 6).

Lupinepublishers-openaccess-computer-sciences-journal

Figure 9: Fragment of the math schema generated by ChatGPT (5 of 6).

Lupinepublishers-openaccess-computer-sciences-journal

Figure 10: Fragment of the math schema generated by ChatGPT (6 of 6).

Lupinepublishers-openaccess-computer-sciences-journal

Gemini 3

Gemini is much more verbose than ChatGPT and does not provide you the mathematical scheme it generates either, not even parts of it, although we tried several times during the long dialogue we had (85 pages A4): it writes you that it has stored it internally, “intended for research, simulation, and high-fidelity geographical modeling”. The dialogue is full of metaphors; here are some examples:

• The DISTANCES table is the most complex part of your “Metabolism.”
• This is the Bio-Logic Actuator. If a user attempts to enter 72 or 11023, the “encapsulated bacteria” in the database (the Validation Text) produces a limestone wall (Error Message) to heal the rupture.
• Unlike terrestrial geography, which is fixed by soil, the Celestial Map is a Relational Projection. The “Fortress” ensures that a star cannot belong to two constellations simultaneously (The Monogamy of Entanglement).
• These formulas represent the “Fortress” rules. If a data entry violates these, the mathematical symmetry of your universe is ruptured.

From the very few formal fragments we obtained, we noticed that Gemini’s style is identical to the ChatGPT one, e.g., set and function names are usually abbreviated or completely replaced (e.g., id for x), primary and foreign keys use the same verbose syntax, which extends to the relational domain constraints, e.g., for our Altitude : PEAKS → [1000, 8848], Gemini wrote the constraint “Domain: ∀ m ∈ PEAKS : 0 ≤ H(m) ≤ 8848” (unfortunately, even wrongly replacing 1000, the minimum altitude for a peak to be considered a mountain one, with 0: only “poets” like it can consider that kid-built sand heaps by the seaside are mountain peaks as well).

Moreover, surprisingly for us, Gemini also used an RDM-style functional dependency notation, e.g., for CELESTIAL_BODIES it wrote: fCELESTIAL_BODIES: IDCC → Name × TypeID × IDGal × Orbit Center × Mass.

Figure 12 shows what does Gemini understand by first-order logic constraints. On a positive note, although the 449 A4 .pdf pages that it took as input is not presenting the non-relational constraints enforced in Geography.mdb, it suggested us to not forget adding to the DISTANCES table (between cities) the geometrical triangle inequality constraint ( ∀ City1, City2, City3 ∈ CITIES : DISTANCES (City1, City3) ≤ DISTANCES (City1, City2) + DISTANCES (City2, City3)).

Figure 11: The most frequent end of answers displayed by ChatGPT.

Lupinepublishers-openaccess-computer-sciences-journal

Figure 12: Examples of Gemini “FOL constraints”.

Lupinepublishers-openaccess-computer-sciences-journal

Instead of mathematical formalizations, Gemini is much more interested in coding and pushing ahead usage of PostgreSQL and Python:
• Without being asked for and even without asking for our permission, Gemini translated our .mdb db into a PostgreSQL one.
• Then, with our permission, Gemini built on top of it a FastAPI (Python) with Pydantic validation models layer, plus an analysis NetworkX (for graph topology) and AstroPy (for celestial metrics) module, as well as a visualization Plotly (for connectivity heatmaps) and Graphviz (for relational mapping) one.
• Finally, it added to this app a pathfinding Dijkstra algorithm, a connectivity density map (that calculates which counties are the more connected hubs, measured by how many roads pass through their cities), a closeness centrality one (that identifies which cities are closest to all others, acting as the natural hubs of countries’ spines), a semantic mapping interface layer embedded in the app’s interface for translating English/Romanian questions into the complex JOIN logic required by the 62 db tables (natural language query tool called by Gemini “The Oracle”), and even a geographical quiz engine!

Figure 13 shows Gemini’s summary of this effort (where you can note once more its appetite for metaphors).

Figure 13: Gemini’s summary of the app buided over our input db.

Lupinepublishers-openaccess-computer-sciences-journal

Claude Sonnet 4.6

Claude was the only one who could decrypt the Geography.mdb file. However, lot of columns and constraints were not captured, so we provided instead the corresponding T-SQL script: in only a couple of minutes, it offered for downloading an .md text file with its corresponding db schema mathematical formalization. The fact that the file is a .md one means that Claude stored it as an axioms one for our further interactions on this project.

Unfortunately, this second answer was only a “sketch”, not including all sets, nor all columns, no domain (check) constraints, and containing some incorrect formalizations. A much better formalization was delivered for download after our reactions. Unfortunately, it still had some already flagged issues, as well as new ones: Figure 14 shows our corresponding message. In a couple of minutes, Claude replied with the message shown in Figures 15 and 16, plus a new Geography.md file. Neither were these corrections enough: to our message from Figure 17, Claude answered as shown in Figure 18.

Although issue 3 was not solved and there were still erroneous expressions like x.Min Visible Latitude and a UNICODE (255) +, we were happy with this fourth version of the formal schema, as we reached the quota for daily free interactions. Figures 19 to 22 show the math schema fragment equivalent to MatBase’s one from Figures 1 to 4.

Remarkably, CLAUDE AI added irreflexively constraints for all 9 dyadic relations (DISTANCES and 8 neighbor-type ones), as well as for all 8 self-maps (e.g., Galactic Supercluster and Orbit Center); of course, the self-maps are, in fact, acyclic, not only irreflexive, but at least irreflexively is commonsense. The whole file has 17 A4 .pdf pages.

Figure 14: Our third message to Claude AI.

Lupinepublishers-openaccess-computer-sciences-journal

Figure 15: Claude AI’s answer to our message shown in Figure 14 (1 of 2)..

Lupinepublishers-openaccess-computer-sciences-journal

Figure 16: Claude AI’s answer to our message shown in Figure 14 (2 of 2).

Lupinepublishers-openaccess-computer-sciences-journal

Figure 17: Our fourth and final message to Claude AI.

Lupinepublishers-openaccess-computer-sciences-journal

Figure 18: Claude AI’s answer to our message shown in Figure 17.

Lupinepublishers-openaccess-computer-sciences-journal

Figure 19: Claude AI’s schema fragment equivalent to the one from Figures 1 to 4 (1 of 4).

Lupinepublishers-openaccess-computer-sciences-journal

Figure 20: Claude AI’s schema fragment equivalent to the one from Figures 1 to 4 (2 of 4).

Lupinepublishers-openaccess-computer-sciences-journal

Figure 21: Claude AI’s schema fragment equivalent to the one from Figures 1 to 4 (3 of 4).

Lupinepublishers-openaccess-computer-sciences-journal

Figure 22: Claude AI’s schema fragment equivalent to the one from Figures 1 to 4 (4 of 4).

Lupinepublishers-openaccess-computer-sciences-journal

Conclusions

As expected, MatBase is still the best one of these four tools, both as accuracy and speed. Its great disadvantage, however, is that it may reverse engineer only MS Access and SQL Server dbs. The 2nd best is, by far, Claude AI, both as speed and as almost perfect accuracy. Moreover, it is not limited to only MS Access and SQL Server dbs, very probably just like ChatGPT and Gemini. Unfortunately, almost after any answer, you must wait some 10h before you get the right to ask another free of charge question. The 3rd best is ChatGPT. Unfortunately, it takes extremely long to get a full schema, which, moreover, is not that accurate. Fortu nately, it is also providing the possibility to formalize db schemas using Category Theory formalism as well, but this is beyond the scope of this research: it will be our next further work topic. Finally, Gemini is almost not useful at all for this endeavor but is very interesting for developing data intelligence apps. Future work will evaluate Claude AI, ChatGPT, and Gemini for legacy database reverse engineering.

Conflict of interest

The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.

Acknowledgements

This research was not sponsored by anybody and nobody other than its authors contributed to it. The corresponding author always recalls with pleasure the contributions made by some of his outstanding former students: Lavinia Crasovschi for the (E)MDM, Adrian Mocanu and Sabina-Maria Motoc for MatBase.

References

  1. Mancas C (2013) Should Reverse Engineering Remain a Computer Science Cinderella? J. Inform. Tech. Soft. Eng pp. 1-3.
  2. Mancas C (2019) MatBase – A Tool for Transparent Programming while Modeling Data at Conceptual Levels. In: Proc. 5th Int. Conf. on Comp. Sci. & Inf. Techn. (CSITEC 2019), AIRCC Pub. Corp. Chennai, India 15-27.
  3. Mancas C (2020) MatBase Metadata Catalog Management”. Acta Scientific Computer Sciences 2(4): 25-29.
  4. ChatGPT (2026). https://chatgpt.com/
  5. Google LLC. Gemini AI (2026).

https://chat.aichatapp.ai/onboarding?landing=gemini&utm_source=google&utm_medium=cpc&utm_campaign=22724736430&utm_term=gemini%20ai&utm_adgroup=187207088087&utm_network=g&utm_matchtype=b&utm_loc_physical_ms=9193633&gad_source=1&gad_campaignid=22724736430&gbraid=0AAAAA1RoX3ghVrd_XhWfc3aChdH-GmeG&gclid=Cj0KCQjwj47OBhCmARIsAF5wUEFhqTw91s549fLjsz2A5jxFk1M0qNSfdgCFjjsMfltAsbY1p1TnLXgaAvzcEALw_wcB

  1. Anthropic Claude AI (2026) https://claude.ai
  2. Mancas C (2024) The (Elementary) Mathematical Data Model revisited. PriMera Scientific Engineering 5(4): 78-91.
  3. Pinter C C (2014) A Book of Set Theory. Dover Pub. Inc., Mineola, NY.
  4. Heil J (2021) First-Order Logic. A Concise Introduction. 2nd Edition. Hackett Pub. Co. Inc., Indianapolis / Cambridge, U.S.A.
  5. Kroger F and Merz S (2008) Temporal Logic and State Systems. Springer-Verlag, Berlin Heidelberg, Germany.
  6. Abiteboul S, Hull R, Vianu V (1995) Foundations of Databases. Addison-Wesley, Reading, MA.
  7. Mancas C (2021) On Computing Transitive Closures in MatBase (Does HRH Charles Prince of Wales Also Have Cuman Blood?). JMEST 8(8): 14499-14513.
  8. Codd EF (1970) A relational model for large shared data banks. CACM 13(6): 377-387.
  9. Mancas C (2015) Conceptual Data Modeling and Database Design: A Completely Algorithmic Approach. Volume 1: The Shortest Advis able Path.” Apple Academic Press, Waretown, NJ.
  10. Chen PP (976) The entity-relationship model. Toward a unified view of data. ACM TODS 1(1): 9-36.
  11. Thalheim B (2000) Entity-Relationship Modeling: Foundations of Database Technology. Springer-Verlag, Berlin, Germany.
  12. Mancas C (2020) On Modelware as the 5th Generation of Programming Languages. Acta Scientific Computer Sciences 2(9): 24-26.
  13. Mancas C, Dragomir S, Crasovschi L (2003) On modeling First Order Predicate Calculus using the Elementary Mathematical Data Model in MatBase DBMS. In Proc. IASTED AI 2003 MIT Conf. on Applied Informatics, 1197–1202, Innsbruck, Austria. Acta Press: Calgary, Canada.
  14. Almarashdi Hanan Shaher, Adeeb M Jarrah, Othman Abu Khurma, Serigne Mbaye Gningue (2024) Unveiling the potential: A systematic review of ChatGPT in transforming mathematics teaching and learning. Eurasia Journal of Mathematics, Science and Technology Education 20(12): 2555.
  15. Pepin B, Buchholtz N, Salinas Hernández U (2025) A Scoping Survey of ChatGPT in Mathematics Education. Digit Exp Math Educ 11(1): 9-41.
  16. Feng T, Trieu Trinh, Garrett Bingham, Jiwon Kang, Shengtong Zhang, et al. (2026) Semi-Autonomous Mathematics Discovery with Gemini: A Case Study on the Erdős Problems.
  17. Woodruff D P et al. (2026) Accelerating Scientific Research with Gemini: Case Studies and Common Techniques.
  18. Education Report: How university students use Claude (2025)

https://www.anthropic.com/news/anthropic-education-report-how-university-students-use-claude

  1. Mancas C and Mancas D C (2026) From (Elementary) Mathematical Data Model Schemas to Safe Blazor Web Applications with Claude AI. Accepted for publication in PriMera Scientific Engineering J 8(4): 1-22.
  2. Hart A (2025) Can LLMs Write Mathematics Papers? A Case Study in Reservoir Computing pp. 1-10.
  3. Microsoft Corp. SQL Server Migration Assistant for Access (AccessToSQL) (2026).

https://learn.microsoft.com/en-us/sql/ssma/access/sql-server-migration-assistant-for-access-accesstosql?view=sql-server-ver17

  1. Mancas C (2024) On Enforcing Existence and Non-Existence Constraints in MatBase. PriMera Scientific Engineering 4(6):4-12.