Boolean Satisfiability Solver for Discrete Fracture Network Connectivity

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Computing fracture network connectivity in large discrete fracture networks is time-consuming with conventional methods, which hinders efficient hydrocarbon production decision-making.

Innovation Solution

Transforming the fracture network connectivity problem into a propositional logic formula that can be solved as a Boolean Satisfiability Problem (SAT), using SAT solvers to efficiently determine connected fractures and generate connectivity maps for hydrocarbon production optimization.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If conventional methods are used to compute fracture network connectivity, then the computation is performed using traditional algorithms, but the time required is excessive and hinders efficient decision-making

Engineering Contradiction:

Improvecomputational efficiencyVSAvoidtime required for connectivity computation

Core Design Contradiction:

ProductivityVSLoss of time

Solution Approach 1:

The patent replaces traditional mechanical/computational algorithms with a Boolean satisfiability (SAT) problem formulation. By transforming the fracture connectivity problem into a propositional logic formula and solving it using SAT solvers, the method achieves significantly faster computation times compared to conventional approaches while maintaining accuracy.

Inventive Principle:

Principle #28Mechanics substitution (Replace mechanical system)

2Measurement precision

If detailed fracture network analysis is performed to ensure accurate hydrocarbon production estimates, then the accuracy of production estimates is improved, but the complexity of processing increases

Engineering Contradiction:

Improveaccuracy of hydrocarbon production estimatesVSAvoidcomplexity of processing DFN information

Core Design Contradiction:

Measurement precisionVSDevice complexity

Solution Approach 1:

The patent changes the parameter representation by encoding fracture connectivity relationships as Boolean variables and constraints in a SAT problem. This transformation allows the system to handle complex fracture network data more efficiently, reducing processing complexity while preserving the accuracy needed for reliable hydrocarbon production estimates.

Inventive Principle:

Principle #35Parameter changes

3Ease of operation

If comprehensive fracture connectivity information is computed to enable efficient resource use, then the quality of production decisions is improved, but the computational resources and time required increase

Engineering Contradiction:

Improvequality of production decision-makingVSAvoidtime for processing fracture data

Core Design Contradiction:

Ease of operationVSLoss of time

Solution Approach 1:

The patent substitutes traditional computational methods with a SAT-based approach, transforming the fracture connectivity analysis into a logical problem that can be solved more rapidly. This enables comprehensive fracture connectivity information to be obtained in less time, improving the quality and timeliness of production decisions without excessive computational burden.

Inventive Principle:

Principle #28Mechanics substitution (Replace mechanical system)

Data Source

PatentEP3394389B1Boolean satisfiability problem for discrete fracture network connectivity

Publication Date: 2023.08.02 BAKER HUGHES CO

Figure 1
Figure 2
Figure 3

AI summary

A method for determining a connectivity of at least one fracture to other fractures in an earth formation includes: obtaining connectivity information for each fracture of interest in the earth formation where the connectivity information for each fracture of interest includes connections with other fractures. The method further includes converting the connectivity information for each fracture of interest into a conjunctive normal form and determining the connectivity of the at least one fracture to other fractures by solving the connectivity information for each fracture of interest in the conjunctive normal form using a Boolean Satisfiability problem solver.