首页> 外国专利> Solving the Boolean Formula Feasibility Problem for Determining the Connectivity of a Discrete Crack Network

Solving the Boolean Formula Feasibility Problem for Determining the Connectivity of a Discrete Crack Network

机译:确定布尔裂纹网络连通性的布尔公式可行性问题的求解

摘要

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.
机译:一种用于确定地层中至少一个裂缝与其他裂缝的连通性的方法,包括:获得针对地层中每个感兴趣的裂缝的连通性信息,其中,每个感兴趣的裂缝的连通性信息包括与其他裂缝的连通性。该方法还包括将每个关注的骨折的连通性信息转换为合取正态形式,并通过使用布尔可满足性来求解结膜正常形式的每个感兴趣的骨折的连通性信息,从而确定至少一个骨折与其他骨折的连通性问题解决。

著录项

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号