scientific article; zbMATH DE number 6917940

DOI10.23638/LMCS-14(3:6)2018MaRDI QIDQ4580325zbMATH OpenFDO

Authors Clément Aubert, Marc Bagnol

Publication date 15 August 2018

Full work available at URL https://arxiv.org/abs/1805.11988

zbMATH Keywords

proof theorylogarithmic spacegeometry of interactionpointer machinesimplicit complexityunification algebra

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic programming (68N17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Grammars and rewriting systems (68Q42) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Recommendations

• Logic programming and logarithmic space
• Unification and Logarithmic Space
• scientific article; zbMATH DE number 1342271
• Syntactic unification as a geometric operation in free modules over certain rings
• Interaction graphs: graphings
• Unification as a complexity measure for logic programming
• scientific article; zbMATH DE number 1722659
• A modified GoI interpretation for a linear functional programming language and its adequacy
• Logic Programming with Focusing Proofs in Linear Logic
• scientific article; zbMATH DE number 785046

Cites work

• scientific article; zbMATH DE number 1722659 (Why is no real title available?)
• scientific article; zbMATH DE number 4099289 (Why is no real title available?)
• scientific article; zbMATH DE number 4123722 (Why is no real title available?)
• scientific article; zbMATH DE number 786500 (Why is no real title available?)
• A Machine-Oriented Logic Based on the Resolution Principle
• A correspondence between maximal abelian sub-algebras and linear logic fragments
• A new recursion-theoretic characterization of the polytime functions
• Bounded linear logic, revisited
• Bounded linear logic: A modular approach to polynomial-time computability
• Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
• Characterizingco-NLby a group action
• Elementary complexity and geometry of interaction
• Geometry of interaction. V: Logic in the hyperfinite factor
• Interaction graphs: additives
• Linear logic and elementary time
• Linear logic by levels and bounded time complexity
• Logarithmic space and permutations
• Logic programming and logarithmic space
• Nondeterministic Space is Closed under Complementation
• Normativity in logic
• On non-determinacy in simple computing devices
• On the sequential nature of unification
• Quasi-interpretations. A way to control resources
• Reversible space equals deterministic space
• The method of forced enumeration for nondeterministic automata
• Three lightings of logic (Invited Talk)
• Unary resolution: characterizing \textsc{Ptime}
• Unification and Logarithmic Space
• Unification: a multidisciplinary survey

Cited in

(5)

• Unification and Logarithmic Space
• Logarithmic space and permutations
• Unary resolution: characterizing \textsc{Ptime}
• Unification as a complexity measure for logic programming
• Logic programming and logarithmic space

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580325)