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

Comparison of Semantics of Disjunctive Logic Programs Based on Model-Equivalent Reduction

โœ Scribed by Xi-Shun Zhao; Yu-Ping Shen

Publisher
Springer
Year
2007
Tongue
English
Weight
750 KB
Volume
22
Category
Article
ISSN
1000-9000

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

A note on semantics of logic programs wi
A note on semantics of logic programs with equality based on complete sets of E-unifiers
โœ Anatoli Degtyarev; Andrei Voronkov ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 538 KB

We discuss semantics of equational Horn-clause programs based on the notion of a complete set of E-unifiers. We prove incompleteness of SLDE tresolution in the general case. SLDELresolution was introduced by Gallier and Raatz who proved its completeness for the case of well-behaved programs. We also

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,