Nikolay Pelov, Emmanuel De Mot, Marc Denecker  Home/Search
Context Related
| cs.kuleuven.ac.be/pub/dta...32258.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.kuleuven.ac.be/~pelov/paper... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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 rst order logic model generators which compute solutions as models of some theory. This paper compares these... (Update)
Context of citations to this paper: More
...semantics. SLDNFA has been applied in experiments with planning and temporal reasoning [16] scheduling and Constraint Satisfaction[67, 101]. The IFF Framework The IFF framework is also based on the completion semantics. It was initially developed as a unifying framework...
...are used to solve similar kinds of problems. At this point, both areas develop di erent technologies to solve these problems. As shown in [32], both technologies may o er complementary advantages and have their own contributions to computation. Synergy between both areas is...
Cited by: More
Constraint Satisfaction Techniques and Software Agents - Monique Calisti And (Correct)
Abduction in Logic Programming - Denecker, Kakas (Correct)
A-System: Problem Solving through Abduction - Van Nuffelen (2001) (Correct)
Active bibliography (related documents): More All
0.7: Problem solving in ID-logic with aggregates: some experiments - Van Nuffelen, Denecker (2000) (Correct)
0.5: A Finite Domain CLP Solver on Top of Mercury - Vandecasteele, Demoen, Janssens (Correct)
0.5: Extending Constraint Logic Programming with Open Functions - Pelov, Bruynooghe (2000) (Correct)
Similar documents based on text: More All
0.4: Translation of Aggregate Programs to Normal Logic Programs - Pelov, Denecker, Bruynooghe (2003) (Correct)
0.4: Semantics of Disjunctive Programs with Monotone Aggregates.. - An Operator-Based Approach (2004) (Correct)
0.4: Partial Stable Models for Logic Programs with Aggregates - Pelov, Denecker, Bruynooghe (2004) (Correct)
Related documents from co-citation: More All
5: Representing Incomplete Knowledge in Abductive Logic Programming - Denecker, de Schreye - 1993
4: The Stable Model Semantics for Logic Programming - Gelfond - 1988
4: Theorist: A Logical Reasoning System for Defaults and Diagnosis (context) - Poole, Goebel et al. - 1987
BibTeX entry: (Update)
Nikolay Pelov, Emmanuel De Mot, and Marc Denecker. Logic programming approaches for representing and solving constraint satisfaction problems : a comparison. 12 In Parigot M. and Voronkov A., editors, Proceedings of the 7th International Conference on Logic for Programming and Automated Reasoning, volume http://citeseer.ist.psu.edu/pelov00logic.html More
@inproceedings{ pelov00logic,
author = "Nikolay Pelov and Emmanuel De Mot and Marc Denecker",
title = "Logic Programming Approaches for Representing and Solving Constraint Satisfaction Problems: A Comparison",
booktitle = "Logic Programming and Automated Reasoning",
pages = "225-239",
year = "2000",
url = "citeseer.ist.psu.edu/pelov00logic.html" }
Citations (may not include all citations):858 The stable model semantics for logic programming - Gelfond, Lifschitz - 1988
473 Foundations of Constraint Satisfaction (context) - Tsang - 1993
214 Constraint Satisfaction in Logic Programming (context) - Van Hentenryck - 1989
212 Abductive logic programming - Kakas, Kowalski et al. - 1992
117 Abduction compared with negation by failure (context) - Eshghi, Kowalski - 1989
113 Constraint logic programming: A survey (context) - Ja, Maher - 1994
90 Stable models and an alternative logic programming paradigm - Marek, Truszczy - 1999
65 Answer set planning - Lifschitz - 1999
46 Logic programs with stable model semantics as a constraint p.. (context) - Niemel - 1999
39 SLDNFA: an abductive procedure for abductive logic programs - Denecker, De Schreye - 1998
37 Integrating abductive and constraint logic programming (context) - Kakas, Michael - 1995
32 The logic of constraint satisfaction (context) - Mackworth - 1992
29 Ecient implementation of the well-founded and stable model s.. (context) - Niemel, Simons - 1996
22 ACLP: Abductive constraint logic programming - Kakas, Michael et al. - 2000
8 Extending classical logic with inductive denitions (context) - Denecker - 2000
6 Experiments for integration CLP and abduction - Denecker, Van Nu - 1999
4 Constraint Logic Programming: Applications and Implementatio.. - Vandecasteele - 1999
4 Constraint propagation in model generation (context) - Zhang, Zhang - 1995
4 Problem solving in ID-logic with aggregates (context) - Van Nu, Denecker - 2000
3 Implementing a nite-domain CLP-language on top of Prolog: a .. (context) - Vandecasteele, De Schreye - 1994
3 A comparison of logic programming approaches for representat.. (context) - Pelov, De Mot et al. - 2000
2 Solving a combinatorial maintenance problem for electrical p.. (context) - Seghers, Bayens - 1996
1 a classical logic specication (context) - Denecker, Vandecasteele et al. - 1997
Documents on the same site (http://www.cs.kuleuven.ac.be/~pelov/papers/): More
Proving Failure of Queries for Definite Logic Programs Using .. - Pelov, Bruynooghe (1999) (Correct)
Towards a More Declarative Language for Solving Finite.. - Bruynooghe, Pelov.. (1999) (Correct)
Extending Constraint Logic Programming with Open Functions - Pelov, Bruynooghe (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC