Question

Is there an algorithm for the satisfiability problem for a specific dictionary

score 30 · Answer 1 · 2017-01-30 14:11:45

30

Views

Is there an algorithm for the satisfiability problem for a specific dictionary

Published on 30 Jan 2017 - 14:11

score 167 · Answer 2 · 2017-02-13 02:59:58

167

Views

If in the 3 CNF formula I were to replace the ANDs with ORs and ORs with ANDs would the problem still be NP complete?

Published on 13 Feb 2017 - 2:59

score 52 · Answer 3 · 2017-02-25 11:28:37

52

Views

Express a Differential equation and a contraint as a logical formula

Published on 25 Feb 2017 - 11:28

score 879 · Answer 4 · 2017-02-27 05:43:50

[logic]Give sample of 3-element set M so that M is not satisfiable, but every 2-element subset of M is satisfiable.

score 697 · Answer 5 · 2017-03-08 03:05:36

697

Views

What is an efficient way to check if a boolean expression is more specific than another one?

Published on 08 Mar 2017 - 3:05

score 82 · Answer 6 · 2017-03-21 10:13:13

82

Views

RSA (FACT) to SAT transform complexity

Published on 21 Mar 2017 - 10:13

score 134 · Answer 7 · 2017-03-26 12:41:53

134

Views

Definition of a model?

Published on 26 Mar 2017 - 12:41

score 1.9k · Answer 8 · 2026-02-23 10:15:00

1.9k

Views

How do I show 3-SAT is decidable?

Published on 23 Feb 2026 - 10:15

score 75 · Answer 9 · 2023-03-05 19:33:43

75

Views

How to understand one of the properties of satisfaction of wfs in first-order logic?

Published on 05 Mar 2023 - 19:33

score 48 · Answer 10 · 2023-03-06 04:29:18

48

Views

How to perform induction on the number of connectives and quantifiers in a well-formed formula?

Published on 06 Mar 2023 - 4:29

score 40 · Answer 11 · 2023-03-07 17:11:48

40

Views

Finding solutions to Boolean satisfaction problems

Published on 07 Mar 2023 - 17:11

score 16 · Answer 12 · 2026-03-10 07:10:26

16

Views

Does quantifier elimination preserve equi-satisfiability or equivalence?

Published on 10 Mar 2026 - 7:10

score 97 · Answer 13 · 2023-05-06 22:19:27

97

Views

Why is the problem of proving the existence or nonexistence of an algorithm that efficiently solves SAT equivalent to $P = NP$, explained simply?

Published on 06 May 2023 - 22:19

score 115 · Answer 14 · 2023-05-28 17:37:45

115

Views

Satisfiability in an Heyting algebra implies satisfiability in a Boolean algebra for propositional logic?

Published on 28 May 2023 - 17:37

score 58 · Answer 15 · 2023-06-04 12:04:27

58

Views

What's meant by a 'reversible Boolean formula' in this context?

Published on 04 Jun 2023 - 12:04

List Question

Is there an algorithm for the satisfiability problem for a specific dictionary

If in the 3 CNF formula I were to replace the ANDs with ORs and ORs with ANDs would the problem still be NP complete?

Express a Differential equation and a contraint as a logical formula

[logic]Give sample of 3-element set M so that M is not satisfiable, but every 2-element subset of M is satisfiable.

What is an efficient way to check if a boolean expression is more specific than another one?

RSA (FACT) to SAT transform complexity

Definition of a model?

How do I show 3-SAT is decidable?

How to understand one of the properties of satisfaction of wfs in first-order logic?

How to perform induction on the number of connectives and quantifiers in a well-formed formula?

Finding solutions to Boolean satisfaction problems

Does quantifier elimination preserve equi-satisfiability or equivalence?

Why is the problem of proving the existence or nonexistence of an algorithm that efficiently solves SAT equivalent to $P = NP$, explained simply?

Satisfiability in an Heyting algebra implies satisfiability in a Boolean algebra for propositional logic?

What's meant by a 'reversible Boolean formula' in this context?

Trending Questions

Popular # Hahtags

Popular Questions