...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Theory and Practice of Logic Programming >Model enumeration in propositional circumscription via unsatisfiable core analysis
【24h】

Model enumeration in propositional circumscription via unsatisfiable core analysis

机译：通过不满意的核心分析进行命题限制的模型枚举

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Many practical problems are characterized by a preference relation over admissible solutions, where preferred solutions are minimal in some sense. For example, a preferred diagnosis usually comprises a minimal set of reasons that is sufficient to cause the observed anomaly. Alternatively, a minimal correction subset comprises a minimal set of reasons whose deletion is sufficient to eliminate the observed anomaly. Circumscription formalizes such preference relations by associating propositional theories with minimal models. The resulting enumeration problem is addressed here by means of a new algorithm taking advantage of unsatisfiable core analysis. Empirical evidence of the efficiency of the algorithm is given by comparing the performance of the resulting solver, CIRCUMSCRIPTINO, with HCLASP, CAMUS_MCS, LBX and MCSLS on the enumeration of minimal models for problems originating from practical applications.
机译：许多实际问题的特点是相对于可允许的解决方案具有偏好关系，在某种意义上，首选的解决方案很少。例如，优选的诊断通常包括足以引起所观察到的异常的最小原因集。备选地，最小校正子集包括其删除足以消除所观察到的异常的最小原因集。割礼通过将命题理论与最小模型相关联来形式化这种偏好关系。由此产生的枚举问题在此借助于利用无法满足的核心分析优势的新算法解决。通过比较最终求解器CIRCUMSCRIPTINO与HCLASP，CAMUS_MCS，LBX和MCSLS的性能，对最小模型的枚举（针对源自实际应用的问题）进行比较，给出了算法效率的经验证据。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号