{"@context":"https://w3id.org/codemeta/3.0","@type":"SoftwareSourceCode","identifier":"pkg:hackage/incremental-sat-solver","name":"incremental-sat-solver","description":"This Haskell library provides an implementation of the\nDavis-Putnam-Logemann-Loveland algorithm\n(cf. http://en.wikipedia.org/wiki/DPLL_algorithm) for\nthe boolean satisfiability problem. It not only allows\nto solve boolean formulas in one go but also to add\nconstraints and query bindings of variables\nincrementally.","version":"0.1.8","softwareVersion":"0.1.8","license":"https://spdx.org/licenses/BSD-3-Clause","codeRepository":"https://github.com/sebfisch/incremental-sat-solver","issueTracker":"https://github.com/sebfisch/incremental-sat-solver/issues","url":"http://github.com/sebfisch/incremental-sat-solver","keywords":["algorithms","bsd3","library","Propose Tags"],"programmingLanguage":{"@type":"ComputerLanguage","name":"Haskell"},"maintainer":[{"@type":"Person","name":"SebastianFischer"}],"author":[{"@type":"Person","name":"SebastianFischer"}],"copyrightHolder":[{"@type":"Person","name":"SebastianFischer"}],"dateCreated":"2009-01-28","dateModified":"2016-08-31","datePublished":"2016-08-31","copyrightYear":2009,"downloadUrl":"https://hackage.haskell.org/package/incremental-sat-solver-0.1.8/incremental-sat-solver-0.1.8.tar.gz","applicationCategory":"hackage","runtimePlatform":"hackage","developmentStatus":"active","sameAs":["https://hackage.haskell.org/package/incremental-sat-solver"],"https://www.w3.org/ns/activitystreams#likes":15,"https://forgefed.org/ns#forks":3}