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

Mints type deductive calculi for logic programming

โœ Scribed by J.C. Shepherdson

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
606 KB
Volume
56
Category
Article
ISSN
0168-0072

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Type dependencies for logic programs usi
Type dependencies for logic programs using ACI-unification
โœ Michael Codish; Vitaly Lagoon ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 197 KB

This paper presents a new notion of typing for logic programs which generalizes the notion of directional types. The generation of type dependencies for a logic program is fully automatic with respect to a given domain of types. The analysis method is based on a novel combination of program abstract

Towards an automated deduction system fo
Towards an automated deduction system for first-order possibilistic logic programming with fuzzy constants
โœ Teresa Alsinet; Lluรญs Godo ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 245 KB

In this article, we present a first-order logic programming language for fuzzy reasoning under possibilistic uncertainty and poorly known information. Formulas are represented by a pair (ฯ•, ฮฑ), in which ฯ• is a first-order Horn clause or a query with fuzzy constants and regular predicates, and ฮฑ โˆˆ [0