scholarly journals Relating data-parallelism and (and-) parallelism in logic programs

1995 ◽  
pp. 27-41 ◽  
Author(s):  
Manuel V. Hermenegildo ◽  
Manuel Carro
Keyword(s):  
Data Parallelism ◽  
Logic Programs

scholarly journals Relating data-parallelism and (and-) parallelism in logic programs

1996 ◽  
Vol 22 (2-3) ◽  
pp. 143-163 ◽  
Author(s):  
Manuel V. Hermenegildo ◽  
Manuel Carro
Keyword(s):  
Data Parallelism ◽  
Logic Programs

An Optimized Strategy for Collective Communication in Data Parallelism

2009 ◽  
Vol 31 (2) ◽  
pp. 318-328
Author(s):  
Jue WANG ◽  
Chang-Jun HU ◽  
Ji-Lin ZHANG ◽  
Jian-Jiang LI
Keyword(s):  
Data Parallelism ◽  
Collective Communication

Generalized Disjunctive Well-Founded Semantics for Logic Programs

1990 ◽  
Author(s):  
Chitta Baral ◽  
Jorge Lobo ◽  
Jack Minker
Keyword(s):  
Logic Programs

A Retargetable MATLAB-to-C Compiler Exploiting Custom Instructions and Data Parallelism

2020 ◽  
Vol 19 (6) ◽  
pp. 1-27
Author(s):  
Ioannis Latifis ◽  
Karthick Parashar ◽  
Grigoris Dimitroulakos ◽  
Hans Cappelle ◽  
Christakis Lezos ◽  
...  
Keyword(s):  
Data Parallelism ◽  
C Compiler

Logical Decision Problems and Complexity of Logic Programs

1987 ◽  
Vol 10 (1) ◽  
pp. 1-33
Author(s):  
Egon Börger ◽  
Ulrich Löwen
Keyword(s):  
Fixed Point ◽  
Computational Complexity ◽  
Decision Problem ◽  
Decision Problems ◽  
Complexity Classes ◽  
Logic Programs ◽  
Finite Structures ◽  
Syntactic Restrictions

We survey and give new results on logical characterizations of complexity classes in terms of the computational complexity of decision problems of various classes of logical formulas. There are two main approaches to obtain such results: The first approach yields logical descriptions of complexity classes by semantic restrictions (to e.g. finite structures) together with syntactic enrichment of logic by new expressive means (like e.g. fixed point operators). The second approach characterizes complexity classes by (the decision problem of) classes of formulas determined by purely syntactic restrictions on the formation of formulas.

Y-Logic: A Framework for Reasoning About Chameleonic Programs with Inconsistent Completions

1990 ◽  
Vol 13 (4) ◽  
pp. 465-483
Author(s):  
V.S. Subrahmanian
Keyword(s):  
Classical Logic ◽  
Logic Program ◽  
Logic Programs ◽  
Large Subset ◽  
General Logic ◽  
Traditional Sense

Large logic programs are normally designed by teams of individuals, each of whom designs a subprogram. While each of these subprograms may have consistent completions, the logic program obtained by taking the union of these subprograms may not. However, the resulting program still serves a useful purpose, for a (possibly) very large subset of it still has a consistent completion. We argue that “small” inconsistencies may cause a logic program to have no models (in the traditional sense), even though it still serves some useful purpose. A semantics is developed in this paper for general logic programs which ascribes a very reasonable meaning to general logic programs irrespective of whether they have consistent (in the classical logic sense) completions.

Sign in / Sign up

Export Citation Format

Share Document