Conditional answers and the role of probabilistic epistemic representations
Conditional utterances can be used in discourse as answers to regular, non-conditional questions in situations of partial knowledge of the answerer. We claim that the probabilities assigned to possible epistemic states of A are a measure of the utility of conditional answers. A second criterion that makes a conditional answer ‘if p, then q’ relevant has to do with the dependency between p and q that is conveyed in the statement. A conditional answer counts as relevant when this dependency leads the question asker to shift from a decision problem about q to an alternative, easier, decision problem about p.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Conditional and Modal Reasoning in Large Language Models
The reasoning abilities of large language models (LLMs) are the topic of a growing body of research in AI and cognitive science. In this paper, we probe the extent to which twenty-nine LLMs are able to distinguish logica…
Logical ReasoningHybridFlow: Quantification of Aleatoric and Epistemic Uncertainty with a Single Hybrid Model
Uncertainty quantification is critical for ensuring robustness in high-stakes machine learning applications. We introduce HybridFlow, a modular hybrid architecture that unifies the modeling of aleatoric and epistemic unc…
Depth EstimationPolynomial-time Updates of Epistemic States in a Fragment of Probabilistic Epistemic Argumentation (Technical Report)
Probabilistic epistemic argumentation allows for reasoning about argumentation problems in a way that is well founded by probability theory. Epistemic states are represented by probability functions over possible worlds …
Predicate-Conditional Conformalized Answer Sets for Knowledge Graph Embeddings
Uncertainty quantification in Knowledge Graph Embedding (KGE) methods is crucial for ensuring the reliability of downstream applications. A recent work applies conformal prediction to KGE methods, providing uncertainty e…
Conformal PredictionGraph EmbeddingKnowledge Graph EmbeddingKnowledge Graph Embeddings+2Data-driven Safe Control of Linear Systems Under Epistemic and Aleatory Uncertainties
Safe control of constrained linear systems under both epistemic and aleatory uncertainties is considered. The aleatory uncertainty characterizes random noises and is modeled by a probability distribution function (PDF) a…