Extremal problems in logic programming and stable model computation

DOI10.1016/S0743-1066(98)10020-1MaRDI QIDQ4245929zbMATH OpenOpenAlexFDO

Authors Paweł Cholewiński, Mirosław Truszczyński

Publication date 20 July 1999

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0743-1066(98)10020-1

zbMATH Keywords

answer setsdisjunctive programsstable models

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Computing stable models: worst-case performance estimates
• scientific article; zbMATH DE number 2090538
• Logic Programming
• On computing logic programs
• Computing large and small stable models

Cited in

(12)

• Solving problems on finite concrete logics with the help of a PC
• Locally determined logic programs and recursive stable models
• Fixed-parameter complexity in AI and nonmonotonic reasoning
• On the equivalence and range of applicability of graph-based representations of logic programs.
• Complexity of computing with extended propositional logic programs
• scientific article; zbMATH DE number 1059312 (Why is no real title available?)
• Computing large and small stable models
• On the Expressibility of Stable Logic Programming
• scientific article; zbMATH DE number 2090538 (Why is no real title available?)
• Computing stable models: worst-case performance estimates
• About epistemic negation and world views in epistemic logic programs
• On computing logic programs

This page was built for publication: Extremal problems in logic programming and stable model computation

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