About: 3-SAT

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

Problem of determining if a Boolean formula could be made true

thumbnail
Property Value
dbo:description
  • problema di determinare se una formula booleana è soddisfacibile (it)
  • Entscheidungsproblem der theoretischen Informatik (de)
  • problem of determining if a Boolean formula could be made true (en)
  • problém (cs)
  • 命題論理式を真にできるかどうかを判定する問題 (ja)
  • problema per determinar si una fórmula booleana es podria fer certa (ca)
  • проблема визначення того, чи можна зробити булеву формулу істинною (uk)
  • problème de décision, qui détermine si une formule Booléenne est vrai. (fr)
dbo:thumbnail
dbo:wikiPageExternalLink
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dct:subject
gold:hypernym
rdfs:label
  • 3-SAT (en)
  • Boolean satisfiability problem (en)
  • Problém splnitelnosti booleovské formule (cs)
  • Problema de satisfacibilitat booleana (ca)
  • مسألة قابلية الإرضاء المنطقية (ar)
  • Bulea plenumebloproblemo (eo)
  • Erfüllbarkeitsproblem der Aussagenlogik (de)
  • Problema de satisfacibilidad booleana (es)
  • Problème SAT (fr)
  • Soddisfacibilità booleana (it)
  • 充足可能性問題 (ja)
  • 충족 가능성 문제 (ko)
  • Problema de satisfatibilidade booliana (pt)
  • Vervulbaarheidsprobleem (nl)
  • Problem spełnialności (pl)
  • Задача здійсненності булевих формул (uk)
  • Задача выполнимости булевых формул (ru)
  • 布尔可满足性问题 (zh)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:academicDiscipline of
is dbo:wikiPageDisambiguates of
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is dbp:class of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 4.0 International