Intensional FOL: Many-Sorted Extension

• URL: http://arxiv.org/abs/2409.04469v1
• Date: Tue, 3 Sep 2024 19:50:57 GMT
• Title: Intensional FOL: Many-Sorted Extension
• Abstract summary: The concepts used in IFOL have associated to them a list of sorted attributes, and the sorts are the intensional concepts as well. The requirement to extend the unsorted IFOL (Intensional FOL) to many-sorted IFOL is mainly based on the fact that a natural language is implicitly many-sorted.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The concepts used in IFOL have associated to them a list of sorted attributes, and the sorts are the intensional concepts as well. The requirement to extend the unsorted IFOL (Intensional FOL) to many-sorted IFOL is mainly based on the fact that a natural language is implicitly many-sorted and that we intend to use IFOL to support applications that use natural languages. Thus, the proposed version of many-sorted IFOL is just the completion of this conceptual feature of the IFOL.

Related papers

• Choosing features for classifying multiword expressions [0.0]
  Multiword expressions (MWEs) are a heterogeneous set with a glaring need for classifications.<n>Not all features are equal in terms of how reliably MWEs can be assigned to classes.
  arXiv  Detail & Related papers  (2026-05-12T08:48:31Z)
• Experiments with Choice in Dependently-Typed Higher-Order Logic [3.072340427031969]
  We extend the DHOL term structure by Hilbert's indefinite choice operator $epsilon$. We define a translation of the choice terms to HOL choice that extends the existing translation from DHOL to HOL. We evaluate the extended translation on a set of dependent HOL problems that require choice.
  arXiv  Detail & Related papers  (2024-10-11T14:49:45Z)
• DIALECTBENCH: A NLP Benchmark for Dialects, Varieties, and Closely-Related Languages [49.38663048447942]
  We propose DIALECTBENCH, the first-ever large-scale benchmark for NLP on varieties. This allows for a comprehensive evaluation of NLP system performance on different language varieties. We provide substantial evidence of performance disparities between standard and non-standard language varieties.
  arXiv  Detail & Related papers  (2024-03-16T20:18:36Z)
• OFA: A Framework of Initializing Unseen Subword Embeddings for Efficient Large-scale Multilingual Continued Pretraining [49.213120730582354]
  Instead of pretraining multilingual language models from scratch, a more efficient method is to adapt existing pretrained language models (PLMs) to new languages via vocabulary extension and continued pretraining. We propose a novel framework: $textbfO$ne $textbfF$or $textbfA$ll, which wisely initializes the embeddings of unseen subwords and thus can adapt a PLM to multiple languages efficiently and effectively.
  arXiv  Detail & Related papers  (2023-11-15T10:40:45Z)
• Ad-hoc polymorphic delimited continuations [4.12935843184402]
  First-class language features in other programming languages can be implemented as libraries with the help of our framework. The core concept in our framework is the type class Dsl, which can be considered as both the ad-hoc polymorphic continuation and a more generic version of Monad.
  arXiv  Detail & Related papers  (2023-07-29T20:46:35Z)
• Fuzzy order-sorted feature logic [2.5672176409865686]
  Order-Sorted Feature (OSF) logic is a knowledge representation and reasoning language based on function-denoting feature symbols and set-denoting sort symbols ordered in a subsumption lattice. We give a flexible definition of a fuzzy subsumption relation which generalizes Zadeh's inclusion between fuzzy sets. We show how to find the greatest lower bound of two OSF terms by unifying them and how to compute the subsumption degree between two OSF terms.
  arXiv  Detail & Related papers  (2023-07-27T07:47:54Z)
• Theorem Proving in Dependently-Typed Higher-Order Logic -- Extended Preprint [0.0]
  Higher-order logic HOL offers a very simple syntax and semantics for representing and reasoning about typed data structures. Dependent type theory offers such a rich type system, but has rather substantial conceptual differences to HOL. We introduce a dependently-typed extension DHOL of HOL that retains the style and conceptual framework of HOL.
  arXiv  Detail & Related papers  (2023-05-24T17:40:54Z)
• DADA: Dialect Adaptation via Dynamic Aggregation of Linguistic Rules [64.93179829965072]
  DADA is a modular approach to imbue SAE-trained models with multi-dialectal robustness. We show that DADA is effective for both single task and instruction fine language models.
  arXiv  Detail & Related papers  (2023-05-22T18:43:31Z)
• Machine-Created Universal Language for Cross-lingual Transfer [73.44138687502294]
  We propose a new Machine-created Universal Language (MUL) as an alternative intermediate language. MUL comprises a set of discrete symbols forming a universal vocabulary and a natural language to MUL translator. MUL unifies shared concepts from various languages into a single universal word, enhancing cross-language transfer.
  arXiv  Detail & Related papers  (2023-05-22T14:41:09Z)
• FOLIO: Natural Language Reasoning with First-Order Logic [147.50480350846726]
  We present FOLIO, a human-annotated, logically complex and diverse dataset for reasoning in natural language (NL) FOLIO consists of 1,430 examples (unique conclusions), each paired with one of 487 sets of premises used to deductively reason for the validity of each conclusion. For both NL reasoning and NL-FOL translation, we benchmark multiple state-of-the-art language models.
  arXiv  Detail & Related papers  (2022-09-02T06:50:11Z)
• OrdinalCLIP: Learning Rank Prompts for Language-Guided Ordinal Regression [94.28253749970534]
  We propose to learn the rank concepts from the rich semantic CLIP latent space. OrdinalCLIP consists of learnable context tokens and learnable rank embeddings. Experimental results show that our paradigm achieves competitive performance in general ordinal regression tasks.
  arXiv  Detail & Related papers  (2022-06-06T03:54:53Z)
• An extended Knowledge Compilation Map for Conditional Preference Statements-based and Generalized Additive Utilities-based Languages [0.0]
  We study the complexity of queries which have not been addressed so far, like equivalence, and transformations. This contributes to a knowledge compilation map for languages based on conditional preference statements.
  arXiv  Detail & Related papers  (2021-02-08T10:19:40Z)
• Modular Networks for Compositional Instruction Following [102.152217117883]
  We propose a modular architecture for following natural language instructions that describe sequences of diverse subgoals. A sequence of modules to execute is chosen by learning to segment the instructions and predicting a subgoal type for each segment. When compared to standard, non-modular sequence-to-sequence approaches on ALFRED, a challenging instruction following benchmark, we find that modularization improves generalization to novel subgoal compositions.
  arXiv  Detail & Related papers  (2020-10-24T03:48:45Z)

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.