On computing logic programs

DOI10.1007/BF00283131zbMATH Open0865.68026MaRDI QIDQ5961490FDOQ5961490

Yannis Dimopoulos

Publication date: 30 June 1997

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

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

zbMATH Keywords

linear programmingconstraint satisfactionpropositional satisfiabilitygraph methodsproblem-solving methods

Mathematics Subject Classification ID

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

Cited In (16)

• On the equivalence and range of applicability of graph-based representations of logic programs.
• Role of logic programming in the FGCS project
• Title not available (Why is that?)
• Title not available (Why is that?)
• Solving problems on finite concrete logics with the help of a PC
• Title not available (Why is that?)
• Answering the “why” in answer set programming – A survey of explanation approaches
• Extending and implementing the stable model semantics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph theoretical structures in logic programs and default theories
• Mixed integer programming methods for computing nonmonotonic deductive databases
• Computing Stable Models via Reductions to Difference Logic
• On the Floyd–Warshall algorithm for logic programs
• Title not available (Why is that?)
• Title not available (Why is that?)

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)