Logical Consistency Satisfiable-Assignment Finder
Find common satisfying rows of complete premise truth columns encoded as 0/1 strings in the same valuation order.
Description
A set of propositions is consistent when at least one assignment makes them all true.
A set of propositions is consistent when at least one assignment makes them all true. Joint satisfiability depends on the same row assignment being used in every column.1
The tool returns consistent, satisfyingRows. Interpret the result under the rule and assumptions below; an encoded premise’s truth is not independently established.
When to use Logical Consistency Satisfiable-Assignment Finder
Use this for the following task: Find common satisfying rows of complete premise truth columns encoded as 0/1 strings in the same valuation order. Prepare the specified logical encoding before running the check or transformation.
How to use Logical Consistency Satisfiable-Assignment Finder and understand its results
- Prepare the requested Boolean values, complete truth-table rows, or identifier atoms. An atom is a name such as p or premise_1, not a natural-language sentence.
- Enter columns according to the field table, then run the tool.
- Read consistent, satisfyingRows. Use the matching rule, assignment order or nonempty-class assumptions below to interpret the result.
- For a false check, inspect the supplied encoding and matching rule. A well-formed false result is different from an input error.
| Input field | Meaning | Value type and bounds | Requirement |
|---|---|---|---|
| columns | Premise truth columns | list of string; minimum entries 1; maximum entries 100; each entry: maximum text length 4096; pattern ^[01]+$(?![\s\S]) | Required |
Supply 1..100 binary-string columns with equal positive power-of-two length, at most 4096 characters each. Collect zero-based rows with all ones and report whether that list is nonempty.
satisfying rows = rows where every column has bit 1 The symbols and boundary conditions refer to the supplied fields and the implementation described above.
| Output field | Meaning | Value type |
|---|---|---|
| consistent | Jointly satisfiable | boolean |
| satisfyingRows | Zero-based satisfying row indices | list of integer |
{
"input": {
"columns": [
"0111",
"1101"
]
},
"output": {
"consistent": true,
"satisfyingRows": [
1,
3
]
}
}Limitations and assumptions
Only the supplied table is searched. Columns must use the same assignment order; this is not a general symbolic SAT solver.
The supplied encodings must represent the intended propositions or classes. No natural-language parsing or assessment of empirical premise truth is performed. Malformed input gives a tool error rather than a logical false result.
Alternative or Complementary methods
Choose Contingency Mixed-Outcome Classifier when you need its operation: Classify a complete ordered Boolean truth column as a tautology, contradiction, or contingency. Choose Full DNF Minterm List Builder from Truth Table for the complementary operation: Build canonical DNF minterms and their indices from true rows in binary counting order.
Background reference: Complete truth tables.
References
-
Complete truth tables — forallx Calgary, Open Logic Project
Similar or alternative tools
- Contingency Mixed-Outcome Classifier
Classify a complete ordered Boolean truth column as a tautology, contradiction, or contingency.
- Full DNF Minterm List Builder from Truth Table
Build canonical DNF minterms and their indices from true rows in binary counting order.