On the Unification Free Prolog Programs

On the Unification Free Prolog Programs (1998)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Krzysztof R. Apt , Sandro Etalle

Venue:	ACM TOPLAS
Citations:	75 - 20 self

BibTeX

@INPROCEEDINGS{Apt98onthe,
    author = {Krzysztof R. Apt and Sandro Etalle},
    title = {On the Unification Free Prolog Programs},
    booktitle = {ACM TOPLAS},
    year = {1998},
    pages = {1--19},
    publisher = {Springer-Verlag}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

We provide simple conditions which allow us to conclude that in case of several well-known Prolog programs the unification algorithm can be replaced by iterated matching. The main tools used here are types and generic expressions for types. As already noticed by other researchers, such a replacement offers a possibility of improving the efficiency of program's execution.

Citations

1739	Foundations of logic programming - Lloyd
585	The Art of Prolog - Sterling, Shapiro - 1986
386	Introduction to Logic Programming - Apt - 1990
317	An efficient unification algorithm - Martelli, Montanari - 1982
211	Unification revisited - Lassez, Maher, et al. - 1988
201	Unfold/Fold Transformation of Logic Programs - Tamaki, Sato - 1984
83	Predicate logic as a computational formalism - Clark - 1979
52	A framework of directionality for proving termination of logic programs - Bronsard, Lakshman, et al. - 1992
51	Combinatory Logic, Volume I - Curry, Feys - 1974
44	AND-parallelism with intelligent backtracking for annotated logic programs - Dembinski, Maluszynski - 1985
40	Relating Logic Programs and Attribute Grammars - Deransart, Maluszynski - 1985
39	The Automatic Generation of Mode Declarations for Prolog Programs - Mellish - 1981
39	An application of abstract interpretation of logic programs: occur check reduction. ESOP’86 - Søndergaard
31	Transformation of Logic Programs into Functional Programs - Reddy - 1984
25	On the relationship between logic and functional languages - Reddy - 1986
25	Polymorphically typed logic programs - Yardeni, Frühwirth, et al. - 1992
18	The occur-check problem revisited - Beer - 1988
16	NSTO programs (not subject to occur-check - Deransart, Ferrand, et al. - 1991
16	The Occur-Check Problem in Prolog - Plaisted - 1984
15	Why the occur-check is not a problem - Apt, Pellegrini - 1992
13	A Characterization of Non-Floundering Logic Programs - Marriott, Sondergaard, et al. - 1990
11	Unsolvable problems for SLDNF resolution - Shepherdson - 1991
11	Unification-free Execution of TYPOL Programs by Semantic Attributes Evaluation - Attali, Franchi-Zannettacci - 1988
9	Basic transformation operations for logic programs which preserve computed answer substitutions of logic programs - Bossi, Cocco - 1993
9	logic programs resemble programs in conventional languages - Do - 1987
9	A completeness result for SLDNF resolution - Stroetman - 1993
8	On Generalized Cover Axioms - Decker - 1991
8	Using program transformation to obtain methods for eliminating backtracking in fixed-mode logic programs - Rosenblueth - 1991
8	Uni cation-free execution of logic programs - luszynski, Komorowski - 1985
6	Checking the soundness of resolution schemes - Dumant - 1992
4	Average case analysis of unification algorithms - Albert, Casas, et al. - 1993
4	A new definition of SLDNF-resolution. ILLC Prepublication Series CT-92-03 - Apt, Doets - 1992
2	Correctness of unification without occur check in Prolog - Chadha, Plaisted - 1991
1	The NSTO problem is CoNP-Complete. ILLC prepublication series - Apt, Boas, et al. - 1993