Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:digitalcommons.unomaha.edu:compscifacpub-1061

On Relation between Constraint Answer Set Programming and Satisfiability Modulo Theories

Authors
Publication date
1 January 2016
Publisher
DigitalCommons@UNO

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, by connecting these two areas, we begin the cross-fertilization of not only of the theoretical foundations of both areas but also of the existing solving technologies

Similar works

Full text

thumbnail-image

The University of Nebraska, Omaha

redirect
oaioai:digitalcommons.unomaha.edu...
Last time updated on 29/10/2019

This paper was published in The University of Nebraska, Omaha.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.