On the Floyd–Warshall algorithm for logic programs

DOI10.1016/S0743-1066(99)00013-8MaRDI QIDQ4719377zbMATH OpenOpenAlexWikidataFDO

Authors Christos Papadimitriou, Martha Sideri

Publication date 4 January 2000

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0743-1066(99)00013-8

zbMATH Keywords

total ambiguity

Mathematics Subject Classification ID

Logic programming (68N17) Nonnumerical algorithms (68W05)

Recommendations

• On computing logic programs
• scientific article; zbMATH DE number 218508
• Alternation and the computational complexity of logic programs
• On computability by logic programs
• scientific article; zbMATH DE number 4103047
• scientific article; zbMATH DE number 3140027
• scientific article; zbMATH DE number 3227504
• An efficient algorithm of logic programming with constraint hierarchy
• Optimal fixedpoints of logic programs
• scientific article; zbMATH DE number 3848592

This page was built for publication: On the Floyd–Warshall algorithm for logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4719377)