Automatic reasoning method based on maximum contradiction in propositional logic
A propositional logic and automatic reasoning technology, applied in the direction of reasoning methods, etc., can solve the problem that the clause set S is not satisfied, cannot reflect the cooperative logical relationship of multiple clauses, restricts the ability and efficiency of automatic reasoning, etc., and achieves great flexibility and ability. Strong and targeted effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Examples
example 1
[0036] Example 1 Let S={C 1 ,C 2 ,C 3 ,C 4 ,C 5 ,C 6} is a clause set in propositional logic, where, C 1 = l 1 ∨ l 2 , C 2 = l 2 ∨ l 3 , C 3 = l 3 ∨ l 4 , C 4 =~l 3 ∨~l 1 , C 5 =~l 4 ∨~l 2 , C 6 =~l 2 ∨~l 3 , l 1 , l 2 , l 3 , l 4 is a propositional variable. Please use the automatic deductive reasoning method based on maximum contradiction separation to determine the attributes of S.
[0037] (1) For the clause set S:
[0038] Step 1: Use variable l 1 , l 2 , l 3 Generate the largest contradiction S(l 1 , l 2 , l 3 ):
[0039] l 1 ∨l 2 ∨l 3
[0040] l 1 ∨ l 2 ∨~l 3
[0041] l 1 ∨~l 2 ∨ l 3
[0042] l 1 ∨~l 2 ∨~l 3
[0043] ~ l 1 ∨l 2 ∨l 3
[0044] ~ l 1 ∨l 2 ∨~l 3
[0045] ~ l 1 ∨~l 2 ∨ l 3
[0046] ~ l 1 ∨~l 2 ∨~l 3
[0047] The second step: according to the clause set S(l 1 , l 2 , l 3 ) with clause C 1 ,C 2 ,C 3 ,C 4 ,C 6 Contradiction C can be obtained 1 - ∧C 2 - ∧C 3 - ∧C 4 - ∧C 6 - ,in, ...
example 2
[0095] Example 2 Let S={C 1 ,C 2 ,C 3 ,C 4 ,C 5 ,C 6} is a clause set in propositional logic, where, C 1 = l 1 ∨ l 2 , C 2 = l 2 ∨ l 3 , C 3 =~l 3 ∨~l 1 , C 4 =~l 2 , C 5 =~l 2 ∨~l 3 , l 1 , l 2 , l 3 is a propositional variable. Please use the automatic deductive reasoning method based on maximum contradiction separation to determine the attributes of S.
[0096] (1) For the clause set S:
[0097] Step 1: Use variable l 2 , l 3 Generate the largest contradiction S(l 2 , l 3 ):
[0098] l 2 ∨ l 3
[0099] l 2 ∨~l 3
[0100] ~ l 2 ∨l 3
[0101] ~ l 2 ∨~l 3
[0102] The second step: according to the clause set S(l 2 , l 3 ) with clause C 2 ,C 3 ,C 4 ,C 5 The contradictory separation formula R=C can be obtained 2 + ∨C 3 + ∨C 4 + ∨C 5 + =~l 1 .
[0103] The third step: From the second step, we know that R≠φ, and there is no artificial stop condition, let C 6 =R=~l 1 , the C 7 Join S to get a new set of clauses S 1 .
[01...
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