Image de couverture de livre

A Mimamsa Inspired Framework For Instruction Sequencing In AI Agents

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Srinivasan, Bama
Format:	Preprint
Publié:	2025
Sujets:	Logic in Computer Science F.4.1
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Two-Level Type Theory and Applications
par: Annenkov, Danil, et autres
Publié: (2017)

New Bounds for the Ideal Proof System in Positive Characteristic
par: Behera, Amik Raj, et autres
Publié: (2025)

A Unified Gentzen-style Framework for Until-free LTL
par: Kamide, Norihiro, et autres
Publié: (2024)

A Topological Rewriting of Tarski's Mereogeometry
par: Barlatier, Patrick, et autres
Publié: (2025)

A Non-Wellfounded and Labelled Sequent Calculus for Bimodal Provability Logic
par: Becker, Justus
Publié: (2025)

Satisfiability in Łukasiewicz logic and its unbounded relative
par: Haniková, Zuzana, et autres
Publié: (2025)

Logic of Sets with Atoms
par: Masters, Jake
Publié: (2025)

Semi-Substructural Logics à la Lambek
par: Wan, Cheng-Syuan
Publié: (2024)

Extensions of K5: Proof Theory and Uniform Lyndon Interpolation
par: van der Giessen, Iris, et autres
Publié: (2023)

Cardinality and Representation of Stone Relation Algebras
par: Furusawa, Hitoshi, et autres
Publié: (2023)

A Proof of the Schröder-Bernstein Theorem in ACL2
par: Jurgensen, Grant
Publié: (2025)

A Curiously Effective Backtracking Strategy for Connection Tableaux
par: Färber, Michael
Publié: (2021)

A Construction of the Lie Algebra of a Lie Group in Isabelle/HOL
par: Schmoetten, Richard, et autres
Publié: (2024)

A topological counterpart of well-founded trees in dependent type theory
par: Maietti, Maria Emilia, et autres
Publié: (2023)

A parametricity-based formalization of semi-simplicial and semi-cubical sets
par: Herbelin, Hugo, et autres
Publié: (2023)

CoLF Logic Programming as Infinitary Proof Exploration
par: Chen, Zhibo, et autres
Publié: (2025)

Dependently Sorted Nominal Signatures
par: Fernández, Maribel, et autres
Publié: (2025)

The mu-calculus' Alternation Hierarchy is Strict over Non-Trivial Fusion Logics
par: Pacheco, Leonardo
Publié: (2025)

Who Wins the Multi-Structural Game?
par: Fagin, Ronald, et autres
Publié: (2025)

The Limit of Recursion in State-based Systems
par: Afshari, Bahareh, et autres
Publié: (2025)

Scroll nets
par: Donato, Pablo
Publié: (2025)

Type Theory with Single Substitutions
par: Kaposi, Ambrus, et autres
Publié: (2025)

The Dependently Typed Higher-Order Form for the TPTP World
par: Ranalter, Daniel, et autres
Publié: (2025)

Characterization of Lattice Properties Within Modal Extensions
par: Freire, Alfredo R., et autres
Publié: (2025)

Complexity of Łukasiewicz Modal Probabilistic Logics
par: Kozhemiachenko, Daniil, et autres
Publié: (2025)

The Cost of Skeletal Call-by-Need, Smoothly
par: Accattoli, Beniamino, et autres
Publié: (2025)

Expressivity of bisimulation pseudometrics over analytic state spaces
par: Luckhardt, Daniel, et autres
Publié: (2025)

Transporting Theorems about Typeability in LF Across Schematically Defined Contexts
par: Johnson, Chase, et autres
Publié: (2025)

On a Dependently Typed Encoding of Matching Logic
par: Kurucz, Ádám, et autres
Publié: (2025)

On the Formal Metatheory of the Pure Type Systems using One-sorted Variable Names and Multiple Substitutions
par: Urciuoli, Sebastián
Publié: (2025)

Satisfiability for Knowing How over Linear Plans is NP-complete
par: Areces, Carlos, et autres
Publié: (2026)

Apply2Isar: Automatically Converting Isabelle/HOL Apply-Style Proofs to Structured Isar
par: Binder, Sage, et autres
Publié: (2026)

Sensible Intersection Type Theories
par: Dezani-Ciancaglini, Mariangiola, et autres
Publié: (2026)

Polymorphism Meets DHOL
par: Ranalter, Rhea, et autres
Publié: (2026)

Efficient Normalization of Linear Temporal Logic
par: Esparza, Javier, et autres
Publié: (2023)

Two Remarks about Game Semantics of Classical Logic
par: Coquand, Thierry
Publié: (2026)

Computation and Size of Interpolants for Hybrid Modal Logics
par: Jung, Jean Christoph, et autres
Publié: (2026)

The Guarded Fragment with Nested Equivalences
par: Fiuk, Oskar
Publié: (2026)

Unified Gentzen Approach to Connexive Logics over Wansing's C
par: Kamide, Norihiro
Publié: (2024)

On the (In-)Completeness of Destructive Equality Resolution in the Superposition Calculus
par: Waldmann, Uwe
Publié: (2024)