✦ LIBER ✦

Equivalent logic programs

✍ Scribed by Chan Kwok Hung

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 823 KB
Volume: 8
Category: Article
ISSN: 0743-1066
DOI: 10.1016/0743-1066(90)90022-w

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Equivalences among logics of programs

✍ Albert R. Meyer; Jerzy Tiuryn 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 742 KB

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

Program logic and equivalence in the pre

Program logic and equivalence in the presence of garbage collection

✍ Cristiano Calcagno; Peter O'Hearn; Richard Bornat 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 220 KB

It is generally thought that reasoning about programs in memory safe, garbage collected languages is much easier than in languages where the programmer has more explicit control over memory. Paradoxically, existing program logics are based on a low-level view of storage that is sensitive to the pres

Logic programs as specifications in the

Logic programs as specifications in the inductive verification of logic programs

✍ Marco Comini; Roberta Gori; Giorgio Levi 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 149 KB

Transformations of logic programs

✍ Olga Štěpánková; Petr Štěpánek 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 863 KB

Annotated fuzzy logic programs

✍ Tru H. Cao 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 189 KB

Several fuzzy logic programming systems that deal with fuzzy sets as data in programs have been developed, but they lack the fundamentals of a theorem prover, whence the soundness and the completeness cannot be proved. Annotated logic programs have been developed as an extension of classical logic p