The Significance of Memory Costs in Answer Set Solver Implementation

DOI10.1093/LOGCOM/EXN038zbMATH Open1192.68127OpenAlexW2126715257MaRDI QIDQ3395262FDOQ3395262

Authors: Martin Brain, Marina De Vos 

Publication date: 24 August 2009

Published in: Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exn038

Recommendations

• Logic Programming
• On the relation among answer set solvers
• Logic Programming
• Learning domain-specific heuristics for answer set solvers
• Answer set programming based on propositional satisfiability

zbMATH Keywords

answer set programmingcache utilizationanswer set solversdeclarative programming systemsoptimization of memory bound programs

Mathematics Subject Classification ID

Logic programming (68N17)

Cited In (3)

• Conflict-driven answer set solving: from theory to practice
• Performance tuning in answer set programming
• Testing and debugging techniques for answer set solver development

Uses Software

• MiniSat
• PLATYPUS
• ASSAT
• Cmodels
• Gringo
• Smodels

This page was built for publication: The Significance of Memory Costs in Answer Set Solver Implementation

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