FO(.) (original) (raw)
In computer science, FO(.) (a.k.a. FO-dot) is a knowledge representation language based on first-order logic (FO). It extends FO with types, aggregates (counting, summing, maximising ... over a set), arithmetic, inductive definitions, partial functions, and intensional objects. FO(.) has four types of statements:
Property | Value |
---|---|
dbo:abstract | In computer science, FO(.) (a.k.a. FO-dot) is a knowledge representation language based on first-order logic (FO). It extends FO with types, aggregates (counting, summing, maximising ... over a set), arithmetic, inductive definitions, partial functions, and intensional objects. By itself, a FO(.) knowledge base cannot be run, as it is just a "bag of information", to be used as input to various generic reasoning algorithms. Reasoning engines that use FO(.) include IDP-Z3, IDP and FOLASP. As an example, the IDP system allows generating models, answering set queries, checking entailment between two theories and checking satisfiability, among other types of inference over a FO(.) knowledge base. FO(.) has four types of statements: * Type, function and predicate declarations, * Axioms, i.e., logic sentences about possible worlds, * Definitions that specify a unique interpretation of a defined symbol, given the interpretation of its parameters. Definitions can be inductive. * Enumerations, i.e., definitions of symbols by enumeration. (en) |
dbo:wikiPageExternalLink | https://docs.idp-z3.be/en/latest/FO-dot.html |
dbo:wikiPageID | 69947736 (xsd:integer) |
dbo:wikiPageLength | 4398 (xsd:nonNegativeInteger) |
dbo:wikiPageRevisionID | 1117559742 (xsd:integer) |
dbo:wikiPageWikiLink | dbr:Model_theory dbr:Material_conditional dbr:Negation dbr:Function_(mathematics) dbr:Computer_science dbr:Type_theory dbr:First-order_logic dbr:Entailment dbr:Knowledge_representation_and_reasoning dbc:Knowledge_representation_languages dbr:Axiom dbr:Boolean dbr:Integer dbr:Satisfiability |
dbp:wikiPageUsesTemplate | dbt:COI dbt:External_links dbt:Multiple_issues dbt:Notability dbt:Reflist |
dcterms:subject | dbc:Knowledge_representation_languages |
rdfs:comment | In computer science, FO(.) (a.k.a. FO-dot) is a knowledge representation language based on first-order logic (FO). It extends FO with types, aggregates (counting, summing, maximising ... over a set), arithmetic, inductive definitions, partial functions, and intensional objects. FO(.) has four types of statements: (en) |
rdfs:label | FO(.) (en) |
owl:sameAs | wikidata:FO(.) https://global.dbpedia.org/id/GDfaX |
prov:wasDerivedFrom | wikipedia-en:FO(.)?oldid=1117559742&ns=0 |
foaf:isPrimaryTopicOf | wikipedia-en:FO(.) |
is dbo:wikiPageRedirects of | dbr:FO-dot |
is dbo:wikiPageWikiLink of | dbr:FO-dot dbr:First-order_logic dbr:Knowledge_representation_and_reasoning |
is foaf:primaryTopic of | wikipedia-en:FO(.) |