plp: A generic compiler for ordered logic programs

DOI10.1007/3-540-45402-0_33MaRDI QIDQ4800166zbMATH OpenFDO

Authors James Delgrande, Torsten Schaub, Hans Tompits

Publication date 18 May 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45402-0_33

Mathematics Subject Classification ID

Logic programming (68N17) Theory of compilers and interpreters (68N20) Computing methodologies and applications (68U99)

Recommendations

• Efficient evaluation of a class of ordered logic programs
• scientific article; zbMATH DE number 44623
• Logic program synthesis in a higher-order setting
• Declarative compilation for constraint logic programming
• scientific article; zbMATH DE number 4164128
• scientific article; zbMATH DE number 549957
• Towards resource handling in logic programming: The PPL framework and fits semantics
• Towards resource handling in logic programming: The PPL framework and its semantics
• Ordered completion for logic programs with aggregates

Cited in

(5)

• scientific article; zbMATH DE number 3881852 (Why is no real title available?)
• Computing preferred answer sets in answer set programming
• A framework for compiling preferences in logic programs
• Translating LPOD and CR-\(\mathrm{Prolog}_2\) into standard answer set programs
• Foundations of Information and Knowledge Systems

Describes a project that uses

Uses Software

• Smodels

This page was built for publication: plp: A generic compiler for ordered logic programs

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