{"@context":"https://w3id.org/codemeta/3.0","@type":"SoftwareSourceCode","identifier":"pkg:npm/%40problem-solving/sat","name":"@problem-solving/sat","description":"Boolean formula satisfiability algorithms for JavaScript","version":"4.0.2","softwareVersion":"4.0.2","license":"https://spdx.org/licenses/AGPL-3.0","codeRepository":"https://github.com/computational-problem-solving/sat","issueTracker":"https://github.com/computational-problem-solving/sat/issues","url":"https://computational-problem-solving.github.io/sat","keywords":["NP","SAT","algorithms","boolean formula","complete","complexity","computer science","javascript","js","satisfiability"],"programmingLanguage":{"@type":"ComputerLanguage","name":"JavaScript"},"maintainer":[{"@type":"Person","name":"raskat"},{"@type":"Person","name":"aureooms"}],"author":[{"@type":"Person","name":"raskat"},{"@type":"Person","name":"aureooms"}],"copyrightHolder":[{"@type":"Person","name":"raskat"},{"@type":"Person","name":"aureooms"}],"dateCreated":"2021-12-20","dateModified":"2021-12-20","datePublished":"2021-12-20","copyrightYear":2021,"downloadUrl":"https://registry.npmjs.org/@problem-solving/sat/-/sat-4.0.2.tgz","applicationCategory":"npm","runtimePlatform":"npm","developmentStatus":"active","sameAs":["https://www.npmjs.com/package/@problem-solving/sat"],"https://www.w3.org/ns/activitystreams#likes":6}