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
arikatimpisbmpgde Classication Algorithms and data structures Parallel algorithms An integer seque...
In this paper we present a graph representation of logic programs and default theories. We show that...
We study the family of stable models of finite and recursive predicate logic programs. We show that ...
We investigate the parallel complexity of computing the stable model of acyclic general logic progr...
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...
AbstractThis paper investigates the class of acyclic programs, programs with the usual hierarchical ...
We study the parallel complexity of three problems on concurrency: decision of firing sequences for ...
The computational complexity of a problem is usually defined in terms of the resources required on s...
This report continues to document the development of a logic programming paradigm with implicit cont...
AbstractThis is a tutorial introduction to the literature on parallel computers and algorithms that ...
We study a class of non-deterministic program schemes with while loops: firstly, augmented with a pr...
International audienceIn this paper, we consider parallel real-time tasks follow- ing a Directed Acy...
AbstractIn this paper we present a graph representation of logic programs and default theories. We s...
AbstractWe study the following problem: given a class of logic programs ¢, determine the maximum num...
arikatimpisbmpgde Classication Algorithms and data structures Parallel algorithms An integer seque...
In this paper we present a graph representation of logic programs and default theories. We show that...
We study the family of stable models of finite and recursive predicate logic programs. We show that ...
We investigate the parallel complexity of computing the stable model of acyclic general logic progr...
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...
AbstractThis paper investigates the class of acyclic programs, programs with the usual hierarchical ...
We study the parallel complexity of three problems on concurrency: decision of firing sequences for ...
The computational complexity of a problem is usually defined in terms of the resources required on s...
This report continues to document the development of a logic programming paradigm with implicit cont...
AbstractThis is a tutorial introduction to the literature on parallel computers and algorithms that ...
We study a class of non-deterministic program schemes with while loops: firstly, augmented with a pr...
International audienceIn this paper, we consider parallel real-time tasks follow- ing a Directed Acy...
AbstractIn this paper we present a graph representation of logic programs and default theories. We s...
AbstractWe study the following problem: given a class of logic programs ¢, determine the maximum num...
arikatimpisbmpgde Classication Algorithms and data structures Parallel algorithms An integer seque...
In this paper we present a graph representation of logic programs and default theories. We show that...
We study the family of stable models of finite and recursive predicate logic programs. We show that ...