Search results for "occur-check"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
103	Krzysztof R. Apt, Alessandro Pellegrini 0002	On the Occur-Check-Free Prolog Programs.	ACM Trans. Program. Lang. Syst.	1994	DBLP DOI BibTeX RDF	PROLOG programs, moded programs, occur-check problem, Prolog, unification algorithm
90	Kim Marriott, Harald Søndergaard	On prolog and the occur check problem.	ACM SIGPLAN Notices	1989	DBLP DOI BibTeX RDF	Prolog
71	Patricia M. Hill, Roberto Bagnara, Enea Zaffanella	The Correctness of Set-Sharing.	SAS	1998	DBLP DOI BibTeX RDF	occur-check, rational trees, set-sharing, logic programming, abstract interpretation
65	W. P. Weijland	Semantics for Logic Programs without Occur Check.	ICALP	1988	DBLP DOI BibTeX RDF
49	Ulrich Neumerkel	Pruning Infinite Failure Branches in Programs with Occur-Check.	LPAR	1992	DBLP DOI BibTeX RDF
49	Krzysztof R. Apt, Alessandro Pellegrini 0002	Why the Occur-Check is Not a Problem. (long version: TOPLAS 16(3): 687-726 (1994))	PLILP	1992	DBLP DOI BibTeX RDF
49	Harald Søndergaard	An Application of Abstract Interpretation of Logic Programs: Occur Check Reduction.	ESOP	1986	DBLP DOI BibTeX RDF
36	Philippe le Chenadec	On Positive Occur-Checks in Unification.	MFCS	1988	DBLP DOI BibTeX RDF
32	Wlodzimierz Drabent	A relaxed condition for avoiding the occur-check.	Theor. Comput. Sci.	2023	DBLP DOI BibTeX RDF
32	Wlodzimierz Drabent	A note on occur-check (extended report).	CoRR	2022	DBLP DOI BibTeX RDF
32	Wlodzimierz Drabent	A Note on Occur-Check.	ICLP Technical Communications	2021	DBLP DOI BibTeX RDF
32	Wlodzimierz Drabent	SLD-resolution without occur-check, an example.	CoRR	2021	DBLP BibTeX RDF
32	Lobel Crnogorac, Andrew D. Kelly, Harald Søndergaard	A Comparison of Three Occur-Check Analysers.	SAS	1996	DBLP DOI BibTeX RDF
32	Ritu Chadha, David A. Plaisted	Correctness of Unification Without Occur Check in Prolog.	J. Log. Program.	1994	DBLP DOI BibTeX RDF
32	Pierre Deransart, Gérard Ferrand, Michel Téguia	NSTO Programs (Not Subject to Occur-Check).	ISLP	1991	DBLP BibTeX RDF
32	W. P. Weijland	Semantics for Logic Programs Without Occur Check.	Theor. Comput. Sci.	1990	DBLP DOI BibTeX RDF
32	Joachim Beer	The Occur-Check Problem Revisited.	J. Log. Program.	1988	DBLP DOI BibTeX RDF
32	David A. Plaisted	The Occur-Check Problem in Prolog.	New Gener. Comput.	1984	DBLP DOI BibTeX RDF
32	David A. Plaisted	The Occur-Check Problem in Prolog.	SLP	1984	DBLP BibTeX RDF
16	Luc Albert, Rafael Casas, François Fages, A. Torrecillas, Paul Zimmermann	Average Case Analysis of Unification Algorithms.	STACS	1991	DBLP DOI BibTeX RDF	generating functions, average case complexity, unification algorithms
12	Peter Graf	Extended Path-Indexing.	CADE	1994	DBLP DOI BibTeX RDF
8	Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann	Automated Termination Analysis for Logic Programs by Term Rewriting.	LOPSTR	2006	DBLP DOI BibTeX RDF
8	Oliver Ray	The Need for Ancestor Resolution When Answering Queries in Horn Clause Logic.	ICLP	2005	DBLP DOI BibTeX RDF
8	Roberto Bagnara, Patricia M. Hill, Enea Zaffanella	Efficient Structural Information Analysis for Real CLP Languages.	LPAR	2000	DBLP DOI BibTeX RDF
8	Jan-Georg Smaus, Patricia M. Hill, Andy King	Termination of Logic Programs with block Declarations Running in Several Modes.	PLILP/ALP	1998	DBLP DOI BibTeX RDF
8	M. R. K. Krishna Rao, Paritosh K. Pandya, R. K. Shyamasundar	Verification Tools in the Development of Provably Correct Compilers.	FME	1993	DBLP DOI BibTeX RDF
8	Andreas Krall, Ulrich Neumerkel	The Vienna Abstract Machine.	PLILP	1990	DBLP DOI BibTeX RDF
8	Peter Ruzicka, Igor Prívara	An Almost Linear Robinson Unification ALgorithm.	MFCS	1988	DBLP DOI BibTeX RDF