首页> 外文会议>IEEE International Conference on Information Visualization >A general approach to constraint solving for declarative modeling domain
【24h】

A general approach to constraint solving for declarative modeling domain

机译:对声明建模域的约束求解的一般方法

获取原文

摘要

Research in declarative modeling started some years ago, and important progress has been accomplished and different orientations have been studied. However, some fundamental problems are not exhaustively explored: the role of constraint solvers in maintaining the scene; detecting the incoherence and contradictions between constraints; reducing the number of generated solutions by dynamically adding new constraints. Our main contribution concerns declarative modeling with constraints. We have developed a constraint solver called ORANOS that offers an extended model of constraint satisfaction problems. The solver supports two independent domains of artificial intelligence research: hierarchical constraints and dynamical constraints. The former offers efficient solving techniques for over-constrained problems; the latter allows development of interactive applications. These essential features allow the solver to extend the range of declarative modeling applications.
机译:几年前开始宣言建模研究,实现了重要进展,已经研究了不同的取向。但是,探索了一些基本问题:约束求解器在维护现场的作用;检测约束之间的不一致和矛盾;通过动态添加新约束来减少生成的解决方案的数量。我们主要贡献涉及与约束的陈述建模。我们开发了一个称为oranos的约束解算器,提供了一个延长的约束满足问题模型。求解器支持两个人工智能研究的两个独立域:分层约束和动态约束。前者提供了高效的求解技术,用于过度约束的问题;后者允许开发交互式应用程序。这些基本功能允许求解器扩展声明性建模应用的范围。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号