Title: Logic programming approaches for representing and solving constraint satisfaction problems A comparison
Authors: Pelov, Nikolay ×
De Mot, Emmanuel
Denecker, Marc #
Issue Date: 2000
Publisher: Springer-verlag berlin
Host Document: Logic for Programming and Automated Reasoning, 7th International Conference, LPAR 2000, Reunion Island, France, November 2000, Proceedings vol:1955 pages:225-239
Conference: 7th International Conference on Logic for Programming and Automated Reasoning location:Reunion Island date:November 6-9, 2000
Abstract: Many logic programming based approaches can be used to describe and solve combinatorial search problems. On the one hand there is constraint logic programming which computes a solution as an answer substitution to a query containing the variables of the constraint satisfaction problem. On the other hand there are systems based on stable model semantics, abductive systems, and first order logic model generators which compute solutions as models of some theory. This paper compares these different approaches from the point of view of knowledge representation (how declarative are the programs) and from the point of view of performance (how good are they at solving typical problems).
ISBN: 3-540-41285-9
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IC
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Status SizeFormat
32258.pdf Published 212KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science