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

Rational set of trees and the algebraic semantics of logic programming

โœ Scribed by G. Marque-Pucheu

Publisher
Springer-Verlag
Year
1983
Tongue
English
Weight
530 KB
Volume
20
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The semantics of constraint logic progra
The semantics of constraint logic programs
โœ Joxan Jaffar; Michael Maher; Kim Marriott; Peter Stuckey ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 350 KB

The Constraint Logic Programming (CLP) Scheme was introduced by Jaar and Lassez. The scheme gave a formal framework, based on constraints, for the basic operational, logical and algebraic semantics of an extended class of logic programs. This paper presents for the ยฎrst time the semantic foundations

Decidability of logic program semantics
Decidability of logic program semantics and applications to testing
โœ Salvatore Ruggieri ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 248 KB

In this paper, we investigate the decidability problem of logic program semantics and observables, focusing in particular on the least Herbrand model (or M-semantics), the C-semantics, and the S-semantics. We introduce bounded logic programs, and show that they coincide with programs such that every

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