✦ LIBER ✦

Heuristics for constructing logic programs

✍ Scribed by Ahmed Ferchichi

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 879 KB
Volume: 23
Category: Article
ISSN: 0164-1212
DOI: 10.1016/0164-1212(93)90097-h

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Completing open logic programs by constr

Completing open logic programs by constructive induction

✍ Esra Erdem; Pierre Flener 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 247 KB

We consider part of the problem of schema-biased inductive synthesis of recursive logic Ž programs from incomplete specifications, such as clausal evidence for instance, but not . necessarily, ground positive and negative examples . After synthesizing the base clause Ž . and introducing recursive ca

Justifying control for logic programs

✍ Birgit Elbl 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 48 KB

Fault detection algorithm for logic prog

Fault detection algorithm for logic programs

✍ A.R. Hamdan; C.J. Hinde 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 635 KB

LUPS—A language for updating logic progr

LUPS—A language for updating logic programs

✍ José Júlio Alferes; Luı́s Moniz Pereira; Halina Przymusinska; Teodor C. Przymusi 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 229 KB

Most of the work conducted so far in the field of logic programming has focused on representing static knowledge, i.e., knowledge that does not evolve with time. To overcome this limitation, in a recent paper, the authors introduced dynamic logic programming. There, they studied and defined the decl

Preferred answer sets for extended logic

Preferred answer sets for extended logic programs

✍ Gerhard Brewka; Thomas Eiter 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 442 KB

In this paper, we address the issue of how Gelfond and Lifschitz's answer set semantics for extended logic programs can be suitably modified to handle prioritized programs. In such programs an ordering on the program rules is used to express preferences. We show how this ordering can be used to defi

Unfold/fold transformations for disjunct

Unfold/fold transformations for disjunctive logic programs

✍ Manolis Gergatsoulis 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 627 KB

Unfold/fold transformation rules for disjunctive logic programs are proposed in this paper. Our transformation rules preserve the meaning of the programs. @ 1997 Elsevier Science B.V.