This HTML5 document contains 37 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n17https://web.archive.org/web/20100227050426/http:/www.probp.com/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n13https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n19https://arxiv.org/abs/
owlhttp://www.w3.org/2002/07/owl#
n21http://www.picat-lang.org/bprolog/
wikipedia-enhttp://en.wikipedia.org/wiki/
n5http://logtalk.org/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/
n14http://www.cs.nmsu.edu/ALP/2010/08/how-to-solve-it-with-b-prolog/

Statements

Subject Item
dbr:BProlog
dbo:wikiPageWikiLink
dbr:B-Prolog
dbo:wikiPageRedirects
dbr:B-Prolog
Subject Item
dbr:Prolog
dbo:wikiPageWikiLink
dbr:B-Prolog
Subject Item
dbr:Probabilistic_programming
dbo:wikiPageWikiLink
dbr:B-Prolog
Subject Item
dbr:B-Prolog
rdf:type
dbo:Software
rdfs:label
B-Prolog
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
dcterms:subject
dbc:Prolog_programming_language_family
dbo:wikiPageID
10875123
dbo:wikiPageRevisionID
1112408185
dbo:wikiPageWikiLink
dbc:Prolog_programming_language_family dbr:Second_International_Solvers_Competition dbr:Constraint_logic_programming dbr:Constraint_Handling_Rules dbr:Prolog dbr:Transitive_closure dbr:CHIP_(programming_language) dbr:List_comprehension dbr:CLP(FD) dbr:Answer_set_programming dbr:PRISM_system
dbo:wikiPageExternalLink
n5:performance.html n14: n17:performance.htm n19:1103.0812 n21:
owl:sameAs
n13:4UUTW freebase:m.02qsr_t wikidata:Q4833686
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Cleanup_bare_URLs
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.
gold:hypernym
dbr:Implementation
prov:wasDerivedFrom
wikipedia-en:B-Prolog?oldid=1112408185&ns=0
dbo:wikiPageLength
17949
foaf:isPrimaryTopicOf
wikipedia-en:B-Prolog
Subject Item
wikipedia-en:B-Prolog
foaf:primaryTopic
dbr:B-Prolog