Comparing the expressive powers of some syntactically restricted classes of logic programs

DOI10.1007/3-540-44957-4_57MaRDI QIDQ2767110zbMATH OpenFDO

Authors Tomi Janhunen

Publication date 28 January 2002

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

Full work available at URL https://doi.org/10.1007/3-540-44957-4_57

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Some (in)translatability results for normal logic programs and propositional theories
• scientific article; zbMATH DE number 4057010
• Expressiveness of logic programs under the general stable model semantics
• The expressive powers of the logic programming semantics
• Logics in Artificial Intelligence

Cited in

(5)

• The expressive power of stratified logic programs with value invention
• Some (in)translatability results for normal logic programs and propositional theories
• scientific article; zbMATH DE number 4057010 (Why is no real title available?)
• The accepting power of unary string logic programs
• The comparison of the expressive power of first-order dynamic logics

This page was built for publication: Comparing the expressive powers of some syntactically restricted classes of logic programs

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