Inferences and Modal Vocabulary

• URL: http://arxiv.org/abs/2007.02487v1
• Date: Mon, 6 Jul 2020 01:04:06 GMT
• Title: Inferences and Modal Vocabulary
• Authors: Florian Richter
• Abstract summary: There are different types of inferences that are not monotonic, e.g. abductive inferences. Material inferences express good inferences based on the principle of material incompatibility. I propose a modal interpretation of implications to express conceptual relations.
• Score: 8.475081627511166
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Deduction is the one of the major forms of inferences and commonly used in formal logic. This kind of inference has the feature of monotonicity, which can be problematic. There are different types of inferences that are not monotonic, e.g. abductive inferences. The debate between advocates and critics of abduction as a useful instrument can be reconstructed along the issue, how an abductive inference warrants to pick out one hypothesis as the best one. But how can the goodness of an inference be assessed? Material inferences express good inferences based on the principle of material incompatibility. Material inferences are based on modal vocabulary, which enriches the logical expressivity of the inferential relations. This leads also to certain limits in the application of labeling in machine learning. I propose a modal interpretation of implications to express conceptual relations.

Related papers

• A Complexity-Based Theory of Compositionality [53.025566128892066]
  In AI, compositional representations can enable a powerful form of out-of-distribution generalization. Here, we propose a formal definition of compositionality that accounts for and extends our intuitions about compositionality. The definition is conceptually simple, quantitative, grounded in algorithmic information theory, and applicable to any representation.
  arXiv  Detail & Related papers  (2024-10-18T18:37:27Z)
• When Is Inductive Inference Possible? [3.4991031406102238]
  We provide a tight characterization of inductive inference by establishing a novel link to online learning theory. We prove that inductive inference is possible if and only if the hypothesis class is a countable union of online learnable classes. Our main technical tool is a novel non-uniform online learning framework, which may be of independent interest.
  arXiv  Detail & Related papers  (2023-11-30T20:02:25Z)
• Contrastive Learning for Inference in Dialogue [56.20733835058695]
  Inference, especially those derived from inductive processes, is a crucial component in our conversation. Recent large language models show remarkable advances in inference tasks. But their performance in inductive reasoning, where not all information is present in the context, is far behind deductive reasoning.
  arXiv  Detail & Related papers  (2023-10-19T04:49:36Z)
• Phenomenal Yet Puzzling: Testing Inductive Reasoning Capabilities of Language Models with Hypothesis Refinement [92.61557711360652]
  Language models (LMs) often fall short on inductive reasoning, despite achieving impressive success on research benchmarks. We conduct a systematic study of the inductive reasoning capabilities of LMs through iterative hypothesis refinement. We reveal several discrepancies between the inductive reasoning processes of LMs and humans, shedding light on both the potentials and limitations of using LMs in inductive reasoning tasks.
  arXiv  Detail & Related papers  (2023-10-12T17:51:10Z)
• Abductive Commonsense Reasoning Exploiting Mutually Exclusive Explanations [118.0818807474809]
  Abductive reasoning aims to find plausible explanations for an event. Existing approaches for abductive reasoning in natural language processing often rely on manually generated annotations for supervision. This work proposes an approach for abductive commonsense reasoning that exploits the fact that only a subset of explanations is correct for a given context.
  arXiv  Detail & Related papers  (2023-05-24T01:35:10Z)
• An Embedding-based Approach to Inconsistency-tolerant Reasoning with Inconsistent Ontologies [12.760301272393898]
  We propose a novel approach to reasoning with inconsistent semantics based on the embeddings of axioms. We show that our embedding-based method can outperform existing inconsistency-tolerant reasoning methods based on maximal consistent subsets.
  arXiv  Detail & Related papers  (2023-04-04T09:38:02Z)
• Certain and Uncertain Inference with Indicative Conditionals [0.3437656066916039]
  We develop a trivalent semantics for the truth conditions and the probability of the natural language conditional. We show systematic correspondences between trivalent and probabilistic representations of inferences in either framework. The result is a unified account of the semantics and indicative of conditionals that can be fruitfully applied to analyzing the validity of conditional inferences.
  arXiv  Detail & Related papers  (2022-07-17T20:06:00Z)
• Observing Interventions: A logic for thinking about experiments [62.997667081978825]
  This paper makes a first step towards a logic of learning from experiments. Crucial for our approach is the idea that the notion of an intervention can be used as a formal expression of a (real or hypothetical) experiment. For all the proposed logical systems, we provide a sound and complete axiomatization.
  arXiv  Detail & Related papers  (2021-11-25T09:26:45Z)
• Logic, Language, and Calculus [8.475081627511166]
  The difference between object-language and metalanguage is crucial for logical analysis, but has yet not been examined for the field of computer science. It is argued that inferential relations in a metalanguage (like a calculus for propositional logic) cannot represent conceptual relations of natural language.
  arXiv  Detail & Related papers  (2020-07-06T00:52:54Z)
• Pairwise Supervision Can Provably Elicit a Decision Boundary [84.58020117487898]
  Similarity learning is a problem to elicit useful representations by predicting the relationship between a pair of patterns. We show that similarity learning is capable of solving binary classification by directly eliciting a decision boundary.
  arXiv  Detail & Related papers  (2020-06-11T05:35:16Z)
• A Unified Scientific Basis for Inference [0.0]
  It is shown that a natural extension of this discussion gives a conceptual basis from which essential parts of the formalism of quantum mechanics can be derived. The questions around Bell's inequality are approached by using the conditionality principle for each observer.
  arXiv  Detail & Related papers  (2012-06-22T07:34:08Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.