M. Denecker and B. Van Nu#elen. Experiments for integration CLP and abduction. In Proc. Workshop on Constraints, 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....non Herbrand well founded models. One important implication of this is that the computational techniques developed in Abductive Logic Programming can be used to reason on ID logic theories. Experiments with the use of abductive solvers for solving satis ability problems in ID logic are found in [10]. A question is whether extensions of logic programming with two negations and disjunction [15] have a natural embedding in ID logic. I believe the answer is negative. Extensions with two negations t in the view of Logic programming as a sub formalism of autoepistemic logic or default logic. ....

Marc Denecker and Bert Van Nuelen. Experiments for integration CLP and abduction. In Krysztof R. Apt, Antonios C. Kakas, Eric Monfroy, and Francesca Rossi, editors, Workshop on Constraints, pages 1-15. ERCIM/COMPULOG, October 25-27 1999.

....the system, the performance boost up is signi cant. For example reversing a 6 high tower in the blocks world was impossible with the previous versions, now the current system is able to reverse a 65 high tower within one hour. Some more examples can be found in (Pelov, De Mot, Bruynooghe 2000; Denecker Van Nu elen 1999). Acknowledgements Bert Van Nu elen is supported by the GOA LP project at the K.U.Leuven. The SLDNFA system is implemented by the ideas of Marc Denecker, Danny De Schreye and many others. In particular the preprocessor is the work of Emmanuel De Mot. The N queens puzzle In the queens problem, ....

Denecker, M., and Van Nuelen, B. 1999. Experiments for integration CLP and abduction. In Apt, K. R.; Kakas, A. C.; Monfroy, E.; and Rossi, F., eds., Workshop on Constraints, 1-15. ERCIM/COMPULOG.

....abduction in a similar way as in [5] One restriction of ACLP is that integrity constraints need to be of the form a( X) B, where a is an abducible. As we will see, this forces sometimes to reformulate some constraints by an additional recursion. Such restrictions are not present in SLDNFAC [3], a more recent integration of an abductive system with CLP that is based on the more general abductive procedure SLDNFA [2] The SLDNFAC system uses ID Logic [1] as speci cation language which is transformed into an abductive logic program by using a Lloyd Topor transformation. The speci cation ....

....problem(n) The ACLP representation is in the middle of the declarative FOL representation and the more procedural CLP representation. 3 Experiments 3.1 The Systems The nite domain CLP package is the one provided with ECL i PS e version 4.2. Both abductive systems, ACLP [10] and SLDNFAC, [3] are meta interpreters written in Prolog, running on ECL i PS e version 4.2 and making use of its nite domain library. For all these systems, a search strategy which rst selects variables with the smallest domain which participate in the largest number of constraints was used. The model ....

[Article contains additional citation context not shown here]

M. Denecker and B. Van Nuelen. Experiments for integration CLP and abduction. In K. Apt, A. Kakas, E. Monfroy, and F. Rossi, editors, Proceedings of the 1999 ERCIM/COMPULOG Workshop on Constraints, Paphos, Cyprus, Oct. 1999. University of Cyprus.

....are known, the only uncertainty lies in the open predicates. We need to nd an interpretation for these open predicates that is consistent with the theory. In other words, we need to generate a model for the open predicates. To do this we use an existing abductive procedure, called SLDNFA (Denecker and Van Nu elen 1999), which operates on theories written in the knowledge representation language outlined in section 3. Abduction is a form of non monotonic reasoning that is used to explain observations. In this case, an explanation consists of a model for the open predicates. As a trivial example, take the de ....

Denecker, M. and Van Nuelen, B. (1999). Experiments for integration CLP and abduction, in K. R. Apt, A. C. Kakas, E. Monfroy and F. Rossi (eds), Proceedings of the 1999 ERCIM/COMPULOG workshop on Constraints, pp. 1-15.

.... Programming [5] The technology that is used so far for reasoning and problem solving in IDlogic is based on an integration of techniques of abductive logic programming [13] and constraint logic programming techniques [12] The rst published presentation of such a procedure was in [14, 15] [9] describes a similar integration of the abductive resolution method SLDNFA [4] with CLP techniques and presents some experiments in the context of ID logic speci cations of some typical CLPproblems (such as N queens) and of scheduling and planning. In this paper, we de ne an extension of ....

....method SLDNFA [4] with CLP techniques and presents some experiments in the context of ID logic speci cations of some typical CLPproblems (such as N queens) and of scheduling and planning. In this paper, we de ne an extension of ID logic with aggregates, sketch an extension of the solver of [9] to reason on aggregates and describe two computational experiments with the system for solving a sea battle puzzle and a scheduling problem. At the logical level, our work is based on Van Gelders s work [20] on aggregates in the context of well founded semantics. On the other hand the ....

[Article contains additional citation context not shown here]

Marc Denecker and Bert Van Nuelen. Experiments for integration CLP and abduction. In Krysztof R. Apt, Antonios C. Kakas, Eric Monfroy, and Francesca Rossi, editors, Workshop on Constraints, page 15. ERCIM/COMPULOG, October 25-27 1999.

No context found.

M. Denecker and B. Van Nu#elen. Experiments for integration CLP and abduction. In Proc. Workshop on Constraints, 1999.

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