Binary resolution over Boolean lattices (Q853473): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.fss.2006.02.010 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2000732792 / rank | |||
Normal rank | |||
Revision as of 01:20, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Binary resolution over Boolean lattices |
scientific article |
Statements
Binary resolution over Boolean lattices (English)
0 references
15 November 2006
0 references
The author presents a binary resolution system over complete Boolean lattices with the condition that their supremum operators are infinitely distributive over the infimum ones. He utilizes inference techniques developed in classical two-valued logic for many-valued ones. He considers many-valued logics \({\mathbf L}\) whose truth values form a Boolean algebra. He avoids any limitation to the finite case where the set of truth values or a given set of clauses are finite. The refutational soundness and completeness of binary \({\mathbf L}\)-resolution is proved.
0 references
many-valued logics
0 references
resolution proof systems
0 references
automated deduction
0 references
knowledge representation
0 references
