logic programming | Contact Us
 

WK :: logic programming ::
[ W E B   K N O W L E D G E   O N L I N E :: logic programming ]
 Resources ::
WB
WBT
Addons
Baby
Cooking
Books
Runway
Legal
DVD
Electronics
Outdoor Living
Kitchen
Change
Magazines
Pop Music
PCs
Computers
Cameras
Software
Toys
Tools
Video
Computer


[W/K] :: logic programming


2 definitions 
 for logic programming
From WordNet (r) 2.0 :

  logic programming
       n 1: a computer language designed in Europe to support natural
            language processing [syn: Prolog, logic programing]
       2: creating a program that enables the computer to reason
          logically

From The Free On-line Dictionary of Computing (27 SEP 03) :

  logic programming
       
           A
          declarative, relational style of programming based on
          first-order logic.  The original logic programming language
          was Prolog.  The concept is based on Horn clauses.
       
          The programmer writes a "database" of "{facts", e.g.
       
          	wet(water).
       
          ("water is wet") and "{rules", e.g.
       
          	mortal(X) :- human(X).
       
          ("X is mortal is implied by X is human").  Facts and rules are
          collectively known as "{clauses".
       
          The user supplies a "{goal" which the system attempts to
          prove using "{resolution" or "{backward chaining}".  This
          involves matching the current goal against each fact or the
          left hand side of each rule using "{unification".  If the
          goal matches a fact, the goal succeeds; if it matches a rule
          then the process recurses, taking each sub-goal on the right
          hand side of the rule as the current goal.  If all sub-goals
          succeed then the rule succeeds.
       
          Each time a possible clause is chosen, a "{choice point" is
          created on a stack.  If subsequent resolution fails then
          control eventually returns to the choice point and subsequent
          clauses are tried.  This is known as "{backtracking".
       
          Clauses may contain logic variables which take on any value
          necessary to make the fact or the left hand side of the rule
          match a goal.  Unification binds these variables to the
          corresponding subterms of the goal.  Such bindings are
          associated with the choice point at which the clause was
          chosen and are undone when backtracking reaches that choice
          point.
       
          The user is informed of the success or failure of his first
          goal and if it succeeds and contains variables he is told what
          values of those variables caused it to succeed.  He can then
          ask for alternative solutions.
       
          (1997-07-14)
       
       


Request more information on logic programming
[W/K]
King of Torts
Perricone Prescription
Atkins
Linksys
Art
SanDisk
Cooking
Kids
Videos
Bosch
Porter
Strait-Line Laser
Legal
Black and Decker
Leatherman
Logitech Cordless
Home/Office
Religion
Windows XP
EuroPro Shark
Harrisons
Art
Management
Copyright Web Knowledge Online Inc. 1997-2003 - [privacy policy] -