Abstract
Answer Set Programming (ASP) is a declarative language oriented towards solving complex combinatorial problems. In fact, ASP has been successfully used to address problems in various academic and industrial domains. The success of ASP can be attributed to its concise syntax, intuitive semantics, and the availability of several efficient solvers based on the Conflict-Driven Clause Learning (CDCL) algorithm. This paper details the design and implementation of contemporary CDCL solvers, emphasizing both algorithmic descriptions and their effective and efficientimplementation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
