Optimistic parallel discrete relaxation

Authors:
Kinson Ho;Paul N. Hilfinger;Hans W. Guesgen
Affiliations:
Computer Science Division, University of California at Berkeley;Computer Science Division, University of California at Berkeley;Computer Science Department, University of Auckland, New Zealand
Venue:
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Year:
1993

Citing 9
Cited 0

Denotational semantics: a methodology for language development

Denotational semantics: a methodology for language development
CONSAT: a system for constraint satisfaction

CONSAT: a system for constraint satisfaction
On the parallel complexity of discrete relaxation in constraint satisfaction networks

Artificial Intelligence
A fixed point approach to parallel discrete event simulation

Acta Informatica
High-level abstractions for symbolic parallel programming

High-level abstractions for symbolic parallel programming
Asynchronous Iterative Methods for Multiprocessors

Journal of the ACM (JACM)
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory

Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Multiprocessing Extensions in Spur Lisp

IEEE Software
Generating Semantic Descriptions From Drawings of Scenes With Shadows

Generating Semantic Descriptions From Drawings of Scenes With Shadows

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of finding a set of assumptions which explain a given proposition is in general NP-hard, even when the background theory is an acyclic Horn theory. In this paper it is shown that when the background theory is acyclic Horn and its pseudo-completion ...