On computational complexity of Prolog programs

DOI10.1016/0304-3975(93)90340-YzbMath0783.68055OpenAlexW2117341343MaRDI QIDQ1311967

V. Pereyra

Publication date: 26 January 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90340-y

zbMATH Keywords

time and space complexityflat dynamicflat Prologkernel dynamic Prologkernel Prolog

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic programming (68N17)

Cites Work

• Complexity results for classes of quantificational formulas
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On computational complexity of Prolog programs