{ "items" : [
    { "id" : "http://dbpedia.org/resource/Satisfiability"
      "properties" : {
        "http://www.w3.org/2000/01/rdf-schema#comment" : [ "In mathematical logic, satisfiability and validity are elementary concepts of semantics. A formula is satisfiable if it is possible to find an interpretation (model) that makes the formula true.  A formula is valid if all interpretations make the formula true. The opposites of these concepts are unsatisfiability and invalidity, that is, a formula is unsatisfiable if none of the interpretations make the formula true, and invalid if some such interpretation makes the formula false."] } } }
