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

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

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n14https://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#
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#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Preferential_entailment
rdfs:label
Preferential entailment
rdfs:comment
Preferential entailment is a non-monotonic logic based on selecting only models that are considered the most plausible. The plausibility of models is expressed by an ordering among models called a preference relation, hence the name preference entailment. Formally, given a propositional formula and an ordering over propositional models , preferential entailment selects only the models of that are minimal according to . This selection leads to a non-monotonic inference relation: holds if and only if all minimal models of according to are also models of .
dct:subject
dbc:Non-classical_logic dbc:Logic_in_computer_science dbc:Knowledge_representation
dbo:wikiPageID
3011353
dbo:wikiPageRevisionID
1122837244
dbo:wikiPageWikiLink
dbr:Model_(logic) dbr:Entailment dbc:Knowledge_representation dbr:Propositional_formula dbr:Circumscription_(logic) dbc:Logic_in_computer_science dbr:Non-monotonic_logic dbc:Non-classical_logic
owl:sameAs
wikidata:Q7239830 freebase:m.08kfsg n14:4tg8V
dbp:wikiPageUsesTemplate
dbt:Annotated_link dbt:Reflist
dbo:abstract
Preferential entailment is a non-monotonic logic based on selecting only models that are considered the most plausible. The plausibility of models is expressed by an ordering among models called a preference relation, hence the name preference entailment. Formally, given a propositional formula and an ordering over propositional models , preferential entailment selects only the models of that are minimal according to . This selection leads to a non-monotonic inference relation: holds if and only if all minimal models of according to are also models of . Circumscription can be seen as the particular case of preferential entailment when the ordering is based on containment of the sets of variables assigned to true (in the propositional case) or containment of the extensions of predicates (in the first-order logic case).
prov:wasDerivedFrom
wikipedia-en:Preferential_entailment?oldid=1122837244&ns=0
dbo:wikiPageLength
1543
foaf:isPrimaryTopicOf
wikipedia-en:Preferential_entailment