- swipl
- library
- error.pl
- debug.pl -- Print debug messages and test assertions
- apply.pl -- Apply predicates on a list
- lists.pl
- broadcast.pl -- Event service
- shlib.pl -- Utility library for loading foreign objects (DLLs, shared objects)
- option.pl
- thread_pool.pl -- Resource bounded thread management
- gensym.pl -- Generate unique symbols
- settings.pl -- Setting management
- arithmetic.pl
- main.pl
- readutil.pl -- Read utilities
- operators.pl -- Manage operators
- pairs.pl -- Operations on key-value lists
- prolog_source.pl -- Examine Prolog source-files
- quasi_quotations.pl
- url.pl -- Analysing and constructing URL
- www_browser.pl
- prolog_colour.pl
- record.pl -- Access compound arguments by name
- prolog_xref.pl -- Prolog cross-referencer data collection
- occurs.pl -- Finding and counting sub-terms
- ordsets.pl -- Ordered set manipulation
- assoc.pl -- Binary associations
- ugraphs.pl -- Graph manipulation library
- solution_sequences.pl -- Modify solution sequences
- atom.pl -- Operations on atoms
- prolog_pack.pl -- A package manager for Prolog
- git.pl -- Run GIT commands
- ctypes.pl -- Character code classification
- utf8.pl
- base64.pl
- persistency.pl -- Provide persistent dynamic predicates
- pure_input.pl
- nb_set.pl -- Non-backtrackable sets
- aggregate.pl
- csv.pl -- Process CSV (Comma-Separated Values) data
- iostream.pl -- Utilities to deal with streams
- dialect.pl
- apply_macros.pl -- Goal expansion rules to avoid meta-calling
- yall.pl -- Lambda expressions
- prolog_code.pl -- Utilities for reasoning about code
- dif.pl -- The dif/2 constraint
- thread.pl -- High level thread primitives
- predicate_options.pl -- Access and analyse predicate options
- rbtrees.pl
- nb_rbtrees.pl
- sandbox.pl
- prolog_format.pl -- Analyse format specifications
- random.pl -- Random numbers
- pprint.pl -- Pretty Print Prolog terms
- modules.pl -- Module utility predicates
- lazy_lists.pl
- edinburgh.pl
- prolog_clause.pl
- prolog_breakpoints.pl -- Manage Prolog break-points
- dicts.pl
- heaps.pl
- backcomp.pl -- Backward compatibility
- date.pl
- prolog_profile.pl -- Execution profiler
- listing.pl -- List programs and pretty print clauses
- quintus.pl -- Quintus compatibility
- oset.pl -- Ordered set manipulation
- varnumbers.pl
- tables.pl -- XSB interface to tables
- charsio.pl
- terms.pl -- Term manipulation
- make.pl -- Reload modified source files
- streams.pl -- Manage Prolog streams
- rwlocks.pl -- Read/write locks
- threadutil.pl -- Interactive thread utilities
- wfs.pl
- prolog_stack.pl -- Examine the Prolog stack
- check.pl -- Consistency checking
- intercept.pl -- Intercept and signal interface
- prolog_coverage.pl
- prolog_debug.pl -- User level debugging tools
- increval.pl -- Incremental dynamic predicate modification
- help.pl -- Text based manual
- portray_text.pl
- statistics.pl -- Get information about resource usage
- optparse.pl -- command line parsing
- ansi_term.pl
- hashtable.pl -- Hash tables
- coinduction.pl -- Co-Logic Programming
- qsave.pl
- zip.pl
- prolog_history.pl -- Per-directory persistent commandline history
- codesio.pl -- I/O on Lists of Character Codes
- shell.pl -- Elementary shell commands
- when.pl -- Conditional coroutining
- system.pl -- System utilities
- prolog_jiti.pl
- prolog_codewalk.pl -- Prolog code walker
- exceptions.pl -- Exception classification
- base32.pl
- sort.pl
- prolog_versions.pl
- edit.pl
- macros.pl -- Macro expansion
- prolog_autoload.pl -- Autoload all dependencies
- writef.pl -- Old-style formatted write
- strings.pl -- String utilities
- tableutil.pl
- tty.pl
- prolog_config.pl
- explain.pl
- fastrw.pl
- prolog_trace.pl
- files.pl
- prolog_wrap.pl -- Wrapping predicates
- prolog_metainference.pl
- library
- complement(+UGraphIn, -UGraphOut)
- UGraphOut is a ugraph with an edge between all vertices that are
not connected in UGraphIn and all edges from UGraphIn removed.
Example:
?- complement([1-[3,5],2-[4],3-[], 4-[1,2,7,5],5-[],6-[],7-[],8-[]], NL). NL = [1-[2,4,6,7,8],2-[1,3,5,6,7,8],3-[1,2,4,5,6,7,8], 4-[3,5,6,8],5-[1,2,3,4,6,7,8],6-[1,2,3,4,5,7,8], 7-[1,2,3,4,5,6,8],8-[1,2,3,4,5,6,7]]- To be done
- - Simple two-step algorithm. You could be smarter, I suppose.