Tag propositional-logic - Это страница 3 - GeneraCodice

Определение формулы 2-CNF (A.K.A KROM)

https://www.generacodice.com/ru/articolo/2455540/определение-формулы-2-cnf-a-k-a-krom
  logic  -  satisfiability  -  graphs  -  propositional-logic
cs.stackexchange cs.stackexchange

Что если p подразумевает q неверно, когда оба P и Q являются ложными?

https://www.generacodice.com/ru/articolo/2454628/что-если-p-подразумевает-q-неверно-когда-оба-p-и-q-являются-ложными
  propositional-logic
cs.stackexchange cs.stackexchange

Complexity of negation cancellation

https://www.generacodice.com/ru/articolo/1621339/complexity-of-negation-cancellation
  complexity-theory  -  logic  -  propositional-logic
cs.stackexchange cs.stackexchange

How to correctly negate a predicate bounded by some quantifiers?

https://www.generacodice.com/ru/articolo/1620902/how-to-correctly-negate-a-predicate-bounded-by-some-quantifiers
  logic  -  first-order-logic  -  propositional-logic  -  predicate-logic
cs.stackexchange cs.stackexchange

The optimized numbers of variables and clauses to encode a graph coloring problem in CNF

https://www.generacodice.com/ru/articolo/1620759/the-optimized-numbers-of-variables-and-clauses-to-encode-a-graph-coloring-problem-in-cnf
  graphs  -  propositional-logic
cs.stackexchange cs.stackexchange

Non-Boolean SAT

https://www.generacodice.com/ru/articolo/1620639/non-boolean-sat
  constraint-satisfaction  -  sat-solvers  -  algorithms  -  propositional-logic
cs.stackexchange cs.stackexchange

prove that {$↔,⊕$} is incomplete set?

https://www.generacodice.com/ru/articolo/1620605/prove-that-is-incomplete-set
  logic  -  discrete-mathematics  -  propositional-logic
cs.stackexchange cs.stackexchange

Are these 2 equivalent?

https://www.generacodice.com/ru/articolo/1616774/are-these-2-equivalent
  logic  -  discrete-mathematics  -  propositional-logic
cs.stackexchange cs.stackexchange

Context-free grammar for tautologies in one variable

https://www.generacodice.com/ru/articolo/1615472/context-free-grammar-for-tautologies-in-one-variable
  context-free  -  propositional-logic
cs.stackexchange cs.stackexchange

Are $\mathsf{\#P}$ problems harder than $\mathsf{NP}$ problems

https://www.generacodice.com/ru/articolo/1615460/are-mathsf-p-problems-harder-than-mathsf-np-problems
  complexity-theory  -  logic  -  counting  -  propositional-logic
cs.stackexchange cs.stackexchange
Результаты найдены: 159
scroll top