Ebénézer Ntienjem  Home/Search
Context
Related
| informatik.uniaugsburg....19975.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: informatik.uniaugs...techreports (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In general, an n-ary predicate (relation) describes the relationship among its arguments, and such that no argument has to be of a special mode. The unification and the resolution (SLDNF-resolution) do capture this state of affair. Hence, the aim of logic programming is in some point approximatively achieved if the system is able to automatically determine the descriptive mode of an n-ary predicate symbol with respect to a logic program. The descriptive mode of an n-ary predicate symbol... (Update)
Active bibliography (related documents): More All
0.2: Completeness Of SLDNF-Resolution For Non-Floundering Queries - Drabent (1994) (Correct)
0.2: The Declarative Semantics of the Prolog Selection Rule - Stärk (1994) (Correct)
0.2: Efficient Dataflow Analysis of Logic Programs - Debray (1992) (Correct)
Similar documents based on text: More All
0.3: Les 2820 complexes consonantiques cambodgiens du dictionnaire.. - Haralambous (1996) (Correct)
0.3: Les 2820 Complexes Consonantiques . . . - Haralambous (1996) (Correct)
0.3: The Network Manager for Event Building in the ATLAS DAQ Prototype - Authors Ralf (Correct)
BibTeX entry: (Update)
@misc{ ntienjem-descriptive,
author = "Ebénézer Ntienjem",
title = "A descriptive Mode Inference for Logic Programs",
url = "citeseer.ist.psu.edu/ntienjem97descriptive.html" }
Citations (may not include all citations):1838 Foundations of Logic Programming (context) - Lloyd - 1987
267 A note on inductive generalization (context) - Plotkin - 1970
192 Logic programming (context) - Apt - 1990
170 ACM Transactions on Programming Languages and Systems (context) - Martelli, Montanari et al. - 1982
82 Signed data dependencies in logic programs (context) - Kunen - 1989
79 Static inference of modes and data dependencies in logic pro.. - Debray - 1989
63 Transformational systems and algebraic structure of atomic f.. (context) - Reynolds - 1970
62 Some global optimization for a prolog compiler (context) - Mellish - 1985
56 Higher-order unification revisited: Complete sets of transfo.. (context) - Snyder, Gallier - 1989
51 Automatic mode inference for logic programs - Debray, Warren - 1988
48 Abstract interpretation of prolog programs (context) - Mellish - 1986
48 Implementing prolog -- compiling predicate logic programs (context) - Warren - 1977
37 Abstract interpretation: towards the global optimization of .. (context) - Bruynooghe, Demoen et al. - 1987
36 The automatic generation of mode declaration for prolog prog.. (context) - Mellish - 1981
36 An instance of abstract interpretation integrating type and .. (context) - Bruynooghe, Janssens - 1988
25 the relationship between logic and functional languages (context) - Reddy - 1986
18 Automating control for logic programs (context) - Naish - 1985
16 Flow analysis of prolog programs (context) - Mannila, Ukkonen - 1987
9 A completeness result for sldnf--resolution (context) - Stroetmann - 1993
8 output dependencies of normal logic programs (context) - Stark - 1994
1 Flow analysis of dymanic logic programs (context) - Debray - 1989
1 Ludwig-Maximilians-Universitat Munchen (context) - Schwichtenberg, Vorlesungsausarbeitung - 1993
Documents on the same site (http://www.informatik.uni-augsburg.de/skripts/techreports): More
ReGTime - Rent Gigaflops someTimes - Dreier, Huber, Zahn, Karl, Ungerer (1996) (Correct)
Axiomatizing a Fragment of PAFAS - Vogler, Jenner (2000) (Correct)
Modal and Temporal Operators on Partial Orders - Möller (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC