Dynamic and static symmetry breaking in answer set programming

DOI10.1007/978-3-642-45221-5_8MaRDI QIDQ2870119zbMATH OpenOpenAlexFDO

Authors Belaïd Benhamou

Publication date 17 January 2014

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-45221-5_8

zbMATH Keywords

symmetryanswer set programminglogic programmingnon-monotonic reasoningstable model semantics

Mathematics Subject Classification ID

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

Recommendations

• Symmetry-breaking answer set solving
• Local Symmetry Breaking During Search in CSPs
• Dynamic structural symmetry breaking for constraint satisfaction problems
• Lightweight dynamic symmetry breaking
• Logic programming -- taking advantage of symmetry

Cited in

(4)

• On local domain symmetry for model expansion
• Logic programming -- taking advantage of symmetry
• Dynamic structural symmetry breaking for constraint satisfaction problems
• Symmetry-breaking answer set solving

Describes a project that uses

Uses Software

• clasp
• ASSAT

This page was built for publication: Dynamic and static symmetry breaking in answer set programming

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