Paradox separation deductive reasoning method based on extended triangle in propositional logic
A technology of propositional logic and reasoning method, applied in the direction of reasoning method, etc., can solve the problems that the ability and efficiency cannot meet the objective needs, cannot reflect the cooperative logical relationship of multiple clauses, and the clause set S cannot be satisfied, etc.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0063] Let clause set S={C in propositional logic 1 ,C 2 ,C 3 ,C 4 ,C 5 ,C 6 ,C 7 ,C 8 ,C 9 ,C 10}, C 1 = 1, C 2 = 2, C 3 =~1∨~2∨3, C 4 =~1∨4, C 5 =~4∨5,C 6 =~3∨~5,C 7 =~3∨7, C 8 =~5∨~7,C 9 =~3∨~4, C 10 =~2∨~7; wherein 1, 2, 3, 4, 5, 6, 7 are proposition variables. For the clause set S, there are two deduction based on the extended triangle method as follows.
[0064] Approach 1: Select clause C 1 ,C 2 ,C 3 ,C 7 ,C 10 , from these clauses construct the extended triangular contradiction in,
[0065]
[0066] The corresponding contradictory separation formula is an empty clause.
[0067] Approach 2: Select clause C 1 ,C 2 ,C 3 ,C 4 ,C 5 ,C 6 , from these clauses construct the extended triangular contradiction in,
[0068]
[0069] The corresponding contradictory separation formula is an empty clause.
[0070] The above two methods can obtain an extended triangle with no words above the main boundary line, that is, the separation of cont...
Embodiment 2
[0072] Let clause set S={C in propositional logic 1 ,C 2 ,C 3 ,C 4 ,C 5 ,C 6 ,C 7}, C1 =~3∨~7,C 2 =2∨3∨5∨~6,C 3 =1∨~2∨5∨~7,C 4 =1∨3∨~5,C 5 =3∨4∨6,C 6 =~1∨3,C 7 =7; 1, 2, 3, 4, 5, 6, 7 are propositional variables. For the clause set S, the following extended triangle can be constructed.
[0073] Practice: select clause C 1 ,C 2 ,C 3 ,C 4 ,C 5 ,C 6 ,C 7 , from these clauses construct the extended triangular contradiction in,
[0074]
[0075] The corresponding contradictory separation formula is
[0076] because And all the clauses in S are used in the construction of the extended triangular contradiction, so it can be concluded that the clause set S is satisfiable, and a satisfiable example of S is obtained: ~3, ~6, ~2, ~5,4, ~1,7.
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com