Logic programming - Knowledge

1339:, backward reasoning reduces the goal to the two subgoals of computing the fibonacci numbers of n-1 and n-2. It reduces the subgoal of computing the fibonacci number of n-1 to the two subgoals of computing the fibonacci numbers of n-2 and n-3, redundantly computing the fibonacci number of n-2. This process of reducing one fibonacci subgoal to two fibonacci subgoals continues until it reaches the numbers 0 and 1. Its complexity is of the order 2. In contrast, forward reasoning generates the sequence of fibonacci numbers, starting from 0 and 1 without any recomputation, and its complexity is linear with respect to n. 1110:, which constitutes the search space for solving the goal. The top-level goal is the root of the tree. Given any node in the tree and any clause whose head matches the node, there exists a set of child nodes corresponding to the sub-goals in the body of the clause. These child nodes are grouped together by an "and". The alternative sets of children corresponding to alternative ways of solving the node are grouped together by an "or". 4252:. Here, in the initial state at time 0, a green block is on a table and a red block is stacked on the green block (like a traffic light). At time 0, the red block is moved to the table. At time 1, the green block is moved onto the red block. Moving an object onto a place terminates the fact that the object is on any place, and initiates the fact that the object is on the place to which it is moved: 3290:. In an argumentation interpretation of negation, the initial argument that tom should be punished because he is a thief, is attacked by the argument that he should be rehabilitated because he is a minor. But the fact that tom is violent undermines the argument that tom should be rehabilitated and reinstates the argument that tom should be punished. 3828:, are "very similar" to logical conditionals, but they are simpler and have greater psychological plausability (page 51). Among other differences between logic and rules, he argues that logic uses deduction, but rules use search (page 45) and can be used to reason either forward or backward (page 47). Sentences in logic "have to be interpreted as 4907:, written as !, which always succeeds but cannot be backtracked. Cut can be used to improve efficiency, but can also interfere with the logical meaning of clauses. In many cases, the use of cut can be replaced by negation as failure. In fact, negation as failure can be defined in Prolog, by using cut, together with any literal, say 6132:

Like Datalog, Answer Set programming (ASP) is not Turing-complete. Moreover, instead of separating goals (or queries) from the program to be used in solving the goals, ASP treats the whole program as a goal, and solves the goal by generating a stable model that makes the goal true. For this purpose,

3937:

The use of logic to represent procedural knowledge and strategic information was one of the main goals contributing to the early development of logic programming. Moreover, it continues to be an important feature of the Prolog family of logic programming languages today. However, many applications of

913:

Hayes and Kowalski in Edinburgh tried to reconcile the logic-based declarative approach to knowledge representation with Planner's procedural approach. Hayes (1973) developed an equational language, Golux, in which different procedures could be obtained by altering the behavior of the theorem prover.

7866:

logic programs as hypothetical generalisations of positive and negative examples. Given a logic program representing background knowledge and positive examples together with constraints representing negative examples, an ILP system induces a logic program that generalises the positive examples while

1974:

Remarkably, the same problem-solving methods of forward and backward reasoning, which were originally developed for the logical consequence semantics, are equally applicable to the satisfiability semantics: Forward reasoning generates the minimal model of a Horn clause program, by deriving new facts

1360:

Logic programming can be viewed as a generalisation of functional programming, in which functions are a special case of relations. For example, the function, mother(X) = Y, (every X has only one mother Y) can be represented by the relation mother(X, Y). In this respect, logic programs are similar to

1141:

In most cases, backward reasoning from a query or goal is more efficient than forward reasoning. But sometimes with Datalog and Answer Set Programming, there may be no query that is separate from the set of clauses as a whole, and then generating all the facts that can be derived from the clauses is

9424:

Behnke, R., Berghammer, R., Meyer, E. and Schneider, P., 1998. RELVIEW—A system for calculating with relations and relational programming. In Fundamental Approaches to Software Engineering: First International Conference, FASE'98 Held as Part of the Joint European Conferences on Theory and Practice

952:

Colmerauer, with Philippe Roussel, used the procedural interpretation as the basis of Prolog, which was implemented in the summer and autumn of 1972. The first Prolog program, also written in 1972 and implemented in Marseille, was a French question-answering system. The use of Prolog as a practical

771:

Much of the research in the field of logic programming has been concerned with trying to develop a logical semantics for negation as failure and with developing other semantics and other implementations for negation. These developments have been important, in turn, for supporting the development of

7874:

For example, given only background knowledge of the mother_child and father_child relations, and suitable examples of the grandparent_child relation, current ILP systems can generate the definition of grandparent_child, inventing an auxiliary predicate, which can be interpreted as the parent_child

3924:

in their book, Human Reasoning and Cognitive Science. They show how the non-monotonic character of logic programs can be used to explain human performance on a variety of psychological tasks. They also show (page 237) that "closed–world reasoning in its guise as logic programming has an appealing

5692:

It was recognized early in the development of relational databases that recursive queries cannot be expressed in either relational algebra or relational calculus, and that this defficiency can be remedied by introducing a least-fixed-point operator. In contrast, recursive relations can be defined

8458:

has resulted in the design of logic programming languages that are considerably more expressive than those based on classical logic. Horn clause programs can only represent state change by the change in arguments to predicates. In linear logic programming, one can use the ambient linear logic to

5265:

Procedurally, subgoals whose predicates are defined by the program are solved by goal-reduction, as in ordinary logic programming, but constraints are simplified and checked for satisfiability by a domain-specific constraint-solver, which implements the semantics of the constraint predicates. An

1113:

Any search strategy can be used to search this space. Prolog uses a sequential, last-in-first-out, backtracking strategy, in which only one alternative and one sub-goal are considered at a time. For example, subgoals can be solved in parallel, and clauses can also be tried in parallel. The first

4856:

Historically, the representation of a large portion of the British Nationality Act as a logic program in the 1980s was "hugely influential for the development of computational representations of legislation, showing how logic programming enables intuitively appealing representations that can be

3191:

The completion semantics for negation is a logical consequence semantics, for which SLDNF provides a proof-theoretic implementation. However, in the 1980s, the satisfiability semantics became more popular for logic programs with negation. In the satisfiability semantics, negation is interpreted

3839:

He states that "unlike logic, rule-based systems can also easily represent strategic information about what to do" (page 45). For example, "IF you want to go home for the weekend, and you have bus fare, THEN you can catch a bus". He does not observe that the same strategy of reducing a goal to

1003:

In the meanwhile, more declarative logic programming approaches, including those based on the use of Prolog, continued to make progress independently of the FGCS project. In particular, although Prolog was developed to combine declarative and procedural representations of knowledge, the purely

999:

However, the committed choice feature of concurrent logic programming interfered with the language's logical semantics and with its suitability for knowledge representation and problem solving applications. Moreover, the parallel computer systems developed in the project failed to compete with

4884:

for solution. For the sake of efficiency, Prolog restricts this order to the order in which the subgoals are written. SLD is also neutral about the strategy for searching the space of SLD proofs. Prolog searches this space, top-down, depth-first, trying different clauses for solving the same

5262:. It extends Horn clauses by allowing some predicates, declared as constraint predicates, to occur as literals in the body of a clause. Constraint predicates are not defined by the facts and rules in the program, but are predefined by some domain-specific model-theoretic structure or theory. 1133:

In the more general, non-propositional case, where sub-goals can share variables, other strategies can be used, such as choosing the subgoal that is most highly instantiated or that is sufficiently instantiated so that only one procedure applies. Such strategies are used, for example, in

8422:, using constraints to control concurrency. A clause can contain a guard, which is a set of constraints that may block the applicability of the clause. When the guards of several clauses are satisfied, concurrent constraint logic programming makes a committed choice to use only one. 4716:

For example, here is a representation of a simplified version of the first sentence of the British Nationality Act, which states that a person who is born in the UK becomes a British citizen at the time of birth if a parent of the person is a British citizen at the time of birth:

1092:. More generally, different problem-solving strategies can be applied to the same logical representation to obtain different algorithms. Alternatively, different algorithms can be obtained with a given problem-solving strategy by using different logical representations. 8401:, concurrent logic programming cannot implement general concurrency. However, according to the logical semantics, any result of a computation of a concurrent logic program is a logical consequence of the program, even though not all logical consequences can be derived. 3301:, in which programs are treated as data, was already a feature of early Prolog implementations. For example, the Edinburgh DEC10 implementation of Prolog included "an interpreter and a compiler, both written in Prolog itself". The simplest metaprogram is the so-called " 1476:

Prolog, for example, transforms functional syntax into relational form and executes the resulting logic program using the standard Prolog execution strategy. Moreover, the same transformation can be used to execute nested relations that are not functional. For example:

5269:

Interestingly, the first version of Prolog already included a constraint predicate dif(term1, term2), from Philippe Roussel's 1972 PhD thesis, which succeeds if both of its arguments are different terms, but which is delayed if either of the terms contains a variable.

1975:

from existing facts, until no new additional facts can be generated. Backward reasoning, which succeeds by reducing a goal to subgoals, until all subgoals are solved by facts, ensures that the goal is true in the minimal model, without generating the model explicitly.

6893:

This combination of ordinary logic programming clauses and constraint clauses illustrates the generate-and-test methodology of problem solving in ASP: The ordinary clauses define a search space of possible solutions, and the constraints filter out unwanted solutions.

49:. A logic program is a set of sentences in logical form, representing knowledge about some problem domain. Computation is performed by applying logical reasoning to that knowledge, to solve problems in the domain. Major logic programming language families include 10039:

Eiter, T., Ianni, G. and Krennwallner, T., 2009. Answer Set Programming: A Primer. In Reasoning Web. Semantic Technologies for Information Systems: 5th International Summer School 2009, Brixen-Bressanone, Italy, August 30-September 4, 2009, Tutorial Lectures (pp.

7870:

ILP is similar to ALP, in that both can be viewed as generating hypotheses to explain observations, and as employing constraints to exclude undesirable hypotheses. But in ALP the hypotheses are variable-free facts, and in ILP the hypotheses are general rules.

420:

Various queries can be asked. For instance the program can be queried both to generate grandparents and to generate grandchildren. It can even be used to generate all pairs of grandchildren and grandparents, or simply to check if a given pair is such a pair:

5696:

Datalog differs from more general logic programming by having only constants and variables as terms. Moreover, all facts are variable-free, and rules are restricted, so that if they are executed bottom-up, then the derived facts are also variable-free.

9387:

A. Casas, D. Cabeza, M. V. Hermenegildo. A Syntactic Approach to Combining Functional Notation, Lazy Evaluation and Higher-Order in LP Systems. The 8th International Symposium on Functional and Logic Programming (FLOPS'06), pages 142-162, April

1000:

advances taking place in the development of more conventional, general-purpose computers. Together these two issues resulted in the FGCS project failing to meet its objectives. Interest in both logic programming and AI fell into world-wide decline.

6890:. Constraints in CLP are predicates that qualify answers to queries (and solutions of goals). Constraints in ASP are clauses that eliminate models that would otherwise satisfy goals. Constraints in ASP are like integrity constraints in databases. 3904:

All of these characteristics of rule-based systems - search, forward and backward reasoning, default reasoning, and goal-reduction - are also defining characteristics of logic programming. This suggests that Thagard's conclusion (page 56) that:

4713:, and it is often difficult to represent such implicit knowledge in explicit rules. This difficulty does not arise, however, when logic programs are used to represent the existing, explicit rules of a business organisation or legal authority. 4892:. When a goal clause at the top of the stack is reduced to a new goal clause, the new goal clause is pushed onto the top of the stack. When the selected subgoal in the goal clause at the top of the stack cannot be solved, the search strategy 940:

It was in the following summer of 1972, that Kowalski, again working with Colmerauer, developed the procedural interpretation of implications in clausal form. It also became clear that such clauses could be restricted to definite clauses or

929:, using logic to represent semantics and using resolution for question-answering. During the summer of 1971, Colmerauer invited Kowalski to Marseille, and together they discovered that the clausal form of logic could be used to represent 715:

reading, and their execution is performed by means of a proof procedure or model generator whose behaviour is not meant to be controlled by the programmer. However, in the Prolog family of languages, logic programs also have a

4860:

More recently, the PROLEG system, initiated in 2009 and consisting of approximately 2500 rules and exceptions of civil code and supreme court case rules in Japan, has become possibly the largest legal rule base in the world.

7078:

The goal can represent an observation, in which case a solution is an explanation of the observation. Or the goal can represent a desired future state of affairs, in which case a solution is a plan for achieving the goal.

3928:

In The Proper Treatment of Events, Michiel van Lambalgen and Fritz Hamm investigate the use of constraint logic programming to code "temporal notions in natural language by looking at the way human beings construct time".

8487:

is an extension of logic programming with a logical theory of state-modifying updates. It has both a model-theoretic semantics and a procedural one. An implementation of a subset of Transaction logic is available in the

6619:

To represent the standard version of the map colouring problem, we need to add a constraint that two adjacent countries cannot be coloured the same colour. In ASP, this constraint can be written as a clause of the form:

6137:, according to which a logic program can have zero, one or more intended models. For example, the following program represents a degenerate variant of the map colouring problem of colouring two countries red or green: 2568:

fails. In the satisfiability semantics, the failure of the goal means that the truth value of the goal is false. But in the logical consequence semantics, the failure means that the truth value of the goal is unknown.

3967:, which states that a fact that holds at a time continues to hold at the next time unless it is terminated by an event that happens at the time. This formulation allows more than one event to occur at the same time: 10439:

Yang, G. and Kifer, M., 2000, July. FLORA: Implementing an efficient DOOD system using a tabling logic engine. In International Conference on Computational Logic (pp. 1078-1093). Berlin, Heidelberg: Springer Berlin

10420:

Kifer, M. and Lausen, G., 1989, June. F-logic: a higher-order language for reasoning about objects, inheritance, and scheme. In Proceedings of the 1989 ACM SIGMOD international conference on Management of data (pp.

9940:

Körner, Philipp; Leuschel, Michael; Barbosa, João; Costa, Vítor Santos; Dahl, Verónica; Hermenegildo, Manuel V.; Morales, Jose F.; Wielemaker, Jan; Diaz, Daniel; Abreu, Salvador; Ciatto, Giovanni (November 2022).

1346:: Subgoals are maintained in a table, along with their solutions. If a subgoal is re-encountered, it is solved directly by using the solutions already in the table, instead of re-solving the subgoals redundantly. 7843:

Abductive logic programming has been used for fault diagnosis, planning, natural language processing and machine learning. It has also been used to interpret negation as failure as a form of abductive reasoning.

3961:. Here is a simplified example, which illustrates the main features of such formalisms. The first clause states that a fact holds immediately after an event initiates (or causes) the fact. The second clause is a 1812:

Informally speaking, a minimal model is a model that, when it is viewed as the set of all (variable-free) facts that are true in the model, contains no smaller set of facts that is also a model of the program.

615:, for most practical applications, Horn clause programs need to be extended to "normal" logic programs with negative conditions. For example, the definition of sibling uses a negative condition, where the 10012:

Kowalski, R., Sadri, F., Calejo, M. and Dávila, J., 2023. Combining logic programming and imperative programming in LPS. In Prolog: The Next 50 Years (pp. 210-223). Cham: Springer Nature Switzerland.

4898:, removing the goal clause from the top of the stack, and retrying the attempted solution of the selected subgoal in the previous goal clause using the next clause that matches the selected subgoal. 1368:

Compared with relational syntax, functional syntax is more compact for nested functions. For example, in functional syntax the definition of maternal grandmother can be written in the nested form:

8459:

support state change. Some early designs of logic programming languages based on linear logic include LO, Lolli, ACL, and Forum. Forum provides a goal-directed interpretation of all linear logic.

8153:

of the chosen clause. These subgoals can also be executed in parallel. Thus concurrent logic programming implements a form of "don't care nondeterminism", rather than "don't know nondeterminism".

5202:

The broad range of Prolog applications, both in isolation and in combination with other languages is highlighted in the Year of Prolog Book, celebrating the 50 year anniversary of Prolog in 2022.

3408:

where true represents an empty conjunction, and (B,C) is a composite term representing the conjunction of B and C. The predicate clause(A,B) means that there is a clause of the form A :- B.

823:

Logic programming, with its current syntax of facts and rules, can be traced back to debates in the late 1960s and early 1970s about declarative versus procedural representations of knowledge in

3938:

logic programming, including Prolog applications, increasingly focus on the use of logic to represent purely declarative knowledge. These applications include both the representation of general

906:. For the sake of efficiency, Planner used a backtracking control structure so that only one possible computation path had to be stored at a time. Planner gave rise to the programming languages 10021:

Aho, A.V. and Ullman, J.D., 1979, January. Universality of data retrieval languages. In Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (pp. 110-119).

9818:

Reiter, R., 1991. The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression. Artificial and Mathematical Theory of Computation, 3.

10239:

Saraswat, V.A. and Rinard, M., 1989, December. Concurrent constraint programming. In Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (pp. 232-245).

1740:

However, the relational language RML is an imperative programming language whose core construct is a relational expression, which is similar to an expression in first-order predicate logic.

1072:

Logic programs enjoy a rich variety of semantics and problem solving methods, as well as a wide range of applications in programming, databases, knowledge representation and problem solving.

820:, on the other hand, employed a combination of equations and lambda calculus in an assertional programming language that places no constraints on the order in which operations are performed. 6926:(ALP), like CLP, extends normal logic programming by allowing the bodies of clauses to contain literals whose predicates are not defined by clauses. In ALP, these predicates are declared as 2852:

This is because tom is a thief, and it cannot be shown that tom should be rehabilitated. It cannot be shown that tom should be rehabilitated, because it cannot be shown that tom is a minor.

2855:

If, however, we receive new information that tom is indeed a minor, the previous conclusion that tom should be punished is replaced by the new conclusion that tom should be rehabilitated:

1816:

For example, the following facts represent the minimal model of the family relationships example in the introduction of this article. All other variable-free facts are false in the model:

9885: 9828: 10283:

Miller, D.A. and Nadathur, G., 1986, July. Higher-order logic programming. In International Conference on Logic Programming (pp. 448-462). Berlin, Heidelberg: Springer Berlin Heidelberg.

10825: 10030:

Maier, D., Tekle, K.T., Kifer, M. and Warren, D.S., 2018. Datalog: concepts, history, and outlook. In Declarative Logic Programming: Theory, Systems, and Applications (pp. 3-100).

882:

at MIT, was the first language to emerge within this proceduralist paradigm. Planner featured pattern-directed invocation of procedural plans from goals (i.e. goal-reduction or

8476:

extends the Prolog programming language with support for objects, protocols, and other OOP concepts. It supports most standard-compliant Prolog systems as backend compilers.

10176:

Flach, P.A. and Kakas, A.C., 2000. On the relation between abduction and inductive learning. In Abductive Reasoning and Learning (pp. 1-33). Dordrecht: Springer Netherlands.

7408:

ALP solves the goal by reasoning backwards and adding assumptions to the program, to solve abducible subgoals. In this case there are many alternative solutions, including:

933:

and that resolution theorem provers could be used for parsing. They observed that some theorem provers, like hyper-resolution, behave as bottom-up parsers and others, like

9076:

Ueda, K., 2018. Logic/constraint programming and concurrency: The hard-won lessons of the fifth generation computer project. Science of Computer Programming, 164, pp.3-17.

3430:

Metalogic programming allows object-level and metalevel representations to be combined, as in natural language. For example, in the following program, the atomic formula

1080:

The procedural interpretation of logic programs, which uses backward reasoning to reduce goals to subgoals, is a special case of the use of a problem-solving strategy to

2676:. Clark showed that proofs generated by SLDNF are structurally similar to proofs generated by a natural deduction style of reasoning with the completion of the program. 2613:

showed that, under certain natural conditions, NAF is an efficient, correct (and sometimes complete) way of reasoning with the logical consequence semantics using the

1142:

a sensible problem-solving strategy. Here is another example, where forward reasoning beats backward reasoning in a more conventional computation task, where the goal

3225:

logic programs. For example, the program for sanctioning thieves is (locally) stratified, and all three semantics for the program determine the same intended model:

11572: 9095:

Gallaire, Hervé; Minker, John 'Jack', eds. (1978), "Logic and Data Bases, Symposium on Logic and Data Bases, Centre d'études et de recherches de Toulouse, 1977",

6897:

Most implementations of ASP proceed in two steps: First they instantiate the program in all possible ways, reducing it to a propositional logic program (known as

201:

are terms naming objects (or individuals). Terms include both constant symbols, like "charles", and variables, such as X, which start with an upper case letter.

9627:. Logic Programming And Nonmonotonic Reasoning: 4th International Conference, LPNMR'97. Dagstuhl Castle, Germany: Springer Berlin Heidelberg. pp. 430–440. 10731: 9759: 1787:, as in hyper-resolution, are correct and complete theorem-proving methods. Sometimes such theorem-proving methods are also regarded as providing a separate 2223:

The two declarative semantics both give the same answers for the same existentially quantified conjunctions of addition and multiplication goals. For example

816:, together with a representation of an input-output relation, to compute the relation by simulating the execution of the program in LISP. Foster and Elcock's 10795: 9193: 10615: 3199:, the intended model of a logic program is a unique, three-valued, minimal model, which always exists. The well-founded semantics generalises the notion of 3810: 1342:

Prolog cannot perform forward reasoning directly. But it can achieve the effect of forward reasoning within the context of backward reasoning by means of

9733:

Warren, D.H., Pereira, L.M. and Pereira, F., 1977. Prolog-the language and its implementation compared with Lisp. ACM SIGPLAN Notices, 12(8), pp.109-115.

3222: 2005:

X + 0 = X. X + s(Y) = s(X + Y). i.e. X + (Y + 1) = (X + Y) + 1 X × 0 = 0. X × s(Y) = X + (X × Y). i.e. X × (Y + 1) = X + (X × Y).

9829:

https://ds.amu.edu.et/xmlui/bitstream/handle/123456789/4434/%28Text%20Book%29%20Building%20Expert%20Systems%20in%20Prolog.pdf?sequence=1&isAllowed=y

10744: 10185:

Cropper, A. and Dumančić, S., 2022. Inductive logic programming at 30: a new introduction. Journal of Artificial Intelligence Research, 74, pp.765-850.

9406:

Beyer, D., 2006, May. Relational programming with CrocoPat. In Proceedings of the 28th International Conference on Software engineering (pp. 807-810).

3909:

Much of human knowledge is naturally described in terms of rules, and many kinds of thinking such as planning can be modeled by rule-based systems.

9807: 8142:

hold. If the guards of more than one clause hold, then a committed choice is made to one of the clauses, and execution proceeds with the subgoals

1757:

Viewed in purely logical terms, there are two approaches to the declarative semantics of Horn clause logic programs: One approach is the original

11736: 5206: 1765: 1733:

has been used to cover a variety of programming languages that treat functions as a special case of relations. Some of these languages, such as

10894: 970: 10829: 8954: 3214:, there may be no intended models or several intended models, all of which are minimal and two-valued. The stable model semantics underpins 11565: 6935: 977: 10686: 9927:

Satoh, K., 2023. PROLEG: Practical legal reasoning system. In Prolog: The Next 50 Years (pp. 277-283). Cham: Springer Nature Switzerland.

9127:

Warren, D.S. (2023). "Introduction to Prolog". In Warren, D.S.; Dahl, V.; Eiter, T.; Hermenegildo, M.V.; Kowalski, R.; Rossi, F. (eds.).

10430:

de Moura, P.J.L., 2003. Design of an Object-Oriented Logic Programming Language (Doctoral dissertation, Universidade da Beira Interior).

10724: 3221:

Both the well-founded and stable model semantics apply to arbitrary logic programs with negation. However, both semantics coincide for

10656: 2907:

This property of withdrawing a conclusion when new information is added, is called non-monotonicity, and it makes logic programming a

8595: 8016: 4960:

Prolog provides other features, in addition to cut, that do not have a logical interpretation. These include the built-in predicates

2812:

Given the goal of determining whether tom should receive a sanction, the first rule succeeds in showing that tom should be punished:

1752: 10958: 9543:

Shepherdson, J.C. (1984). "Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption".

9325: 1056: 1130:. Other search strategies, such as intelligent backtracking, or best-first search to find an optimal solution, are also possible. 11558: 11308: 11170: 9578: 8415: 8410: 8398: 6909:. However, some implementations, such as s(CASP) use a goal-directed, top-down, SLD resolution-like procedure without grounding. 5199:

Various extensions of logic programming have been developed to provide a logical framework for such destructive change of state.

5532:

are constraint predicates, with their usual intended semantics. The following goal clause queries the database to find out when

1979: 11665: 11655: 11314: 10392: 10003:

Genesereth, M., 2023. Dynamic logic programming. In Prolog: The Next 50 Years (pp. 197-209). Cham: Springer Nature Switzerland.

9514:

Gelfond, M.; Przymusinska, H.; Przymusinski, T. (1989). "On the relationship between circumscription and negation as failure".

1355: 11713: 11670: 11660: 11650: 10717: 10161: 9788: 9691:"On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming, and n–person games" 9498: 9144: 9108: 8008:

Stuart Russell has referred to such invention of new concepts as the most important step needed for reaching human-level AI.

9760:

https://www.google.co.uk/books/edition/Mind_second_edition/gjcR1U2HT7kC?hl=en&gbpv=1&pg=PP11&printsec=frontcover

7773:

Such solutions, if not desired, can be removed by adding an integrity constraint, which is like a constraint clause in ASP:

3195:

In the case of logic programs with negative conditions, there are two main variants of the satisfiability semantics: In the

11627: 11499: 11247: 9397:

Kersting, K., Mladenov, M. and Tokmakov, P., 2017. Relational linear programming. Artificial Intelligence, 244, pp.188-216.

8565: 2603: 2477:

is true. But with the satisfiability semantics, there is only one model, namely the standard model of arithmetic, in which

3840:

subgoals can be interpreted, in the manner of logic programming, as applying backward reasoning to a logical conditional:

10156:. Lecture notes in computer science Lecture notes in artificial intelligence. Berlin Heidelberg: Springer. p. 173. 1978:

The difference between the two declarative semantics can be seen with the definitions of addition and multiplication in

1106:

In the simple case of a propositional Horn clause program and a top-level atomic goal, backward reasoning determines an

10967: 10323: 10142:

Eshghi, K. and Kowalski, R.A., 1989, June. Abduction Compared with Negation by Failure. In ICLP (Vol. 89, pp. 234-255).

9425:

of Software, ETAPS'98 Lisbon, Portugal, March 28–April 4, 1998 Proceedings 1 (pp. 318-321). Springer Berlin Heidelberg.

3175: 832: 8868: 2469:

However, with the logical-consequence semantics, there are non-standard models of the program, in which, for example,

957:

in Edinburgh in 1977. Experiments demonstrated that Edinburgh Prolog could compete with the processing speed of other

9893: 9752: 9516: 8998: 8833:

Davies, J.M., 1971. POPLER: a POP-2 planner. Edinburgh University, Department of Machine Intelligence and Perception.

2622:

Completion amounts roughly to regarding the set of all the program clauses with the same predicate in the head, say:

1971:

of the function that uses the rules in the program to derive new facts from existing facts in one step of inference.

1033: 981: 17: 11642: 11339: 11019: 10963: 10295: 9545: 9478: 8938: 4234: 2610: 1038: 9721:

Colmerauer, A. and Roussel, P., 1996. The birth of Prolog. In History of programming languages---II (pp. 331-367).

9048:

Warren, D.H.; Pereira, L.M.; Pereira, F. (1977). "Prolog-the language and its implementation compared with Lisp".

8851: 6941:

For example, suppose we are given an initial state in which a red block is on a green block on a table at time 0:

4880:

The SLD resolution rule of inference is neutral about the order in which subgoals in the bodies of clauses can be

890:). The most influential implementation of Planner was the subset of Planner, called Micro-Planner, implemented by 11622: 11199: 11072: 11003: 10938: 10861: 8037:. Its development was given a big impetus in the 1980s by its choice for the systems programming language of the 8012: 1021:

This focus on the logical, declarative reading of logic programs was given further impetus by the development of

704:

Logic programming languages that include negative conditions have the knowledge representation capabilities of a

5214: 11741: 11702: 11617: 11377: 11140: 10770: 10678: 10539: 9808:

https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=3126320bb6e37ca3727fed404828b53fc56ff063

8784: 8510: 5658: 4888:

This search strategy has the advantage that the current branch of the tree can be represented efficiently by a

2673: 926: 875: 616: 10645: 5087:

The sequence of move events and the resulting locations of the blocks can be computed by executing the query:

3916:

Other arguments showing how logic programming can be used to model aspects of human thinking are presented by

2614: 11632: 11155: 11145: 10923: 10626: 8570: 6938:

to explain observations, or more generally to add new facts to the program (as assumptions) to solve goals.

2914:

But, if we are now told that tom is violent, the conclusion that tom should be punished will be reinstated:

11539: 11519: 11449: 11392: 11354: 11344: 11304: 11229: 11165: 11135: 11062: 11051: 10948: 10928: 10903: 10866: 10255: 8515: 8419: 8097:

is the commitment operator. Declaratively, guarded Horn clauses are read as ordinary logical implications:

8028: 8011:

Recent work in ILP, combining logic programming, learning and probability, has given rise to the fields of

5255: 5250: 5218: 1135: 1022: 993: 137: 9994:

Bonner, A.J. and Kifer, M., 1993, February. Transaction Logic Programming. In ICLP (Vol. 93, pp. 257-279).

11494: 11257: 11224: 11119: 11095: 11057: 11037: 10933: 10842: 10820: 10805: 10328: 8585: 8545: 7853: 6923: 6918: 5633: 5226: 1473: 962: 11731: 11691: 11441: 11427: 11334: 11294: 11219: 11125: 11105: 10972: 10851: 10785: 9169: 8700: 8653: 4889: 1061: 976:

Logic programming gained international attention during the 1980s, when it was chosen by the Japanese

9841: 3192:

according to the classical definition of truth in an intended or standard model of the logic program.

1805:

of the program. For Horn clause programs, there always exists such a standard model: It is the unique

11534: 11299: 11209: 11189: 11175: 9849: 9286: 9213: 8617: 8555: 8505: 8038: 5693:

naturally by rules in logic programs, without the need for any new logical connectives or operators.

5222: 1791:

for logic programs. But from a logical point of view, they are proof methods, rather than semantics.

1788: 1772: 155:

Queries (or goals) have the same syntax as the bodies of rules and are commonly written in the form:

9269:. Conference on Logic Programming. Berlin, Heidelberg: Springer Berlin Heidelberg. pp. 148–155. 8131:

match a given goal, then all of the clauses are executed in parallel, checking whether their guards

4248:

The following example illustrates how these clauses can be used to reason about causality in a toy

11514: 11474: 11417: 11349: 11087: 10918: 10371: 9038:

Also in Proceedings IFIP Congress, Stockholm, North Holland Publishing Co., 1974, pp. 569–574.

8431: 8090: 6115: 1743:

Other relational programming languages are based on the relational calculus or relational algebra.

42: 9773: 4695: 11524: 11504: 11445: 11432: 11412: 11239: 10976: 10880: 10838: 10709: 10694: 10194:

Russell, S., 2019. Human compatible: Artificial intelligence and the problem of control. Penguin.

9085:

H.P. Newquist, 2020. The Brain Makers: The History Of Artificial Intelligence. The Relayer Group.

8699:. Fourth Annual Machine Intelligence Workshop. Machine Intelligence. Vol. 4. Edinburgh, UK: 4903: 3824:

as alternative approaches to modelling human thinking. He argues that rules, which have the form

3287: 3286:

Attempts to understand negation in logic programming have also contributed to the development of

3185: 3178: 1802: 985: 949:. Kowalski's procedural interpretation and SLD were described in a 1973 memo, published in 1974. 840: 824: 712: 9415:

MacLennan, B.J., 1983. Overview of relational programming. ACM SIGPLAN Notices, 18(3), pp.36-45.

1967:

The satisfiability semantics also has an alternative, more mathematical characterisation as the

1737:

and relational linear programming are logic programming languages in the sense of this article.

1408:

The same definition in relational notation needs to be written in the unnested, flattened form:

902:. Winograd used Micro-Planner to implement the landmark, natural-language understanding program 11484: 11459: 11453: 11397: 11359: 11047: 11042: 10994: 10889: 10790: 10762: 10753: 10366: 9323:

Swift, T.; Warren, D.S. (January 2012). "XSB: Extending Prolog with tabled logic programming".

8535: 8034: 7082:

We can use the rules for cause and effect presented earlier to solve the goal, by treating the

6134: 6127: 5617: 3215: 3211: 3196: 1026: 1004:

declarative interpretation of logic programs became the focus for applications in the field of

781: 717: 54: 10683: 10518: 10486: 8715: 11386: 11382: 11324: 11276: 10846: 10293:

Andreoli, Jean-Marc (1 June 1992). "Logic Programming with Focusing Proofs in Linear Logic".

9827:

Merritt, D., 2012. Building expert systems in Prolog. Springer Science & Business Media.

9806:

Van Lambalgen, M. and Hamm, F., 2008. The proper treatment of events. John Wiley & Sons.

9187: 5625: 4705:

Logic programming has also proved to be useful for representing domain-specific expertise in

3939: 3921: 3808: 2672:

means "if and only if". The completion also includes axioms of equality, which correspond to

1764:, which understands solving a goal as showing that the goal is a theorem that is true in all 1036:(ALP) was founded in 1986 to promote Logic Programming. Its official journal until 2000, was 1012:

organized a workshop on logic and databases in Toulouse. The field was eventually renamed as

754:

Negative conditions in the bodies of clauses also have a procedural interpretation, known as

10133:

Eshghi, K., 1988, August. Abductive Planning with Event Calculus. In ICLP/SLP (pp. 562-579).

11610: 11581: 11529: 11509: 11469: 11271: 11130: 10999: 10986: 10740: 10653: 10218: 9033: 5650:

Datalog is a database definition language, which combines a relational view of data, as in

3200: 1801:, which understands solving a goal as showing that the goal is true (or satisfied) in some 1362: 958: 34: 10608: 8355:

in the second and third clauses is the list constructor, whereas the second occurrence of

7663:

is an event that marks the passage of time without initiating or terminating any fluents.

3949:

Commonsense includes knowledge about cause and effect, as formalised, for example, in the

8: 11464: 11402: 11214: 11194: 11180: 10912: 10780: 10775: 10620:

AAAI Spring Symposium: What Went Wrong and Why: Lessons from AI Research and Applications

9050: 8359:

is the commitment operator.) The program can be used, for example, to shuffle the lists

7863: 5651: 5629: 5205:

Prolog has also contributed to the development of other programming languages, including

3302: 2908: 2594:

fails to hold, was already a feature of early Prolog systems. The resulting extension of

2583: 2578: 2002:

Here are the standard definitions of addition and multiplication in functional notation:

1759: 992:. Although the project initially explored the use of Prolog, it later adopted the use of 907: 848: 828: 805: 777: 756: 705: 612: 10460: 9250:

Bruynooghe, M.; Pereira, L.M. (1984). "Deduction revision by intelligent backtracking".

5677:

to specify queries, which access a database. Datalog uses logical connectives, such as

720:

interpretation as goal-reduction procedures. From this point of view, clause A :- B

11281: 11234: 11204: 11150: 11009: 10908: 10800: 10509: 10083: 10063: 9954: 9910: 9866: 9840:

Sergot, M.J.; Sadri, F.; Kowalski, R.A.; Kriwaczek, F.; Hammond, P; Cory, H.T. (1986).

9671: 9652: 9605: 9587: 9460: 9441: 9352: 9334: 9305: 9232: 9131:. Lecture Notes in Computer Science(). Vol. 13900. Springer, Cham. pp. 3–19. 8971: 8915: 8847: 8738: 8634: 8435: 6906: 5259: 4699: 3950: 1005: 989: 954: 891: 844: 10119: 10102: 8760: 8676: 5266:

initial problem is solved by reducing it to a satisfiable conjunction of constraints.

11605: 11600: 11437: 11329: 11184: 11160: 11100: 11067: 11014: 10953: 10671: 10568: 10476: 10406: 10387: 10269: 10250: 10157: 9974: 9784: 9748: 9707: 9690: 9573: 9558: 9529: 9494: 9140: 9104: 9097: 9026: 9011: 8797: 8493: 8484: 5613: 3821: 2599: 1968: 1780: 1776: 1096: 1029:

in the 1990s. It is also receiving renewed emphasis in recent applications of Prolog

883: 10513: 10087: 9609: 9464: 9372: 9309: 8742: 8638: 984:(FGCS) project. The FGCS project aimed to use logic programming to develop advanced 11319: 11251: 11115: 10856: 10584: 10563: 10501: 10471: 10401: 10358: 10337: 10304: 10264: 10114: 10073: 9964: 9914: 9902: 9870: 9858: 9702: 9675: 9661: 9628: 9597: 9554: 9525: 9486: 9450: 9356: 9344: 9295: 9236: 9222: 9173: 9132: 9059: 9007: 8963: 8919: 8905: 8897: 8793: 8730: 8626: 8580: 7859: 1784: 1100: 1047: 918: 887: 852: 793: 5935:

Bottom-up execution derives the following set of additional facts and terminates:

953:

programming language was given great momentum by the development of a compiler by

11550: 11369: 11243: 11109: 10810: 10690: 10660: 9906: 9490: 5621: 4710: 3958: 3434:

occurs both as an object-level formula, and as an argument of the metapredicates

3298: 1043: 930: 895: 856: 836: 797: 9136: 8654:"The generalised completeness of Horn predicate-logic as a programming language" 4709:. But human expertise, like general-purpose commonsense, is mostly implicit and 197:), where p is a predicate symbol naming a relation, like "motherhood", and the t 11746: 11421: 11077: 10943: 10551: 8843: 8815: 8779: 8590: 8559: 8520: 8387:

The program will non-deterministically generate a single solution, for example

6902: 5612:

Constraint logic programming has been used to solve problems in such fields as

4682:

Forward reasoning and backward reasoning generate the same answers to the goal

4217:

has only one argument, which applies to general clauses, the first argument of

3954: 3917: 3182: 2595: 1796: 1794:

The other approach to the declarative semantics of Horn clause programs is the

1472:

However, nested syntax can be regarded as syntactic sugar for unnested syntax.

946: 934: 899: 868: 773: 186: 63: 10078: 10051: 9969: 9942: 9795: 9623:

Rao, P.; Sagonas, K.; Swift, T.; Warren, D.S.; Freire, J. (July 28–31, 1997).

9348: 9178: 8901: 6708:

With the addition of this constraint, the problem now has only two solutions:

4968:

for destructively updating the state of the program during program execution.

11725: 11407: 10308: 9978: 9632: 8990: 8811: 5273:

The following constraint logic program represents a toy temporal database of

5230: 4706: 3963: 3943: 864: 809: 801: 9601: 8438:, such as predicate variables. Such languages include the Prolog extensions 11595: 10342: 8550: 8455: 8045: 8033:

Concurrent logic programming integrates concepts of logic programming with

5689:

in the bodies of rules to define relations as part of the database itself.

5657:

Relational databases use a relational calculus or relational algebra, with

4975:

can be implemented without frame axioms using destructive change of state:

4894: 4249: 4221:

is a fact and the second argument is a time (or state). The atomic formula

3817: 3419: 1008:. Work in this field became prominent around 1977, when Hervé Gallaire and 9666: 9647: 9455: 9436: 9227: 9208: 9063: 11289: 10594: 10550:

Miller, Dale; Nadathur, Gopalan; Pfenning, Frank; Scedrov, Andre (1991).

8885: 8810: 8756: 8540: 8394: 6114:

But then it goes into an infinite loop. However, top-down execution with

1107: 1009: 942: 879: 174: 10616:

The Repeated Demise of Logic Programming and Why It Will Be Reincarnated

10505: 8734: 8156:

For example, the following concurrent logic program defines a predicate

10704: 10590: 8975: 8910: 8630: 1734: 400:

Given a query, the program produces answers. For instance for a query

10365:. US/Japan Workshop on Parallel Symbolic Computing. pp. 279–294. 9862: 9300: 9281: 8873:(Technical report). Artificial Intelligence Center, SRI International. 8443: 5238: 9780: 6901:). Then they apply a propositional logic problem solver, such as the 3413: 922: 10633: 8967: 1324:

is Prolog notation for the predicate that instantiates the variable

10665: 10068: 9959: 9592: 9373:

Daniel Friedman; William Byrd; Oleg Kiselyov; Jason Hemann (2018).

827:. Advocates of declarative representations were notably working at 38: 10739: 10595:

Handbook of Logic in Artificial Intelligence and Logic Programming

9339: 8952:

Robinson, J. (1965). "Automatic deduction with hyper-resolution".

8127:

However, procedurally, when there are several clauses whose heads

6300:

The problem has four solutions represented by four stable models:

945:, and that SL-resolution could be restricted (and generalised) to 859:. Advocates of procedural representations were mainly centered at 10249:

Chen, Weidong; Kifer, Michael; Warren, David S. (February 1993).

10050:

Arias, J.; Carro, M.; Salazar, E.; Marple, K.; Gupta, G. (2018).

8525: 8489: 8473: 8467: 5645: 1343: 1014: 58: 10324:"Logic Programming in a Fragment of Intuitionistic Linear Logic" 10207:. Institute for New Generation Computer Technology (ICOT). 1992. 8697:

ABSYS 1: An Incremental Compiler for Assertions: an Introduction

1103:, also known as top-down and bottom-up reasoning, respectively. 9513: 4875: 3411:

Metaprogramming is an application of the more general use of a

903: 50: 10625:

Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov:

10593:; Hogger, Christopher John; Robinson, J.A., eds. (1993-1998). 9770: 9625:

XSB: A system for efficiently computing well-founded semantics

910:, Popler, Conniver, QLISP, and the concurrent language Ether. 61:. In all of these languages, rules are written in the form of 10549: 9267:

Heuristic Prolog: logic program execution by heuristic search

8575: 8470:

extends logic programming with objects and the frame syntax.

8439: 1356:

Functional programming § Comparison to logic programming

817: 808:

form of logic for representing computer programs was made by

46: 9839: 9648:"Tabled Evaluation with Delaying for General Logic Programs" 9437:"The semantics of predicate logic as a programming language" 4690:

in temporal order, and backward reasoning generates fluents

3207:

implements the well-founded semantics using SLG resolution.

9886:"Law and logic: a review from an argumentation perspective" 8530: 5210: 1724: 1349: 996:, because it was closer to the FGCS computer architecture. 813: 10546:. National Physical Laboratory. Teddington, England. 1958. 9939: 8404: 6086:

Top-down execution derives the same answers to the query:

4901:

Backtracking can be restricted by using a subgoal, called

3423:

to describe and reason about another language, called the

1088:

representation of knowledge to obtain the behaviour of an

204:

Consider, for example, the following Horn clause program:

10585:"Experiments with a Deductive Question-Answering Program" 8856:(Technical report). Artificial Intelligence Memo No. 259. 8430:

Several researchers have extended logic programming with

5234: 4885:(sub)goal in the order in which the clauses are written. 3204: 860: 10251:"HiLog: A foundation for higher-order logic programming" 2586:(NAF), as a way of concluding that a negative condition 2008:

Here are the same definitions as a logic program, using

10049: 9254:. Chichester, England: Ellis Horwood. pp. 194–215. 6118:

gives the same answers and terminates without looping.

2602:. A similar construct, called "thnot", also existed in 792:

The use of mathematical logic to represent and execute

85:

and are read as declarative sentences in logical form:

10552:"Uniform proofs as a foundation for logic programming" 10363:

Asynchronous communication model based on linear logic

764:

is deemed to hold if and only if the positive literal

10699: 10052:"Constraint Answer Set Programming without Grounding" 9622: 8351:, as in Prolog. (Notice that the first occurrence of 4857:

directly deployed to generate automatic inferences".

874:

Although it was based on the proof methods of logic,

804:

in the 1930s. However, the first proposal to use the

10627:

Complexity and expressive power of logic programming

9047: 8823:(Technical report). SRI AI Center Technical Note 73. 8615:

Tärnlund, S.Å. (1977). "Horn clause computability".

8462: 7858:

Inductive logic programming (ILP) is an approach to

3942:

knowledge and the representation of domain specific

3811:

Computational-representational understanding of mind

1746: 1335:

Given the goal of computing the fibonacci number of

10205:

Proceedings of the FGCS Project Evaluation Workshop

10152:Nienhuys-Cheng, Shan-hwei; Wolf, Ronald de (1997). 9645: 969:standard and strongly influenced the definition of 11580: 10388:"Forum: A Multiple-Conclusion Specification Logic" 10151: 9772: 9279: 9096: 8890:IEEE Transactions on Systems, Man, and Cybernetics 8817:QA4, A Procedural Calculus for Intuitive Reasoning 8814:; Jan Derksen; Richard Waldinger (November 1973). 8762:Planner: A Language for Proving Theorems in Robots 5258:(CLP) combines Horn clause logic programming with 3816:In his popular Introduction to Cognitive Science, 2609:The logical semantics of NAF was unresolved until 10356: 9571: 9434: 9249: 9192:: CS1 maint: DOI inactive as of September 2024 ( 8678:Application of Theorem Proving to Problem Solving 8425: 11723: 10461:"Logic programming and knowledge representation" 9842:"The British Nationality Act as a logic program" 9771:Stenning, Keith; van Lambalgen, Michiel (2008). 9435:Van Emden, M.H.; Kowalski, R.A. (October 1976). 8933:Hayes, Pat (1973). "Computation and Deduction". 8842: 8479: 5654:, with a logical view, as in logic programming. 3925:neural implementation, unlike classical logic." 141:or conditions. When n = 0, the rule is called a 10544:Symposium on Mechanization of Thought Processes 10248: 9160:Robinson, J. Alan (2001). "Invited Editorial". 8988: 8044:A concurrent logic program is a set of guarded 8022: 5244: 3174:The notion of completion is closely related to 1365:, which also represent functions as relations. 711:In ASP and Datalog, logic programs have only a 9688: 9574:"A logic of nonmonotone inductive definitions" 9122: 9120: 9094: 8883: 8866: 7847: 6912: 2679:Consider, for example, the following program: 1075: 1052:The Journal of Logic and Algebraic Programming 11566: 10725: 10219:"Inconsistency Robustness for Logic Programs" 10100: 9883: 9485:. Boston, MA: Springer US. pp. 293–322. 8955:International Journal of Computer Mathematics 8888:(1981). "The scientific community metaphor". 8651: 8172:that preserves the ordering of the two lists 7670:events happen at the same time. For example: 4972: 2590:holds by showing that the positive condition 812:. This used an axiomatization of a subset of 10609:Procedural Embedding of Knowledge in Planner 10458: 10216: 10103:"Special issue: abductive logic programming" 9206: 8694: 1095:The two main problem-solving strategies are 978:Ministry of International Trade and Industry 10321: 9796:https://philpapers.org/archive/STEHRA-5.pdf 9542: 9322: 9117: 9027:"Predicate Logic as a Programming Language" 8991:"Linear Resolution with Selection Function" 8449: 5700:For example, consider the family database: 5608:2005 ≤ T, T ≤ 2012, 2010 ≤ T, T < 2014. 4911:, that unifies with the head of no clause: 3932: 11573: 11559: 10732: 10718: 10154:Foundations of inductive logic programming 8989:Kowalski, Robert; Kuehner, Donald (1971). 8867:Reboh, R.; Sacerdoti, E.D. (August 1973). 8782:(1972). "Understanding natural language". 8418:combines concurrent logic programming and 7666:There are also solutions in which the two 4864: 4686:. But forward reasoning generates fluents 4233:. Such time-varying facts are also called 1789:proof-theoretic (or operational) semantics 27:Programming paradigm based on formal logic 10796:Programming in the large and in the small 10629:. ACM Comput. Surv. 33(3): 374–425 (2001) 10567: 10475: 10405: 10370: 10341: 10268: 10242: 10118: 10077: 10067: 9968: 9958: 9729: 9727: 9706: 9665: 9591: 9454: 9338: 9299: 9280:Genesereth, M.R.; Ginsberg, M.L. (1985). 9226: 9177: 9032:. Department of Artificial Intelligence, 8909: 8596:Syntax and semantics of logic programming 8160:, which can be used to shuffle two lists 8017:probabilistic inductive logic programming 6121: 5606:results from simplifying the constraints 2619:of a logic program in first-order logic. 1753:Syntax and semantics of logic programming 1054:, and the official journal of ALP became 10672:Theory and Practice of Logic Programming 10484: 10452: 10292: 10056:Theory and Practice of Logic Programming 9947:Theory and Practice of Logic Programming 9884:Prakken, H.; Sartor, G. (October 2015). 9326:Theory and Practice of Logic Programming 9264: 9162:Theory and Practice of Logic Programming 9159: 9024: 9018: 8951: 8778: 8713: 8614: 8039:Japanese Fifth Generation Project (FGCS) 6871:The addition of constraints of the form 5632:, and finance. It is closely related to 4241:expresses that the Event happens at the 3293: 3181:semantics for default reasoning, and to 2471:add(s(s(0)), s(s(0)), s(s(s(s(s(0)))))), 1725:Relationship with relational programming 1350:Relationship with functional programming 1057:Theory and Practice of Logic Programming 611:Although Horn clause logic programs are 177:(or "definite" clauses), all of the A, B 10666:Association for Logic Programming (ALP) 10101:Denecker, M.; Kakas, A.C. (July 2000). 9745:Mind: Introduction to Cognitive Science 9742: 9579:ACM Transactions on Computational Logic 8804: 8772: 8416:Concurrent constraint logic programming 8411:Concurrent constraint logic programming 8405:Concurrent constraint logic programming 8399:indeterminacy of concurrent computation 1982:, which represents the natural numbers 145:and is written in the simplified form: 14: 11737:Computer-related introductions in 1972 11724: 10487:"The early years of logic programming" 10385: 10210: 9935: 9933: 9724: 9646:W. Chen; D. S. Warren (January 1996). 9368: 9366: 9126: 8716:"The early years of logic programming" 2572: 11554: 10713: 10522: 9990: 9988: 9775:Human reasoning and cognitive science 9477: 8935:Proceedings of the 2nd MFCS Symposium 8932: 8343:represents a list with first element 10705:Racklog: Logic Programming in Racket 10679:Logic programming in C++ with Castor 10597:.Vols. 1–5, Oxford University Press. 10322:Hodas, Joshua; Miller, Dale (1994). 10203:Shunichi Uchida and Kazuhiro Fuchi. 9572:Denecker, M.; Ternovska, E. (2008). 9375:The Reasoned Schemer, Second Edition 8168:, combining them into a single list 7008:Suppose we are also given the goal: 3836:, which admit exceptions (page 44). 1050:. In 2001, the journal was renamed 10654:Bibliographies on Logic Programming 9930: 9363: 8695:Foster, J.M.; Elcock, E.W. (1969). 4694:, as in the domain-specific use of 3913:also applies to logic programming. 2966:The completion of this program is: 1986:as a sequence of terms of the form 1146:is to find the n fibonacci number: 937:(1971) behave as top-down parsers. 24: 10601: 10386:Miller, Dale (30 September 1996). 9985: 9943:"Fifty Years of Prolog and Beyond" 8755: 8492:system. Other prototypes are also 2650:as a definition of the predicate: 1122:and the second strategy is called 25: 11758: 10639: 10632:Ulf Nilsson and Jan Maluszynski, 8674: 8463:Object-oriented logic programming 7867:excluding the negative examples. 3288:abstract argumentation frameworks 1771:In this approach, computation is 1747:Semantics of Horn clause programs 1034:Association for Logic Programming 982:Fifth Generation Computer Systems 11340:Partitioned global address space 10556:Annals of Pure and Applied Logic 10532: 10527:(2nd ed.). Springer-Verlag. 10525:Foundations of Logic Programming 10468:The Journal of Logic Programming 10296:Journal of Logic and Computation 9546:The Journal of Logic Programming 8939:Czechoslovak Academy of Sciences 8652:Andréka, H.; Németi, I. (1978). 8454:Basing logic programming within 8397:has argued that, because of the 4209:is a meta-predicate, similar to 1039:The Journal of Logic Programming 980:to develop the software for the 10459:Baral, C.; Gelfond, M. (1994). 10433: 10424: 10414: 10379: 10350: 10315: 10286: 10277: 10233: 10197: 10188: 10179: 10170: 10145: 10136: 10127: 10094: 10043: 10033: 10024: 10015: 10006: 9997: 9921: 9877: 9833: 9821: 9812: 9800: 9764: 9736: 9715: 9682: 9639: 9616: 9565: 9536: 9507: 9481:(1977). "Negation as Failure". 9471: 9428: 9418: 9409: 9400: 9391: 9381: 9316: 9273: 9258: 9243: 9200: 9153: 9088: 9079: 9070: 9041: 8982: 8945: 8926: 8877: 8860: 8836: 8340:represents the empty list, and 8013:statistical relational learning 11582:Types of programming languages 10221:. Hal Archives. pp. 21–26 10217:Hewitt, Carl (27 April 2016). 8827: 8749: 8707: 8688: 8668: 8645: 8608: 8511:Boolean satisfiability problem 8426:Higher-order logic programming 4973:toy blocks world example above 965:. Edinburgh Prolog became the 927:natural-language understanding 13: 1: 11682: 10634:Logic, Programming and Prolog 10120:10.1016/S0743-1066(99)00078-3 9747:. The MIT Press. p. 11. 8853:The Conniver reference manual 8571:Programmable logic controller 8480:Transaction logic programming 8365:by invoking the goal clause: 11714:Programming paradigms navbox 10867:Uniform Function Call Syntax 10569:10.1016/0168-0072(91)90068-W 10540:"Programs with common sense" 10477:10.1016/0743-1066(94)90025-6 10407:10.1016/0304-3975(96)00045-X 10393:Theoretical Computer Science 10270:10.1016/0743-1066(93)90039-J 10256:Journal of Logic Programming 10107:Journal of Logic Programming 9907:10.1016/j.artint.2015.06.005 9708:10.1016/0004-3702(94)00041-X 9559:10.1016/0743-1066(84)90023-2 9530:10.1016/0004-3702(89)90068-4 9491:10.1007/978-1-4684-3384-5_11 9099:Advances in Data Base Theory 9012:10.1016/0004-3702(71)90012-9 8798:10.1016/0010-0285(72)90002-3 8601: 8516:Constraint logic programming 8420:constraint logic programming 8029:Concurrent logic programming 8023:Concurrent logic programming 5256:Constraint logic programming 5251:Constraint logic programming 5245:Constraint logic programming 2484:In both semantics, the goal 1994:represents the successor of 1803:intended (or standard) model 1783:, as in SLD resolution, and 1136:concurrent logic programming 1023:constraint logic programming 994:concurrent logic programming 886:) and from assertions (i.e. 7: 11335:Parallel programming models 11309:Concurrent constraint logic 10329:Information and Computation 9209:"Algorithm=Logic + Control" 9137:10.1007/978-3-031-35254-6_1 8586:Rule-based machine learning 8566:Logic programming languages 8546:Inductive logic programming 8499: 8158:shuffle(Left, Right, Merge) 7854:Inductive logic programming 7848:Inductive logic programming 6924:Abductive logic programming 6919:Abductive logic programming 6913:Abductive logic programming 6875:eliminates models in which 5634:abductive logic programming 1076:Algorithm = Logic + Control 1067: 619:= is defined by the clause 402:?- parent_child(X, william) 10: 11763: 11428:Metalinguistic abstraction 11295:Automatic mutual exclusion 10700:Prolog Development Center 10447: 9265:Nakamura, K. (July 1985). 9207:R.A.Kowalski (July 1979). 9170:Cambridge University Press 9103:, New York: Plenum Press, 8870:A preliminary QLISP manual 8701:Edinburgh University Press 8408: 8026: 7851: 6916: 6125: 5643: 5639: 5248: 4873: 2576: 1750: 1353: 1084:the use of a declarative, 1062:Cambridge University Press 988:applications on massively 863:, under the leadership of 847:(an academic visitor from 839:and Cordell Green, and in 787: 11641: 11588: 11483: 11368: 11300:Choreographic programming 11270: 11086: 11028: 10985: 10888: 10879: 10819: 10761: 10752: 10494:Communications of the ACM 10079:10.1017/S1471068418000285 9970:10.1017/S1471068422000102 9850:Communications of the ACM 9349:10.1017/S1471068411000500 9287:Communications of the ACM 9252:Implementations of Prolog 9214:Communications of the ACM 9179:10.1017/s1471068400000028 9129:Prolog: The Next 50 Years 9025:Kowalski, Robert (1973). 8902:10.1109/TSMC.1981.4308575 8723:Communications of the ACM 8618:BIT Numerical Mathematics 8556:Logic in computer science 8506:Automated theorem proving 7658: 4869: 2485: 796:is also a feature of the 45:paradigm based on formal 11350:Relativistic programming 10485:Kowalski, R. A. (1988). 9633:10.1007/3-540-63255-7_33 8714:Kowalski, R. A. (1988). 8450:Linear logic programming 8432:higher-order programming 8367: 8182: 7877: 7775: 7672: 7574: 7492: 7410: 7088: 7086:predicate as abducible: 7010: 6943: 6710: 6622: 6302: 6139: 6088: 5937: 5702: 5546: 5279: 5089: 4977: 4913: 4719: 4254: 4213:above. However, whereas 3969: 3933:Knowledge representation 3842: 3826:IF condition THEN action 3443: 3432:attends(Person, Meeting) 3307: 3227: 2968: 2916: 2857: 2814: 2681: 2245: 2026: 1818: 1479: 1410: 1370: 1316:stands for the function 1148: 624: 423: 406: 206: 173:In the simplest case of 43:knowledge representation 10576:Ehud Shapiro (Editor). 9894:Artificial Intelligence 9695:Artificial Intelligence 9689:Phan Minh Dung (1995). 9602:10.1145/1342991.1342998 9517:Artificial Intelligence 8999:Artificial Intelligence 4865:Variants and extensions 3740:should_receive_sanction 3578:should_receive_sanction 3503:should_receive_sanction 3230:should_receive_sanction 3203:in mathematical logic. 3186:closed world assumption 3019:should_receive_sanction 2971:should_receive_sanction 2934:should_receive_sanction 2875:should_receive_sanction 2820:should_receive_sanction 2738:should_receive_sanction 2720:should_receive_sanction 2684:should_receive_sanction 1990:. In general, the term 1144:?- fibonacci(n, Result) 986:Artificial Intelligence 825:artificial intelligence 404:, the single answer is 11360:Structured concurrency 10745:Comparison by language 10587:. CACM. December 1965. 10343:10.1006/inco.1994.1036 10309:10.1093/logcom/2.3.297 9743:Thagard, Paul (2005). 9182:(inactive 2024-09-13). 8536:Functional programming 8434:features derived from 8035:concurrent programming 6934:), and are used as in 6135:stable model semantics 6128:Answer Set Programming 6122:Answer set programming 5618:mechanical engineering 5277:history as a teacher: 3911: 3809:Relationship with the 3216:answer set programming 3212:stable model semantics 3197:well-founded semantics 1731:relational programming 1027:Answer Set Programming 782:program transformation 55:Answer Set Programming 11742:Programming paradigms 11703:Programming languages 11325:Multitier programming 11141:Interface description 10741:Programming paradigms 10649:Virtual Library entry 10523:Lloyd, J. W. (1987). 10453:General introductions 9667:10.1145/227595.227597 9456:10.1145/321978.321991 9228:10.1145/359131.359136 9064:10.1145/872734.806939 5659:relational operations 5626:automated timetabling 4237:. The atomic formula 3922:Michiel van Lambalgen 3907: 3294:Metalogic programming 1988:0, s(0), s(s(0)), ... 1099:(goal reduction) and 760:: A negative literal 9483:Logic and Data Bases 9034:Edinburgh University 8785:Cognitive Psychology 5652:relational databases 4239:happens(Event, Time) 3832:", but rules can be 3305:" meta-interpreter: 3201:inductive definition 1980:successor arithmetic 1413:maternal_grandmother 1373:maternal_grandmother 1363:relational databases 1320:, and the predicate 959:symbolic programming 778:program verification 743:, and ... and solve 11465:Self-modifying code 11073:Probabilistic logic 11004:Functional reactive 10959:Expression-oriented 10913:Partial application 10506:10.1145/35043.35046 9282:"Logic programming" 9051:ACM SIGPLAN Notices 8941:. pp. 105–118. 8735:10.1145/35043.35046 8703:. pp. 423–429. 8093:of the clause, and 6936:abductive reasoning 6886:are different from 6094:ancestor_descendant 6066:ancestor_descendant 6048:ancestor_descendant 6030:ancestor_descendant 6012:ancestor_descendant 5994:ancestor_descendant 5915:ancestor_descendant 5897:ancestor_descendant 5876:ancestor_descendant 5837:ancestor_descendant 5630:air traffic control 5604:2010 ≤ T, T ≤ 2012 4225:expresses that the 3820:includes logic and 3210:In the alternative 2909:non-monotonic logic 2584:Negation as failure 2579:Negation as failure 2573:Negation as failure 1760:logical consequence 1114:strategy is called 1006:deductive databases 849:Syracuse University 757:negation as failure 706:non-monotonic logic 11378:Attribute-oriented 11151:List comprehension 11096:Algebraic modeling 10909:Anonymous function 10801:Design by contract 10771:Jackson structures 10689:2011-09-03 at the 10659:2008-12-04 at the 10580:. MIT Press. 1987. 10357:Kobayashi, Naoki; 9653:Journal of the ACM 9442:Journal of the ACM 8631:10.1007/BF01932293 8436:higher-order logic 6907:Boolean SAT solver 6888:constraints in CLP 6884:constraints in ASP 5260:constraint solving 4700:situation calculus 3951:situation calculus 2235:has two solutions 1781:backward reasoning 1312:Here the relation 1097:backward reasoning 990:parallel computers 961:languages such as 955:David H. D. Warren 917:In the meanwhile, 845:John Alan Robinson 831:, associated with 728:is understood as: 11732:Logic programming 11692:Computer language 11679: 11678: 11548: 11547: 11438:Program synthesis 11330:Organic computing 11266: 11265: 11171:Non-English-based 11146:Language-oriented 10924:Purely functional 10875: 10874: 10684:Logic programming 10647:Logic Programming 10578:Concurrent Prolog 10470:. 19–20: 73–148. 10359:Yonezawa, Akinori 10163:978-3-540-62927-6 9863:10.1145/5689.5920 9790:978-0-262-19583-6 9586:(2): 14:1–14:52. 9500:978-1-4684-3386-9 9301:10.1145/4284.4287 9146:978-3-031-35253-9 9110:978-0-306-40060-5 8485:Transaction logic 8347:followed by list 7880:grandparent_child 5675:cartesian product 5614:civil engineering 4971:For example, the 4684:holds(Fact, Time) 4223:holds(Fact, Time) 2227:has the solution 2018:multiply(X, Y, Z) 1969:least fixed point 1947:grandparent_child 1929:grandparent_child 1785:forward reasoning 1777:first-order logic 1101:forward reasoning 1025:in the 1980s and 973:standard Prolog. 884:backward chaining 794:computer programs 588:grandparent_child 564:grandparent_child 501:grandparent_child 456:grandparent_child 426:grandparent_child 341:grandparent_child 31:Logic programming 18:Logic Programming 16:(Redirected from 11754: 11718: 11712: 11707: 11701: 11696: 11690: 11575: 11568: 11561: 11552: 11551: 11450:by demonstration 11355:Service-oriented 11345:Process-oriented 11320:Macroprogramming 11305:Concurrent logic 11176:Page description 11166:Natural language 11136:Grammar-oriented 11063:Nondeterministic 11052:Constraint logic 10954:Point-free style 10949:Functional logic 10886: 10885: 10857:Immutable object 10776:Block-structured 10759: 10758: 10734: 10727: 10720: 10711: 10710: 10573: 10571: 10562:(1–2): 125–157. 10528: 10517: 10491: 10481: 10479: 10465: 10441: 10437: 10431: 10428: 10422: 10418: 10412: 10411: 10409: 10383: 10377: 10376: 10374: 10354: 10348: 10347: 10345: 10319: 10313: 10312: 10290: 10284: 10281: 10275: 10274: 10272: 10246: 10240: 10237: 10231: 10230: 10228: 10226: 10214: 10208: 10201: 10195: 10192: 10186: 10183: 10177: 10174: 10168: 10167: 10149: 10143: 10140: 10134: 10131: 10125: 10124: 10122: 10098: 10092: 10091: 10081: 10071: 10062:(3–4): 337–354. 10047: 10041: 10037: 10031: 10028: 10022: 10019: 10013: 10010: 10004: 10001: 9995: 9992: 9983: 9982: 9972: 9962: 9937: 9928: 9925: 9919: 9918: 9890: 9881: 9875: 9874: 9846: 9837: 9831: 9825: 9819: 9816: 9810: 9804: 9798: 9794: 9778: 9768: 9762: 9758: 9740: 9734: 9731: 9722: 9719: 9713: 9712: 9710: 9686: 9680: 9679: 9669: 9643: 9637: 9636: 9620: 9614: 9613: 9595: 9569: 9563: 9562: 9540: 9534: 9533: 9511: 9505: 9504: 9475: 9469: 9468: 9458: 9432: 9426: 9422: 9416: 9413: 9407: 9404: 9398: 9395: 9389: 9385: 9379: 9378: 9377:. The MIT Press. 9370: 9361: 9360: 9342: 9333:(1–2): 157–187. 9320: 9314: 9313: 9303: 9277: 9271: 9270: 9262: 9256: 9255: 9247: 9241: 9240: 9230: 9204: 9198: 9197: 9191: 9183: 9181: 9157: 9151: 9150: 9124: 9115: 9113: 9102: 9092: 9086: 9083: 9077: 9074: 9068: 9067: 9045: 9039: 9037: 9031: 9022: 9016: 9015: 9006:(3–4): 227–260. 8995: 8986: 8980: 8979: 8949: 8943: 8942: 8930: 8924: 8923: 8913: 8884:Kornfeld, W.A.; 8881: 8875: 8874: 8864: 8858: 8857: 8840: 8834: 8831: 8825: 8824: 8822: 8808: 8802: 8801: 8776: 8770: 8769: 8767: 8753: 8747: 8746: 8720: 8711: 8705: 8704: 8692: 8686: 8685: 8683: 8675:Green, Cordell. 8672: 8666: 8665: 8658:Acta Cybernetica 8649: 8643: 8642: 8612: 8581:Reasoning system 8390: 8383: 8380: 8377: 8374: 8371: 8364: 8361: 8358: 8354: 8350: 8346: 8342: 8339: 8333: 8330: 8327: 8324: 8321: 8318: 8315: 8312: 8309: 8306: 8303: 8300: 8297: 8294: 8291: 8288: 8285: 8282: 8279: 8276: 8273: 8270: 8267: 8264: 8261: 8258: 8255: 8252: 8249: 8246: 8243: 8240: 8237: 8234: 8231: 8228: 8225: 8222: 8219: 8216: 8213: 8210: 8207: 8204: 8201: 8198: 8195: 8192: 8189: 8186: 8179: 8175: 8171: 8167: 8163: 8159: 8152: 8141: 8130: 8121: 8096: 8088: 8078:The conjunction 8072: 8004: 8001: 7998: 7995: 7992: 7989: 7986: 7983: 7980: 7977: 7974: 7971: 7968: 7965: 7962: 7959: 7956: 7953: 7950: 7947: 7944: 7941: 7938: 7935: 7932: 7929: 7926: 7923: 7920: 7917: 7914: 7911: 7908: 7905: 7902: 7899: 7896: 7893: 7890: 7887: 7884: 7881: 7860:machine learning 7839: 7836: 7833: 7830: 7827: 7824: 7821: 7818: 7815: 7812: 7809: 7806: 7803: 7800: 7797: 7794: 7791: 7788: 7785: 7782: 7779: 7769: 7766: 7763: 7760: 7757: 7754: 7751: 7748: 7745: 7742: 7739: 7736: 7733: 7730: 7727: 7724: 7721: 7718: 7715: 7712: 7709: 7706: 7703: 7700: 7697: 7694: 7691: 7688: 7685: 7682: 7679: 7676: 7669: 7662: 7661: 7653: 7650: 7647: 7644: 7641: 7638: 7635: 7632: 7629: 7626: 7623: 7620: 7617: 7614: 7611: 7608: 7605: 7602: 7599: 7596: 7593: 7590: 7587: 7584: 7581: 7578: 7571: 7568: 7565: 7562: 7559: 7556: 7553: 7550: 7547: 7544: 7541: 7538: 7535: 7532: 7529: 7526: 7523: 7520: 7517: 7514: 7511: 7508: 7505: 7502: 7499: 7496: 7489: 7486: 7483: 7480: 7477: 7474: 7471: 7468: 7465: 7462: 7459: 7456: 7453: 7450: 7447: 7444: 7441: 7438: 7435: 7432: 7429: 7426: 7423: 7420: 7417: 7414: 7404: 7401: 7398: 7395: 7392: 7389: 7386: 7383: 7380: 7377: 7374: 7371: 7368: 7365: 7362: 7359: 7356: 7353: 7350: 7347: 7344: 7341: 7338: 7335: 7332: 7329: 7326: 7323: 7320: 7317: 7314: 7311: 7308: 7305: 7302: 7299: 7296: 7293: 7290: 7287: 7284: 7281: 7278: 7275: 7272: 7269: 7266: 7263: 7260: 7257: 7254: 7251: 7248: 7245: 7242: 7239: 7236: 7233: 7230: 7227: 7224: 7221: 7218: 7215: 7212: 7209: 7206: 7203: 7200: 7197: 7194: 7191: 7188: 7185: 7182: 7179: 7176: 7173: 7170: 7167: 7164: 7161: 7158: 7155: 7152: 7149: 7146: 7143: 7140: 7137: 7134: 7131: 7128: 7125: 7122: 7119: 7116: 7113: 7110: 7107: 7104: 7101: 7098: 7095: 7092: 7085: 7074: 7071: 7068: 7065: 7062: 7059: 7056: 7053: 7050: 7047: 7044: 7041: 7038: 7035: 7032: 7029: 7026: 7023: 7020: 7017: 7014: 7004: 7001: 6998: 6995: 6992: 6989: 6986: 6983: 6980: 6977: 6974: 6971: 6968: 6965: 6962: 6959: 6956: 6953: 6950: 6947: 6878: 6874: 6867: 6864: 6861: 6858: 6855: 6852: 6849: 6846: 6843: 6840: 6837: 6834: 6831: 6828: 6825: 6822: 6819: 6816: 6813: 6810: 6807: 6804: 6801: 6798: 6795: 6792: 6789: 6786: 6783: 6780: 6777: 6774: 6771: 6768: 6765: 6762: 6759: 6756: 6753: 6750: 6747: 6744: 6741: 6738: 6735: 6732: 6729: 6726: 6723: 6720: 6717: 6714: 6704: 6701: 6698: 6695: 6692: 6689: 6686: 6683: 6680: 6677: 6674: 6671: 6668: 6665: 6662: 6659: 6656: 6653: 6650: 6647: 6644: 6641: 6638: 6635: 6632: 6629: 6626: 6615: 6612: 6609: 6606: 6603: 6600: 6597: 6594: 6591: 6588: 6585: 6582: 6579: 6576: 6573: 6570: 6567: 6564: 6561: 6558: 6555: 6552: 6549: 6546: 6543: 6540: 6537: 6534: 6531: 6528: 6525: 6522: 6519: 6516: 6513: 6510: 6507: 6504: 6501: 6498: 6495: 6492: 6489: 6486: 6483: 6480: 6477: 6474: 6471: 6468: 6465: 6462: 6459: 6456: 6453: 6450: 6447: 6444: 6441: 6438: 6435: 6432: 6429: 6426: 6423: 6420: 6417: 6414: 6411: 6408: 6405: 6402: 6399: 6396: 6393: 6390: 6387: 6384: 6381: 6378: 6375: 6372: 6369: 6366: 6363: 6360: 6357: 6354: 6351: 6348: 6345: 6342: 6339: 6336: 6333: 6330: 6327: 6324: 6321: 6318: 6315: 6312: 6309: 6306: 6296: 6293: 6290: 6287: 6284: 6281: 6278: 6275: 6272: 6269: 6266: 6263: 6260: 6257: 6254: 6251: 6248: 6245: 6242: 6239: 6236: 6233: 6230: 6227: 6224: 6221: 6218: 6215: 6212: 6209: 6206: 6203: 6200: 6197: 6194: 6191: 6188: 6185: 6182: 6179: 6176: 6173: 6170: 6167: 6164: 6161: 6158: 6155: 6152: 6149: 6146: 6143: 6110: 6107: 6104: 6101: 6098: 6095: 6092: 6082: 6079: 6076: 6073: 6070: 6067: 6064: 6061: 6058: 6055: 6052: 6049: 6046: 6043: 6040: 6037: 6034: 6031: 6028: 6025: 6022: 6019: 6016: 6013: 6010: 6007: 6004: 6001: 5998: 5995: 5992: 5989: 5986: 5983: 5980: 5977: 5974: 5971: 5968: 5965: 5962: 5959: 5956: 5953: 5950: 5947: 5944: 5941: 5931: 5928: 5925: 5922: 5919: 5916: 5913: 5910: 5907: 5904: 5901: 5898: 5895: 5892: 5889: 5886: 5883: 5880: 5877: 5874: 5871: 5868: 5865: 5862: 5859: 5856: 5853: 5850: 5847: 5844: 5841: 5838: 5835: 5832: 5829: 5826: 5823: 5820: 5817: 5814: 5811: 5808: 5805: 5802: 5799: 5796: 5793: 5790: 5787: 5784: 5781: 5778: 5775: 5772: 5769: 5766: 5763: 5760: 5757: 5754: 5751: 5748: 5745: 5742: 5739: 5736: 5733: 5730: 5727: 5724: 5721: 5718: 5715: 5712: 5709: 5706: 5609: 5605: 5598: 5595: 5592: 5589: 5586: 5583: 5580: 5577: 5574: 5571: 5568: 5565: 5562: 5559: 5556: 5553: 5550: 5543: 5539: 5535: 5531: 5527: 5520: 5517: 5514: 5511: 5508: 5505: 5502: 5499: 5496: 5493: 5490: 5487: 5484: 5481: 5478: 5475: 5472: 5469: 5466: 5463: 5460: 5457: 5454: 5451: 5448: 5445: 5442: 5439: 5436: 5433: 5430: 5427: 5424: 5421: 5418: 5415: 5412: 5409: 5406: 5403: 5400: 5397: 5394: 5391: 5388: 5385: 5382: 5379: 5376: 5373: 5370: 5367: 5364: 5361: 5358: 5355: 5352: 5349: 5346: 5343: 5340: 5337: 5334: 5331: 5328: 5325: 5322: 5319: 5316: 5313: 5310: 5307: 5304: 5301: 5298: 5295: 5292: 5289: 5286: 5283: 5276: 5195: 5192: 5189: 5186: 5183: 5180: 5177: 5174: 5171: 5168: 5165: 5162: 5159: 5156: 5153: 5150: 5147: 5144: 5141: 5138: 5135: 5132: 5129: 5126: 5123: 5120: 5117: 5114: 5111: 5108: 5105: 5102: 5099: 5096: 5093: 5083: 5080: 5077: 5074: 5071: 5068: 5065: 5062: 5059: 5056: 5053: 5050: 5047: 5044: 5041: 5038: 5035: 5032: 5029: 5026: 5023: 5020: 5017: 5014: 5011: 5008: 5005: 5002: 4999: 4996: 4993: 4990: 4987: 4984: 4981: 4956: 4953: 4950: 4947: 4944: 4941: 4938: 4935: 4932: 4929: 4926: 4923: 4920: 4917: 4852: 4849: 4846: 4843: 4840: 4837: 4834: 4831: 4828: 4825: 4822: 4819: 4816: 4813: 4810: 4807: 4804: 4801: 4798: 4795: 4792: 4789: 4786: 4783: 4780: 4777: 4774: 4771: 4768: 4765: 4762: 4759: 4756: 4753: 4750: 4747: 4744: 4741: 4738: 4735: 4732: 4729: 4726: 4723: 4685: 4678: 4675: 4672: 4669: 4666: 4663: 4660: 4657: 4654: 4651: 4648: 4645: 4642: 4639: 4636: 4633: 4630: 4627: 4624: 4621: 4618: 4615: 4612: 4609: 4606: 4603: 4600: 4597: 4594: 4591: 4588: 4585: 4582: 4579: 4576: 4573: 4570: 4567: 4564: 4561: 4558: 4555: 4552: 4549: 4546: 4543: 4540: 4537: 4534: 4531: 4528: 4525: 4522: 4519: 4516: 4513: 4510: 4507: 4504: 4501: 4498: 4495: 4492: 4489: 4486: 4483: 4480: 4477: 4474: 4471: 4468: 4465: 4462: 4459: 4456: 4453: 4450: 4447: 4444: 4441: 4438: 4435: 4432: 4429: 4426: 4423: 4420: 4417: 4414: 4411: 4408: 4405: 4402: 4399: 4396: 4393: 4390: 4387: 4384: 4381: 4378: 4375: 4372: 4369: 4366: 4363: 4360: 4357: 4354: 4351: 4348: 4345: 4342: 4339: 4336: 4333: 4330: 4327: 4324: 4321: 4318: 4315: 4312: 4309: 4306: 4303: 4300: 4297: 4294: 4291: 4288: 4285: 4282: 4279: 4276: 4273: 4270: 4267: 4264: 4261: 4258: 4244: 4240: 4232: 4228: 4224: 4220: 4216: 4212: 4208: 4201: 4198: 4195: 4192: 4189: 4186: 4183: 4180: 4177: 4174: 4171: 4168: 4165: 4162: 4159: 4156: 4153: 4150: 4147: 4144: 4141: 4138: 4135: 4132: 4129: 4126: 4123: 4120: 4117: 4114: 4111: 4108: 4105: 4102: 4099: 4096: 4093: 4090: 4087: 4084: 4081: 4078: 4075: 4072: 4069: 4066: 4063: 4060: 4057: 4054: 4051: 4048: 4045: 4042: 4039: 4036: 4033: 4030: 4027: 4024: 4021: 4018: 4015: 4012: 4009: 4006: 4003: 4000: 3997: 3994: 3991: 3988: 3985: 3982: 3979: 3976: 3973: 3959:action languages 3900: 3897: 3894: 3891: 3888: 3885: 3882: 3879: 3876: 3873: 3870: 3867: 3864: 3861: 3858: 3855: 3852: 3849: 3846: 3830:universally true 3804: 3801: 3798: 3795: 3792: 3789: 3786: 3783: 3780: 3777: 3774: 3771: 3768: 3765: 3762: 3759: 3756: 3753: 3750: 3747: 3744: 3741: 3738: 3735: 3732: 3729: 3726: 3723: 3720: 3717: 3714: 3711: 3708: 3705: 3702: 3699: 3696: 3693: 3690: 3687: 3684: 3681: 3678: 3675: 3672: 3669: 3666: 3663: 3660: 3657: 3654: 3651: 3648: 3645: 3642: 3639: 3636: 3633: 3630: 3627: 3624: 3621: 3618: 3615: 3612: 3609: 3606: 3603: 3600: 3597: 3594: 3591: 3588: 3585: 3582: 3579: 3576: 3573: 3570: 3567: 3564: 3561: 3558: 3555: 3552: 3549: 3546: 3543: 3540: 3537: 3534: 3531: 3528: 3525: 3522: 3519: 3516: 3513: 3510: 3507: 3504: 3501: 3498: 3495: 3492: 3489: 3486: 3483: 3480: 3477: 3474: 3471: 3468: 3465: 3462: 3459: 3456: 3453: 3450: 3447: 3441: 3437: 3433: 3404: 3401: 3398: 3395: 3392: 3389: 3386: 3383: 3380: 3377: 3374: 3371: 3368: 3365: 3362: 3359: 3356: 3353: 3350: 3347: 3344: 3341: 3338: 3335: 3332: 3329: 3326: 3323: 3320: 3317: 3314: 3311: 3282: 3279: 3276: 3273: 3270: 3267: 3264: 3261: 3258: 3255: 3252: 3249: 3246: 3243: 3240: 3237: 3234: 3231: 3170: 3167: 3164: 3161: 3158: 3155: 3152: 3149: 3146: 3143: 3140: 3137: 3134: 3131: 3128: 3125: 3122: 3119: 3116: 3113: 3110: 3107: 3104: 3101: 3098: 3095: 3092: 3089: 3086: 3083: 3080: 3077: 3074: 3071: 3068: 3065: 3062: 3059: 3056: 3053: 3050: 3047: 3044: 3041: 3038: 3035: 3032: 3029: 3026: 3023: 3020: 3017: 3014: 3011: 3008: 3005: 3002: 2999: 2996: 2993: 2990: 2987: 2984: 2981: 2978: 2975: 2972: 2962: 2959: 2956: 2953: 2950: 2947: 2944: 2941: 2938: 2935: 2932: 2929: 2926: 2923: 2920: 2903: 2900: 2897: 2894: 2891: 2888: 2885: 2882: 2879: 2876: 2873: 2870: 2867: 2864: 2861: 2848: 2845: 2842: 2839: 2836: 2833: 2830: 2827: 2824: 2821: 2818: 2808: 2805: 2802: 2799: 2796: 2793: 2790: 2787: 2784: 2781: 2778: 2775: 2772: 2769: 2766: 2763: 2760: 2757: 2754: 2751: 2748: 2745: 2742: 2739: 2736: 2733: 2730: 2727: 2724: 2721: 2718: 2715: 2712: 2709: 2706: 2703: 2700: 2697: 2694: 2691: 2688: 2685: 2671: 2664: 2646: 2637: 2632: 2593: 2589: 2567: 2566: 2563: 2560: 2557: 2554: 2551: 2548: 2545: 2542: 2539: 2536: 2533: 2530: 2527: 2524: 2521: 2518: 2515: 2512: 2509: 2506: 2503: 2500: 2497: 2494: 2491: 2488: 2480: 2476: 2472: 2465: 2462: 2459: 2456: 2453: 2450: 2447: 2444: 2441: 2438: 2435: 2432: 2429: 2426: 2423: 2420: 2417: 2414: 2411: 2408: 2405: 2402: 2399: 2396: 2393: 2390: 2387: 2384: 2381: 2378: 2375: 2372: 2369: 2366: 2363: 2360: 2357: 2354: 2351: 2348: 2345: 2342: 2339: 2336: 2333: 2330: 2327: 2324: 2321: 2318: 2315: 2312: 2309: 2306: 2303: 2300: 2297: 2294: 2291: 2288: 2285: 2282: 2279: 2276: 2273: 2270: 2267: 2264: 2261: 2258: 2255: 2252: 2249: 2242: 2238: 2234: 2230: 2226: 2219: 2216: 2213: 2210: 2207: 2204: 2201: 2198: 2195: 2192: 2189: 2186: 2183: 2180: 2177: 2174: 2171: 2168: 2165: 2162: 2159: 2156: 2153: 2150: 2147: 2144: 2141: 2138: 2135: 2132: 2129: 2126: 2123: 2120: 2117: 2114: 2111: 2108: 2105: 2102: 2099: 2096: 2093: 2090: 2087: 2084: 2081: 2078: 2075: 2072: 2069: 2066: 2063: 2060: 2057: 2054: 2051: 2048: 2045: 2042: 2039: 2036: 2033: 2030: 2023: 2019: 2015: 2011: 2001: 1997: 1993: 1989: 1985: 1963: 1960: 1957: 1954: 1951: 1948: 1945: 1942: 1939: 1936: 1933: 1930: 1927: 1924: 1921: 1918: 1915: 1912: 1909: 1906: 1903: 1900: 1897: 1894: 1891: 1888: 1885: 1882: 1879: 1876: 1873: 1870: 1867: 1864: 1861: 1858: 1855: 1852: 1849: 1846: 1843: 1840: 1837: 1834: 1831: 1828: 1825: 1822: 1809:of the program. 1768:of the program. 1720: 1717: 1714: 1711: 1708: 1705: 1702: 1699: 1696: 1693: 1690: 1687: 1684: 1681: 1678: 1675: 1672: 1669: 1666: 1663: 1660: 1657: 1654: 1651: 1648: 1645: 1642: 1639: 1636: 1633: 1630: 1627: 1624: 1621: 1618: 1615: 1612: 1609: 1606: 1603: 1600: 1597: 1594: 1591: 1588: 1585: 1582: 1579: 1576: 1573: 1570: 1567: 1564: 1561: 1558: 1555: 1552: 1549: 1546: 1543: 1540: 1537: 1534: 1531: 1528: 1525: 1522: 1519: 1516: 1513: 1510: 1507: 1504: 1501: 1498: 1495: 1492: 1489: 1486: 1483: 1468: 1465: 1462: 1459: 1456: 1453: 1450: 1447: 1444: 1441: 1438: 1435: 1432: 1429: 1426: 1423: 1420: 1417: 1414: 1404: 1401: 1398: 1395: 1392: 1389: 1386: 1383: 1380: 1377: 1374: 1338: 1331: 1328:to the value of 1327: 1323: 1319: 1318:fibonacci(N) = M 1315: 1308: 1305: 1302: 1299: 1296: 1293: 1290: 1287: 1284: 1281: 1278: 1275: 1272: 1269: 1266: 1263: 1260: 1257: 1254: 1251: 1248: 1245: 1242: 1239: 1236: 1233: 1230: 1227: 1224: 1221: 1218: 1215: 1212: 1209: 1206: 1203: 1200: 1197: 1194: 1191: 1188: 1185: 1182: 1179: 1176: 1173: 1170: 1167: 1164: 1161: 1158: 1155: 1152: 1145: 1128: 1127: 1120: 1119: 1048:J. Alan Robinson 1042:. Its founding 919:Alain Colmerauer 888:forward chaining 776:for logic-based 767: 763: 749: 742: 735: 700: 697: 694: 691: 688: 685: 682: 679: 676: 673: 670: 667: 664: 661: 658: 655: 652: 649: 646: 643: 640: 637: 634: 631: 628: 622: 607: 604: 601: 598: 595: 592: 589: 586: 583: 580: 577: 574: 571: 568: 565: 562: 559: 556: 553: 550: 547: 544: 541: 538: 535: 532: 529: 526: 523: 520: 517: 514: 511: 508: 505: 502: 499: 496: 493: 490: 487: 484: 481: 478: 475: 472: 469: 466: 463: 460: 457: 454: 451: 448: 445: 442: 439: 436: 433: 430: 427: 416: 413: 410: 403: 396: 393: 390: 387: 384: 381: 378: 375: 372: 369: 366: 363: 360: 357: 354: 351: 348: 345: 342: 339: 336: 333: 330: 327: 324: 321: 318: 315: 312: 309: 306: 303: 300: 297: 294: 291: 288: 285: 282: 279: 276: 273: 270: 267: 264: 261: 258: 255: 252: 249: 246: 243: 240: 237: 234: 231: 228: 225: 222: 219: 216: 213: 210: 169: 151: 134: 123: 116: 105: 99: 81: 21: 11762: 11761: 11757: 11756: 11755: 11753: 11752: 11751: 11722: 11721: 11716: 11710: 11705: 11699: 11694: 11688: 11685: 11680: 11675: 11637: 11628:Very high-level 11584: 11579: 11549: 11544: 11486: 11479: 11370:Metaprogramming 11364: 11280: 11275: 11262: 11244:Graph rewriting 11082: 11058:Inductive logic 11038:Abductive logic 11024: 10981: 10944:Dependent types 10892: 10871: 10843:Prototype-based 10823: 10821:Object-oriented 10815: 10811:Nested function 10806:Invariant-based 10748: 10738: 10691:Wayback Machine 10661:Wayback Machine 10642: 10604: 10602:Further reading 10538:John McCarthy. 10535: 10489: 10463: 10455: 10450: 10445: 10444: 10438: 10434: 10429: 10425: 10419: 10415: 10384: 10380: 10355: 10351: 10320: 10316: 10291: 10287: 10282: 10278: 10247: 10243: 10238: 10234: 10224: 10222: 10215: 10211: 10202: 10198: 10193: 10189: 10184: 10180: 10175: 10171: 10164: 10150: 10146: 10141: 10137: 10132: 10128: 10099: 10095: 10048: 10044: 10038: 10034: 10029: 10025: 10020: 10016: 10011: 10007: 10002: 9998: 9993: 9986: 9938: 9931: 9926: 9922: 9888: 9882: 9878: 9844: 9838: 9834: 9826: 9822: 9817: 9813: 9805: 9801: 9791: 9769: 9765: 9755: 9741: 9737: 9732: 9725: 9720: 9716: 9687: 9683: 9644: 9640: 9621: 9617: 9570: 9566: 9541: 9537: 9512: 9508: 9501: 9476: 9472: 9433: 9429: 9423: 9419: 9414: 9410: 9405: 9401: 9396: 9392: 9386: 9382: 9371: 9364: 9321: 9317: 9278: 9274: 9263: 9259: 9248: 9244: 9205: 9201: 9185: 9184: 9158: 9154: 9147: 9125: 9118: 9111: 9093: 9089: 9084: 9080: 9075: 9071: 9046: 9042: 9029: 9023: 9019: 8993: 8987: 8983: 8968:10.2307/2272384 8950: 8946: 8931: 8927: 8882: 8878: 8865: 8861: 8844:McDermott, D.V. 8841: 8837: 8832: 8828: 8820: 8809: 8805: 8780:Winograd, Terry 8777: 8773: 8765: 8754: 8750: 8718: 8712: 8708: 8693: 8689: 8681: 8673: 8669: 8650: 8646: 8613: 8609: 8604: 8502: 8482: 8465: 8452: 8428: 8413: 8407: 8388: 8385: 8384: 8381: 8378: 8375: 8372: 8369: 8363: 8360: 8356: 8352: 8348: 8344: 8341: 8338: 8335: 8334: 8331: 8328: 8325: 8322: 8319: 8316: 8313: 8310: 8307: 8304: 8301: 8298: 8295: 8292: 8289: 8286: 8283: 8280: 8277: 8274: 8271: 8268: 8265: 8262: 8259: 8256: 8253: 8250: 8247: 8244: 8241: 8238: 8235: 8232: 8229: 8226: 8223: 8220: 8217: 8214: 8211: 8208: 8205: 8202: 8199: 8196: 8193: 8190: 8187: 8184: 8177: 8173: 8169: 8165: 8161: 8157: 8151: 8147: 8143: 8140: 8136: 8132: 8128: 8119: 8115: 8111: 8107: 8103: 8094: 8087: 8083: 8079: 8070: 8066: 8062: 8058: 8054: 8031: 8025: 8006: 8005: 8002: 7999: 7996: 7993: 7990: 7987: 7984: 7981: 7978: 7975: 7972: 7969: 7966: 7963: 7960: 7957: 7954: 7951: 7948: 7945: 7942: 7939: 7936: 7933: 7930: 7927: 7924: 7921: 7918: 7915: 7912: 7909: 7906: 7903: 7900: 7897: 7894: 7891: 7888: 7885: 7882: 7879: 7856: 7850: 7841: 7840: 7837: 7834: 7831: 7828: 7825: 7822: 7819: 7816: 7813: 7810: 7807: 7804: 7801: 7798: 7795: 7792: 7789: 7786: 7783: 7780: 7777: 7771: 7770: 7767: 7764: 7761: 7758: 7755: 7752: 7749: 7746: 7743: 7740: 7737: 7734: 7731: 7728: 7725: 7722: 7719: 7716: 7713: 7710: 7707: 7704: 7701: 7698: 7695: 7692: 7689: 7686: 7683: 7680: 7677: 7674: 7667: 7659: 7655: 7654: 7651: 7648: 7645: 7642: 7639: 7636: 7633: 7630: 7627: 7624: 7621: 7618: 7615: 7612: 7609: 7606: 7603: 7600: 7597: 7594: 7591: 7588: 7585: 7582: 7579: 7576: 7573: 7572: 7569: 7566: 7563: 7560: 7557: 7554: 7551: 7548: 7545: 7542: 7539: 7536: 7533: 7530: 7527: 7524: 7521: 7518: 7515: 7512: 7509: 7506: 7503: 7500: 7497: 7494: 7491: 7490: 7487: 7484: 7481: 7478: 7475: 7472: 7469: 7466: 7463: 7460: 7457: 7454: 7451: 7448: 7445: 7442: 7439: 7436: 7433: 7430: 7427: 7424: 7421: 7418: 7415: 7412: 7406: 7405: 7402: 7399: 7396: 7393: 7390: 7387: 7384: 7381: 7378: 7375: 7372: 7369: 7366: 7363: 7360: 7357: 7354: 7351: 7348: 7345: 7342: 7339: 7336: 7333: 7330: 7327: 7324: 7321: 7318: 7315: 7312: 7309: 7306: 7303: 7300: 7297: 7294: 7291: 7288: 7285: 7282: 7279: 7276: 7273: 7270: 7267: 7264: 7261: 7258: 7255: 7252: 7249: 7246: 7243: 7240: 7237: 7234: 7231: 7228: 7225: 7222: 7219: 7216: 7213: 7210: 7207: 7204: 7201: 7198: 7195: 7192: 7189: 7186: 7183: 7180: 7177: 7174: 7171: 7168: 7165: 7162: 7159: 7156: 7153: 7150: 7147: 7144: 7141: 7138: 7135: 7132: 7129: 7126: 7123: 7120: 7117: 7114: 7111: 7108: 7105: 7102: 7099: 7096: 7093: 7090: 7083: 7076: 7075: 7072: 7069: 7066: 7063: 7060: 7057: 7054: 7051: 7048: 7045: 7042: 7039: 7036: 7033: 7030: 7027: 7024: 7021: 7018: 7015: 7012: 7006: 7005: 7002: 6999: 6996: 6993: 6990: 6987: 6984: 6981: 6978: 6975: 6972: 6969: 6966: 6963: 6960: 6957: 6954: 6951: 6948: 6945: 6921: 6915: 6876: 6872: 6869: 6868: 6865: 6862: 6859: 6856: 6853: 6850: 6847: 6844: 6841: 6838: 6835: 6832: 6829: 6826: 6823: 6820: 6817: 6814: 6811: 6808: 6805: 6802: 6799: 6796: 6793: 6790: 6787: 6784: 6781: 6778: 6775: 6772: 6769: 6766: 6763: 6760: 6757: 6754: 6751: 6748: 6745: 6742: 6739: 6736: 6733: 6730: 6727: 6724: 6721: 6718: 6715: 6712: 6706: 6705: 6702: 6699: 6696: 6693: 6690: 6687: 6684: 6681: 6678: 6675: 6672: 6669: 6666: 6663: 6660: 6657: 6654: 6651: 6648: 6645: 6642: 6639: 6636: 6633: 6630: 6627: 6624: 6617: 6616: 6613: 6610: 6607: 6604: 6601: 6598: 6595: 6592: 6589: 6586: 6583: 6580: 6577: 6574: 6571: 6568: 6565: 6562: 6559: 6556: 6553: 6550: 6547: 6544: 6541: 6538: 6535: 6532: 6529: 6526: 6523: 6520: 6517: 6514: 6511: 6508: 6505: 6502: 6499: 6496: 6493: 6490: 6487: 6484: 6481: 6478: 6475: 6472: 6469: 6466: 6463: 6460: 6457: 6454: 6451: 6448: 6445: 6442: 6439: 6436: 6433: 6430: 6427: 6424: 6421: 6418: 6415: 6412: 6409: 6406: 6403: 6400: 6397: 6394: 6391: 6388: 6385: 6382: 6379: 6376: 6373: 6370: 6367: 6364: 6361: 6358: 6355: 6352: 6349: 6346: 6343: 6340: 6337: 6334: 6331: 6328: 6325: 6322: 6319: 6316: 6313: 6310: 6307: 6304: 6298: 6297: 6294: 6291: 6288: 6285: 6282: 6279: 6276: 6273: 6270: 6267: 6264: 6261: 6258: 6255: 6252: 6249: 6246: 6243: 6240: 6237: 6234: 6231: 6228: 6225: 6222: 6219: 6216: 6213: 6210: 6207: 6204: 6201: 6198: 6195: 6192: 6189: 6186: 6183: 6180: 6177: 6174: 6171: 6168: 6165: 6162: 6159: 6156: 6153: 6150: 6147: 6144: 6141: 6130: 6124: 6112: 6111: 6108: 6105: 6102: 6099: 6096: 6093: 6090: 6084: 6083: 6080: 6077: 6074: 6071: 6068: 6065: 6062: 6059: 6056: 6053: 6050: 6047: 6044: 6041: 6038: 6035: 6032: 6029: 6026: 6023: 6020: 6017: 6014: 6011: 6008: 6005: 6002: 5999: 5996: 5993: 5990: 5987: 5984: 5981: 5978: 5975: 5972: 5969: 5966: 5963: 5960: 5957: 5954: 5951: 5948: 5945: 5942: 5939: 5933: 5932: 5929: 5926: 5923: 5920: 5917: 5914: 5911: 5908: 5905: 5902: 5899: 5896: 5893: 5890: 5887: 5884: 5881: 5878: 5875: 5872: 5869: 5866: 5863: 5860: 5857: 5854: 5851: 5848: 5845: 5842: 5839: 5836: 5833: 5830: 5827: 5824: 5821: 5818: 5815: 5812: 5809: 5806: 5803: 5800: 5797: 5794: 5791: 5788: 5785: 5782: 5779: 5776: 5773: 5770: 5767: 5764: 5761: 5758: 5755: 5752: 5749: 5746: 5743: 5740: 5737: 5734: 5731: 5728: 5725: 5722: 5719: 5716: 5713: 5710: 5707: 5704: 5648: 5642: 5622:digital circuit 5607: 5603: 5600: 5599: 5596: 5593: 5590: 5587: 5584: 5581: 5578: 5575: 5572: 5569: 5566: 5563: 5560: 5557: 5554: 5551: 5548: 5541: 5537: 5533: 5529: 5525: 5522: 5521: 5518: 5515: 5512: 5509: 5506: 5503: 5500: 5497: 5494: 5491: 5488: 5485: 5482: 5479: 5476: 5473: 5470: 5467: 5464: 5461: 5458: 5455: 5452: 5449: 5446: 5443: 5440: 5437: 5434: 5431: 5428: 5425: 5422: 5419: 5416: 5413: 5410: 5407: 5404: 5401: 5398: 5395: 5392: 5389: 5386: 5383: 5380: 5377: 5374: 5371: 5368: 5365: 5362: 5359: 5356: 5353: 5350: 5347: 5344: 5341: 5338: 5335: 5332: 5329: 5326: 5323: 5320: 5317: 5314: 5311: 5308: 5305: 5302: 5299: 5296: 5293: 5290: 5287: 5284: 5281: 5274: 5253: 5247: 5197: 5196: 5193: 5190: 5187: 5184: 5181: 5178: 5175: 5172: 5169: 5166: 5163: 5160: 5157: 5154: 5151: 5148: 5145: 5142: 5139: 5136: 5133: 5130: 5127: 5124: 5121: 5118: 5115: 5112: 5109: 5106: 5103: 5100: 5097: 5094: 5091: 5085: 5084: 5081: 5078: 5075: 5072: 5069: 5066: 5063: 5060: 5057: 5054: 5051: 5048: 5045: 5042: 5039: 5036: 5033: 5030: 5027: 5024: 5021: 5018: 5015: 5012: 5009: 5006: 5003: 5000: 4997: 4994: 4991: 4988: 4985: 4982: 4979: 4958: 4957: 4954: 4951: 4948: 4945: 4942: 4939: 4936: 4933: 4930: 4927: 4924: 4921: 4918: 4915: 4878: 4872: 4867: 4854: 4853: 4850: 4847: 4844: 4841: 4838: 4835: 4832: 4829: 4826: 4823: 4820: 4817: 4814: 4811: 4808: 4805: 4802: 4799: 4796: 4793: 4790: 4787: 4784: 4781: 4778: 4775: 4772: 4769: 4766: 4763: 4760: 4757: 4754: 4751: 4748: 4745: 4742: 4739: 4736: 4733: 4730: 4727: 4724: 4721: 4683: 4680: 4679: 4676: 4673: 4670: 4667: 4664: 4661: 4658: 4655: 4652: 4649: 4646: 4643: 4640: 4637: 4634: 4631: 4628: 4625: 4622: 4619: 4616: 4613: 4610: 4607: 4604: 4601: 4598: 4595: 4592: 4589: 4586: 4583: 4580: 4577: 4574: 4571: 4568: 4565: 4562: 4559: 4556: 4553: 4550: 4547: 4544: 4541: 4538: 4535: 4532: 4529: 4526: 4523: 4520: 4517: 4514: 4511: 4508: 4505: 4502: 4499: 4496: 4493: 4490: 4487: 4484: 4481: 4478: 4475: 4472: 4469: 4466: 4463: 4460: 4457: 4454: 4451: 4448: 4445: 4442: 4439: 4436: 4433: 4430: 4427: 4424: 4421: 4418: 4415: 4412: 4409: 4406: 4403: 4400: 4397: 4394: 4391: 4388: 4385: 4382: 4379: 4376: 4373: 4370: 4367: 4364: 4361: 4358: 4355: 4352: 4349: 4346: 4343: 4340: 4337: 4334: 4331: 4328: 4325: 4322: 4319: 4316: 4313: 4310: 4307: 4304: 4301: 4298: 4295: 4292: 4289: 4286: 4283: 4280: 4277: 4274: 4271: 4268: 4265: 4262: 4259: 4256: 4242: 4238: 4230: 4226: 4222: 4218: 4214: 4210: 4206: 4203: 4202: 4199: 4196: 4193: 4190: 4187: 4184: 4181: 4178: 4175: 4172: 4169: 4166: 4163: 4160: 4157: 4154: 4151: 4148: 4145: 4142: 4139: 4136: 4133: 4130: 4127: 4124: 4121: 4118: 4115: 4112: 4109: 4106: 4103: 4100: 4097: 4094: 4091: 4088: 4085: 4082: 4079: 4076: 4073: 4070: 4067: 4064: 4061: 4058: 4055: 4052: 4049: 4046: 4043: 4040: 4037: 4034: 4031: 4028: 4025: 4022: 4019: 4016: 4013: 4010: 4007: 4004: 4001: 3998: 3995: 3992: 3989: 3986: 3983: 3980: 3977: 3974: 3971: 3935: 3902: 3901: 3898: 3895: 3892: 3889: 3886: 3883: 3880: 3877: 3874: 3871: 3868: 3865: 3862: 3859: 3856: 3853: 3850: 3847: 3844: 3814: 3806: 3805: 3802: 3799: 3796: 3793: 3790: 3787: 3784: 3781: 3778: 3775: 3772: 3769: 3766: 3763: 3760: 3757: 3754: 3751: 3748: 3745: 3742: 3739: 3736: 3733: 3730: 3727: 3724: 3721: 3718: 3715: 3712: 3709: 3706: 3703: 3700: 3697: 3694: 3691: 3688: 3685: 3682: 3679: 3676: 3673: 3670: 3667: 3664: 3661: 3658: 3655: 3652: 3649: 3646: 3643: 3640: 3637: 3634: 3631: 3628: 3625: 3622: 3619: 3616: 3613: 3610: 3607: 3604: 3601: 3598: 3595: 3592: 3589: 3586: 3583: 3580: 3577: 3574: 3571: 3568: 3565: 3562: 3559: 3556: 3553: 3550: 3547: 3544: 3541: 3538: 3535: 3532: 3529: 3526: 3523: 3520: 3517: 3514: 3511: 3508: 3505: 3502: 3499: 3496: 3493: 3490: 3487: 3484: 3481: 3478: 3475: 3472: 3469: 3466: 3463: 3460: 3457: 3454: 3451: 3448: 3445: 3439: 3435: 3431: 3425:object language 3406: 3405: 3402: 3399: 3396: 3393: 3390: 3387: 3384: 3381: 3378: 3375: 3372: 3369: 3366: 3363: 3360: 3357: 3354: 3351: 3348: 3345: 3342: 3339: 3336: 3333: 3330: 3327: 3324: 3321: 3318: 3315: 3312: 3309: 3299:Metaprogramming 3296: 3284: 3283: 3280: 3277: 3274: 3271: 3268: 3265: 3262: 3259: 3256: 3253: 3250: 3247: 3244: 3241: 3238: 3235: 3232: 3229: 3179:circumscription 3176:John McCarthy's 3172: 3171: 3168: 3165: 3162: 3159: 3156: 3153: 3150: 3147: 3144: 3141: 3138: 3135: 3132: 3129: 3126: 3123: 3120: 3117: 3114: 3111: 3108: 3105: 3102: 3099: 3096: 3093: 3090: 3087: 3084: 3081: 3078: 3075: 3072: 3069: 3066: 3063: 3060: 3057: 3054: 3051: 3048: 3045: 3042: 3039: 3036: 3033: 3030: 3027: 3024: 3021: 3018: 3015: 3012: 3009: 3006: 3003: 3000: 2997: 2994: 2991: 2988: 2985: 2982: 2979: 2976: 2973: 2970: 2964: 2963: 2960: 2957: 2954: 2951: 2948: 2945: 2942: 2939: 2936: 2933: 2930: 2927: 2924: 2921: 2918: 2905: 2904: 2901: 2898: 2895: 2892: 2889: 2886: 2883: 2880: 2877: 2874: 2871: 2868: 2865: 2862: 2859: 2850: 2849: 2846: 2843: 2840: 2837: 2834: 2831: 2828: 2825: 2822: 2819: 2816: 2810: 2809: 2806: 2803: 2800: 2797: 2794: 2791: 2788: 2785: 2782: 2779: 2776: 2773: 2770: 2767: 2764: 2761: 2758: 2755: 2752: 2749: 2746: 2743: 2740: 2737: 2734: 2731: 2728: 2725: 2722: 2719: 2716: 2713: 2710: 2707: 2704: 2701: 2698: 2695: 2692: 2689: 2686: 2683: 2669: 2662: 2658: 2654: 2644: 2641:A :- Body 2640: 2635: 2630: 2627:A :- Body 2626: 2591: 2587: 2581: 2575: 2564: 2561: 2558: 2555: 2552: 2549: 2546: 2543: 2540: 2537: 2534: 2531: 2528: 2525: 2522: 2519: 2516: 2513: 2510: 2507: 2504: 2501: 2498: 2495: 2492: 2489: 2486: 2478: 2474: 2470: 2467: 2466: 2463: 2460: 2457: 2454: 2451: 2448: 2445: 2442: 2439: 2436: 2433: 2430: 2427: 2424: 2421: 2418: 2415: 2412: 2409: 2406: 2403: 2400: 2397: 2394: 2391: 2388: 2385: 2382: 2379: 2376: 2373: 2370: 2367: 2364: 2361: 2358: 2355: 2352: 2349: 2346: 2343: 2340: 2337: 2334: 2331: 2328: 2325: 2322: 2319: 2316: 2313: 2310: 2307: 2304: 2301: 2298: 2295: 2292: 2289: 2286: 2283: 2280: 2277: 2274: 2271: 2268: 2265: 2262: 2259: 2256: 2253: 2250: 2247: 2240: 2236: 2232: 2228: 2224: 2221: 2220: 2217: 2214: 2211: 2208: 2205: 2202: 2199: 2196: 2193: 2190: 2187: 2184: 2181: 2178: 2175: 2172: 2169: 2166: 2163: 2160: 2157: 2154: 2151: 2148: 2145: 2142: 2139: 2136: 2133: 2130: 2127: 2124: 2121: 2118: 2115: 2112: 2109: 2106: 2103: 2100: 2097: 2094: 2091: 2088: 2085: 2082: 2079: 2076: 2073: 2070: 2067: 2064: 2061: 2058: 2055: 2052: 2049: 2046: 2043: 2040: 2037: 2034: 2031: 2028: 2021: 2017: 2013: 2009: 2006: 1999: 1995: 1991: 1987: 1983: 1965: 1964: 1961: 1958: 1955: 1952: 1949: 1946: 1943: 1940: 1937: 1934: 1931: 1928: 1925: 1922: 1919: 1916: 1913: 1910: 1907: 1904: 1901: 1898: 1895: 1892: 1889: 1886: 1883: 1880: 1877: 1874: 1871: 1868: 1865: 1862: 1859: 1856: 1853: 1850: 1847: 1844: 1841: 1838: 1835: 1832: 1829: 1826: 1823: 1820: 1773:theorem-proving 1755: 1749: 1727: 1722: 1721: 1718: 1715: 1712: 1709: 1706: 1703: 1700: 1697: 1694: 1691: 1688: 1685: 1682: 1679: 1676: 1673: 1670: 1667: 1664: 1661: 1658: 1655: 1652: 1649: 1646: 1643: 1640: 1637: 1634: 1631: 1628: 1625: 1622: 1619: 1616: 1613: 1610: 1607: 1604: 1601: 1598: 1595: 1592: 1589: 1586: 1583: 1580: 1577: 1574: 1571: 1568: 1565: 1562: 1559: 1556: 1553: 1550: 1547: 1544: 1541: 1538: 1535: 1532: 1529: 1526: 1523: 1520: 1517: 1514: 1511: 1508: 1505: 1502: 1499: 1496: 1493: 1490: 1487: 1484: 1481: 1470: 1469: 1466: 1463: 1460: 1457: 1454: 1451: 1448: 1445: 1442: 1439: 1436: 1433: 1430: 1427: 1424: 1421: 1418: 1415: 1412: 1406: 1405: 1402: 1399: 1396: 1393: 1390: 1387: 1384: 1381: 1378: 1375: 1372: 1358: 1352: 1336: 1329: 1325: 1322:N is Expression 1321: 1317: 1314:fibonacci(N, M) 1313: 1310: 1309: 1306: 1303: 1300: 1297: 1294: 1291: 1288: 1285: 1282: 1279: 1276: 1273: 1270: 1267: 1264: 1261: 1258: 1255: 1252: 1249: 1246: 1243: 1240: 1237: 1234: 1231: 1228: 1225: 1222: 1219: 1216: 1213: 1210: 1207: 1204: 1201: 1198: 1195: 1192: 1189: 1186: 1183: 1180: 1177: 1174: 1171: 1168: 1165: 1162: 1159: 1156: 1153: 1150: 1143: 1125: 1124: 1117: 1116: 1078: 1070: 1060:, published by 1044:editor-in-chief 931:formal grammars 925:was working on 896:Eugene Charniak 878:, developed by 857:Robert Kowalski 837:Bertram Raphael 800:, developed by 798:lambda calculus 790: 768:fails to hold. 765: 761: 748: 744: 741: 737: 733: 727: 723: 702: 701: 698: 695: 692: 689: 686: 683: 680: 677: 674: 671: 668: 665: 662: 659: 656: 653: 650: 647: 644: 641: 638: 635: 632: 629: 626: 620: 613:Turing complete 609: 608: 605: 602: 599: 596: 593: 590: 587: 584: 581: 578: 575: 572: 569: 566: 563: 560: 557: 554: 551: 548: 545: 542: 539: 536: 533: 530: 527: 524: 521: 518: 515: 512: 509: 506: 503: 500: 497: 494: 491: 488: 485: 482: 479: 476: 473: 470: 467: 464: 461: 458: 455: 452: 449: 446: 443: 440: 437: 434: 431: 428: 425: 418: 417: 414: 411: 408: 401: 398: 397: 394: 391: 388: 385: 382: 379: 376: 373: 370: 367: 364: 361: 358: 355: 352: 349: 346: 343: 340: 337: 334: 331: 328: 325: 322: 319: 316: 313: 310: 307: 304: 301: 298: 295: 292: 289: 286: 283: 280: 277: 274: 271: 268: 265: 262: 259: 256: 253: 250: 247: 244: 241: 238: 235: 232: 229: 226: 223: 220: 217: 214: 211: 208: 200: 196: 192: 189:of the form p(t 187:atomic formulae 184: 180: 167: 163: 159: 149: 133: 129: 122: 118: 115: 111: 103: 97: 93: 89: 79: 75: 71: 28: 23: 22: 15: 12: 11: 5: 11760: 11750: 11749: 11744: 11739: 11734: 11720: 11719: 11708: 11697: 11684: 11681: 11677: 11676: 11674: 11673: 11668: 11663: 11658: 11653: 11647: 11645: 11639: 11638: 11636: 11635: 11630: 11625: 11620: 11614: 11613: 11608: 11603: 11598: 11592: 11590: 11586: 11585: 11578: 11577: 11570: 11563: 11555: 11546: 11545: 11543: 11542: 11537: 11532: 11527: 11522: 11517: 11512: 11507: 11502: 11497: 11491: 11489: 11481: 11480: 11478: 11477: 11472: 11467: 11462: 11457: 11435: 11430: 11425: 11415: 11410: 11405: 11400: 11395: 11390: 11380: 11374: 11372: 11366: 11365: 11363: 11362: 11357: 11352: 11347: 11342: 11337: 11332: 11327: 11322: 11317: 11312: 11302: 11297: 11292: 11286: 11284: 11268: 11267: 11264: 11263: 11261: 11260: 11255: 11240:Transformation 11237: 11232: 11227: 11222: 11217: 11212: 11207: 11202: 11197: 11192: 11187: 11178: 11173: 11168: 11163: 11158: 11153: 11148: 11143: 11138: 11133: 11128: 11126:Differentiable 11123: 11113: 11106:Automata-based 11103: 11098: 11092: 11090: 11084: 11083: 11081: 11080: 11075: 11070: 11065: 11060: 11055: 11045: 11040: 11034: 11032: 11026: 11025: 11023: 11022: 11017: 11012: 11007: 10997: 10991: 10989: 10983: 10982: 10980: 10979: 10973:Function-level 10970: 10961: 10956: 10951: 10946: 10941: 10936: 10931: 10926: 10921: 10916: 10906: 10900: 10898: 10883: 10877: 10876: 10873: 10872: 10870: 10869: 10864: 10859: 10854: 10849: 10835: 10833: 10817: 10816: 10814: 10813: 10808: 10803: 10798: 10793: 10788: 10786:Non-structured 10783: 10778: 10773: 10767: 10765: 10756: 10750: 10749: 10737: 10736: 10729: 10722: 10714: 10708: 10707: 10702: 10697: 10681: 10676: 10668: 10663: 10651: 10641: 10640:External links 10638: 10637: 10636: 10630: 10623: 10614:Carl Hewitt. " 10612: 10611:". IJCAI 1971. 10607:Carl Hewitt. " 10603: 10600: 10599: 10598: 10591:Gabbay, Dov M. 10588: 10583:James Slagle. 10581: 10574: 10547: 10534: 10531: 10530: 10529: 10520: 10482: 10454: 10451: 10449: 10446: 10443: 10442: 10432: 10423: 10413: 10400:(1): 201–232. 10378: 10372:10.1.1.42.8749 10349: 10336:(2): 327–365. 10314: 10303:(3): 297–347. 10285: 10276: 10263:(3): 187–230. 10241: 10232: 10209: 10196: 10187: 10178: 10169: 10162: 10144: 10135: 10126: 10093: 10042: 10032: 10023: 10014: 10005: 9996: 9984: 9953:(6): 776–858. 9929: 9920: 9876: 9857:(5): 370–386. 9832: 9820: 9811: 9799: 9789: 9763: 9753: 9735: 9723: 9714: 9701:(2): 321–357. 9681: 9638: 9615: 9564: 9535: 9506: 9499: 9470: 9449:(4): 733–742. 9427: 9417: 9408: 9399: 9390: 9380: 9362: 9315: 9294:(9): 933–941. 9272: 9257: 9242: 9221:(7): 424–436. 9199: 9152: 9145: 9116: 9109: 9087: 9078: 9069: 9058:(8): 109–115. 9040: 9017: 8981: 8962:(3): 227–234. 8944: 8925: 8876: 8859: 8835: 8826: 8803: 8771: 8748: 8706: 8687: 8667: 8644: 8625:(2): 215–226. 8606: 8605: 8603: 8600: 8599: 8598: 8593: 8591:Satisfiability 8588: 8583: 8578: 8573: 8568: 8563: 8560:Formal methods 8553: 8548: 8543: 8538: 8533: 8528: 8523: 8521:Control theory 8518: 8513: 8508: 8501: 8498: 8481: 8478: 8464: 8461: 8451: 8448: 8427: 8424: 8409:Main article: 8406: 8403: 8368: 8183: 8149: 8145: 8138: 8134: 8125: 8124: 8123: 8122: 8117: 8113: 8109: 8105: 8089:is called the 8085: 8081: 8076: 8075: 8074: 8073: 8068: 8064: 8060: 8056: 8027:Main article: 8024: 8021: 7878: 7852:Main article: 7849: 7846: 7776: 7673: 7575: 7493: 7411: 7089: 7011: 6944: 6917:Main article: 6914: 6911: 6903:DPLL algorithm 6711: 6623: 6303: 6140: 6126:Main article: 6123: 6120: 6089: 5938: 5703: 5671:set difference 5644:Main article: 5641: 5638: 5624:verification, 5602:The solution 5547: 5280: 5249:Main article: 5246: 5243: 5090: 4978: 4914: 4874:Main article: 4871: 4868: 4866: 4863: 4836:Another_Person 4812:Another_Person 4720: 4707:expert systems 4255: 3970: 3955:event calculus 3934: 3931: 3918:Keith Stenning 3843: 3813: 3807: 3444: 3308: 3295: 3292: 3228: 3046:rehabilitation 3031:rehabilitation 2969: 2917: 2899:rehabilitation 2858: 2815: 2750:rehabilitation 2732:rehabilitation 2682: 2666: 2665: 2660: 2659:or ... or Body 2656: 2648: 2647: 2642: 2638: 2633: 2628: 2596:SLD resolution 2577:Main article: 2574: 2571: 2246: 2027: 2004: 1819: 1797:satisfiability 1751:Main article: 1748: 1745: 1726: 1723: 1480: 1411: 1371: 1351: 1348: 1149: 1077: 1074: 1069: 1066: 947:SLD resolution 900:Terry Winograd 869:Seymour Papert 789: 786: 774:formal methods 752: 751: 746: 739: 725: 721: 625: 424: 407: 207: 198: 194: 190: 182: 178: 171: 170: 165: 161: 153: 152: 131: 124:is called the 120: 113: 106:is called the 101: 100: 95: 91: 83: 82: 77: 73: 26: 9: 6: 4: 3: 2: 11759: 11748: 11745: 11743: 11740: 11738: 11735: 11733: 11730: 11729: 11727: 11715: 11709: 11704: 11698: 11693: 11687: 11686: 11672: 11669: 11667: 11664: 11662: 11659: 11657: 11654: 11652: 11649: 11648: 11646: 11644: 11640: 11634: 11631: 11629: 11626: 11624: 11621: 11619: 11616: 11615: 11612: 11609: 11607: 11604: 11602: 11599: 11597: 11594: 11593: 11591: 11587: 11583: 11576: 11571: 11569: 11564: 11562: 11557: 11556: 11553: 11541: 11538: 11536: 11533: 11531: 11528: 11526: 11523: 11521: 11518: 11516: 11513: 11511: 11510:Data-oriented 11508: 11506: 11503: 11501: 11498: 11496: 11493: 11492: 11490: 11488: 11482: 11476: 11473: 11471: 11468: 11466: 11463: 11461: 11458: 11455: 11451: 11447: 11443: 11439: 11436: 11434: 11431: 11429: 11426: 11423: 11419: 11416: 11414: 11411: 11409: 11408:Homoiconicity 11406: 11404: 11401: 11399: 11396: 11394: 11391: 11388: 11384: 11381: 11379: 11376: 11375: 11373: 11371: 11367: 11361: 11358: 11356: 11353: 11351: 11348: 11346: 11343: 11341: 11338: 11336: 11333: 11331: 11328: 11326: 11323: 11321: 11318: 11316: 11315:Concurrent OO 11313: 11310: 11306: 11303: 11301: 11298: 11296: 11293: 11291: 11288: 11287: 11285: 11283: 11278: 11273: 11269: 11259: 11256: 11253: 11249: 11245: 11241: 11238: 11236: 11233: 11231: 11228: 11226: 11223: 11221: 11218: 11216: 11213: 11211: 11210:Set-theoretic 11208: 11206: 11203: 11201: 11198: 11196: 11193: 11191: 11190:Probabilistic 11188: 11186: 11182: 11179: 11177: 11174: 11172: 11169: 11167: 11164: 11162: 11159: 11157: 11154: 11152: 11149: 11147: 11144: 11142: 11139: 11137: 11134: 11132: 11129: 11127: 11124: 11121: 11117: 11114: 11111: 11107: 11104: 11102: 11099: 11097: 11094: 11093: 11091: 11089: 11085: 11079: 11076: 11074: 11071: 11069: 11066: 11064: 11061: 11059: 11056: 11053: 11049: 11046: 11044: 11041: 11039: 11036: 11035: 11033: 11031: 11027: 11021: 11018: 11016: 11013: 11011: 11008: 11005: 11001: 10998: 10996: 10993: 10992: 10990: 10988: 10984: 10978: 10974: 10971: 10969: 10968:Concatenative 10965: 10962: 10960: 10957: 10955: 10952: 10950: 10947: 10945: 10942: 10940: 10937: 10935: 10932: 10930: 10927: 10925: 10922: 10920: 10917: 10914: 10910: 10907: 10905: 10902: 10901: 10899: 10896: 10891: 10887: 10884: 10882: 10878: 10868: 10865: 10863: 10860: 10858: 10855: 10853: 10850: 10848: 10844: 10840: 10837: 10836: 10834: 10831: 10827: 10822: 10818: 10812: 10809: 10807: 10804: 10802: 10799: 10797: 10794: 10792: 10789: 10787: 10784: 10782: 10779: 10777: 10774: 10772: 10769: 10768: 10766: 10764: 10760: 10757: 10755: 10751: 10746: 10742: 10735: 10730: 10728: 10723: 10721: 10716: 10715: 10712: 10706: 10703: 10701: 10698: 10696: 10692: 10688: 10685: 10682: 10680: 10677: 10674: 10673: 10669: 10667: 10664: 10662: 10658: 10655: 10652: 10650: 10648: 10644: 10643: 10635: 10631: 10628: 10624: 10621: 10617: 10613: 10610: 10606: 10605: 10596: 10592: 10589: 10586: 10582: 10579: 10575: 10570: 10565: 10561: 10557: 10553: 10548: 10545: 10541: 10537: 10536: 10533:Other sources 10526: 10521: 10519: 10515: 10511: 10507: 10503: 10499: 10495: 10488: 10483: 10478: 10473: 10469: 10462: 10457: 10456: 10436: 10427: 10417: 10408: 10403: 10399: 10395: 10394: 10389: 10382: 10373: 10368: 10364: 10360: 10353: 10344: 10339: 10335: 10331: 10330: 10325: 10318: 10310: 10306: 10302: 10298: 10297: 10289: 10280: 10271: 10266: 10262: 10258: 10257: 10252: 10245: 10236: 10220: 10213: 10206: 10200: 10191: 10182: 10173: 10165: 10159: 10155: 10148: 10139: 10130: 10121: 10116: 10112: 10108: 10104: 10097: 10089: 10085: 10080: 10075: 10070: 10065: 10061: 10057: 10053: 10046: 10036: 10027: 10018: 10009: 10000: 9991: 9989: 9980: 9976: 9971: 9966: 9961: 9956: 9952: 9948: 9944: 9936: 9934: 9924: 9916: 9912: 9908: 9904: 9900: 9896: 9895: 9887: 9880: 9872: 9868: 9864: 9860: 9856: 9852: 9851: 9843: 9836: 9830: 9824: 9815: 9809: 9803: 9797: 9792: 9786: 9782: 9777: 9776: 9767: 9761: 9756: 9754:9780262701099 9750: 9746: 9739: 9730: 9728: 9718: 9709: 9704: 9700: 9696: 9692: 9685: 9677: 9673: 9668: 9663: 9659: 9655: 9654: 9649: 9642: 9634: 9630: 9626: 9619: 9611: 9607: 9603: 9599: 9594: 9589: 9585: 9581: 9580: 9575: 9568: 9560: 9556: 9552: 9548: 9547: 9539: 9531: 9527: 9523: 9519: 9518: 9510: 9502: 9496: 9492: 9488: 9484: 9480: 9474: 9466: 9462: 9457: 9452: 9448: 9444: 9443: 9438: 9431: 9421: 9412: 9403: 9394: 9384: 9376: 9369: 9367: 9358: 9354: 9350: 9346: 9341: 9336: 9332: 9328: 9327: 9319: 9311: 9307: 9302: 9297: 9293: 9289: 9288: 9283: 9276: 9268: 9261: 9253: 9246: 9238: 9234: 9229: 9224: 9220: 9216: 9215: 9210: 9203: 9195: 9189: 9180: 9175: 9171: 9167: 9163: 9156: 9148: 9142: 9138: 9134: 9130: 9123: 9121: 9112: 9106: 9101: 9100: 9091: 9082: 9073: 9065: 9061: 9057: 9053: 9052: 9044: 9035: 9028: 9021: 9013: 9009: 9005: 9001: 9000: 8992: 8985: 8977: 8973: 8969: 8965: 8961: 8957: 8956: 8948: 8940: 8936: 8929: 8921: 8917: 8912: 8907: 8903: 8899: 8895: 8891: 8887: 8880: 8872: 8871: 8863: 8855: 8854: 8849: 8848:Sussman, G.J. 8845: 8839: 8830: 8819: 8818: 8813: 8812:Jeff Rulifson 8807: 8799: 8795: 8791: 8787: 8786: 8781: 8775: 8768:. IJCAI 1969. 8764: 8763: 8758: 8752: 8744: 8740: 8736: 8732: 8728: 8724: 8717: 8710: 8702: 8698: 8691: 8684:. IJCAI 1969. 8680: 8679: 8671: 8663: 8659: 8655: 8648: 8640: 8636: 8632: 8628: 8624: 8620: 8619: 8611: 8607: 8597: 8594: 8592: 8589: 8587: 8584: 8582: 8579: 8577: 8574: 8572: 8569: 8567: 8564: 8561: 8557: 8554: 8552: 8549: 8547: 8544: 8542: 8539: 8537: 8534: 8532: 8529: 8527: 8524: 8522: 8519: 8517: 8514: 8512: 8509: 8507: 8504: 8503: 8497: 8495: 8491: 8486: 8477: 8475: 8471: 8469: 8460: 8457: 8447: 8445: 8441: 8437: 8433: 8423: 8421: 8417: 8412: 8402: 8400: 8396: 8392: 8366: 8181: 8154: 8116:and ... and B 8108:and ... and G 8102: 8101: 8100: 8099: 8098: 8092: 8053: 8052: 8051: 8050: 8049: 8048:of the form: 8047: 8042: 8040: 8036: 8030: 8020: 8018: 8014: 8009: 7876: 7872: 7868: 7865: 7861: 7855: 7845: 7774: 7671: 7664: 7409: 7087: 7080: 7009: 6942: 6939: 6937: 6933: 6929: 6925: 6920: 6910: 6908: 6904: 6900: 6895: 6891: 6889: 6885: 6882:Confusingly, 6880: 6709: 6621: 6301: 6138: 6136: 6129: 6119: 6117: 6087: 5936: 5701: 5698: 5694: 5690: 5688: 5684: 5680: 5676: 5672: 5668: 5664: 5660: 5655: 5653: 5647: 5637: 5635: 5631: 5627: 5623: 5619: 5615: 5610: 5545: 5278: 5271: 5267: 5263: 5261: 5257: 5252: 5242: 5240: 5236: 5232: 5231:Visual Prolog 5228: 5224: 5220: 5216: 5212: 5208: 5203: 5200: 5088: 4976: 4974: 4969: 4967: 4963: 4912: 4910: 4906: 4905: 4899: 4897: 4896: 4891: 4886: 4883: 4877: 4862: 4858: 4718: 4714: 4712: 4708: 4703: 4701: 4697: 4693: 4689: 4688:progressively 4253: 4251: 4246: 4236: 4229:holds at the 3968: 3966: 3965: 3960: 3956: 3952: 3947: 3945: 3941: 3930: 3926: 3923: 3919: 3914: 3910: 3906: 3841: 3837: 3835: 3831: 3827: 3823: 3819: 3812: 3442: 3428: 3426: 3422: 3421: 3416: 3415: 3409: 3306: 3304: 3300: 3291: 3289: 3226: 3224: 3219: 3217: 3213: 3208: 3206: 3202: 3198: 3193: 3189: 3187: 3184: 3180: 3177: 2967: 2915: 2912: 2910: 2856: 2853: 2813: 2680: 2677: 2675: 2653: 2652: 2651: 2639: 2634: 2625: 2624: 2623: 2620: 2618: 2617: 2612: 2607: 2605: 2604:Micro-Planner 2601: 2597: 2585: 2580: 2570: 2482: 2244: 2233:X × X = X + X 2025: 2020:to represent 2012:to represent 2003: 1981: 1976: 1972: 1970: 1817: 1814: 1810: 1808: 1807:minimal model 1804: 1800: 1798: 1792: 1790: 1786: 1782: 1778: 1774: 1769: 1767: 1763: 1761: 1754: 1744: 1741: 1738: 1736: 1732: 1478: 1475: 1409: 1369: 1366: 1364: 1357: 1347: 1345: 1340: 1333: 1147: 1139: 1137: 1131: 1129: 1121: 1111: 1109: 1104: 1102: 1098: 1093: 1091: 1087: 1083: 1073: 1065: 1063: 1059: 1058: 1053: 1049: 1045: 1041: 1040: 1035: 1030: 1028: 1024: 1019: 1017: 1016: 1011: 1007: 1001: 997: 995: 991: 987: 983: 979: 974: 972: 968: 964: 960: 956: 950: 948: 944: 938: 936: 935:SL resolution 932: 928: 924: 920: 915: 911: 909: 905: 901: 897: 893: 892:Gerry Sussman 889: 885: 881: 877: 872: 870: 866: 865:Marvin Minsky 862: 858: 854: 850: 846: 842: 838: 834: 833:John McCarthy 830: 826: 821: 819: 815: 811: 810:Cordell Green 807: 803: 802:Alonzo Church 799: 795: 785: 783: 779: 775: 769: 759: 758: 731: 730: 729: 719: 714: 709: 707: 623: 618: 614: 422: 405: 205: 202: 188: 176: 158: 157: 156: 148: 147: 146: 144: 140: 139: 127: 110:of the rule, 109: 94:and ... and B 88: 87: 86: 70: 69: 68: 66: 65: 60: 56: 52: 48: 44: 40: 36: 32: 19: 11717:}} 11711:{{ 11706:}} 11700:{{ 11695:}} 11689:{{ 11515:Event-driven 11029: 10919:Higher-order 10847:Object-based 10670: 10646: 10619: 10577: 10559: 10555: 10543: 10524: 10497: 10493: 10467: 10435: 10426: 10416: 10397: 10391: 10381: 10362: 10352: 10333: 10327: 10317: 10300: 10294: 10288: 10279: 10260: 10254: 10244: 10235: 10223:. Retrieved 10212: 10204: 10199: 10190: 10181: 10172: 10153: 10147: 10138: 10129: 10113:(1–3): 1–4. 10110: 10106: 10096: 10059: 10055: 10045: 10035: 10026: 10017: 10008: 9999: 9950: 9946: 9923: 9898: 9892: 9879: 9854: 9848: 9835: 9823: 9814: 9802: 9774: 9766: 9744: 9738: 9717: 9698: 9694: 9684: 9660:(1): 20–74. 9657: 9651: 9641: 9624: 9618: 9583: 9577: 9567: 9553:(1): 51–79. 9550: 9544: 9538: 9524:(1): 75–94. 9521: 9515: 9509: 9482: 9473: 9446: 9440: 9430: 9420: 9411: 9402: 9393: 9383: 9374: 9330: 9324: 9318: 9291: 9285: 9275: 9266: 9260: 9251: 9245: 9218: 9212: 9202: 9188:cite journal 9165: 9161: 9155: 9128: 9098: 9090: 9081: 9072: 9055: 9049: 9043: 9020: 9003: 8997: 8984: 8959: 8953: 8947: 8934: 8928: 8896:(1): 24–33. 8893: 8889: 8886:Hewitt, C.E. 8879: 8869: 8862: 8852: 8850:(May 1972). 8838: 8829: 8816: 8806: 8792:(1): 1–191. 8789: 8783: 8774: 8761: 8757:Hewitt, Carl 8751: 8726: 8722: 8709: 8696: 8690: 8677: 8670: 8661: 8657: 8647: 8622: 8616: 8610: 8551:Linear logic 8483: 8472: 8466: 8456:linear logic 8453: 8429: 8414: 8393: 8386: 8336: 8155: 8126: 8077: 8046:Horn clauses 8043: 8032: 8010: 8007: 7988:father_child 7952:mother_child 7873: 7869: 7857: 7842: 7772: 7665: 7656: 7407: 7081: 7077: 7007: 6940: 6931: 6927: 6922: 6898: 6896: 6892: 6887: 6883: 6881: 6870: 6707: 6618: 6299: 6133:it uses the 6131: 6113: 6085: 5976:parent_child 5958:parent_child 5940:parent_child 5934: 5858:parent_child 5819:father_child 5798:parent_child 5780:mother_child 5759:parent_child 5741:father_child 5723:father_child 5705:mother_child 5699: 5695: 5691: 5686: 5682: 5678: 5674: 5670: 5667:intersection 5666: 5662: 5656: 5649: 5611: 5601: 5536:both taught 5523: 5272: 5268: 5264: 5254: 5204: 5201: 5198: 5086: 4970: 4965: 4961: 4959: 4908: 4902: 4900: 4893: 4887: 4881: 4879: 4859: 4855: 4806:parent_child 4715: 4704: 4692:regressively 4691: 4687: 4681: 4250:blocks world 4247: 4204: 3962: 3948: 3936: 3927: 3915: 3912: 3908: 3903: 3838: 3833: 3829: 3825: 3818:Paul Thagard 3815: 3429: 3424: 3420:metalanguage 3418: 3412: 3410: 3407: 3297: 3285: 3220: 3209: 3194: 3190: 3183:Ray Reiter's 3173: 2965: 2913: 2906: 2854: 2851: 2811: 2678: 2667: 2649: 2621: 2615: 2608: 2582: 2483: 2468: 2222: 2010:add(X, Y, Z) 2007: 1984:0, 1, 2, ... 1977: 1973: 1966: 1911:parent_child 1893:parent_child 1875:parent_child 1857:father_child 1839:father_child 1821:mother_child 1815: 1811: 1806: 1795: 1793: 1770: 1758: 1756: 1742: 1739: 1730: 1728: 1471: 1407: 1367: 1359: 1341: 1334: 1311: 1140: 1132: 1123: 1118:and-parallel 1115: 1112: 1105: 1094: 1089: 1085: 1081: 1079: 1071: 1055: 1051: 1037: 1031: 1020: 1013: 1002: 998: 975: 966: 951: 943:Horn clauses 939: 916: 912: 873: 822: 791: 770: 755: 753: 710: 703: 666:parent_child 648:parent_child 610: 419: 399: 380:parent_child 362:parent_child 323:father_child 302:parent_child 284:mother_child 263:parent_child 245:father_child 227:father_child 209:mother_child 203: 175:Horn clauses 172: 154: 142: 136: 125: 107: 102: 84: 62: 30: 29: 11611:Interpreted 11525:Intentional 11505:Data-driven 11487:of concerns 11446:Inferential 11433:Multi-stage 11413:Interactive 11290:Actor-based 11277:distributed 11220:Stack-based 11020:Synchronous 10977:Value-level 10964:Applicative 10881:Declarative 10839:Class-based 10440:Heidelberg. 9901:: 214–245. 9479:Clark, K.L. 8911:1721.1/5693 8541:Fuzzy logic 8395:Carl Hewitt 8055:H :- G 7717:green_block 7619:green_block 7555:green_block 7473:green_block 7028:green_block 6994:green_block 6958:green_block 5179:green_block 5119:green_block 5010:green_block 4986:green_block 4626:green_block 4560:green_block 4533:green_block 4494:green_block 4359:green_block 4305:green_block 4269:green_block 3964:frame axiom 3940:commonsense 2674:unification 2655:A iff (Body 2611:Keith Clark 1779:; and both 1656:grandparent 1482:grandparent 1126:or-parallel 1108:and-or tree 1010:Jack Minker 880:Carl Hewitt 713:declarative 135:are called 72:A :- B 35:programming 11726:Categories 11643:Generation 11623:High-level 11500:Components 11485:Separation 11460:Reflective 11454:by example 11398:Extensible 11272:Concurrent 11248:Production 11235:Templating 11215:Simulation 11200:Scientific 11120:Spacecraft 11048:Constraint 11043:Answer set 10995:Flow-based 10895:comparison 10890:Functional 10862:Persistent 10826:comparison 10791:Procedural 10763:Structured 10754:Imperative 10622:2006: 2–9. 10225:7 November 10069:1804.11162 9960:2201.10816 9593:cs/0501025 9036:. Memo 70. 8664:(1): 3–10. 8558:(includes 8329:ShortMerge 8260:ShortMerge 7875:relation: 7364:terminates 7304:terminates 7265:terminated 7247:terminated 5661:, such as 5540:and was a 5438:instructor 4895:backtracks 4696:regression 4419:terminates 4185:terminates 4146:terminated 4128:terminated 3800:banishment 3764:mad_hatter 3719:mad_hatter 3683:mad_hatter 3629:prohibited 3590:banishment 3554:prohibited 3446:prohibited 3436:prohibited 3272:is_violent 3260:is_a_minor 3248:is_a_thief 3242:punishment 3223:stratified 3205:XSB Prolog 3145:is_violent 3118:is_a_minor 3091:is_a_thief 3079:is_violent 3064:is_a_minor 3052:is_a_thief 3004:is_a_thief 2998:punishment 2958:punishment 2844:punishment 2798:is_a_thief 2786:is_violent 2771:is_a_minor 2759:is_a_thief 2705:is_a_thief 2696:punishment 2616:completion 2598:is called 2481:is false. 2014:X + Y = Z, 1735:miniKanren 1354:See also: 1330:Expression 718:procedural 128:, and the 57:(ASP) and 11618:Low-level 11387:Inductive 11383:Automatic 11205:Scripting 10904:Recursive 10675:(journal) 10500:: 38–43. 10421:134-146). 10367:CiteSeerX 9979:1471-0684 9781:MIT Press 9340:1012.5123 8729:: 38–43. 8602:Citations 8494:available 8137:, ... , G 8084:, ... , G 7970:auxiliary 7934:auxiliary 7916:auxiliary 7898:auxiliary 7723:red_block 7687:red_block 7625:red_block 7589:red_block 7561:red_block 7525:red_block 7479:red_block 7425:red_block 7322:initiates 7148:initiates 7058:red_block 7034:red_block 6988:red_block 6932:assumable 6928:abducible 6899:grounding 6879:is true. 6072:elizabeth 6054:elizabeth 6000:elizabeth 5946:elizabeth 5711:elizabeth 5588:professor 5542:professor 5486:professor 5191:red_block 5155:red_block 5125:red_block 5101:red_block 5004:red_block 4722:initiates 4659:red_block 4632:red_block 4593:red_block 4527:red_block 4377:initiates 4365:red_block 4329:red_block 4299:red_block 4029:initiates 3944:expertise 3707:tea_party 3689:tea_party 3671:tea_party 3440:approved. 3414:metalogic 2479:2 + 2 = 5 2475:2 + 2 = 5 2225:2 × 2 = X 2022:X × Y = Z 1953:elizabeth 1935:elizabeth 1881:elizabeth 1827:elizabeth 1799:semantics 1762:semantics 1729:The term 1692:elizabeth 1584:elizabeth 1274:fibonacci 1256:fibonacci 1187:fibonacci 1169:fibonacci 1151:fibonacci 1090:algorithm 923:Marseille 853:Pat Hayes 841:Edinburgh 732:to solve 617:predicate 594:elizabeth 546:elizabeth 525:elizabeth 462:elizabeth 450:elizabeth 215:elizabeth 11683:See also 11633:Esoteric 11606:Compiled 11601:Assembly 11540:Subjects 11530:Literate 11520:Features 11475:Template 11470:Symbolic 11442:Bayesian 11422:Hygienic 11282:parallel 11161:Modeling 11156:Low-code 11131:End-user 11068:Ontology 11000:Reactive 10987:Dataflow 10687:Archived 10657:Archived 10514:12259230 10361:(1994). 10088:13754645 10040:40-110). 9610:13156469 9465:11048276 9310:15527861 8743:12259230 8639:32577496 8500:See also 8389:Merge = 8148:, ..., B 8067:, ..., B 8059:, ..., G 6873::- Body. 6815:adjacent 6737:adjacent 6652:adjacent 6563:adjacent 6485:adjacent 6407:adjacent 6329:adjacent 6166:adjacent 5342:software 5294:hardware 4882:selected 4782:place_of 3878:bus_fare 3834:defaults 3794:Sanction 3788:dormouse 3776:scolding 3770:Sanction 3731:dormouse 3701:dormouse 3653:approved 3515:scolding 3479:approved 3040:Sanction 2992:Sanction 2983:Sanction 2952:Sanction 2946:Sanction 2893:Sanction 2887:Sanction 2838:Sanction 2832:Sanction 2338:multiply 2251:multiply 2173:multiply 2140:multiply 2116:multiply 1068:Concepts 967:de facto 829:Stanford 736:, solve 181:, ..., B 164:, ..., B 138:literals 76:, ..., B 39:database 11596:Machine 11495:Aspects 11403:Generic 11393:Dynamic 11252:Pattern 11230:Tactile 11195:Quantum 11185:filters 11116:Command 11015:Streams 11010:Signals 10781:Modular 10448:Sources 9915:4261497 9871:5665107 9676:7041379 9357:6153112 9237:2509896 8976:2272384 8920:1322857 8526:Datalog 8490:Flora-2 8474:Logtalk 8468:F-logic 8444:λProlog 8370:shuffle 8311:shuffle 8266:shuffle 8242:shuffle 8197:shuffle 8185:shuffle 7864:induces 7811:happens 7781:happens 7753:happens 7735:happens 7705:happens 7675:happens 7637:happens 7607:happens 7577:happens 7543:happens 7513:happens 7495:happens 7461:happens 7443:happens 7413:happens 7286:happens 7187:happens 7112:happens 7084:happens 6803:country 6791:country 6725:country 6713:country 6640:country 6628:country 6551:country 6539:country 6473:country 6461:country 6395:country 6383:country 6317:country 6305:country 6262:country 6205:country 6154:country 6142:country 6116:tabling 6060:william 6036:charles 6024:william 6018:charles 6006:charles 5982:charles 5970:william 5964:charles 5952:charles 5747:charles 5735:william 5729:charles 5717:charles 5646:Datalog 5640:Datalog 5552:teaches 5378:teaches 5330:teaches 5282:teaches 5239:λProlog 5219:Mercury 5037:retract 4966:retract 4830:citizen 4758:time_of 4740:citizen 4698:in the 4347:happens 4317:happens 4235:fluents 4167:happens 4068:happens 3993:happens 3695:attends 3677:attends 3659:attends 3647:Meeting 3635:attends 3611:Meeting 3599:attends 3572:Meeting 3560:attends 3536:Meeting 3524:attends 3497:Meeting 3485:attends 3464:Meeting 3452:attends 3303:vanilla 3218:(ASP). 2919:violent 1998:namely 1941:william 1917:charles 1905:william 1899:charles 1887:charles 1863:charles 1851:william 1845:charles 1833:charles 1716:phillip 1647:charles 1605:phillip 1596:charles 1575:charles 1344:tabling 1086:logical 1082:control 1015:Datalog 876:Planner 843:, with 806:clausal 788:History 627:sibling 621:X = X: 570:william 534:william 480:william 438:william 415:charles 251:charles 239:william 233:charles 221:charles 193:,..., t 117:, ..., 64:clauses 59:Datalog 11666:Fourth 11656:Second 11258:Visual 11225:System 11110:Action 10934:Strict 10512: 10369: 10160: 10086: 9977: 9913: 9869: 9787: 9751: 9674: 9608: 9497: 9463: 9355: 9308: 9235: 9143: 9107: 8974: 8918: 8741: 8637: 8337:Here, 8104:H if G 7829:Block1 7823:Block2 7793:Block1 7400:Place1 7394:Object 7382:Place2 7376:Object 7352:Object 7334:Object 6851:colour 6833:colour 6773:colour 6755:colour 6688:colour 6670:colour 6599:colour 6581:colour 6521:colour 6503:colour 6443:colour 6425:colour 6365:colour 6347:colour 6280:colour 6241:colour 6223:colour 6184:colour 5275:john's 5237:, and 5173:Object 5149:Object 5137:Object 5079:Place2 5073:Object 5061:assert 5055:Place1 5049:Object 5028:Place2 5022:Object 4962:assert 4876:Prolog 4870:Prolog 4818:Person 4794:Person 4770:Person 4746:Person 4734:Person 4455:Place1 4449:Object 4437:Place2 4431:Object 4407:Object 4389:Object 3845:can_go 3782:Person 3758:Person 3641:Person 3623:Person 3605:Person 3584:Person 3566:Person 3548:Person 3530:Person 3509:Person 3491:Person 3458:Person 3376:clause 2668:where 2565:)))))) 2231:; and 2000:X + 1. 1766:models 1632:father 1611:mother 1590:father 1569:mother 1557:father 1542:parent 1530:mother 1515:parent 1503:parent 1497:parent 1452:mother 1434:mother 1394:mother 1388:mother 1292:Result 1199:Result 904:SHRDLU 855:, and 724:,...,B 90:A if B 51:Prolog 11747:Logic 11671:Fifth 11661:Third 11651:First 11589:Level 11535:Roles 11418:Macro 11181:Pipes 11101:Array 11078:Query 11030:Logic 10939:GADTs 10929:Total 10852:Agent 10510:S2CID 10490:(PDF) 10464:(PDF) 10084:S2CID 10064:arXiv 9955:arXiv 9911:S2CID 9889:(PDF) 9867:S2CID 9845:(PDF) 9672:S2CID 9606:S2CID 9588:arXiv 9461:S2CID 9388:2006. 9353:S2CID 9335:arXiv 9306:S2CID 9233:S2CID 9172:: 1. 9168:(1). 9030:(PDF) 8994:(PDF) 8972:JSTOR 8916:S2CID 8821:(PDF) 8766:(PDF) 8739:S2CID 8719:(PDF) 8682:(PDF) 8635:S2CID 8440:HiLog 8379:Merge 8302:Merge 8293:Right 8284:Merge 8278:Right 8254:Right 8233:Merge 8215:Merge 8209:Right 8178:Right 8170:Merge 8166:Right 8112:and B 8091:guard 7862:that 7799:Place 7693:table 7657:Here 7595:table 7531:table 7431:table 7358:Place 7340:Place 7310:Event 7292:Event 7259:Time1 7235:Time1 7223:holds 7211:Time1 7205:Time2 7199:Time1 7193:Event 7178:Time2 7166:holds 7154:Event 7136:Time1 7130:Time2 7124:Time1 7118:Event 7103:Time2 7091:holds 7064:table 7046:holds 7016:holds 6976:holds 6964:table 6946:holds 6905:or a 6845:green 6785:green 6593:green 6533:green 6455:green 6437:green 6253:green 6235:green 6078:harry 6042:harry 5988:harry 5753:harry 5663:union 5564:logic 5538:logic 5524:Here 5519:2014. 5471:2010. 5423:2012. 5390:logic 5375:2005. 5327:1999. 5215:Gödel 5185:Place 5167:table 5161:Place 5143:Place 5107:table 4992:table 4890:stack 4824:holds 4788:birth 4764:birth 4728:birth 4711:tacit 4665:table 4599:table 4566:table 4500:table 4464:holds 4413:Place 4395:Place 4335:table 4287:holds 4275:table 4257:holds 4219:holds 4215:solve 4211:solve 4207:holds 4205:Here 4191:Event 4173:Event 4140:Time1 4116:Time1 4104:holds 4092:Time1 4086:Time2 4080:Time1 4074:Event 4059:Time2 4047:holds 4035:Event 4017:Time1 4011:Time2 4005:Time1 3999:Event 3984:Time2 3972:holds 3884:catch 3822:rules 3725:lowly 3713:lofty 3665:alice 3617:lowly 3542:lofty 3394:solve 3364:solve 3352:solve 3340:solve 3322:solve 3310:solve 2860:minor 2600:SLDNF 2588:not p 2473:i.e. 2464:)))). 2332:)))). 2241:X = 2 2237:X = 0 2229:X = 4 1959:harry 1923:harry 1869:harry 1704:harry 1680:harry 1638:harry 1626:diana 1617:harry 818:Absys 762:not B 600:harry 576:harry 555:harry 492:harry 257:harry 47:logic 33:is a 11183:and 10830:list 10227:2016 10158:ISBN 9975:ISSN 9785:ISBN 9749:ISBN 9495:ISBN 9194:link 9141:ISBN 9105:ISBN 8531:Fril 8442:and 8362:and 8349:Tail 8345:Head 8323:Rest 8317:Left 8272:Left 8248:Rest 8224:Left 8203:Left 8176:and 8174:Left 8164:and 8162:Left 8015:and 7835:Time 7817:move 7805:Time 7787:move 7759:tick 7741:tick 7711:move 7681:move 7668:move 7660:tick 7643:tick 7613:move 7583:move 7549:move 7519:move 7501:tick 7467:move 7449:tick 7419:move 7370:move 7328:move 7316:Fact 7298:Time 7277:Time 7271:Fact 7253:Fact 7229:Fact 7172:Fact 7160:Fact 7097:Fact 6930:(or 6877:Body 5685:and 5673:and 5582:john 5576:rank 5558:john 5534:john 5530:< 5528:and 5516:< 5501:2010 5480:john 5474:rank 5468:< 5453:1990 5432:john 5426:rank 5405:2005 5384:john 5372:< 5357:1999 5336:john 5324:< 5309:1990 5288:john 5227:Ciao 5211:Fril 5113:move 5095:move 5016:move 4964:and 4940:fail 4909:fail 4848:Time 4776:Time 4755:)):- 4671:Time 4647:Fact 4638:Time 4614:Fact 4605:Time 4581:Fact 4572:Time 4548:Fact 4539:Time 4515:Fact 4506:Time 4482:Fact 4476:Time 4470:Fact 4425:move 4383:move 4353:move 4323:move 4243:Time 4231:Time 4227:Fact 4197:Fact 4179:Time 4158:Time 4152:Fact 4134:Fact 4110:Fact 4053:Fact 4041:Fact 3978:Fact 3957:and 3920:and 3866:have 3857:home 3500:))). 3438:and 3337:)):- 3316:true 2239:and 2016:and 1992:s(X) 1474:Ciao 1211:> 1046:was 1032:The 963:Lisp 898:and 867:and 814:LISP 780:and 185:are 160:?- B 143:fact 126:body 108:head 41:and 11088:DSL 10693:in 10618:". 10564:doi 10502:doi 10472:doi 10402:doi 10398:165 10338:doi 10334:110 10305:doi 10265:doi 10115:doi 10074:doi 9965:doi 9903:doi 9899:227 9859:doi 9703:doi 9662:doi 9629:doi 9598:doi 9555:doi 9526:doi 9487:doi 9451:doi 9345:doi 9296:doi 9223:doi 9174:doi 9133:doi 9060:doi 9008:doi 8964:doi 8906:hdl 8898:doi 8794:doi 8731:doi 8627:doi 8576:R++ 8063:| B 7985:):- 7949:):- 7895:):- 7403:)). 7361:)). 7262:)). 7241:not 6863:red 6767:red 6611:red 6515:red 6377:red 6359:red 6295:)). 6292:red 6274:not 6238:)). 6217:not 6196:red 5687:not 5683:and 5235:XSB 5207:ALF 5058:)), 4946:not 4916:not 4904:cut 4458:)). 4416:)). 4143:)). 4122:not 3896:bus 3890:you 3872:you 3851:you 3674:)). 3650:)). 3575:)). 3473:not 3417:or 3373:):- 3278:tom 3266:tom 3254:tom 3236:tom 3166:tom 3157:iff 3139:tom 3130:iff 3112:tom 3103:iff 3076:not 3016:not 2989:iff 2940:tom 2925:tom 2881:tom 2866:tom 2826:tom 2804:tom 2783:not 2717:not 2670:iff 2636:... 2529:)), 2511:)), 2490:add 2428:)), 2362:add 2290:)), 2272:)), 2197:add 2092:add 2053:add 2029:add 1775:in 1512:)). 1403:)). 971:ISO 921:in 908:QA4 861:MIT 851:), 684:not 606:yes 11728:: 11452:, 11448:, 11444:, 11250:, 11246:, 10975:, 10966:, 10845:, 10841:, 10828:, 10695:Oz 10560:51 10558:. 10554:. 10542:. 10508:. 10498:31 10496:. 10492:. 10466:. 10396:. 10390:. 10332:. 10326:. 10299:. 10261:15 10259:. 10253:. 10111:44 10109:. 10105:. 10082:. 10072:. 10060:18 10058:. 10054:. 9987:^ 9973:. 9963:. 9951:22 9949:. 9945:. 9932:^ 9909:. 9897:. 9891:. 9865:. 9855:29 9853:. 9847:. 9783:. 9779:. 9726:^ 9699:77 9697:. 9693:. 9670:. 9658:43 9656:. 9650:. 9604:. 9596:. 9582:. 9576:. 9549:. 9522:38 9520:. 9493:. 9459:. 9447:23 9445:. 9439:. 9365:^ 9351:. 9343:. 9331:12 9329:. 9304:. 9292:28 9290:. 9284:. 9231:. 9219:22 9217:. 9211:. 9190:}} 9186:{{ 9164:. 9139:. 9119:^ 9056:12 9054:. 9002:. 8996:. 8970:. 8958:. 8937:. 8914:. 8904:. 8894:11 8892:. 8846:; 8788:. 8759:. 8737:. 8727:31 8725:. 8721:. 8660:. 8656:. 8633:. 8623:17 8621:. 8496:. 8446:. 8391:. 8382:). 8373:(, 8332:). 8290::- 8263:). 8221::- 8194:). 8188:(, 8180:: 8041:. 8019:. 8003:). 7967:). 7931:). 7913:), 7838:). 7832:), 7808:), 7802:), 7778::- 7768:). 7750:). 7732:). 7726:), 7702:). 7696:), 7652:). 7634:). 7628:), 7604:). 7598:), 7570:). 7564:), 7540:). 7534:), 7510:). 7488:). 7482:), 7458:). 7440:). 7434:), 7388:on 7385:), 7346:on 7343:), 7319:). 7301:), 7283::- 7238:), 7208:is 7202:), 7184::- 7163:). 7133:is 7127:), 7109::- 7073:). 7067:), 7052:on 7043:), 7037:), 7022:on 7013:?- 7003:). 6997:), 6982:on 6973:). 6967:), 6952:on 6866:). 6857:iz 6848:). 6839:oz 6830:). 6827:iz 6821:oz 6812:). 6809:iz 6800:). 6797:oz 6788:). 6779:iz 6770:). 6761:oz 6752:). 6749:iz 6743:oz 6734:). 6731:iz 6722:). 6719:oz 6703:). 6694:C2 6685:), 6676:C1 6667:), 6664:C2 6658:C1 6649:), 6646:C2 6637:), 6634:C1 6625::- 6614:). 6605:iz 6596:). 6587:oz 6578:). 6575:iz 6569:oz 6560:). 6557:iz 6548:). 6545:oz 6536:). 6527:iz 6518:). 6509:oz 6500:). 6497:iz 6491:oz 6482:). 6479:iz 6470:). 6467:oz 6458:). 6449:iz 6440:). 6431:oz 6422:). 6419:iz 6413:oz 6404:). 6401:iz 6392:). 6389:oz 6380:). 6371:iz 6362:). 6353:oz 6344:). 6341:iz 6335:oz 6326:). 6323:iz 6314:). 6311:oz 6271:), 6259::- 6214:), 6202::- 6181:). 6178:iz 6172:oz 6163:). 6160:iz 6151:). 6148:oz 6109:). 6091:?- 6081:). 6063:). 6045:). 6027:). 6009:). 5991:). 5973:). 5955:). 5930:). 5912:), 5894::- 5873:). 5855::- 5834:). 5816::- 5795:). 5777::- 5756:). 5738:). 5720:). 5681:, 5679:or 5669:, 5665:, 5636:. 5628:, 5620:, 5616:, 5597:). 5573:), 5549:?- 5544:: 5498::- 5450::- 5402::- 5354::- 5306::- 5241:. 5233:, 5229:, 5225:, 5223:Oz 5221:, 5217:, 5213:, 5209:, 5146:). 5131:on 5128:), 5110:), 5092:?- 5082:). 5067:on 5043:on 5034::- 5013:). 4998:on 4995:). 4980:on 4955:). 4937:!, 4928::- 4851:). 4845:), 4842:uk 4821:), 4803:), 4800:uk 4797:), 4779:), 4773:), 4752:uk 4737:), 4702:. 4677:2. 4668:), 4653:on 4644:2. 4635:), 4620:on 4611:1. 4602:), 4587:on 4578:1. 4569:), 4554:on 4545:0. 4536:), 4521:on 4512:0. 4503:), 4488:on 4479:). 4461:?- 4443:on 4440:), 4401:on 4398:), 4374:). 4368:), 4344:). 4338:), 4314:). 4308:), 4293:on 4284:). 4278:), 4263:on 4245:. 4200:). 4182:), 4164::- 4119:), 4089:is 4083:), 4065::- 4044:). 4014:is 4008:), 3990::- 3953:, 3946:. 3899:). 3881:), 3863::- 3755:). 3737:?- 3734:). 3722:). 3710:). 3692:). 3626:), 3614:), 3596::- 3551:), 3539:), 3521::- 3470::- 3467:)) 3427:. 3403:). 3391:), 3361:). 3349:), 3325:(( 3319:). 3281:). 3269:). 3257:). 3245:). 3188:. 3088:). 3073:), 3061:), 3037:or 3013:), 2949:). 2931:?- 2928:). 2911:. 2890:). 2872:?- 2869:). 2835:). 2817:?- 2807:). 2795:). 2780:), 2768:), 2756::- 2735:). 2714:), 2702::- 2606:. 2487:?- 2404:0. 2383:). 2359:), 2335:?- 2296:). 2248:?- 2243:: 2218:). 2194:), 2170::- 2161:), 2137:). 2113:). 2089::- 2086:)) 2074:), 2050:). 2024:: 1996:X, 1962:). 1944:). 1926:). 1908:). 1890:). 1872:). 1854:). 1836:). 1671:). 1653:?- 1644::= 1623::= 1602::= 1581::= 1566:). 1554::= 1539:). 1527::= 1494::= 1467:). 1449:), 1431::- 1332:. 1304:F2 1298:F1 1295:is 1289:), 1286:F2 1280:N2 1271:), 1268:F1 1262:N1 1241:is 1238:N2 1223:is 1220:N1 1205::- 1184:). 1166:). 1138:. 1064:. 1018:. 894:, 871:. 835:, 784:. 708:. 699:). 681:), 663:), 645::- 603:). 585:?- 582:no 579:). 561:?- 516:). 498:?- 471:). 453:?- 441:). 395:). 377:), 359::- 338:). 320::- 299:). 281::- 260:). 242:). 224:). 150:A. 67:: 53:, 37:, 11574:e 11567:t 11560:v 11456:) 11440:( 11424:) 11420:( 11389:) 11385:( 11311:) 11307:( 11279:, 11274:, 11254:) 11242:( 11122:) 11118:( 11112:) 11108:( 11054:) 11050:( 11006:) 11002:( 10915:) 10911:( 10897:) 10893:( 10832:) 10824:( 10747:) 10743:( 10733:e 10726:t 10719:v 10572:. 10566:: 10516:. 10504:: 10480:. 10474:: 10410:. 10404:: 10375:. 10346:. 10340:: 10311:. 10307:: 10301:2 10273:. 10267:: 10229:. 10166:. 10123:. 10117:: 10090:. 10076:: 10066:: 9981:. 9967:: 9957:: 9917:. 9905:: 9873:. 9861:: 9793:. 9757:. 9711:. 9705:: 9678:. 9664:: 9635:. 9631:: 9612:. 9600:: 9590:: 9584:9 9561:. 9557:: 9551:1 9532:. 9528:: 9503:. 9489:: 9467:. 9453:: 9359:. 9347:: 9337:: 9312:. 9298:: 9239:. 9225:: 9196:) 9176:: 9166:1 9149:. 9135:: 9114:. 9066:. 9062:: 9014:. 9010:: 9004:2 8978:. 8966:: 8960:1 8922:. 8908:: 8900:: 8800:. 8796:: 8790:3 8745:. 8733:: 8662:4 8641:. 8629:: 8562:) 8376:, 8357:| 8353:| 8326:, 8320:, 8314:( 8308:, 8305:= 8299:| 8296:= 8287:) 8281:, 8275:, 8269:( 8257:, 8251:, 8245:( 8239:, 8236:= 8230:| 8227:= 8218:) 8212:, 8206:, 8200:( 8191:, 8150:n 8146:1 8144:B 8139:n 8135:1 8133:G 8129:H 8120:. 8118:n 8114:1 8110:n 8106:1 8095:| 8086:n 8082:1 8080:G 8071:. 8069:n 8065:1 8061:n 8057:1 8000:Y 7997:, 7994:X 7991:( 7982:Y 7979:, 7976:X 7973:( 7964:Y 7961:, 7958:X 7955:( 7946:Y 7943:, 7940:X 7937:( 7928:Y 7925:, 7922:Z 7919:( 7910:Z 7907:, 7904:X 7901:( 7892:Y 7889:, 7886:X 7883:( 7826:, 7820:( 7814:( 7796:, 7790:( 7784:( 7765:2 7762:, 7756:( 7747:1 7744:, 7738:( 7729:0 7720:, 7714:( 7708:( 7699:0 7690:, 7684:( 7678:( 7649:2 7646:, 7640:( 7631:1 7622:, 7616:( 7610:( 7601:0 7592:, 7586:( 7580:( 7567:2 7558:, 7552:( 7546:( 7537:1 7528:, 7522:( 7516:( 7507:0 7504:, 7498:( 7485:2 7476:, 7470:( 7464:( 7455:1 7452:, 7446:( 7437:0 7428:, 7422:( 7416:( 7397:, 7391:( 7379:, 7373:( 7367:( 7355:, 7349:( 7337:, 7331:( 7325:( 7313:, 7307:( 7295:, 7289:( 7280:) 7274:, 7268:( 7256:, 7250:( 7244:( 7232:, 7226:( 7220:, 7217:1 7214:+ 7196:, 7190:( 7181:) 7175:, 7169:( 7157:, 7151:( 7145:, 7142:1 7139:+ 7121:, 7115:( 7106:) 7100:, 7094:( 7070:3 7061:, 7055:( 7049:( 7040:3 7031:, 7025:( 7019:( 7000:0 6991:, 6985:( 6979:( 6970:0 6961:, 6955:( 6949:( 6860:, 6854:( 6842:, 6836:( 6824:, 6818:( 6806:( 6794:( 6782:, 6776:( 6764:, 6758:( 6746:, 6740:( 6728:( 6716:( 6700:X 6697:, 6691:( 6682:X 6679:, 6673:( 6661:, 6655:( 6643:( 6631:( 6608:, 6602:( 6590:, 6584:( 6572:, 6566:( 6554:( 6542:( 6530:, 6524:( 6512:, 6506:( 6494:, 6488:( 6476:( 6464:( 6452:, 6446:( 6434:, 6428:( 6416:, 6410:( 6398:( 6386:( 6374:, 6368:( 6356:, 6350:( 6338:, 6332:( 6320:( 6308:( 6289:, 6286:C 6283:( 6277:( 6268:C 6265:( 6256:) 6250:, 6247:C 6244:( 6232:, 6229:C 6226:( 6220:( 6211:C 6208:( 6199:) 6193:, 6190:C 6187:( 6175:, 6169:( 6157:( 6145:( 6106:Y 6103:, 6100:X 6097:( 6075:, 6069:( 6057:, 6051:( 6039:, 6033:( 6021:, 6015:( 6003:, 5997:( 5985:, 5979:( 5967:, 5961:( 5949:, 5943:( 5927:Y 5924:, 5921:Z 5918:( 5909:Z 5906:, 5903:X 5900:( 5891:) 5888:Y 5885:, 5882:X 5879:( 5870:X 5867:, 5864:X 5861:( 5852:) 5849:Y 5846:, 5843:X 5840:( 5831:Y 5828:, 5825:X 5822:( 5813:) 5810:Y 5807:, 5804:X 5801:( 5792:Y 5789:, 5786:X 5783:( 5774:) 5771:Y 5768:, 5765:X 5762:( 5750:, 5744:( 5732:, 5726:( 5714:, 5708:( 5594:T 5591:, 5585:, 5579:( 5570:T 5567:, 5561:, 5555:( 5526:≤ 5513:T 5510:, 5507:T 5504:≤ 5495:) 5492:T 5489:, 5483:, 5477:( 5465:T 5462:, 5459:T 5456:≤ 5447:) 5444:T 5441:, 5435:, 5429:( 5420:≤ 5417:T 5414:, 5411:T 5408:≤ 5399:) 5396:T 5393:, 5387:, 5381:( 5369:T 5366:, 5363:T 5360:≤ 5351:) 5348:T 5345:, 5339:, 5333:( 5321:T 5318:, 5315:T 5312:≤ 5303:) 5300:T 5297:, 5291:, 5285:( 5194:. 5188:= 5182:, 5176:= 5170:. 5164:= 5158:, 5152:= 5140:, 5134:( 5122:, 5116:( 5104:, 5098:( 5076:, 5070:( 5064:( 5052:, 5046:( 5040:( 5031:) 5025:, 5019:( 5007:, 5001:( 4989:, 4983:( 4952:P 4949:( 4943:. 4934:, 4931:P 4925:) 4922:P 4919:( 4839:, 4833:( 4827:( 4815:, 4809:( 4791:( 4785:( 4767:( 4761:( 4749:, 4743:( 4731:( 4725:( 4674:= 4662:, 4656:( 4650:= 4641:= 4629:, 4623:( 4617:= 4608:= 4596:, 4590:( 4584:= 4575:= 4563:, 4557:( 4551:= 4542:= 4530:, 4524:( 4518:= 4509:= 4497:, 4491:( 4485:= 4473:, 4467:( 4452:, 4446:( 4434:, 4428:( 4422:( 4410:, 4404:( 4392:, 4386:( 4380:( 4371:1 4362:, 4356:( 4350:( 4341:0 4332:, 4326:( 4320:( 4311:0 4302:, 4296:( 4290:( 4281:0 4272:, 4266:( 4260:( 4194:, 4188:( 4176:, 4170:( 4161:) 4155:, 4149:( 4137:, 4131:( 4125:( 4113:, 4107:( 4101:, 4098:1 4095:+ 4077:, 4071:( 4062:) 4056:, 4050:( 4038:, 4032:( 4026:, 4023:1 4020:+ 4002:, 3996:( 3987:) 3981:, 3975:( 3893:, 3887:( 3875:, 3869:( 3860:) 3854:, 3848:( 3803:. 3797:= 3791:, 3785:= 3779:. 3773:= 3767:, 3761:= 3752:Y 3749:, 3746:X 3743:( 3728:( 3716:( 3704:, 3698:( 3686:, 3680:( 3668:, 3662:( 3656:( 3644:, 3638:( 3632:( 3620:( 3608:, 3602:( 3593:) 3587:, 3581:( 3569:, 3563:( 3557:( 3545:( 3533:, 3527:( 3518:) 3512:, 3506:( 3494:, 3488:( 3482:( 3476:( 3461:, 3455:( 3449:( 3400:B 3397:( 3388:B 3385:, 3382:A 3379:( 3370:A 3367:( 3358:C 3355:( 3346:B 3343:( 3334:C 3331:, 3328:B 3313:( 3275:( 3263:( 3251:( 3239:, 3233:( 3169:. 3163:= 3160:X 3154:) 3151:X 3148:( 3142:. 3136:= 3133:X 3127:) 3124:X 3121:( 3115:. 3109:= 3106:X 3100:) 3097:X 3094:( 3085:X 3082:( 3070:X 3067:( 3058:X 3055:( 3049:, 3043:= 3034:) 3028:, 3025:X 3022:( 3010:X 3007:( 3001:, 2995:= 2986:) 2980:, 2977:X 2974:( 2961:. 2955:= 2943:, 2937:( 2922:( 2902:. 2896:= 2884:, 2878:( 2863:( 2847:. 2841:= 2829:, 2823:( 2801:( 2792:X 2789:( 2777:X 2774:( 2765:X 2762:( 2753:) 2747:, 2744:X 2741:( 2729:, 2726:X 2723:( 2711:X 2708:( 2699:) 2693:, 2690:X 2687:( 2663:) 2661:k 2657:1 2645:. 2643:k 2631:. 2629:1 2592:p 2562:0 2559:( 2556:s 2553:( 2550:s 2547:( 2544:s 2541:( 2538:s 2535:( 2532:s 2526:0 2523:( 2520:s 2517:( 2514:s 2508:0 2505:( 2502:s 2499:( 2496:s 2493:( 2461:0 2458:( 2455:s 2452:( 2449:s 2446:( 2443:s 2440:( 2437:s 2434:= 2431:Y 2425:0 2422:( 2419:s 2416:( 2413:s 2410:= 2407:X 2401:= 2398:Y 2395:, 2392:0 2389:= 2386:X 2380:Y 2377:, 2374:X 2371:, 2368:X 2365:( 2356:Y 2353:, 2350:X 2347:, 2344:X 2341:( 2329:0 2326:( 2323:s 2320:( 2317:s 2314:( 2311:s 2308:( 2305:s 2302:= 2299:X 2293:X 2287:0 2284:( 2281:s 2278:( 2275:s 2269:0 2266:( 2263:s 2260:( 2257:s 2254:( 2215:W 2212:, 2209:Z 2206:, 2203:X 2200:( 2191:Z 2188:, 2185:Y 2182:, 2179:X 2176:( 2167:) 2164:W 2158:Y 2155:( 2152:s 2149:, 2146:X 2143:( 2134:0 2131:, 2128:0 2125:, 2122:X 2119:( 2110:Z 2107:, 2104:Y 2101:, 2098:X 2095:( 2083:Z 2080:( 2077:s 2071:Y 2068:( 2065:s 2062:, 2059:X 2056:( 2047:X 2044:, 2041:0 2038:, 2035:X 2032:( 1956:, 1950:( 1938:, 1932:( 1920:, 1914:( 1902:, 1896:( 1884:, 1878:( 1866:, 1860:( 1848:, 1842:( 1830:, 1824:( 1719:. 1713:= 1710:Y 1707:, 1701:= 1698:X 1695:. 1689:= 1686:Y 1683:, 1677:= 1674:X 1668:Y 1665:, 1662:X 1659:( 1650:. 1641:) 1635:( 1629:. 1620:) 1614:( 1608:. 1599:) 1593:( 1587:. 1578:) 1572:( 1563:X 1560:( 1551:) 1548:X 1545:( 1536:X 1533:( 1524:) 1521:X 1518:( 1509:X 1506:( 1500:( 1491:) 1488:X 1485:( 1464:Y 1461:, 1458:Z 1455:( 1446:Z 1443:, 1440:X 1437:( 1428:) 1425:Y 1422:, 1419:X 1416:( 1400:X 1397:( 1391:( 1385:= 1382:) 1379:X 1376:( 1337:n 1326:N 1307:. 1301:+ 1283:, 1277:( 1265:, 1259:( 1253:, 1250:2 1247:- 1244:N 1235:, 1232:1 1229:- 1226:N 1217:, 1214:1 1208:N 1202:) 1196:, 1193:N 1190:( 1181:1 1178:, 1175:1 1172:( 1163:0 1160:, 1157:0 1154:( 766:B 750:. 747:n 745:B 740:1 738:B 734:A 726:n 722:1 696:Y 693:= 690:X 687:( 678:Y 675:, 672:Z 669:( 660:X 657:, 654:Z 651:( 642:) 639:Y 636:, 633:X 630:( 597:, 591:( 573:, 567:( 558:. 552:= 549:Y 543:= 540:X 537:; 531:= 528:Y 522:= 519:X 513:Y 510:, 507:X 504:( 495:. 489:= 486:Y 483:; 477:= 474:Y 468:Y 465:, 459:( 447:= 444:X 435:, 432:X 429:( 412:= 409:X 392:Y 389:, 386:Z 383:( 374:Z 371:, 368:X 365:( 356:) 353:Y 350:, 347:X 344:( 335:Y 332:, 329:X 326:( 317:) 314:Y 311:, 308:X 305:( 296:Y 293:, 290:X 287:( 278:) 275:Y 272:, 269:X 266:( 254:, 248:( 236:, 230:( 218:, 212:( 199:i 195:m 191:1 183:n 179:1 168:. 166:n 162:1 132:i 130:B 121:n 119:B 114:1 112:B 104:A 98:. 96:n 92:1 80:. 78:n 74:1 20:)

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.

Index