On relation between constraint answer set programming and satisfiability modulo theories*

Publisher： Cambridge University Press

E-ISSN： 1475-3081|17|4|559-590

ISSN： 1471-0684

Source： Theory and Practice of Logic Programming, Vol.17, Iss.4, 2017-07, pp. : 559-590

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Non-monotonic spatial reasoning with answer set programming modulo theories* †

By  

Theory and Practice of Logic Programming, Vol. 17, Iss. 2, 2017-03 ,pp. : 205-225

Cambridge University Press

Access to resources Recommend Favorite

Achievements in answer set programming*

By  

Theory and Practice of Logic Programming, Vol. 17, Iss. 5-6, 2017-09 ,pp. : 961-973

Cambridge University Press

Access to resources Recommend Favorite

Hybrid conditional planning using answer set programming

By  

Theory and Practice of Logic Programming, Vol. 17, Iss. 5-6, 2017-09 ,pp. : 1027-1047

Cambridge University Press

Access to resources Recommend Favorite

Constraint answer set solver EZCSP and why integration schemas matter

By  

Theory and Practice of Logic Programming, Vol. 17, Iss. 4, 2017-07 ,pp. : 462-515

Cambridge University Press

Access to resources Recommend Favorite

When you must forget: Beyond strong persistence when forgetting in answer set programming*

By  

Theory and Practice of Logic Programming, Vol. 17, Iss. 5-6, 2017-09 ,pp. : 837-854

Cambridge University Press

Access to resources Recommend Favorite