{"id":"https://openalex.org/keywords/sat-solving","display_name":"SAT solving","description":"A computational method for determining whether a Boolean formula can be satisfied by assigning truth values to its variables.","display_name_alternatives":["Boolean satisfiability solving","propositional satisfiability solving","solving Boolean satisfiability"],"ids":{"openalex":"https://openalex.org/keywords/sat-solving","wikidata":"https://www.wikidata.org/wiki/Q124734256"},"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.4535,"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.4535,"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.18,"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":1613,"cited_by_count":15022,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/sat-solving","updated_date":"2026-10-16T04:06:51","created_date":"2026-09-30T00:00:00"}