scientific article; zbMATH DE number 4199630

MaRDI QIDQ3348419zbMATH OpenFDO

Authors Krzysztof R. Apt, Howard A. Blair

Publication date 1991

zbMATH Keywords

perfect modelsrecursion-free program

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic programming (68N17) Hierarchies of computability and definability (03D55) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• scientific article; zbMATH DE number 4147557
• Publication:4934250
• Generic models of logic programs
• The expressiveness of locally stratified programs
• Complexity and undecidability results for logic programming

Cited in

(4)

• Index sets for finite normal predicate logic programs with function symbols
• scientific article; zbMATH DE number 4147557 (Why is no real title available?)
• The expressiveness of locally stratified programs
• Layerings of logic programs -- layer decomposable semantics and incremental model computation

This page was built for publication:

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