Nikolay Pelov, Maurice Bruynooghe  Home/Search
Context
Related
| cs.kuleuven.ac.be/pub/dta...31673.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: The natural representation of solutions of finite constraint satisfaction problems is as a (set of) function(s) or relation(s). In (constraint) logic programming, answers are in the form of substitutions to the variables in the query. This results in a not very declarative programming style where a table has to be presented as a complex term. Recently, stable logic programming, also called answer set programming and abductive logic programming have been proposed as approaches supporting a more... (Update)
Active bibliography (related documents): More All
0.5: Logic Programming Approaches for Representing and Solving .. - Pelov, De Mot, Denecker (2000) (Correct)
0.4: Experiments for integration CLP and abduction - Denecker, Van Nuffelen (1999) (Correct)
0.4: ACLP: Integrating Abduction and Constraint Solving - Kakas (2000) (Correct)
Similar documents based on text: More All
0.6: Translation of Aggregate Programs to Normal Logic Programs - Pelov, Denecker, Bruynooghe (2003) (Correct)
0.5: Partial Stable Models for Logic Programs with Aggregates - Pelov, Denecker, Bruynooghe (2004) (Correct)
0.4: Semantics of Disjunctive Programs with Monotone Aggregates.. - An Operator-Based Approach (2004) (Correct)
BibTeX entry: (Update)
@inproceedings{ pelov00extending,
author = "Nikolay Pelov and Maurice Bruynooghe",
title = "Extending constraint logic programming with open functions",
booktitle = "Principles and Practice of Declarative Programming",
pages = "235-244",
year = "2000",
url = "citeseer.ist.psu.edu/pelov00extending.html" }
Citations (may not include all citations):759 Negation as failure (context) - Clark - 1978
473 Foundations of Constraint Satisfaction (context) - Tsang - 1993
234 The well-founded semantics for general logic programs - Van Gelder, Ross et al. - 1991
221 Constraint logic programming (context) - Ja, Lassez - 1987
174 A Kripke-Kleene semantics for logic programs (context) - Fitting - 1985
142 Tabled evaluation with delaying for general logic programs - Chen, Warren - 1996
113 Constraint logic programming: A survey (context) - Ja, Maher - 1994
90 Stable models and an alternative logic programming paradigm - Marek, Truszczy - 1999
88 Abductive planning with event calculus (context) - Eshghi - 1988
88 Generalized stable models: A semantics for abduction (context) - Kakas, Mancarella - 1990
77 Constructive negation for constraint logic programming (context) - Stuckey - 1991
66 The role of abduction in logic programming - Kakas, Kowalski et al. - 1998
65 Answer set planning - Lifschitz - 1999
46 Logic programs with stable model semantics as a constraint p.. (context) - Niemel - 1999
44 The stable semantics for logic programs (context) - Gelfond, Lifschitz - 1988
39 SLDNFA: an abductive procedure for abductive logic programs - Denecker, De Schreye - 1998
37 Integrating abductive and constraint logic programming (context) - Kakas, Michael - 1995
29 Ecient implementation of the well-founded and stable model s.. (context) - Niemel, Simons - 1996
27 XSB as an ecient deductive database engine (context) - Sagonas, Swift et al. - 1994
26 A terminological interpretation (context) - Denecker - 1995
23 Action languages - Lifschitz - 1999
22 Algebraic specication (context) - Wirsing - 1990
22 ACLP: Abductive constraint logic programming - Kakas, Michael et al. - 2000
22 Planning as satisability (context) - Kautz, Selman - 1992
19 Solving a cutting-stock problem in constraint logic programm.. (context) - Dincbas, Simonis et al. - 1988
18 The well-founded semantics is the principle of inductive den.. - Denecker - 1998
15 ACLP: Flexible solutions to complex problems - Kakas, Mourlas - 1997
12 Equations and inequations on nite and innite trees (context) - Colmerauer - 1984
9 Equational problems and disunication (context) - Comon, Lescanne - 1989
8 A new denition of SLDNF-resolution (context) - Apt, Doets - 1994
4 proof procedure for abductive logic programming (context) - Fung, Kowalski - 1997
4 Functional constraints in CLP languages (context) - Hickey - 1993
3 Denite relations over constraint languages (context) - ohfeld, Smolka - 1988
3 A comparison of logic programming approaches for representat.. (context) - Pelov, De Mot et al. - 2000
1 Terms in logic programs: a problem with their semantics and .. (context) - Denecker, De Schreye - 1990
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)
Logic Programming Approaches for Representing and Solving .. - Pelov, De Mot, Denecker (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