Chain programs for writing deterministic metainterpreters

DOI10.1017/S147106840100134XMaRDI QIDQ4452615zbMATH OpenFDO

Authors David A. Rosenblueth

Publication date 1 March 2004

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL http://journals.cambridge.org/action/displayIssue?jid=TLP&volumeId=2&issueId=02

zbMATH Keywords

exhaustive searchbounded-resource reasoningchain programs.committed-choice processorsdeterministic metainterpretation

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 4106263
• scientific article; zbMATH DE number 3956467
• scientific article; zbMATH DE number 4104373
• Transformations of logic programs
• Proving properties of committed choice logic programs

This page was built for publication: Chain programs for writing deterministic metainterpreters

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