arXiv (All)
open access
Equation discovery with Bayesian tree-adjoining grammars
Tree-Adjoining Grammars (TAGs) have recently been introduced to Nonlinear System Identification (NLSI) as a means of encoding an entire model class as a finite set of grammatical rules, from which candidate models are assembled as trees. Existing TAG-based identifiers rely on evolutionary optimisati
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Automatic Ordinary Differential Equations Discovery For Biological Systems Using Large Language Model Powered Agentic System#370384
- A Pragmatic Bayesian Platform for Automating Scientific Induction#71563
- Automated Modeling Method for Pathloss Model Discovery#149284
- A Responsible Artificial Intelligence Framework for Groundwater Modeling#616807
- A Responsible Artificial Intelligence Framework for Groundwater Modeling#616307
Record · ID 1106067
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive