dc.contributor.author |
Booth, R
|
|
dc.contributor.author |
Casini, G
|
|
dc.contributor.author |
Meyer, T
|
|
dc.contributor.author |
Varzinczak, I
|
|
dc.date.accessioned |
2016-02-23T08:56:44Z |
|
dc.date.available |
2016-02-23T08:56:44Z |
|
dc.date.issued |
2015-03 |
|
dc.identifier.citation |
Booth, R, Casini, G, Meyer, T and Varzinczak, I. 2015. What does entailment for PTL mean? In: Twelfth International Symposium on Logical Formalization on Commonsense Reasoning (Commonsense-2015,) Stanford University, 23-25 March 2015 |
en_US |
dc.identifier.uri |
http://hdl.handle.net/10204/8399
|
|
dc.description |
Twelfth International Symposium on Logical Formalization on Commonsense Reasoning (Commonsense-2015,) Stanford University, 23-25 March 2015. Due to copyright restrictions, the attached PDF file only contains the abstract of the full text item. For access to the full text item, please consult the publisher's website |
en_US |
dc.description.abstract |
We continue recent investigations into the problem of reasoning about typicality. We do so in the framework of Propositional Typicality Logic (PTL), which is obtained by enriching classical propositional logic with a typicality operator and characterized by a preferential semantics a la KLM. In this paper we study different notions of entailment for PTL. We take as a starting point the notion of Rational Closure defined for KLM-style conditionals. We show that the additional expressivity of PTL results in different versions of Rational Closure for PTL — versions that are equivalent with respect to the conditional language originally proposed by KLM. |
en_US |
dc.language.iso |
en |
en_US |
dc.publisher |
Commonsense Reasoning |
en_US |
dc.relation.ispartofseries |
Workflow;15633 |
|
dc.subject |
Propositional Typicality Logic |
en_US |
dc.subject |
PTL |
en_US |
dc.subject |
Artificial Intelligence |
en_US |
dc.title |
What does entailment for PTL mean? |
en_US |
dc.type |
Conference Presentation |
en_US |
dc.identifier.apacitation |
Booth, R., Casini, G., Meyer, T., & Varzinczak, I. (2015). What does entailment for PTL mean?. Commonsense Reasoning. http://hdl.handle.net/10204/8399 |
en_ZA |
dc.identifier.chicagocitation |
Booth, R, G Casini, T Meyer, and I Varzinczak. "What does entailment for PTL mean?." (2015): http://hdl.handle.net/10204/8399 |
en_ZA |
dc.identifier.vancouvercitation |
Booth R, Casini G, Meyer T, Varzinczak I, What does entailment for PTL mean?; Commonsense Reasoning; 2015. http://hdl.handle.net/10204/8399 . |
en_ZA |
dc.identifier.ris |
TY - Conference Presentation
AU - Booth, R
AU - Casini, G
AU - Meyer, T
AU - Varzinczak, I
AB - We continue recent investigations into the problem of reasoning about typicality. We do so in the framework of Propositional Typicality Logic (PTL), which is obtained by enriching classical propositional logic with a typicality operator and characterized by a preferential semantics a la KLM. In this paper we study different notions of entailment for PTL. We take as a starting point the notion of Rational Closure defined for KLM-style conditionals. We show that the additional expressivity of PTL results in different versions of Rational Closure for PTL — versions that are equivalent with respect to the conditional language originally proposed by KLM.
DA - 2015-03
DB - ResearchSpace
DP - CSIR
KW - Propositional Typicality Logic
KW - PTL
KW - Artificial Intelligence
LK - https://researchspace.csir.co.za
PY - 2015
T1 - What does entailment for PTL mean?
TI - What does entailment for PTL mean?
UR - http://hdl.handle.net/10204/8399
ER -
|
en_ZA |