{ "schema_version": "0.1", "document": { "id": "np-00009", "sha256": "10fb33eeb9849083494a2d241ed8a179facb9ed7d18181278895e15a1bbd0660", "source": "scan", "groundtruth_source": "nutrient_seeded_reviewed", "language": [ "en" ], "pages": [ { "index": 0, "label": null, "width": 589.0, "height": 750.0 } ] }, "elements": [ { "id": "e1", "class": "caption", "page": 0, "box": [ 0.26972, 0.06817, 0.45461, 0.01632 ], "text": "Table 1: Complexity of domain-independent planning.", "channel": "body", "level": null, "header": null, "rows": null, "spans": null, "chart": null, "cells": null, "styles": [ { "style": "bold", "start": 0, "end": 51 } ], "font": { "family": "Latin Modern Roman", "class": "serif", "size": 10.07 }, "payload": null }, { "id": "e2", "class": "table", "page": 0, "box": [ 0.096, 0.084, 0.806, 0.229 ], "text": "", "channel": "body", "level": null, "header": [ [ "Language restrictions", "How the operators are given", "Allow delete lists?", "Allow negated preconditions?", "Telling if a plan exists", "Telling if there’s a plan of length ≤ k" ] ], "rows": [ [ "datalog (no function symbols, and only finitely many constant symbols)", "given in the input", "yes", "yes/no", "EXPSPACE-complete", "NEXPTIME-complete" ], [ null, null, "no", "yes", "NEXPTIME-complete", "NEXPTIME-complete" ], [ null, null, null, "no", "EXPTIME-complete", "NEXPTIME-complete" ], [ null, null, null, "noᵅ", "PSPACE-complete", "PSPACE-complete" ], [ null, "fixed", "yes", "yes/no", "in PSPACE ᵞ", "in PSPACE ᵞ" ], [ null, null, "no", "yes", "in NP ᵞ", "in NP ᵞ" ], [ null, null, null, "no", "in P", "in NP ᵞ" ], [ null, null, null, "noᵅ", "in NLOGSPACE", "in NP" ], [ "propositional (all predicates are 0-ary)", "given in the input", "yes", "yes/no", "PSPACE-completeᵟ", "PSPACE-complete" ], [ null, null, "no", "yes", "NP-complete ᵟ", "NP-complete" ], [ null, null, null, "no", "in P ᵟ", "NP-complete" ], [ null, null, null, "noᵅ/noᵝ", "NLOGSPACE-complete", "NP-complete" ], [ null, "fixed", "yes/no", "yes/no", "constant time", "constant time" ] ], "spans": [ { "row": 1, "column": 0, "rows": 8, "columns": 1 }, { "row": 1, "column": 1, "rows": 4, "columns": 1 }, { "row": 2, "column": 2, "rows": 3, "columns": 1 }, { "row": 5, "column": 1, "rows": 4, "columns": 1 }, { "row": 6, "column": 2, "rows": 3, "columns": 1 }, { "row": 9, "column": 0, "rows": 5, "columns": 1 }, { "row": 9, "column": 1, "rows": 4, "columns": 1 }, { "row": 10, "column": 2, "rows": 3, "columns": 1 } ], "chart": null, "cells": null, "styles": null, "font": null, "payload": null }, { "id": "e3", "class": "footnote", "page": 0, "box": [ 0.102, 0.312, 0.345, 0.013 ], "text": "ᵅNo operator has more than one precondition.", "channel": "body", "level": null, "header": null, "rows": null, "spans": null, "chart": null, "cells": null, "styles": [ { "style": "italic", "start": 0, "end": 1 }, { "style": "superscript", "start": 0, "end": 1 } ], "font": { "family": "Latin Modern Roman", "class": "serif", "size": 9.4 }, "payload": null }, { "id": "e4", "class": "footnote", "page": 0, "box": [ 0.10634, 0.32357, 0.63036, 0.0192 ], "text": "ᵝEvery operator with more than one precondition is a composition of other operators.", "channel": "body", "level": null, "header": null, "rows": null, "spans": null, "chart": null, "cells": null, "styles": [ { "style": "italic", "start": 0, "end": 1 }, { "style": "superscript", "start": 0, "end": 1 } ], "font": { "family": "Latin Modern Roman", "class": "serif", "size": 9.81 }, "payload": null }, { "id": "e5", "class": "footnote", "page": 0, "box": [ 0.10706, 0.34142, 0.45513, 0.0141 ], "text": "ᵞWith PSPACE- or NP-completeness for some sets of operators.", "channel": "body", "level": null, "header": null, "rows": null, "spans": null, "chart": null, "cells": null, "styles": [ { "style": "italic", "start": 0, "end": 1 }, { "style": "superscript", "start": 0, "end": 1 } ], "font": { "family": "Latin Modern Roman", "class": "serif", "size": 9.25 }, "payload": null }, { "id": "e6", "class": "footnote", "page": 0, "box": [ 0.1069, 0.35238, 0.5042, 0.01824 ], "text": "ᵟThese results are due to Bylander (1991). All other results are new.", "channel": "body", "level": null, "header": null, "rows": null, "spans": null, "chart": null, "cells": null, "styles": [ { "style": "italic", "start": 0, "end": 1 }, { "style": "superscript", "start": 0, "end": 1 } ], "font": { "family": "Latin Modern Roman", "class": "serif", "size": 9.55 }, "payload": null }, { "id": "e7", "class": "paragraph", "page": 0, "box": [ 0.09869, 0.40548, 0.37861, 0.06948 ], "text": "This is because what makes the problem hard is the task of choosing operators that achieve several subgoals in order to minimize the overall length of the plan, and this task remains equally hard regardless of whether negated preconditions are allowed.", "channel": "body", "level": null, "header": null, "rows": null, "spans": null, "chart": null, "cells": null, "styles": [], "font": { "family": "Latin Modern Roman", "class": "serif", "size": 9.45 }, "payload": null }, { "id": "e8", "class": "list_item", "page": 0, "box": [ 0.07819, 0.482, 0.39981, 0.05723 ], "text": "5. Delete lists are more powerful than negated preconditions. Thus, if the operators are allowed to have delete lists, then whether or not they have negated preconditions has no effect on the complexity.", "channel": "body", "level": 1, "header": null, "rows": null, "spans": null, "chart": null, "cells": null, "styles": [], "font": { "family": "Latin Modern Roman", "class": "serif", "size": 9.29 }, "payload": null }, { "id": "e9", "class": "heading", "page": 0, "box": [ 0.22726, 0.55547, 0.10629, 0.01303 ], "text": "Definitions", "channel": "body", "level": 2, "header": null, "rows": null, "spans": null, "chart": null, "cells": null, "styles": [], "font": { "family": "Latin Modern Roman", "class": "serif", "size": 9.48 }, "payload": null }, { "id": "e10", "class": "paragraph", "page": 0, "box": [ 0.08299, 0.57874, 0.3953, 0.14038 ], "text": "Let ℒ be any datalog (i.e., function-free first-order) language. Then a state is any nonempty set of ground atoms in ℒ. Intuitively, a state tells us which ground atoms are currently true. Thus, if a ground atom A is in state S, then A is true in state S; if B ∉ S, then B is false in state S. Thus, a state is simply an Herbrand interpretation for the language ℒ, and hence each formula of first-order logic is either satisfied or not satisfied in S according to the usual first-order logic definition of satisfaction.", "channel": "body", "level": null, "header": null, "rows": null, "spans": null, "chart": null, "cells": null, "styles": [ { "style": "italic", "start": 72, "end": 77 }, { "style": "italic", "start": 212, "end": 213 }, { "style": "italic", "start": 226, "end": 227 }, { "style": "italic", "start": 234, "end": 235 }, { "style": "italic", "start": 253, "end": 254 }, { "style": "italic", "start": 259, "end": 260 }, { "style": "italic", "start": 263, "end": 264 }, { "style": "italic", "start": 271, "end": 272 }, { "style": "italic", "start": 291, "end": 292 }, { "style": "italic", "start": 449, "end": 450 } ], "font": { "family": "Latin Modern Roman", "class": "serif", "size": 9.4 }, "payload": null }, { "id": "e11", "class": "paragraph", "page": 0, "box": [ 0.08359, 0.72235, 0.39658, 0.03905 ], "text": "Let ℒ be any datalog language. A planning operator α is a 4-tuple (Name(α), Pre(α), Add(α), Del(α)), where", "channel": "body", "level": null, "header": null, "rows": null, "spans": null, "chart": null, "cells": null, "styles": [ { "style": "italic", "start": 33, "end": 52 }, { "style": "italic", "start": 72, "end": 73 }, { "style": "italic", "start": 80, "end": 81 }, { "style": "italic", "start": 88, "end": 89 }, { "style": "italic", "start": 96, "end": 97 } ], "font": { "family": "Latin Modern Roman", "class": "serif", "size": 9.33 }, "payload": null }, { "id": "e12", "class": "list_item", "page": 0, "box": [ 0.07965, 0.77052, 0.39955, 0.04609 ], "text": "1. Name(α) is a syntactic expression of the form α(X₁, …, Xₙ) where each Xᵢ is a variable symbol of ℒ;", "channel": "body", "level": 1, "header": null, "rows": null, "spans": null, "chart": null, "cells": null, "styles": [ { "style": "italic", "start": 8, "end": 9 }, { "style": "italic", "start": 49, "end": 50 }, { "style": "italic", "start": 51, "end": 52 }, { "style": "subscript", "start": 52, "end": 53 }, { "style": "italic", "start": 58, "end": 60 }, { "style": "subscript", "start": 59, "end": 60 }, { "style": "italic", "start": 73, "end": 75 }, { "style": "subscript", "start": 74, "end": 75 } ], "font": { "family": "Latin Modern Roman", "class": "serif", "size": 9.54 }, "payload": null }, { "id": "e13", "class": "list_item", "page": 0, "box": [ 0.07901, 0.82045, 0.3995, 0.04513 ], "text": "2. Pre(α) is a finite set of literals, called the precondition list of α, whose variables are all from the set {X₁, …, Xₙ};", "channel": "body", "level": 1, "header": null, "rows": null, "spans": null, "chart": null, "cells": null, "styles": [ { "style": "italic", "start": 7, "end": 8 }, { "style": "italic", "start": 50, "end": 67 }, { "style": "italic", "start": 71, "end": 72 }, { "style": "italic", "start": 112, "end": 113 }, { "style": "subscript", "start": 113, "end": 114 }, { "style": "italic", "start": 119, "end": 121 }, { "style": "subscript", "start": 120, "end": 121 } ], "font": { "family": "Latin Modern Roman", "class": "serif", "size": 9.16 }, "payload": null }, { "id": "e14", "class": "list_item", "page": 0, "box": [ 0.07973, 0.86846, 0.39909, 0.02976 ], "text": "3. Add(α) and Del(α) are both finite sets of atoms (possibly non-ground) whose variables are taken", "channel": "body", "level": 1, "header": null, "rows": null, "spans": null, "chart": null, "cells": null, "styles": [ { "style": "italic", "start": 7, "end": 8 }, { "style": "italic", "start": 18, "end": 19 } ], "font": { "family": "Latin Modern Roman", "class": "serif", "size": 9.46 }, "payload": null }, { "id": "e15a", "class": "figure", "page": 0, "box": [ 0.571, 0.408, 0.141, 0.041 ], "text": "", "channel": "body", "level": null, "header": null, "rows": null, "spans": null, "chart": null, "cells": null, "styles": null, "font": null, "payload": null }, { "id": "e16", "class": "caption", "page": 0, "box": [ 0.5923, 0.46056, 0.09948, 0.02816 ], "text": "Fig. 1: Initial configuration", "channel": "body", "level": null, "header": null, "rows": null, "spans": null, "chart": null, "cells": null, "styles": [], "font": { "family": "Latin Modern Roman", "class": "serif", "size": 9.49 }, "payload": null }, { "id": "e15b", "class": "figure", "page": 0, "box": [ 0.8, 0.408, 0.028, 0.041 ], "text": "", "channel": "body", "level": null, "header": null, "rows": null, "spans": null, "chart": null, "cells": null, "styles": null, "font": null, "payload": null }, { "id": "e17", "class": "caption", "page": 0, "box": [ 0.76039, 0.46053, 0.09647, 0.02801 ], "text": "Fig. 2: Goal configuration", "channel": "body", "level": null, "header": null, "rows": null, "spans": null, "chart": null, "cells": null, "styles": [], "font": { "family": "Latin Modern Roman", "class": "serif", "size": 9.76 }, "payload": null }, { "id": "e18", "class": "list_item", "page": 0, "box": [ 0.53893, 0.5228, 0.38137, 0.03265 ], "text": "from the set {X₁, …, Xₙ}. Add(α) is called the add list of α, and Del(α) is called the delete list of α.", "channel": "body", "level": 1, "header": null, "rows": null, "spans": null, "chart": null, "cells": null, "styles": [ { "style": "italic", "start": 14, "end": 15 }, { "style": "subscript", "start": 15, "end": 16 }, { "style": "italic", "start": 21, "end": 23 }, { "style": "subscript", "start": 22, "end": 23 }, { "style": "italic", "start": 30, "end": 31 }, { "style": "italic", "start": 47, "end": 55 }, { "style": "italic", "start": 59, "end": 60 }, { "style": "italic", "start": 70, "end": 71 }, { "style": "italic", "start": 87, "end": 98 }, { "style": "italic", "start": 102, "end": 103 } ], "font": { "family": "Latin Modern Roman", "class": "serif", "size": 9.65 }, "payload": null }, { "id": "e19", "class": "paragraph", "page": 0, "box": [ 0.52189, 0.55924, 0.39727, 0.04144 ], "text": "Observe that atoms and negated atoms may occur in the precondition list, but negated atoms may not occur in either the add list or the delete list.", "channel": "body", "level": null, "header": null, "rows": null, "spans": null, "chart": null, "cells": null, "styles": [], "font": { "family": "Latin Modern Roman", "class": "serif", "size": 9.47 }, "payload": null }, { "id": "e20", "class": "paragraph", "page": 0, "box": [ 0.52166, 0.60058, 0.39807, 0.12885 ], "text": "A planning domain is a pair P = (S₀, 𝒪), where S₀ is the initial state and 𝒪 is a finite set of operators. A planning problem is a triple P = (S₀, 𝒪, G), where (S₀, 𝒪) is a planning domain and G is a goal (an existentially closed conjunction of atoms). In both cases, the language of P is the datalog language ℒ generated by the constant, predicate, and variable symbols appearing in P, along with an infinite number of variable symbols.", "channel": "body", "level": null, "header": null, "rows": null, "spans": null, "chart": null, "cells": null, "styles": [ { "style": "italic", "start": 2, "end": 17 }, { "style": "bold", "start": 28, "end": 29 }, { "style": "italic", "start": 33, "end": 34 }, { "style": "subscript", "start": 34, "end": 35 }, { "style": "italic", "start": 47, "end": 48 }, { "style": "subscript", "start": 48, "end": 49 }, { "style": "italic", "start": 57, "end": 70 }, { "style": "italic", "start": 109, "end": 125 }, { "style": "bold", "start": 138, "end": 139 }, { "style": "italic", "start": 143, "end": 144 }, { "style": "subscript", "start": 144, "end": 145 }, { "style": "italic", "start": 150, "end": 151 }, { "style": "italic", "start": 161, "end": 162 }, { "style": "subscript", "start": 162, "end": 163 }, { "style": "italic", "start": 193, "end": 194 }, { "style": "italic", "start": 200, "end": 204 }, { "style": "italic", "start": 272, "end": 280 }, { "style": "bold", "start": 284, "end": 285 }, { "style": "bold", "start": 384, "end": 385 } ], "font": { "family": "Latin Modern Roman", "class": "serif", "size": 9.4 }, "payload": null }, { "id": "e21", "class": "paragraph", "page": 0, "box": [ 0.52259, 0.73844, 0.39792, 0.08393 ], "text": "Example 1 (Blocks World) Consider a blocks-world domain containing three blocks a, b, c, along with Nilsson’s “stack”, “unstack”, “pickup”, and “putdown” operators (Nilsson, 1980). Suppose the initial and goal configurations are as shown in Figs. 1 and 2. This domain can be represented as follows:", "channel": "body", "level": null, "header": null, "rows": null, "spans": null, "chart": null, "cells": null, "styles": [ { "style": "bold", "start": 0, "end": 24 }, { "style": "italic", "start": 80, "end": 81 }, { "style": "italic", "start": 83, "end": 84 }, { "style": "italic", "start": 86, "end": 87 } ], "font": { "family": "Latin Modern Roman", "class": "serif", "size": 9.5 }, "payload": null }, { "id": "e22", "class": "list_item", "page": 0, "box": [ 0.52369, 0.82912, 0.39675, 0.06958 ], "text": "Language. The language ℒ contains a supply of variable symbols X₁, X₂, …, and three constant symbols a, b, c to represent the three blocks. ℒ contains a binary predicate symbol “on”, unary predicate symbols “ontable”, “clear”, and “holding”, and a 0-ary", "channel": "body", "level": 1, "header": null, "rows": null, "spans": null, "chart": null, "cells": null, "styles": [ { "style": "italic", "start": 0, "end": 9 }, { "style": "italic", "start": 63, "end": 64 }, { "style": "subscript", "start": 64, "end": 65 }, { "style": "italic", "start": 67, "end": 68 }, { "style": "subscript", "start": 68, "end": 69 }, { "style": "italic", "start": 101, "end": 102 }, { "style": "italic", "start": 104, "end": 105 }, { "style": "italic", "start": 107, "end": 108 } ], "font": { "family": "Latin Modern Roman", "class": "serif", "size": 9.16 }, "payload": null }, { "id": "e23", "class": "footer", "page": 0, "box": [ 0.07677, 0.92338, 0.02956, 0.01023 ], "text": "382", "channel": "furniture", "level": null, "header": null, "rows": null, "spans": null, "chart": null, "cells": null, "styles": null, "font": null, "payload": null }, { "id": "e24", "class": "footer", "page": 0, "box": [ 0.12972, 0.92274, 0.077, 0.01313 ], "text": "Planning", "channel": "furniture", "level": null, "header": null, "rows": null, "spans": null, "chart": null, "cells": null, "styles": null, "font": null, "payload": null } ], "relations": [ { "kind": "caption_of", "from": "e1", "to": "e2", "hyphenated": false }, { "kind": "footnote_of", "from": "e3", "to": "e2", "hyphenated": false }, { "kind": "footnote_of", "from": "e4", "to": "e2", "hyphenated": false }, { "kind": "footnote_of", "from": "e5", "to": "e2", "hyphenated": false }, { "kind": "footnote_of", "from": "e6", "to": "e2", "hyphenated": false }, { "kind": "caption_of", "from": "e16", "to": "e15a", "hyphenated": false }, { "kind": "continues_in", "from": "e14", "to": "e18", "hyphenated": false }, { "kind": "caption_of", "from": "e17", "to": "e15b", "hyphenated": false } ], "reading_order": [ "e1", "e2", "e3", "e4", "e5", "e6", "e7", "e8", "e9", "e10", "e11", "e12", "e13", "e14", "e15a", "e16", "e15b", "e17", "e18", "e19", "e20", "e21", "e22" ], "planted": [] }