{"id":"https://openalex.org/keywords/parallel-sat-solving","display_name":"parallel SAT solving","description":"The use of concurrent computation to determine whether a Boolean formula is satisfiable and, when possible, find a satisfying assignment.","display_name_alternatives":["parallel Boolean satisfiability solving","parallel satisfiability solving"],"ids":{"openalex":"https://openalex.org/keywords/parallel-sat-solving","wikidata":null},"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.5892,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.5892,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.1438,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":217,"cited_by_count":3587,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/parallel-sat-solving","updated_date":"2026-11-19T04:05:57","created_date":"2026-09-30T00:00:00"}
