Paradox separation-based multi-element dynamic automatic deductive reasoning method in first-order logic
A technology of automatic deduction and reasoning method, applied in the direction of reasoning method, etc., can solve the problems that restrict the ability and efficiency of automatic deduction and reasoning
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Examples
example 1
[0035] Example 1 Let S={C 1 ,C 2 ,...,C 5} is a set of clauses in first-order logic, where,
[0036] C 1 =P 1 (f 1 (x 11 ),x 11 ,a 1 ), C 2 =P 1 (a 1 ,x 21 ,x 21 ),
[0037] C 3 =~P 1 (x 31 ,x 32 ,x 35 )∨~P 1 (x 32 ,x 33 ,x 36 )∨~P 1 (x 35 ,x 33 ,x 34 )∨P 1 (x 31 ,x 36 ,x 34 ),
[0038] C 4 =~P 1 (x 41 ,x 42 ,x 45 )∨~P 1 (x 42 ,x 43 ,x 46 )∨~P 1 (x 41 ,x 46 ,x 44 )∨P 1 (x 45 ,x 43 ,x 44 ),
[0039] C 5 =~P 1 (a 2 ,a 1 ,a 2 ),
[0040] a 1 ,a 2 is constant, x 11 ,x 21 ,x 31 ,x 32 ,x 33 ,x 34 ,x 35 ,x 36 ,x 41 ,x 42 ,x 43 ,x 44 ,x 45 ,x 46 is the variable. The attributes of S are judged by the automatic deductive reasoning method based on the separation of contradictions.
[0041] (1) For the clause set S:
[0042] Step 1: For clause C 2 ,C 4 ,C 5 Substitute θ and merge the same text to get the standard contradiction C 2 θ- ∧C 4 θ- ∧C 5 θ- ,in,
[0043] C 2 θ- =P 1 (a 1 ,a 1 ,a 1 ),
[0044...
example 2
[0065] Example 2 Let S={C 1 ,C 2 ,...,C 5} is a set of clauses in first-order logic, where,
[0066] C 1 =P 1 (f 1 (x 11 ),x 11 ,a 1 ), C 2 =P 1 (a 1 ,x 21 ,x 21 ),
[0067] C 3 =~P 1 (x 31 ,x 32 ,x 35 )∨~P 1 (x 32 ,x 33 ,x 36 )∨~P 1 (x 35 ,x 33 ,x 34 )∨P 1 (x 31 ,x 36 ,x 34 ),
[0068] C 4 =~P 1 (x 41 ,x 42 ,x 45 )∨~P 1 (x 42 ,x 43 ,x 46 )∨~P 1 (x 41 ,x 46 ,x 44 )∨P 1 (x 45 ,x 43 ,x 44 ),
[0069] C 5 =~P 1 (a 2 ,a 1 ,a 2 ),
[0070] a 1 ,a 2 is constant, x 11 ,x 21 ,x 31 ,x 32 ,x 33 ,x 34 ,x 35 ,x 36 ,x 41 ,x 42 ,x 43 ,x 44 ,x 45 ,x 46 is the variable. Use the automatic deductive reasoning method based on the separation of contradictions to determine the attributes of S, and the number of separations of contradictions should not exceed 2 times.
[0071] It can be seen from Example 1 that it is unsatisfactory to obtain S after four times of contradiction separation. Obviously, it is impossible to determi...
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