AbstractIt is a general problem to investigate the trade off between the complexity of algorithmic problems, the structure of the input objects and the expressive power of problem description languages. The article concentrates on linear time algorithms and on first order logic (FO) as problem description language. One of the main results is a proof that each FO-problem can be solved in linear time for arbitrary relational structures of universally bounded degree
The aim of this thesis is to explore the potential of resolution-based methods for linear temporal r...
In this work, the notion of provability for first order linear temporal logic over finite time struc...
AbstractWe give a new characterization of elementary and deterministic polynomial time computation i...
AbstractIt is a general problem to investigate the trade off between the complexity of algorithmic p...
Linear logic has many properties that make it suitable for application in various areas of computer ...
Abstract. Linear logic has many properties that make it suitable for application in various areas of...
Linear logic, introduced by Girard in 1987, has been called a resource conscious logic. In order to ...
AbstractUsual typed lambda-calculi yield input/output specifications; in this paper the authors show...
The aim of the present paper was to go deeper into the logics of time. By the formula of the classic...
International audienceElementary linear logic is a simple variant of linear logic due to Girard and ...
this paper a series of languages adequate for expressing exactly those properties checkable in a ser...
AbstractUsing predicate logic, the concept of a linear problem is formalized. The class of linear pr...
We study the complexity of some fragments of first-order temporal logic over natural numbers time. T...
Linear logic, introduced by Girard in 1987, has been called a resource conscious logic. In order to ...
International audienceElementary linear logic is a simple variant of linear logic, introduced by Gir...
The aim of this thesis is to explore the potential of resolution-based methods for linear temporal r...
In this work, the notion of provability for first order linear temporal logic over finite time struc...
AbstractWe give a new characterization of elementary and deterministic polynomial time computation i...
AbstractIt is a general problem to investigate the trade off between the complexity of algorithmic p...
Linear logic has many properties that make it suitable for application in various areas of computer ...
Abstract. Linear logic has many properties that make it suitable for application in various areas of...
Linear logic, introduced by Girard in 1987, has been called a resource conscious logic. In order to ...
AbstractUsual typed lambda-calculi yield input/output specifications; in this paper the authors show...
The aim of the present paper was to go deeper into the logics of time. By the formula of the classic...
International audienceElementary linear logic is a simple variant of linear logic due to Girard and ...
this paper a series of languages adequate for expressing exactly those properties checkable in a ser...
AbstractUsing predicate logic, the concept of a linear problem is formalized. The class of linear pr...
We study the complexity of some fragments of first-order temporal logic over natural numbers time. T...
Linear logic, introduced by Girard in 1987, has been called a resource conscious logic. In order to ...
International audienceElementary linear logic is a simple variant of linear logic, introduced by Gir...
The aim of this thesis is to explore the potential of resolution-based methods for linear temporal r...
In this work, the notion of provability for first order linear temporal logic over finite time struc...
AbstractWe give a new characterization of elementary and deterministic polynomial time computation i...
DOI
Add to ORKG