Operator-based semantics for choice programs: is choosing losing? (full version)

• URL: http://arxiv.org/abs/2407.21556v1
• Date: Wed, 31 Jul 2024 12:25:57 GMT
• Title: Operator-based semantics for choice programs: is choosing losing? (full version)
• Authors: Jesse Heyninck,
• Abstract summary: Only two-valued semantics have been studied so far. An operator-based framework allows for the definition and comparison of different semantics in a principled way.
• Score: 6.983702226751596
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Choice constructs are an important part of the language of logic programming, yet the study of their semantics has been a challenging task. So far, only two-valued semantics have been studied, and the different proposals for such semantics have not been compared in a principled way. In this paper, an operator-based framework allow for the definition and comparison of different semantics in a principled way is proposed.

Related papers

• Description Logics Go Second-Order -- Extending EL with Universally Quantified Concepts [0.0]
  We focus on the extension of description logic $mathcalEL$. We show that for a useful fragment of the extension, the conclusions entailed by the different semantics coincide. For a slightly smaller, but still useful, fragment, we were also able to show decidability of the extension.
  arXiv  Detail & Related papers  (2023-08-16T09:37:38Z)
• Agentivit\`a e telicit\`a in GilBERTo: implicazioni cognitive [77.71680953280436]
  The goal of this study is to investigate whether a Transformer-based neural language model infers lexical semantics. The semantic properties considered are telicity (also combined with definiteness) and agentivity.
  arXiv  Detail & Related papers  (2023-07-06T10:52:22Z)
• Disentangling Learnable and Memorizable Data via Contrastive Learning for Semantic Communications [81.10703519117465]
  A novel machine reasoning framework is proposed to disentangle source data so as to make it semantic-ready. In particular, a novel contrastive learning framework is proposed, whereby instance and cluster discrimination are performed on the data. Deep semantic clusters of highest confidence are considered learnable, semantic-rich data. Our simulation results showcase the superiority of our contrastive learning approach in terms of semantic impact and minimalism.
  arXiv  Detail & Related papers  (2022-12-18T12:00:12Z)
• Distance Based Image Classification: A solution to generative classification's conundrum? [70.43638559782597]
  We argue that discriminative boundaries are counter-intuitive as they define semantics by what-they-are-not. We propose a new generative model in which semantic factors are accommodated by shell theory's hierarchical generative process. We use the model to develop a classification scheme which suppresses the impact of noise while preserving semantic cues.
  arXiv  Detail & Related papers  (2022-10-04T03:35:13Z)
• The Inverse Problem for Argumentation Gradual Semantics [8.860629791560198]
  A sub-class of such semantics, the so-called weighted semantics, takes an initial set of weights over the arguments as input. We consider the inverse problem over such weighted semantics. That is, given an argumentation framework and a desired argument ranking, we ask whether there exist initial weights such that a particular semantics produces the given ranking.
  arXiv  Detail & Related papers  (2022-02-01T09:46:23Z)
• An MRC Framework for Semantic Role Labeling [21.140775452024894]
  We propose to use the machine reading comprehension framework to bridge the gap between predicate disambiguation and argument labeling. We leverage both the predicate semantics and the semantic role semantics for argument labeling. Experiments show that the proposed framework achieves state-of-the-art results on both span and dependency benchmarks.
  arXiv  Detail & Related papers  (2021-09-14T13:04:08Z)
• Lexicographic Logic: a Many-valued Logic for Preference Representation [1.5484595752241122]
  We propose lexicographic logic, an extension of classical propositional logic that can express a variety of preferences. We argue that the new logic is an effective formalism for ranking query results according to the satisfaction level of user preferences.
  arXiv  Detail & Related papers  (2020-12-20T14:42:04Z)
• Infusing Finetuning with Semantic Dependencies [62.37697048781823]
  We show that, unlike syntax, semantics is not brought to the surface by today's pretrained models. We then use convolutional graph encoders to explicitly incorporate semantic parses into task-specific finetuning.
  arXiv  Detail & Related papers  (2020-12-10T01:27:24Z)
• Smart Choices and the Selection Monad [0.0]
  Describing systems in terms of choices and their resulting costs and rewards offers the promise of freeing algorithm designers and programmers from specifying how those choices should be made. We define two small languages that support decision-making abstractions: one with choices and rewards, and the other additionally with probabilities.
  arXiv  Detail & Related papers  (2020-07-17T12:13:16Z)
• Semantics-Aware Inferential Network for Natural Language Understanding [79.70497178043368]
  We propose a Semantics-Aware Inferential Network (SAIN) to meet such a motivation. Taking explicit contextualized semantics as a complementary input, the inferential module of SAIN enables a series of reasoning steps over semantic clues. Our model achieves significant improvement on 11 tasks including machine reading comprehension and natural language inference.
  arXiv  Detail & Related papers  (2020-04-28T07:24:43Z)
• Human Correspondence Consensus for 3D Object Semantic Understanding [56.34297279246823]
  In this paper, we introduce a new dataset named CorresPondenceNet. Based on this dataset, we are able to learn dense semantic embeddings with a novel geodesic consistency loss. We show that CorresPondenceNet could not only boost fine-grained understanding of heterogeneous objects but also cross-object registration and partial object matching.
  arXiv  Detail & Related papers  (2019-12-29T04:24:22Z)

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.