library(aggregate)| aggregate/3 | Aggregate bindings in Goal according to Template. |
| aggregate/4 | Aggregate bindings in Goal according to Template. |
| aggregate_all/3 | Aggregate bindings in Goal according to Template. |
| aggregate_all/4 | Aggregate bindings in Goal according to Template. |
| foreach/2 | True if the conjunction of instances of Goal using the bindings from Generator is true. |
| free_variables/4 | In order to handle variables properly, we have to find all the universally quantified variables in the Generator. |
library(apply)| exclude/3 | Filter elements for which Goal fails. |
| include/3 | Filter elements for which Goal succeed. |
| partition/4 | Filter elements of List according to Pred. |
| partition/5 | Filter list according to Pred in three sets. |
library(assoc)| assoc_to_list/2 | Translate assoc into a pairs list |
| assoc_to_keys/2 | Translate assoc into a key list |
| assoc_to_values/2 | Translate assoc into a value list |
| empty_assoc/1 | Test/create an empty assoc |
| gen_assoc/3 | Non-deterministic enumeration of assoc |
| get_assoc/3 | Get associated value |
| get_assoc/5 | Get and replace associated value |
| list_to_assoc/2 | Translate pair list to assoc |
| map_assoc/2 | Test assoc values |
| map_assoc/3 | Map assoc values |
| max_assoc/3 | Max key-value of an assoc |
| min_assoc/3 | Min key-value of an assoc |
| ord_list_to_assoc/3 | Translate ordered list into an assoc |
| put_assoc/4 | Add association to an assoc |
library(broadcast)| broadcast/1 | Send event notification |
| broadcast_request/1 | Request all agents |
| listen/2 | Listen to event notifications |
| listen/3 | Listen to event notifications |
| unlisten/1 | Stop listening to event notifications |
| unlisten/2 | Stop listening to event notifications |
| unlisten/3 | Stop listening to event notifications |
| listening/3 | Who is listening to event notifications? |
library(check)| check/0 | Program completeness and consistency |
| list_undefined/0 | List undefined predicates |
| list_autoload/0 | List predicates that require autoload |
| list_redefined/0 | List locally redefined predicates |
library(lists)| append/2 | Concatenate a list of lists |
| append/3 | Concatenate lists |
| delete/3 | Delete all matching members from a list |
| flatten/2 | Transform nested list into flat list |
| intersection/3 | Set intersection |
| is_set/1 | Type check for a set |
| list_to_set/2 | Remove duplicates |
| max_list/2 | Largest number in a list |
| member/2 | Element is member of a list |
| min_list/2 | Smallest number in a list |
| nextto/3 | Y follows X in List |
| nth0/3 | N-th element of a list (0-based) |
| nth1/3 | N-th element of a list (1-based) |
| numlist/3 | Create list of integers in interval |
| permutation/2 | Test/generate permutations of a list |
| reverse/2 | Inverse the order of the elements in a list |
| select/3 | Select element of a list |
| subset/2 | Check subset relation for unordered sets |
| subtract/3 | Delete elements that do not satisfy condition |
| sumlist/2 | Add all numbers in a list |
| union/3 | Union of two sets |
library(option)| merge_options/3 | Merge two option lists. |
| meta_options/3 | Perform meta-expansion on options that are module-sensitive. |
| option/2 | Get an option from a OptionList. |
| option/3 | Get an option from a OptionList. |
| select_option/3 | Get and remove option from an option list. |
| select_option/4 | Get and remove option with default value. |
library(ordsets)| ord_empty/1 | Test empty ordered set |
| list_to_ord_set/2 | Create ordered set |
| ord_add_element/3 | Add element to ordered set |
| ord_del_element/3 | Delete element from ordered set |
| ord_intersect/2 | Test non-empty intersection |
| ord_intersection/3 | Compute intersection |
| ord_disjoint/2 | Test empty intersection |
| ord_subtract/3 | Delete set from set |
| ord_union/3 | Union of two ordered sets |
| ord_union/4 | Union and difference of two ordered sets |
| ord_subset/2 | Test subset |
| ord_memberchk/2 | Deterministically test membership |
library(prologxref)| prolog:called_by/2 | (hook) Extend cross-referencer |
| xref_built_in/1 | Examine defined built-ins |
| xref_called/3 | Examine called predicates |
| xref_clean/1 | Remove analysis of source |
| xref_current_source/1 | Examine cross-referenced sources |
| xref_defined/3 | Examine defined predicates |
| xref_exported/2 | Examine exported predicates |
| xref_module/2 | Module defined by source |
| xref_source/1 | Cross-reference analysis of source |
library(pairs)| group_pairs_by_key/2 | Group values with the same key. |
| map_list_to_pairs/3 | Create a key-value list by mapping each element of List. |
| pairs_keys/2 | Remove the values from a list of Key-Value pairs. |
| pairs_keys_values/3 | True if Keys holds the keys of Pairs and Values the values. |
| pairs_values/2 | Remove the keys from a list of Key-Value pairs. |
| transpose_pairs/2 | Swap Key-Value to Value-Key and sort the result on Value (the new key) using keysort/2. |
library(pio)library(pure_input)| phrase_from_file/2 | Process the content of File using the DCG rule Grammar. |
| phrase_from_file/3 | As phrase_from_file/2, providing additional Options. |
| stream_to_lazy_list/2 | Create a lazy list representing the character codes in Stream. |
library(readutil)| read_line_to_codes/2 | Read line from a stream |
| read_line_to_codes/3 | Read line from a stream |
| read_stream_to_codes/2 | Read contents of stream |
| read_stream_to_codes/3 | Read contents of stream |
| read_file_to_codes/3 | Read contents of file |
| read_file_to_terms/3 | Read contents of file to Prolog terms |
library(record)| record/1 | Define named fields in a term |
library(registry)This library is only available on Windows systems.
| registry_get_key/2 | Get principal value of key |
| registry_get_key/3 | Get associated value of key |
| registry_set_key/2 | Set principal value of key |
| registry_set_key/3 | Set associated value of key |
| registry_delete_key/1 | Remove a key |
| shell_register_file_type/4 | Register a file-type |
| shell_register_dde/6 | Register DDE action |
| shell_register_prolog/1 | Register Prolog |
library(ugraphs)| vertices_edges_to_ugraph/3 | Create unweighted graph |
| vertices/2 | Find vertices in graph |
| edges/2 | Find edges in graph |
| add_vertices/3 | Add vertices to graph |
| del_vertices/3 | Delete vertices from graph |
| add_edges/3 | Add edges to graph |
| del_edges/3 | Delete edges from graph |
| transpose/2 | Invert the direction of all edges |
| neighbors/3 | Find neighbors of vertice |
| neighbours/3 | Find neighbors of vertice |
| complement/2 | Inverse presense of edges |
| compose/3 | |
| top_sort/2 | Sort graph topologically |
| top_sort/3 | Sort graph topologically |
| transitive_closure/2 | Create transitive closure of graph |
| reachable/3 | Find all reachable vertices |
| ugraph_union/3 | Union of two graphs |
library(url)| file_name_to_url/2 | Translate
between a filename and a file:// URL. |
| global_url/3 | Translate a possibly relative URL into an absolute one. |
| http_location/2 | Construct or analyze an HTTP location. |
| is_absolute_url/1 | True if URL is an absolute URL. |
| parse_url/2 | Construct or analyse a URL. |
| parse_url_search/2 | Construct or analyze an HTTP search specification. |
| url_iri/2 | Convert between a URL, encoding in US-ASCII and an IRI. |
| www_form_encode/2 | En/Decode between native value and application/x-www-form-encoded. |
library(www_browser)| www_open_url/1 | Open a web-page in a browser |
library(clp/clp_distinct)| all_distinct/1 | Demand distinct values |
| vars_in/2 | Declare domain of variable as set |
| vars_in/3 | Declare domain of variable as interval |
library(clp/clpfd)| #/\/2 | P and Q hold. |
| #</2 | X is less than Y. |
| #<==/2 | Q implies P. |
| #<==>/2 | P and Q are equivalent. |
| #=/2 | X equals Y. |
| #=</2 | X is less than or equal to Y. |
| #==>/2 | P implies Q. |
| #>/2 | X is greater than Y. |
| #>=/2 | X is greater than or equal to Y. |
| #\/1 | The reifiable constraint Q does _not_ hold. |
| #\//2 | P or Q holds. |
| #\=/2 | X is not Y. |
| all_different/1 | Vars are pairwise distinct. |
| all_distinct/1 | Like all_different/1, with stronger propagation. |
| fd_dom/2 | Dom is the current domain (see in/2) of Var. |
| fd_inf/2 | Inf is the infimum of the current domain of Var. |
| fd_size/2 | Size is the number of elements of the current domain of Var, or the atom *sup* if the domain is unbounded. |
| fd_sup/2 | Sup is the supremum of the current domain of Var. |
| fd_var/1 | True iff Var is a CLP(FD) variable. |
| in/2 | Var is an element of Domain. |
| indomain/1 | Bind Var to all feasible values of its domain on backtracking. |
| ins/2 | The variables in the list Vars are elements of Domain. |
| label/1 | Equivalent to labeling([], Vars). |
| labeling/2 | Labeling means systematically trying out values for the finite domain variables Vars until all of them are ground. |
| lex_chain/1 | Lists are lexicographically non-decreasing. |
| serialized/2 | Constrain a set of intervals to a non-overlapping sequence. |
| sum/3 | The sum of elements of the list Vars is in relation Rel to Expr. |
| tuples_in/2 | Relation must be a ground list of lists of integers. |
library(clpqr)| entailed/1 | Check if constraint is entailed |
| inf/2 | Find the infimum of an expression |
| sup/2 | Find the supremum of an expression |
| minimize/1 | Minimizes an expression |
| maximize/1 | Maximizes an expression |
| bb_inf/3 | Infimum of expression for mixed-integer problems |
| bb_inf/4 | Infimum of expression for mixed-integer problems |
| bb_inf/5 | Infimum of expression for mixed-integer problems |
| dump/3 | Dump constraints on variables |
library(clp/simplex)| assignment/2 | Solve assignment problem |
| constraint/3 | Add linear constraint to state |
| constraint/4 | Add named linear constraint to state |
| constraint_add/4 | Extend a named constraint |
| gen_state/1 | Create empty linear program |
| maximize/3 | Maximize objective function in to linear constraints |
| minimize/3 | Minimize objective function in to linear constraints |
| objective/2 | Fetch value of objective function |
| shadow_price/3 | Fetch shadow price in solved state |
| transportation/4 | Solve transportation problem |
| variable_value/3 | Fetch value of variable in solved state |