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

Prioritized logic programming and its application to commonsense reasoning

โœ Scribed by Chiaki Sakama; Katsumi Inoue

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
284 KB
Volume
123
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

โœฆ Synopsis

Representing and reasoning with priorities are important in commonsense reasoning. This paper introduces a framework of prioritized logic programming (PLP), which has a mechanism of explicit representation of priority information in a program. When a program contains incomplete or indefinite information, PLP is useful for specifying preference to reduce non-determinism in logic programming. Moreover, PLP can realize various forms of commonsense reasoning in AI such as abduction, default reasoning, circumscription, and their prioritized variants. The proposed framework increases the expressive power of logic programming and exploits new applications in knowledge representation.

๐Ÿ“œ SIMILAR VOLUMES

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

A general theory of confluent rewriting
A general theory of confluent rewriting systems for logic programming and its applications
โœ Jรผrgen Dix; Mauricio Osorio; Claudia Zepeda ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 236 KB

Recently, Brass and Dix showed (J. Automat. Reason. 20(1) (1998) 143-165) that the well founded semantics WFS can be deรฟned as a con uent calculus of transformation rules. This led not only to a simple extension to disjunctive programs (J. Logic Programming 38(3) (1999) 167-213), but also to a new c

Abstract multiple specialization and its
Abstract multiple specialization and its application to program parallelization
โœ German Puebla; Manuel Hermenegildo ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 510 KB

Program specialization optimizes programs for known values of the input. It is often the case that the set of possible input values is unknown, or this set is inยฎnite. However, a form of specialization can still be performed in such cases by means of abstract interpretation, specialization then bein