Add to ORKGWe investigate the parallel complexity of computing the stable model of acyclic general logic programs. Within this class of logic programs, we consider the cases of negative and definite logic programs. Both cases are proved to be P-complete. We prove the same for a related problem, namely that of computing the kernel of a directed acyclic graph
This report continues to document the development of a logic programming paradigm with implicit cont...
AbstractGelfond and Lifschitz (1988) proposed the notion of a stable model of a logic program. We es...
AbstractThis paper investigates the class of acyclic programs, programs with the usual hierarchical ...
We investigate the parallel complexity of computing the stable model of acyclic general logic progra...
AbstractWe consider logic programs without function symbols, called Datalog programs, and study thei...
In this paper we investigate and solve the problem classifying the Turing complexity of stable model...
The computational complexity of a problem is usually defined in terms of the resources required on s...
We study the parallel complexity of three problems on concurrency: decision of firing sequences for ...
International audienceIn this paper, we consider parallel real-time tasks follow- ing a Directed Acy...
AbstractThis is a tutorial introduction to the literature on parallel computers and algorithms that ...
AbstractWe investigate the complexity of derivations from logic programs, and find it closely relate...
AbstractWe study the following problem: given a class of logic programs ¢, determine the maximum num...
AbstractIn this paper we present a graph representation of logic programs and default theories. We s...
The symbolic computations of recursive programmes were investigated with the aim of study of complex...
In this paper we present a graph representation of logic programs and default theories. We show that...
This report continues to document the development of a logic programming paradigm with implicit cont...
AbstractGelfond and Lifschitz (1988) proposed the notion of a stable model of a logic program. We es...
AbstractThis paper investigates the class of acyclic programs, programs with the usual hierarchical ...
We investigate the parallel complexity of computing the stable model of acyclic general logic progra...
AbstractWe consider logic programs without function symbols, called Datalog programs, and study thei...
In this paper we investigate and solve the problem classifying the Turing complexity of stable model...
The computational complexity of a problem is usually defined in terms of the resources required on s...
We study the parallel complexity of three problems on concurrency: decision of firing sequences for ...
International audienceIn this paper, we consider parallel real-time tasks follow- ing a Directed Acy...
AbstractThis is a tutorial introduction to the literature on parallel computers and algorithms that ...
AbstractWe investigate the complexity of derivations from logic programs, and find it closely relate...
AbstractWe study the following problem: given a class of logic programs ¢, determine the maximum num...
AbstractIn this paper we present a graph representation of logic programs and default theories. We s...
The symbolic computations of recursive programmes were investigated with the aim of study of complex...
In this paper we present a graph representation of logic programs and default theories. We show that...
This report continues to document the development of a logic programming paradigm with implicit cont...
AbstractGelfond and Lifschitz (1988) proposed the notion of a stable model of a logic program. We es...
AbstractThis paper investigates the class of acyclic programs, programs with the usual hierarchical ...