B-Prolog

A great Prolog compiler for Darwim.
Download

B-Prolog Ranking & Summary

Advertisement

  • Rating:
  • License:
  • Demo
  • Price:
  • USD 298.00 | BUY the full version
  • Publisher Name:
  • KopecSoft
  • Publisher web site:
  • http://www.kopecsoft.com/sachs/
  • Operating Systems:
  • Mac OS X 10.3 or later
  • File Size:
  • 1.4 MB

B-Prolog Tags


B-Prolog Description

A great Prolog compiler for Darwim. B-Prolog is a versatile and really efficient constraint logic programming (CLP) system! B-Prolog is being brought to you by Afany Software (New York), KLS (Tokyo), and NandaSoft (Nanjing). The birth of CLP is a milestone in the history of programming languages. CLP combines two declarative programming paradigms: logic programming and constraint solving. The declarative nature has proven appealing in numerous applications including computer-aided design and verification, database, data mining, software engineering, optimization, configuration, graphical user interface, and language processing. One of B-Prolog goals is to enhance the productivity of software maintainability and development.In addition, because of the availability of efficient constraint-solving, memory management, and compilation techniques, CLP programs can be more efficient than their counterparts written in procedural languages. What's New in This Release: · Table constraints. A table or extensional constraint is either positive or negative. A positive constraint takes the form 'X in R' and a negative constraint takes the form 'X notin R' where X is a tuple variables (X1,...,Xn) or a list of tuples of variables , and R is a table defined as a set of tuples of integers where each tuple takes the form (a1,...,an). · Support of table modes. A table declaration takes the form ':-table p(M1,...,Mn):N.' where p/n is a predicate, Mi is a mode (which can be 'min','max','+','-',or '?'), and N is a limit on the number of answers to be tabled. If no limit is given, then it is assumed that only one answer is tabled. · Iteration built-ins: foreach(Iterators,LocalVars,Goal) and foreach(Iterators,LocalVars,Accumulators,Goal) · New global constraints: post_neqs/1 and post_disjunctive_tasks/1. · Time events are handled with top priority. · Binary equality constraints are further specialized. · Added global constraints: serialized/2, assignment/2, and assignment0/2. · 'Var in D' and 'Var notin D' can occur in Boolean constraints. · The unknown flag works again. · Improved version of call_cleanup/2. · A bug fix in the compiler. · A bug fix in the glpk interface.


B-Prolog Related Software