Computer ScienceMathematics

Logic programs with stable model semantics as a constraint programming paradigm

I. Niemelä

1999.2.10ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE

DOI: 10.1023/a:1018930122475

tlooto Summary

It is shown that the novel paradigm embeds classical logical satisfiability and standard (finite domain) constraint satisfaction problems but seems to provide a more expressive framework from a knowledge representation point of view.

Abstract

Abstract is not available.

Citation format

NIEMELÄ, I. Logic programs with stable model semantics as a constraint programming paradigm. ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 1999, 25: 241–273.