Logic Programming and Logarithmic Space

@article{Aubert2014LogicPA,
  title={Logic Programming and Logarithmic Space},
  author={Cl{\'e}ment Aubert and Marc Bagnol and Paolo Pistone and Thomas Seiller},
  journal={ArXiv},
  year={2014},
  volume={abs/1406.2110}
}
We present an algebraic view on logic programming, related to proof theory and more specifically linear logic and geometry of interaction. Within this construction, a characterization of logspace (deterministic and non-deterministic) computation is given via a syntactic restriction, using an encoding of words that derives from proof theory. 

Unification and Logarithmic Space

An algebraic characterization of the complexity classes Logspace and NLogspace is presented, using an algebra with a composition law based on unification based on linear logic and Geometry of Interaction.

Unary Resolution: Characterizing Ptime

We give a characterization of deterministic polynomial time computation based on an algebraic structure called the resolution semiring, whose elements can be understood as logic programs or sets of

On the Resolution Semiring

This thesis studies a semiring structure with a product based on the resolution rule of logic programming that provides an algebraic and abstract setting, while being presented in a syntactic and concrete way, in which a theoretical study of computation can be carried on.

Interaction Graphs: Nondeterministic Automata

This paper exhibits a series of semantic characterisations of sublinear nondeterministic complexity classes without reference to specific machine models that relate strongly to ICC results based on linear logic since the semantic framework considered stems from work on the latter.

Interaction Graphs

  • T. Seiller
  • Computer Science
    ACM Trans. Comput. Log.
  • 2018
This article exhibits a series of semantic characterisations of sublinear nondeterministic complexity classes without reference to specific machine models, which relates strongly to icc results based on linear logic, since the semantic framework considered stems from work on the latter.

PRAMs over integers do not compute maxflow efficiently

This article analyzes two proofs of complexity lower bound: Ben-Or's proof of minimal height of algebraic computational trees deciding certain problems and Mulmuley's proof that restricted Parallel Random Access Machines (prams) over integers can not decide P-complete problems efficiently.

Memoization for Unary Logic Programming: Characterizing PTIME

A characterization of deterministic polynomial time computation based on an algebraic structure called the resolution semiring, whose elements can be understood as logic programs or sets of rewriting rules over first-order terms, and shows a PTIME-completeness result for a class of logic programming queries which use only unary function symbols.

Towards a Complexity-through-Realizability Theory

The background, motivations and perspectives of this complexity-through-Realisability theory to be developed are provided, and it is illustrated with recent results.

An in-between "implicit" and "explicit" complexity: Automata

This work surveys how automata theory contributed to complexity with a machine-dependant with implicit bounds model and makes two aspects implicit, by manipulating programming languages rather than models of com-putation and internalizing the bounds rather than using external measure.

Entropy and Complexity Lower Bounds

The notion of topological entropy, which quantifies the exponential growth of the number of orbits of a dynamical system, is generalised to define the entropy of a graphing and is refined to more specific situations in which both the number and the degrees of the varieties delimiting the regions can be bounded.

References

SHOWING 1-10 OF 35 REFERENCES

Unification and Logarithmic Space

An algebraic characterization of the complexity classes Logspace and NLogspace is presented, using an algebra with a composition law based on unification based on linear logic and Geometry of Interaction.

Bounded Linear Logic, Revisited

QBAL, an extension of Girard, Scedrov and Scott's bounded linear logic, is presented, which provides compositional embeddings of Leivant's RRW and Hofmann's LFPL into QBAL.

Elementary Complexity and Geometry of Interaction

A geometry of interaction model given by an algebra of clauses equipped with resolution into which proofs of Elementary Linear Logic can be interpreted is introduced.

Complexity and expressive power of logic programming

The main focus is on decidable forms of logic programming, in particular propositional logic programming and datalog, but the also mention general logic programming with function symbols, and the complexity of the unification problem is addressed.

Stratified Bounded Affine Logic for Logarithmic Space

  • Ulrich Schöpp
  • Computer Science, Mathematics
    22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)
  • 2007
This paper introduces stratified bounded affine logic (SBAL), a restricted version of bounded linear logic, in which not only the modality, but also the universal quantifier is bounded by a resource polynomial.

Linear logic by levels and bounded time complexity

An Implicit Characterization of PSPACE

A type system for an extension of lambda calculus with a conditional construction, named STAB, that characterizes the PSPACE class, the first characterization of PSPACE that is based on lambda calculus and light logics.

Linear logic

This column presents an intuitive overview of linear logic, some recent theoretical results, and summarizes several applications oflinear logic to computer science.

One More Decidable Class of Finitely Ground Programs

This paper introduces the class of argument-restricted programs--the class of "finitely ground" programs that can be efficiently instantiated, which includes, in particular, all finite domain programs, *** - restricted programs, and *** -restricted programs.

Interaction graphs: Multiplicatives

  • T. Seiller
  • Computer Science, Mathematics
    Ann. Pure Appl. Log.
  • 2012