English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  On the Parallel Complexity of Acyclic Logic Programs

Chaudhuri, S., Dimopoulos, Y., & Zaroliagis, C. (1996). On the Parallel Complexity of Acyclic Logic Programs. Parallel Processing Letters, 6(2), 223-230.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-ABF6-3 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-ABF7-1
Genre: Journal Article

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Chaudhuri, Shiva1, Author           
Dimopoulos, Yannis2, Author           
Zaroliagis, Christos1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Content

show
hide
Free keywords: -
 Abstract: We 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.

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-121996
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 519459
Other: Local-ID: C1256104005ECAFC-0890B8611EEEC8C9C12562E000497906-ChaudhuriDimopoulosZaroliagis-PPL96
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Parallel Processing Letters
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 6 (2) Sequence Number: - Start / End Page: 223 - 230 Identifier: ISSN: 0129-6264