B-Prolog (original) (raw)
B-Prolog was a high-performance implementation of the standard Prolog language with several extended features including matching clauses, action rules for event handling, finite-domain constraint solving, arrays and hash tables, declarative loops, and tabling. First released in 1994, B-Prolog is now a widely used CLP system. The constraint solver of B-Prolog was ranked top in two categories in the , and it also took the second place in P class in the second ASP solver competition and the second place overall in the third ASP solver competition. B-Prolog underpins the , a logic-based probabilistic reasoning and learning system. B-Prolog is a commercial product, but it can be used for learning and non-profit research purposes free of charge (since version 7.8 for individual users, including
| Property | Value |
|---|---|
| dbo:abstract | B-Prolog was a high-performance implementation of the standard Prolog language with several extended features including matching clauses, action rules for event handling, finite-domain constraint solving, arrays and hash tables, declarative loops, and tabling. First released in 1994, B-Prolog is now a widely used CLP system. The constraint solver of B-Prolog was ranked top in two categories in the , and it also took the second place in P class in the second ASP solver competition and the second place overall in the third ASP solver competition. B-Prolog underpins the , a logic-based probabilistic reasoning and learning system. B-Prolog is a commercial product, but it can be used for learning and non-profit research purposes free of charge (since version 7.8 for individual users, including commercial individual users, B-Prolog is free of charge ). B-Prolog is not anymore actively developed, but it forms the basis for the Picat programming language. (en) |
| dbo:wikiPageExternalLink | http://logtalk.org/performance.html http://www.picat-lang.org/bprolog/ https://arxiv.org/abs/1103.0812 https://web.archive.org/web/20100227050426/http:/www.probp.com/performance.htm http://www.cs.nmsu.edu/ALP/2010/08/how-to-solve-it-with-b-prolog/ |
| dbo:wikiPageID | 10875123 (xsd:integer) |
| dbo:wikiPageLength | 17949 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1112408185 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Prolog dbr:Answer_set_programming dbr:Constraint_Handling_Rules dbr:Constraint_logic_programming dbr:Transitive_closure dbr:List_comprehension dbc:Prolog_programming_language_family dbr:CHIP_(programming_language) dbr:CLP(FD) dbr:PRISM_system dbr:Second_International_Solvers_Competition |
| dbp:wikiPageUsesTemplate | dbt:Cleanup_bare_URLs dbt:Reflist |
| dcterms:subject | dbc:Prolog_programming_language_family |
| gold:hypernym | dbr:Implementation |
| rdf:type | dbo:Software |
| rdfs:comment | B-Prolog was a high-performance implementation of the standard Prolog language with several extended features including matching clauses, action rules for event handling, finite-domain constraint solving, arrays and hash tables, declarative loops, and tabling. First released in 1994, B-Prolog is now a widely used CLP system. The constraint solver of B-Prolog was ranked top in two categories in the , and it also took the second place in P class in the second ASP solver competition and the second place overall in the third ASP solver competition. B-Prolog underpins the , a logic-based probabilistic reasoning and learning system. B-Prolog is a commercial product, but it can be used for learning and non-profit research purposes free of charge (since version 7.8 for individual users, including (en) |
| rdfs:label | B-Prolog (en) |
| owl:sameAs | freebase:B-Prolog wikidata:B-Prolog https://global.dbpedia.org/id/4UUTW |
| prov:wasDerivedFrom | wikipedia-en:B-Prolog?oldid=1112408185&ns=0 |
| foaf:isPrimaryTopicOf | wikipedia-en:B-Prolog |
| is dbo:wikiPageRedirects of | dbr:BProlog |
| is dbo:wikiPageWikiLink of | dbr:BProlog dbr:Prolog dbr:Probabilistic_programming |
| is foaf:primaryTopic of | wikipedia-en:B-Prolog |