@article{malikBooleanSatisfiabilityTheoretical2009,
  title = {Boolean Satisfiability from Theoretical Hardness to Practical Success},
  volume = {52},
  issn = {00010782},
  doi = {10.1145/1536616.1536637},
  abstract = {THERE ARE MANY practical situations where we need to satisfy several potentially confl icting constraints. Simple examples of this abound in daily life, for example, determining a schedule for a series of games that resolves the availability of players and venues, or fi nding a seating assignment at dinner consistent with various rules the host would like to impose. This also applies to applications in computing, for example, ensuring that a hardware/software system functions correctly with its overall behavior constrained by the behavior of its components and their composition, or fi nding a plan for a robot to reach a goal that is consistent with the moves it can make at any step. While the applications may seem varied, at the core they all have variables whose values we need to determine (for example, the person sitting at a given seat at dinner) and constraints that these variables must satisfy (for example, the host's seating rules).},
  number = {8},
  journaltitle = {Communications of the ACM},
  date = {2009},
  pages = {76},
  author = {Malik, Sharad and Zhang, Lintao},
  file = {/home/dimitri/Nextcloud/Zotero/storage/KXA3N65N/p76-malik.pdf}
}

{"_id":"FGx7LnzerjLahc2tx","bibbaseid":"malik-zhang-booleansatisfiabilityfromtheoreticalhardnesstopracticalsuccess","authorIDs":[],"author_short":["Malik, S.","Zhang, L."],"bibdata":{"bibtype":"article","type":"article","title":"Boolean Satisfiability from Theoretical Hardness to Practical Success","volume":"52","issn":"00010782","doi":"10.1145/1536616.1536637","abstract":"THERE ARE MANY practical situations where we need to satisfy several potentially confl icting constraints. Simple examples of this abound in daily life, for example, determining a schedule for a series of games that resolves the availability of players and venues, or fi nding a seating assignment at dinner consistent with various rules the host would like to impose. This also applies to applications in computing, for example, ensuring that a hardware/software system functions correctly with its overall behavior constrained by the behavior of its components and their composition, or fi nding a plan for a robot to reach a goal that is consistent with the moves it can make at any step. While the applications may seem varied, at the core they all have variables whose values we need to determine (for example, the person sitting at a given seat at dinner) and constraints that these variables must satisfy (for example, the host's seating rules).","number":"8","journaltitle":"Communications of the ACM","date":"2009","pages":"76","author":[{"propositions":[],"lastnames":["Malik"],"firstnames":["Sharad"],"suffixes":[]},{"propositions":[],"lastnames":["Zhang"],"firstnames":["Lintao"],"suffixes":[]}],"file":"/home/dimitri/Nextcloud/Zotero/storage/KXA3N65N/p76-malik.pdf","bibtex":"@article{malikBooleanSatisfiabilityTheoretical2009,\n title = {Boolean Satisfiability from Theoretical Hardness to Practical Success},\n volume = {52},\n issn = {00010782},\n doi = {10.1145/1536616.1536637},\n abstract = {THERE ARE MANY practical situations where we need to satisfy several potentially confl icting constraints. Simple examples of this abound in daily life, for example, determining a schedule for a series of games that resolves the availability of players and venues, or fi nding a seating assignment at dinner consistent with various rules the host would like to impose. This also applies to applications in computing, for example, ensuring that a hardware/software system functions correctly with its overall behavior constrained by the behavior of its components and their composition, or fi nding a plan for a robot to reach a goal that is consistent with the moves it can make at any step. While the applications may seem varied, at the core they all have variables whose values we need to determine (for example, the person sitting at a given seat at dinner) and constraints that these variables must satisfy (for example, the host's seating rules).},\n number = {8},\n journaltitle = {Communications of the ACM},\n date = {2009},\n pages = {76},\n author = {Malik, Sharad and Zhang, Lintao},\n file = {/home/dimitri/Nextcloud/Zotero/storage/KXA3N65N/p76-malik.pdf}\n}\n\n","author_short":["Malik, S.","Zhang, L."],"key":"malikBooleanSatisfiabilityTheoretical2009","id":"malikBooleanSatisfiabilityTheoretical2009","bibbaseid":"malik-zhang-booleansatisfiabilityfromtheoreticalhardnesstopracticalsuccess","role":"author","urls":{},"downloads":0},"bibtype":"article","biburl":"https://raw.githubusercontent.com/dlozeve/newblog/master/bib/all.bib","creationDate":"2020-01-08T20:39:39.022Z","downloads":0,"keywords":[],"search_terms":["boolean","satisfiability","theoretical","hardness","practical","success","malik","zhang"],"title":"Boolean Satisfiability from Theoretical Hardness to Practical Success","year":null,"dataSources":["3XqdvqRE7zuX4cm8m"]}