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

Logic programming as a basis for lean automated deduction

โœ Scribed by Bernhard Beckert; Joachim Posegga


Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
372 KB
Volume
28
Category
Article
ISSN
0743-1066

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Towards an automated deduction system fo
โœ 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

A semantic basis for the termination ana
โœ Michael Codish; Cohavit Taboch ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 287 KB

This paper presents a formal semantic basis for the termination analysis of logic programs. The semantics exhibits the termination properties of a logic program through its binary unfoldings ยฑ a possibly inยฎnite set of binary clauses. Termination of a program P and goal G is determined by the absenc

Fuzzy logic as a basis for reusing task-
โœ Lein F. Lai; Jonathan Lee; Stephen J. Yang ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 597 KB

In this paper, we propose an approach to reusing requirements specification, called ลฝ . task-based specifications in conceptual graphs TBCG . In TBCG, task-based specification methodology is used to serve as the mechanism to structure the knowledge captured in conceptual models, and conceptual graph