Conference item icon

Conference item

Complexity Results for Default Reasoning from Conditional Knowledge Bases

Abstract:

Conditional knowledge bases have been proposed as belief bases that include defeasible rules (also called defaults) of the form \"phi->psi\", which informally read as \"generally, if phi then psi\". Such rules may have exceptions, which can be handled in different ways. A number of entailment semantics for conditional knowledge bases have been proposed in the literature. However, while the semantic properties and interrelationships of these formalisms are quit...

Expand abstract

Actions


Authors


Thomas Eiter More by this author
Thomas Lukasiewicz More by this author
Publisher:
Morgan Kaufmann
Publication date:
2000
URN:
uuid:9b2d0be7-aa94-4fd5-a12f-bb6064aa23bc
Local pid:
cs:6739

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP