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

Stable and extension class theory for logic programs and default logics

โœ Scribed by Chitta R. Baral; V. S. Subrahmanian

Publisher
Springer Netherlands
Year
1992
Tongue
English
Weight
1018 KB
Volume
8
Category
Article
ISSN
0168-7433

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Time-extraction for temporal logic-logic
Time-extraction for temporal logic-logic programming and local process time
โœ Takashi Hattori ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 783 KB

Temporal logic is useful to describe a variety of computer systems such as operating systems and real-time process control systems, where explicit treatment of time plays an essential role. In the logic, the notion of time is represented by a sequence of states at each point in time, which is called

Mechanising shared configuration and dia
Mechanising shared configuration and diagnosis theories through constraint logic programming
โœ Nirad Sharma; Robert Colomb ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 461 KB

Conยฎguration and diagnosis problem-solvers are commonly championed as successes of applied artiยฎcial intelligence techniques. A common problem is that problem-solvers typically encode task-speciยฎc representation assumptions and simpliยฎcations in their domain theories, hindering the reuse of the doma

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