资源分类
》 资源 》论文》Constraint Answer Set Programming versus Satisfiability Modulo Theories

Constraint Answer Set Programming versus Satisfiability Modulo Theories

2019-11-22 | |  64 |   43 |   0
Abstract Constraint answer set programming is a promising research direction that integrates answer set programming with constraint processing. It is often informally related to the field of Satisfiability Modulo Theories. Yet, the exact formal link is obscured as the terminology and concepts used in these two research areas differ. In this paper, we make the link between these two areas precise.

上一篇：Answering Metaqueries Over Hi(OWL 2 QL) Ontologies

下一篇：Exploring the Context of Locations for Personalized Location Recommendations

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...