Imagen de Portada

A Mimamsa Inspired Framework For Instruction Sequencing In AI Agents

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Srinivasan, Bama
Formato:	Preprint
Publicado:	2025
Materias:	Logic in Computer Science F.4.1
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Two-Level Type Theory and Applications
por: Annenkov, Danil, et al.
Publicado: (2017)

New Bounds for the Ideal Proof System in Positive Characteristic
por: Behera, Amik Raj, et al.
Publicado: (2025)

A Unified Gentzen-style Framework for Until-free LTL
por: Kamide, Norihiro, et al.
Publicado: (2024)

A Topological Rewriting of Tarski's Mereogeometry
por: Barlatier, Patrick, et al.
Publicado: (2025)

A Non-Wellfounded and Labelled Sequent Calculus for Bimodal Provability Logic
por: Becker, Justus
Publicado: (2025)

Satisfiability in Łukasiewicz logic and its unbounded relative
por: Haniková, Zuzana, et al.
Publicado: (2025)

Logic of Sets with Atoms
por: Masters, Jake
Publicado: (2025)

Semi-Substructural Logics à la Lambek
por: Wan, Cheng-Syuan
Publicado: (2024)

Extensions of K5: Proof Theory and Uniform Lyndon Interpolation
por: van der Giessen, Iris, et al.
Publicado: (2023)

Cardinality and Representation of Stone Relation Algebras
por: Furusawa, Hitoshi, et al.
Publicado: (2023)

A Proof of the Schröder-Bernstein Theorem in ACL2
por: Jurgensen, Grant
Publicado: (2025)

A Curiously Effective Backtracking Strategy for Connection Tableaux
por: Färber, Michael
Publicado: (2021)

A Construction of the Lie Algebra of a Lie Group in Isabelle/HOL
por: Schmoetten, Richard, et al.
Publicado: (2024)

A topological counterpart of well-founded trees in dependent type theory
por: Maietti, Maria Emilia, et al.
Publicado: (2023)

A parametricity-based formalization of semi-simplicial and semi-cubical sets
por: Herbelin, Hugo, et al.
Publicado: (2023)

CoLF Logic Programming as Infinitary Proof Exploration
por: Chen, Zhibo, et al.
Publicado: (2025)

Dependently Sorted Nominal Signatures
por: Fernández, Maribel, et al.
Publicado: (2025)

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

Who Wins the Multi-Structural Game?
por: Fagin, Ronald, et al.
Publicado: (2025)

The Limit of Recursion in State-based Systems
por: Afshari, Bahareh, et al.
Publicado: (2025)

Scroll nets
por: Donato, Pablo
Publicado: (2025)

Type Theory with Single Substitutions
por: Kaposi, Ambrus, et al.
Publicado: (2025)

The Dependently Typed Higher-Order Form for the TPTP World
por: Ranalter, Daniel, et al.
Publicado: (2025)

Characterization of Lattice Properties Within Modal Extensions
por: Freire, Alfredo R., et al.
Publicado: (2025)

Complexity of Łukasiewicz Modal Probabilistic Logics
por: Kozhemiachenko, Daniil, et al.
Publicado: (2025)

The Cost of Skeletal Call-by-Need, Smoothly
por: Accattoli, Beniamino, et al.
Publicado: (2025)

Expressivity of bisimulation pseudometrics over analytic state spaces
por: Luckhardt, Daniel, et al.
Publicado: (2025)

Transporting Theorems about Typeability in LF Across Schematically Defined Contexts
por: Johnson, Chase, et al.
Publicado: (2025)

On a Dependently Typed Encoding of Matching Logic
por: Kurucz, Ádám, et al.
Publicado: (2025)

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

Satisfiability for Knowing How over Linear Plans is NP-complete
por: Areces, Carlos, et al.
Publicado: (2026)

Apply2Isar: Automatically Converting Isabelle/HOL Apply-Style Proofs to Structured Isar
por: Binder, Sage, et al.
Publicado: (2026)

Sensible Intersection Type Theories
por: Dezani-Ciancaglini, Mariangiola, et al.
Publicado: (2026)

Polymorphism Meets DHOL
por: Ranalter, Rhea, et al.
Publicado: (2026)

Efficient Normalization of Linear Temporal Logic
por: Esparza, Javier, et al.
Publicado: (2023)

Two Remarks about Game Semantics of Classical Logic
por: Coquand, Thierry
Publicado: (2026)

Computation and Size of Interpolants for Hybrid Modal Logics
por: Jung, Jean Christoph, et al.
Publicado: (2026)

The Guarded Fragment with Nested Equivalences
por: Fiuk, Oskar
Publicado: (2026)

Unified Gentzen Approach to Connexive Logics over Wansing's C
por: Kamide, Norihiro
Publicado: (2024)

On the (In-)Completeness of Destructive Equality Resolution in the Superposition Calculus
por: Waldmann, Uwe
Publicado: (2024)