On computing logic programs

DOI10.1007/BF00283131MaRDI QIDQ5961490zbMATH OpenFDO

Authors Yannis Dimopoulos

Publication date 30 June 1997

Published in Journal of Automated Reasoning (Search for Journal in Brave)

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

zbMATH Keywords

constraint satisfactiongraph methodslinear programmingproblem-solving methodspropositional satisfiability

Mathematics Subject Classification ID

Logic programming (68N17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Extremal problems in logic programming and stable model computation
• scientific article; zbMATH DE number 1368933
• scientific article; zbMATH DE number 1696768
• scientific article; zbMATH DE number 2088041
• Mixed integer programming methods for computing nonmonotonic deductive databases

Cited in

(20)

• Solving problems on finite concrete logics with the help of a PC
• Extending and implementing the stable model semantics
• On the equivalence and range of applicability of graph-based representations of logic programs.
• scientific article; zbMATH DE number 1696768 (Why is no real title available?)
• scientific article; zbMATH DE number 5841868 (Why is no real title available?)
• Computing Stable Models via Reductions to Difference Logic
• scientific article; zbMATH DE number 4103047 (Why is no real title available?)
• scientific article; zbMATH DE number 1292287 (Why is no real title available?)
• Extremal problems in logic programming and stable model computation
• Mixed integer programming methods for computing nonmonotonic deductive databases
• scientific article; zbMATH DE number 1059307 (Why is no real title available?)
• On the Floyd–Warshall algorithm for logic programs
• scientific article; zbMATH DE number 2088041 (Why is no real title available?)
• scientific article; zbMATH DE number 2101985 (Why is no real title available?)
• scientific article; zbMATH DE number 1407682 (Why is no real title available?)
• Role of logic programming in the FGCS project
• Answering the ``why in answer set programming -- a survey of explanation approaches
• Layerings of logic programs -- layer decomposable semantics and incremental model computation
• Graph theoretical structures in logic programs and default theories
• Logic programming in tensor spaces

This page was built for publication: On computing logic programs

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