On acyclic and head-cycle free nested logic programs

DOI10.1007/978-3-540-27775-0_16MaRDI QIDQ5313186zbMATH OpenOpenAlexFDO

Authors T. Linke, Hans Tompits, Stefan Woltran

Publication date 26 August 2005

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

Full work available at URL https://doi.org/10.1007/b99475

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Nested expressions in logic programs
• scientific article; zbMATH DE number 25189
• Acyclic logic programs and the completeness of SLDNF-resolution
• A polynomial translation of logic programs with nested expressions into disjunctive logic programs: Preliminary report
• Propositional semantics for disjunctive logic programs

Cited in

(5)

• On the complexity of identifying head-elementary-set-free programs
• A polynomial translation of logic programs with nested expressions into disjunctive logic programs: Preliminary report
• Normal form nested programs
• Normal Form Nested Programs
• Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs

Describes a project that uses

Uses Software

• ASSAT

This page was built for publication: On acyclic and head-cycle free nested logic programs

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