首页> 美国政府科技报告 >Optimizations in Decision Procedures for Propositional Linear Inequalities
【24h】

Optimizations in Decision Procedures for Propositional Linear Inequalities

机译:命题线性不等式判定程序的优化

获取原文

摘要

Several decision procedures that were published in the last few years for sub-theories of propositional linear inequalities, i.e. a Boolean combination of predicates that belong to the theory, are based on a graph-based analysis of the formula's predicates. The analysis is always based on the predicates while ignoring the Boolean connectives between them. In this note we show how taking this information into account can significantly reduce the (practical) complexity of the decision procedure.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号