This HTML5 document contains 36 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/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n6https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
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#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
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/

Statements

Subject Item
dbr:Multi-adjoint_logic_programming
rdf:type
yago:Abstraction100002137 yago:Language106282651 dbo:ArchitecturalStructure yago:ArtificialLanguage106894544 yago:ProgrammingLanguage106898352 yago:Communication100033020 yago:WikicatProgrammingLanguages
rdfs:label
Multi-adjoint logic programming
rdfs:comment
Multi-adjoint logic programming defines syntax and semantics of a logic programming program in such a way that the underlying maths justifying the results are a residuated lattice and/or MV-algebra. The definition of a multi-adjoint logic program is given, as usual in fuzzy logic programming, as a set of weighted rules and facts of a given formal language F. Notice that we are allowed to use different implications in our rules. Definition: A multi-adjoint logic program is a set P of rules of the form <(A ←i B), δ> such that: 1. The rule (A ←i B) is a formula of F; 3. The head A is an atom;
dcterms:subject
dbc:Programming_languages
dbo:wikiPageID
2099529
dbo:wikiPageRevisionID
950033209
dbo:wikiPageWikiLink
dbr:MV-algebra dbr:Truth-value dbr:Atom_(disambiguation) dbr:Disjunctor dbr:Logic_programming dbr:Formal_language dbr:Residuated_lattice dbr:Logical_aggregation dbc:Programming_languages dbr:Fuzzy_logic dbr:Conjunctor
owl:sameAs
n6:4rvk9 yago-res:Multi-adjoint_logic_programming wikidata:Q6934419 freebase:m.06m20w
dbp:wikiPageUsesTemplate
dbt:Compu-stub dbt:Reflist dbt:Short_description
dbo:abstract
Multi-adjoint logic programming defines syntax and semantics of a logic programming program in such a way that the underlying maths justifying the results are a residuated lattice and/or MV-algebra. The definition of a multi-adjoint logic program is given, as usual in fuzzy logic programming, as a set of weighted rules and facts of a given formal language F. Notice that we are allowed to use different implications in our rules. Definition: A multi-adjoint logic program is a set P of rules of the form <(A ←i B), δ> such that: 1. The rule (A ←i B) is a formula of F; 2. The confidence factor δ is an element (a truth-value) of L; 3. The head A is an atom; 4. The body B is a formula built from atoms B1, …, Bn (n ≥ 0) by the use of , , and . 5. Facts are rules with body ┬. 6. A query (or goal) is an atom intended as a question ?A prompting the system.
gold:hypernym
dbr:Lattice
prov:wasDerivedFrom
wikipedia-en:Multi-adjoint_logic_programming?oldid=950033209&ns=0
dbo:wikiPageLength
1971
foaf:isPrimaryTopicOf
wikipedia-en:Multi-adjoint_logic_programming
Subject Item
wikipedia-en:Multi-adjoint_logic_programming
foaf:primaryTopic
dbr:Multi-adjoint_logic_programming