M. Denecker and D. De Schreye. Terms in logic programs: a problem with their semantics and its e ect on the programming methodology. The Journal for the Integrated Study of Articial Intelligence, Cognitive Science and Applied Epistemology, 7(3-4):363-383, 1990. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Extending Constraint Logic Programming with Open Functions - Pelov, Bruynooghe (2000) (Correct)
....a list of domain variables holding the positions of the di erent queens, of setting up the constraints between the di erent queens and nally of searching for a solution satisfying the constraints. The level of indirection in the representation results in a much less declarative program (e.g. [8]) It is harder to write, to understand and to maintain than in the case where a solution can be represented as a relation or a function. A typical CLP program for solving the n queens problem (note the double recursion) is as follows: queens(Q,N) generate(Q,N,N) safe(Q) instantiate(Q) ....
M. Denecker and D. De Schreye. Terms in logic programs: a problem with their semantics and its e ect on the programming methodology. The Journal for the Integrated Study of Articial Intelligence, Cognitive Science and Applied Epistemology, 7(3-4):363-383, 1990.
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