Sciweavers

Share
CL
1999
Springer

An execution scheme for interactive problem-solving in concurrent constraint logic programming languages

12 years 1 months ago
An execution scheme for interactive problem-solving in concurrent constraint logic programming languages
Van Emden's incremental queries address the inadequacy of current Prolog-style querying mechanism in most logic programming systems for interactive problem-solving. In the context of constraint logic programming, incremental queries involve adding new constraints or deleting old ones from a query after a solution is found. This paper presents an implementation scheme IQ of incremental queries in Constraint Pandora, which defines a class of non-deterministic concurrent constraint logic programming languages. We use Van Hentenryck and Le Provost's scheme (VHLP-scheme hereafter), a re-execution approach, as a starting point. Re-execution is costly in concurrent languages, in which process creation and inter-process communications are common operations. The main idea of IQ is that the basic trail unwinding operation used in backtracking is more efficient than re-execution in reaching an execution context along a recorded execution path. We modify the conventional trail-unwinding...
Jimmy Ho-Man Lee, Ho-fung Leung
Added 22 Dec 2010
Updated 22 Dec 2010
Type Journal
Year 1999
Where CL
Authors Jimmy Ho-Man Lee, Ho-fung Leung
Comments (0)
books