๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the logic of programs

โœ Scribed by R. A. Plyushkyavichyus; A. Yu. Plyushkyavichene; Yu. V. Sakalauskaite; S. P. Yukna

Publisher
Springer US
Year
1979
Tongue
English
Weight
875 KB
Volume
15
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the equivalence of semantics for norm
On the equivalence of semantics for normal logic programs
โœ Jia-Huai You; Li Yan Yuan ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 699 KB

Despite the frequent comment that there is no general agreement on the semantics of logic programs, this paper shows that a number of independently proposed extensions to the stable model semantics coincide: the regular model semantics proposed by You and Yuan, the partial stable model semantics by

Some results on the complexity of exploi
Some results on the complexity of exploiting data dependency in parallel logic programs
โœ Arthur Delcher; Simon Kasif ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 937 KB

We consider several problems related to maintaining and analyzing dataflow dependencies in AND-parallel execution of logic programs. Several problems related to optimal selection of literals for parallel execution are established to be intractable (NP-complete). Most importantly, we establish intrac

On the equivalence and range of applicab
On the equivalence and range of applicability of graph-based representations of logic programs
โœ Stefania Costantini; Ottavio D'Antona; Alessandro Provetti ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 97 KB

Logic programs under Answer Sets semantics can be studied, and actual computation can be carried out, by means of representing them by directed graphs. Several reductions of logic programs to directed graphs are now available. We compare our proposed representation, called Extended Dependency Graph,