{"id":"https://openalex.org/keywords/sat-solvers","display_name":"SAT solvers","description":"Computer programs that determine whether a Boolean formula can be satisfied, used in automated reasoning, verification, and constraint solving.","display_name_alternatives":["SAT solver","Boolean satisfiability solvers","Boolean satisfiability solver","satisfiability solvers","satisfiability solver","propositional satisfiability solvers"],"ids":{"openalex":"https://openalex.org/keywords/sat-solvers","wikidata":"https://www.wikidata.org/wiki/Q21055608"},"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.4174,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.4174,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.1615,"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":3142,"cited_by_count":50212,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/sat-solvers","updated_date":"2026-10-15T04:06:03","created_date":"2026-09-30T00:00:00"}