Chapter 9 Relational Programming “Toward the end of the thirteenth century, Ram´on Llull (Raimundo Lulio or Raymond Lully) invented the thinking machine. [ ] The circumstances and objectives of this machine no longer interest us, but its guiding principle–the methodical application of chance to the resolution of a problem–still does.” –Ram´on Llull’s Thinking Machine, Jorge Luis Borges (1899–1986) “In retrospect it can now be said that the ars magna Lulli was the first seed of what is now called “symbolic logic,” but it took a long time until the seed brought fruit, this particular fruit.” – Postscript to the “Universal Library”, Willy Ley (1957) A procedure in the declarative model uses its input arguments to calculate the values of its output arguments. This is a functional calculation, in the math- ematical sense: the outputs are functions of the inputs. For a given set of input argument values, there is only one set of output argument values. We can gen- eralize this to become relational. A relational procedure is more flexible in two ways than a functional procedure. First, there can be any number of results to a call, either zero (no results), one, or more. Second, which arguments are inputs and which are outputs can be different for each call. This flexibility makes relational programming well-suited for databases and parsers, in particular for difficult cases such as deductive databases and parsing ambiguous grammars. It can also be used to enumerate solutions to complex combinatoric problems. We have used it to automatically generate diagnostics for a RISC microprocessor, the VLSI-BAM [84, 193]. The diagnostics enumerate all possible instruction sequences that use register forwarding. Relational pro- gramming has also been used in artificial intelligence applications such as David Warren’s venerable WARPLAN planner [39]. From the programmer’s point of view, relational programming extends declar- ative programming with a new kind of statement called “choice”. Conceptually, the choice statement nondeterministically picks one among a set of alternatives. Copyright c  2001-3 by P. Van Roy and S. Haridi. All rights reserved. 634 Relational Programming During execution, the choice is implemented with search, which enumerates the possible answers. We call this don’t know nondeterminism, although the search algorithm is almost always deterministic. Introducing a choice statement is an old idea. E. W. Elcock [52] used it in 1967 in the Absys language and Floyd [53] used it in the same year. The Prolog language uses a choice operation as the heart of its execution model, which was defined in 1972 [40]. Floyd gives a lucid account of the choice operation. He first extends a simple Algol-like language with a function called choice(n),which returns an integer from 1 to n. He then shows how to implement a depth-first search strategy using flow charts to give the operational semantics of the extended language. Watch out for efficiency The flexibility of relational programming has a reverse side. It can easily lead to highly inefficient programs, if not used properly. This cannot be avoided in general since each new choice operation multiplies the size of the search space by the number of alternatives. The search space is the set of candidate solutions to a problem. This means the size is exponential in the number of choice operations. However, relational programming is sometimes practical: • When the search space is small. This is typically the case for database applications. Another example is the above-mentioned VLSI-BAM diagnos- tics generator, which generated all combinations of instructions for register forwarding, condition bit forwarding, and branches in branch delay slots. This gave a total of about 70,000 lines of VLSI-BAM assembly language code. This was small enough to be used as input to the gate-level simula- tor. • As an exploratory tool. If used on small examples, relational program- ming can give results even if it is impractical for bigger examples. The advantage is that the programs can be much shorter and easier to write: no algorithm has to be devised since search is a brute force technique that avoids the need for algorithms. This is an example of nonalgorithmic pro- gramming. This kind of exploration gives insight into the problem structure. This insight is often sufficient to design an efficient algorithm. To use search in other cases, more sophisticated techniques are needed, e.g., pow- erful constraint-solving algorithms, optimizations based on the problem structure, and search heuristics. We leave these until Chapter 12. The present chapter studies the use of nondeterministic programming as a tool for the two classes of problems for which it works well. For more information and techniques, we rec- ommend any good book on Prolog, which has good support for nondeterministic programming [182, 39]. Copyright c  2001-3 by P. Van Roy and S. Haridi. All rights reserved. 9.1 The relational computation model 635 s ::= skip Empty statement |s 1 s 2 Statement sequence | local x in s end Variable creation |x 1 =x 2 Variable-variable binding |x=v Value creation | if x then s 1 else s 2 end Conditional | case x of pattern then s 1 else s 2 end Pattern matching | {xy 1 y n } Procedure application | choice s 1 [] [] s n end Choice | fail Failure Table 9.1: The relational kernel language Structure of the chapter The chapter consists of four parts: • Section 9.1 explains the basic concepts of the relational computation model, namely choice and encapsulated search. Section 9.2 continues with some more examples to introduce programming in the model. • Section 9.3 introduces logic and logic programming. It introduces a new kind of semantics for programs, the logical semantics. It then explains how both the declarative and relational computation models are doing logic programming. • Sections 9.4–9.6 give large examples in three areas that are particularly well-suited to relational programming, namely natural language parsing, interpreters, and deductive databases. • Section 9.7 gives an introduction to Prolog, a programming language based on relational programming. Prolog was originally designed for natural lan- guage processing, but has become one of the main programming languages in all areas that require symbolic programming. 9.1 The relational computation model 9.1.1 The choice and fail statements The relational computation model extends the declarative model with two new statements, choice and fail: Copyright c  2001-3 by P. Van Roy and S. Haridi. All rights reserved. 636 Relational Programming • The choice statement groups together a set of alternative statements. Ex- ecuting a choice statement provisionally picks one of these alternatives. If the alternative is found to be wrong later on, then another one is picked. • The fail statement indicates that the current alternative is wrong. A fail is executed implicitly when trying to bind two incompatible values, for example 3=4. This is a modification of the declarative model, which raises an exception in that case. Section 2.7.2 explains the binding algorithm in detail for all partial values. Table 9.1 shows the relational kernel language. An example for clothing design Here is a simple example of a relational program that might interest a clothing designer: fun {Soft} choice beige [] coral end end fun {Hard} choice mauve [] ochre end end proc {Contrast C1 C2} choice C1={Soft} C2={Hard} [] C1={Hard} C2={Soft} end end fun {Suit} Shirt Pants Socks in {Contrast Shirt Pants} {Contrast Pants Socks} if Shirt==Socks then fail end suit(Shirt Pants Socks) end This program is intended to help a clothing designer pick colors for a man’s casual suit. Soft picks a soft color and Hard picks a hard color. Contrast picks a pair of contrasting colors (one soft and one hard). Suit returns a complete set including shirt, pants, and socks such that adjacent garments are in contrasting colors and such that shirt and socks are of different colors. 9.1.2 Search tree A relational program is executed sequentially. The choice statements are exe- cuted in the order that they are encountered during execution. When a choice is first executed, its first alternative is picked. When a fail is executed, exe- cution “backs up” to the most recent choice statement, which picks its next alternative. If there are none, then the next most recent choice picks another alternative, and so forth. Each choice statement picks alternatives in order from left to right. Copyright c  2001-3 by P. Van Roy and S. Haridi. All rights reserved. 9.1 The relational computation model 637 Shirt=beige Pants=ochre Shirt=beige Pants=mauve Shirt=coral Pants=mauve Shirt=coral Pants=ochre Pants={Hard} Shirt=beige Pants={Hard} Shirt=coral Pants={Hard} Shirt={Soft} {Suit} Shirt={Hard} Pants={Soft} Pants={Soft} Socks={Hard} Pants=mauve Shirt=beige Pants={Hard} Socks={Soft} Shirt=beige Pants=mauve Shirt=beige Shirt=beige Pants=mauve Shirt=beige Pants=mauve Pants=beige Socks={Hard} Shirt=beige Pants=mauve Pants=coral Socks={Hard} (fail) (fail) Pants=mauve Pants=ochrePants=mauve Socks={Soft} Socks={Soft} Shirt=beige Pants=mauve Socks=coral Shirt\=Socks Shirt=beige Pants=mauve Socks=beige Shirt\=Socks (fail) ( fail )( succeed ) choice choice choice choice choice choice choice Figure 9.1: Search tree for the clothing design example This execution strategy can be illustrated with a tree called the search tree. Each node in the search tree corresponds to a choice statement and each subtree corresponds to one of the alternatives. Figure 9.1 shows part of the search tree for the clothing design example. Each path in the tree corresponds to one possible execution of the program. The path can lead either to no solution (marked “fail”) or to a solution (marked “succeed”). The search tree shows all paths at a glance, including both the failed and successful ones. 9.1.3 Encapsulated search A relational program is interesting because it can potentially execute in many different ways, depending on the choices it makes. We would like to control which choices are made and when they are made. For example, we would like to specify the search strategy: depth-first search, breadth-first search, or some other strategy. We would like to specify how many solutions are calculated: just one solution, all solutions right away, or new solutions on demand. Briefly, we would like the same relational program to be executed in many different ways. One way to exercise this control is to execute the relational program with encapsulated search. Encapsulation means that the relational program runs inside a kind of “environment”. The environment controls which choices are made by the relational program and when they are made. The environment also protects the rest of the application from the effects of the choices. This is important Copyright c  2001-3 by P. Van Roy and S. Haridi. All rights reserved. 638 Relational Programming because the relational program can do multiple bindings of the same variable when different choices are made. These multiple bindings should not be visible to the rest of the application. Encapsulated search is important also for modularity and compositionality: • For modularity: with encapsulated search there can be more than one re- lational program running concurrently. Since each is encapsulated, they do not interfere with each other (except that they can influence each oth- er’s performance because they share the same computational resources). They can be used in a program that communicates with the external world, without interfering with that communication. • For compositionality: an encapsulated search can run inside another encap- sulated search. Because of encapsulation, this is perfectly well-defined. Early logic languages with search such as Prolog have global backtracking, in which multiple bindings are visible everywhere. This is bad for program mod- ularity and compositionality. To be fair to Prolog, it has a limited form of en- capsulated search, the bagof/3 and setof/3 operations. This is explained in Section 9.7. 9.1.4 The Solve function We provide encapsulated search by adding one function, Solve,tothecom- putation model. The call {Solve F} is given a zero-argument function F (or equivalently, a one-argument procedure) that returns a solution to a relational program. The call returns a lazy list of all solutions, ordered according to a depth-first search strategy. For example, the call: L={Solve fun {$} choice 1[]2[]3end end} returns the lazy list [123]. Because Solve is lazy, it only calculates the solutions that are needed. Solve is compositional, i.e., it can be nested: the function F can contain calls to Solve.UsingSolve as a basic operation, we can define both one-solution and all-solutions search. To get one-solution search, we look at just the first element of the list and never look at the rest: fun {SolveOne F} L={Solve F} in if L==nil then nil else [L.1] end end This returns either a list [X] containing the first solution X or nil if there are no solutions. To get all-solutions search, we look at the whole list: fun {SolveAll F} L={Solve F} proc {TouchAll L} Copyright c  2001-3 by P. Van Roy and S. Haridi. All rights reserved. 9.2 Further examples 639 if L==nil then skip else {TouchAll L.2} end end in {TouchAll L} L end This returns a list of all solutions. Computation spaces We have introduced choice and fail statements and the Solve function. These new operations can be programmed by extending the declarative model with just one new concept, the computation space. Computation spaces are part of the constraint-based computation model, which is explained in Chapter 12. They were originally designed for constraint programming, a powerful generalization of relational programming. Chapter 12 explains how to implement choice, fail, and Solve in terms of computation spaces. The definition of Solve is also given in the supplements file on the book’s Web site. Solving the clothing design example Let us use Solve to find answers to the clothing design example. To find all solutions, we do the following query: {Browse {SolveAll Suit}} This displays a list of the eight solutions: [suit(beige mauve coral) suit(beige ochre coral) suit(coral mauve beige) suit(coral ochre beige) suit(mauve beige ochre) suit(mauve coral ochre) suit(ochre beige mauve) suit(ochre coral mauve)] Figure 9.1 gives enough of the search tree to show how the first solution suit(beige mauve coral) is obtained. 9.2 Further examples We give some simple examples to show how to program in the relational compu- tation model. 9.2.1 Numeric examples Let us show some simple examples using numbers, to show how to program with the relational computation model. Here is a program that uses choice to count from 0 to 9: Copyright c  2001-3 by P. Van Roy and S. Haridi. All rights reserved. 640 Relational Programming 96 97 98 99 {Digit} {Digit} (second digit) (first digit) 0 1 2 3 4 Figure 9.2: Two digit counting with depth-first search fun {Digit} choice 0[]1[]2[]3[]4[]5[]6[]7[]8[]9end end {Browse {SolveAll Digit}} This displays: [0123456789] (Note that the zero-argument function Digit is the same as a one-argument procedure.) We can combine calls to Digit to count with more than one digit: fun {TwoDigit} 10*{Digit}+{Digit} end {Browse {SolveAll TwoDigit}} This displays: [01234567891011121314 9899] This shows what it means to do a depth-first search: when two choices are done, the program first makes the first choice and then makes the second. Here the func- tion chooses first the tens digit and then the ones digit. Changing the definition of TwoDigit to choose digits in the opposite order will give unusual results: fun {StrangeTwoDigit} {Digit}+10*{Digit} end {Browse {SolveAll StrangeTwoDigit}} This displays: [0 10 20 30 40 50 60 70 80 90 1 11 21 31 41 89 99] In this case, the tens digit is chosen second and therefore changes quicker than the ones digit. Copyright c  2001-3 by P. Van Roy and S. Haridi. All rights reserved. 9.2 Further examples 641 Palindrome product problem Using Digit, we can already solve some interesting puzzles, like the “palindrome product” problem. We would like to find all four-digit palindromes that are prod- ucts of two-digit numbers. A palindrome is a number that reads the same forwards and backwards, when written in decimal notation. The following program solves the puzzle: proc {Palindrome ?X} X=(10*{Digit}+{Digit})*(10*{Digit}+{Digit}) % Generate (X>0)=true % Test 1 (X>=1000)=true % Test 2 (X div 1000) mod 10 = (X div 1) mod 10 % Test 3 (X div 100) mod 10=(Xdiv 10) mod 10 % Test 4 end {Browse {SolveAll Palindrome}} This displays all 118 palindrome products. Why do we have to write the condition X>0 as (X>0)=true? If the condition returns false, then the attempted binding false=true will fail. This ensures the relational program will fail when the condition is false. Palindrome product is an example of a generate-and-test program: it generates a set of possibilities and then it uses tests to filter out the bad ones. The tests use unification failure to reject bad alternatives. Generate-and-test is a very naive way to explore a search space. It generates all the possibilities first and only filters out the bad ones afterwards. In palindrome product, 10000 possibilities are generated. Chapter 12 introduces a much better way to explore a search space, called propagate-and-search. This approach does the filtering during the generation, so that many fewer possibilities are generated. If we extend palindrome product to 6-digit numbers then the naive solution takes 45 seconds. 1 The propagate- and-search solution of Chapter 12 takes less than 0.4 second to solve the same problem. 9.2.2 Puzzles and the n-queens problem The n-queens problem is an example of a combinatoric puzzle. This kind of puzzle can be easily specified in relational programming. The resulting solution is not very efficient; for more efficiency we recommend using constraint programming instead, as explained in Chapter 12. Using relational programming is a precursor to constraint programming. The problem is to place n queens on an n × n chessboard so that no queen attacks another. There are many ways to solve this problem. The solution given in Figure 9.4 is noteworthy because it uses dataflow variables. We can get the 1 On a 500 MHz Pentium III processor running Mozart 1.1.0. Copyright c  2001-3 by P. Van Roy and S. Haridi. All rights reserved. 642 Relational Programming Cs (columns) Us Ds (down diagonals)(up diagonals) Figure 9.3: The n-queens problem (when n =4) first solution of an 8-queens problem as follows: {Browse {SolveOne fun {$} {Queens 8} end}} This uses higher-order programming to define a zero-argument function from the one-argument function Queens. The answer displayed is: [[17582463]] This list gives the placement of the queens on the chessboard. It assumes there is one queen per column. The solution lists the eight columns and gives for each column the queen’s position (first square of first column, seventh square of second column, etc.). How many solutions are there to the 8-queens problem (counting reflections and rotations as separate)? This is easy to calculate: {Browse {Length {SolveAll fun {$} {Queens 8} end}}} This displays the number 92, which is the answer. Queens is not the best possible program for solving the n-queens problem. It is not practical for large n.Much better programs can be gotten by using constraint programming or by design- ing specialized algorithms (which amounts almost to the same thing). But this program is simple and elegant. How does this magical program work? We explain it by means of Figure 9.3. Each column, up diagonal, and down diagonal has one dataflow variable. The lists Cs, Us,andDs contain all the column variables, up variables, and down variables, respectively. Each column variable “guards” a column, and similarly Copyright c  2001-3 by P. Van Roy and S. Haridi. All rights reserved. [...]... computation model of this chapter are closely related to logic programming This section examines this relationship Section 9. 3.1 first gives a brief introduction to logic and logic programming Sections 9. 3.2 and 9. 3.3 then show how these ideas apply to the declarative and relational computation models Finally, Section 9. 3.4 briefly mentions pure Prolog, which is another implementation of logic programming. .. the right and the Ds one place to the left At each iteration, PlaceQueens is at one row It calls PlaceQueen, which tries to place a queen in one of the columns of that row, by binding one entry in Cs, Us, and Ds Copyright c 200 1-3 by P Van Roy and S Haridi All rights reserved 643 644 Relational Programming 9. 3 Relation to logic programming Both the declarative computation model of Chapter 2 and the relational... are the inputs and which are the outputs Nondeterministic operations perform relational calculations, i.e., it is not known which arguments are inputs and outputs, and indeed the same relation can be used in different ways Copyright c 200 1-3 by P Van Roy and S Haridi All rights reserved 9. 3 Relation to logic programming 9. 3.5 Logic programming in other models So far we have seen logic programming in... us examine some other computation models: • Adding concurrency to the declarative model gives the data-driven and demand-driven concurrent models These models also do logic programming, since they only change the order in which valid tuples are calculated They do not change the content of the tuples • The nondeterministic concurrent model of Section 5.7.1 does logic programming It adds just one operation,... X1 X} and( P1 P2) [] X0=X P1 end end Figure 9. 6: Natural language parsing (compound nonterminals) Copyright c 200 1-3 by P Van Roy and S Haridi All rights reserved 6 59 660 Relational Programming end Since P1 and P2 are single-assignment variables, they can be passed to Determiner before they are bound In this way, each nonterminal brings its piece of the puzzle and the whole grammar fits together 9. 4.5... statement binds X and Y and then executes s The second statement executes s and then binds X and Y The third statement waits until it can determine whether or not X and Y are equal It then executes s , if it determines that they are equal Writing a logic program consists of two parts: writing the logical semantics and then choosing an operational semantics for it The art of logic programming consists... axiomatic semantics of Section 6.6 9. 3.1 Logic and logic programming A logic program is a statement of logic that is given an operational semantics, i.e., it can be executed on a computer If the operational semantics is well-designed, then the execution has two properties: it is correct, i.e., it respects the logical semantics (all consequences of the execution are valid logical consequences of the program... assignments of its atoms, then it is called a tautology Both the contrapositive law and De Morgan’s law are examples of tautologies They are true for all four possible truth assignments of p and q First-order predicate calculus Propositional logic is rather weak as a base for logic programming, principally because it does not allow expressing data structures First-order predicate calculus is much better-suited... consists of two parts: a domain of discourse (all possible values of the variables) and a set of relations (where a relation is a set of tuples) Each predicate has a relation, which gives the tuples for which the predicate is true Among all predicates, equality (=) is particularly important The equality relation will almost always be part of the model The quantifiers Copyright c 200 1-3 by P Van Roy and S... Figure 9. 7 Parse takes as inputs a goal to be parsed, Goal, and a list of tokens, S0 It does the parse and returns the unparsed remainder of S0 in S: {Parse Goal S0 S} While doing the parse, it can also build a parse tree because it unifies the arguments of the nonterminal with the head of the chosen rule The parser is executed with encapsulated search Here is an example: Copyright c 200 1-3 by P Van Roy and . count from 0 to 9: Copyright c  200 1-3 by P. Van Roy and S. Haridi. All rights reserved. 640 Relational Programming 96 97 98 99 {Digit} {Digit} (second digit) (first digit) 0 1 2 3 4 Figure 9. 2: Two. program mod- ularity and compositionality. To be fair to Prolog, it has a limited form of en- capsulated search, the bagof/3 and setof/3 operations. This is explained in Section 9. 7. 9. 1.4 The. product to 6-digit numbers then the naive solution takes 45 seconds. 1 The propagate- and- search solution of Chapter 12 takes less than 0.4 second to solve the same problem. 9. 2.2 Puzzles and the n-queens