Declarative problem solving using answer set semantics

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

My dissertation will make the case that answer set semantics can form the basis of powerful, logical NP problem solving tools. The argument is made in two steps. Firstly a logical programming language, AnsPrologCE is proposed and an efficient, parallel implementation is described. This language is then used to solve a variety of diverse real world problems, demonstrating the power and flexibility of this approach. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Brain, M. (2006). Declarative problem solving using answer set semantics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4079 LNCS, pp. 459–460). Springer Verlag. https://doi.org/10.1007/11799573_48

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free