A Comparison of Logic Programming Approaches for Representation and Solving of Constraint Satisfaction Problems

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Many logic programming based approaches can be used to describe and solve combinatorial search problems. On the one hand there are definite programs and constraint logic programs that compute a solution as an answer substitution to a query containing the variables of the constraint satisfaction problem. On the other hand there are approaches based on stable model semantics, abduction, and first-order logic model generation that compute solutions as models of some theory. This paper compares these different approaches from point of view of knowledge representation (how declarative are the programs) and from point of view of performance (how good are they at solving typical problems).
9 pages, 3 figures submitted to NMR 2000, April 9-11, Breckenridge, Colorado

Keywords

Logic in Computer Science, I.2.3: Logic programming, Nonmonotonic reasoning; I.2.4; F.4.1: Logic and constraint programming; Experiments

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/30186

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0003026
 http://arxiv.org/abs/cs/0003026

Collections

arXiv