Hasil untuk "Semantics"

T. Cao, N. Noi

D. Moody

M. Harman, K. Gallagher

H. Kamp

James Gosling, William N. Joy, Guy L. Steele

Nicholas Asher, A. Lascarides

Mats Rooth

L. Lamport

A. Arasu, S. Babu, J. Widom

Dekang Lin

Bootstrapping semantics from text is one of the greatest challenges in natural language learning. We first define a word similarity measure based on the distributional pattern of words. The similarity measure allows us to construct a thesaurus using a parsed corpus. We then present a new evaluation methodology for the automatically constructed thesaurus. The evaluation results show that the thesaurus is significantly closer to WordNet than Roget Thesaurus is.

Yann Munro, Isabelle Bloch, Marie-Jeanne Lesot

Formal argumentation is being used increasingly in artificial intelligence as an effective and understandable way to model potentially conflicting pieces of information, called arguments, and identify so-called acceptable arguments depending on a chosen semantics. This paper deals with the specific context of Quantitative Bipolar Argumentation Frameworks (QBAF), where arguments have intrinsic weights and can attack or support each other. In this context, we introduce a novel family of gradual semantics, called aggregative semantics. In order to deal with situations in which attackers and supporters do not play a symmetric role, and in contrast to modular semantics, we propose to aggregate attackers and supporters separately. This leads to a three-stage computation, which consists in computing a global weight for attackers and another for supporters, before aggregating these two values with the intrinsic weight of the argument. We discuss the properties that the three aggregation functions should satisfy depending on the context, as well as their relationships with the classical principles for gradual semantics. This discussion is supported by various simple examples, as well as a final example on which five hundred aggregative semantics are tested and compared, illustrating the range of possible behaviours with aggregative semantics. Decomposing the computation into three distinct and interpretable steps leads to a more parametrisable computation: it keeps the bipolarity one step further than what is done in the literature, and it leads to more understandable gradual semantics.

D. Kozen

Anvith Pabba, Alex Mathai, Anindya Chakraborty et al.

Large Language Models (LLMs) have shown impressive capabilities in downstream software engineering tasks such as Automated Program Repair (APR). In particular, there has been a lot of research on repository-level issue-resolution benchmarks such as SWE-Bench. Although there has been significant progress on this topic, we notice that in the process of solving such issues, existing agentic systems tend to hyper-localize on immediately suspicious lines of code and fix them in isolation, without a deeper understanding of the issue semantics, code semantics, or execution semantics. Consequently, many existing systems generate patches that overfit to the user issue, even when a more general fix is preferable. To address this limitation, we introduce SemAgent, a novel workflow-based procedure that leverages issue, code, and execution semantics to generate patches that are complete - identifying and fixing all lines relevant to the issue. We achieve this through a novel pipeline that (a) leverages execution semantics to retrieve relevant context, (b) comprehends issue-semantics via generalized abstraction, (c) isolates code-semantics within the context of this abstraction, and (d) leverages this understanding in a two-stage architecture: a repair stage that proposes fine-grained fixes, followed by a reviewer stage that filters relevant fixes based on the inferred issue-semantics. Our evaluations show that our methodology achieves a solve rate of 44.66% on the SWEBench-Lite benchmark beating all other workflow-based approaches, and an absolute improvement of 7.66% compared to our baseline, which lacks such deep semantic understanding. We note that our approach performs particularly well on issues requiring multi-line reasoning (and editing) and edge-case handling, suggesting that incorporating issue and code semantics into APR pipelines can lead to robust and semantically consistent repairs.

Sascha Rechenberger, Thom Frühwirth

Constraint Handling Rules (CHR) is a rule-based programming language which is typically embedded into a general-purpose language. There exists a plethora of implementations of CHR for numerous host languages. However, the existing implementations often reinvent the way to embed CHR, which impedes maintenance and weakens assertions of correctness. To formalize and thereby unify the embedding of CHR into arbitrary host languages, we introduced the framework FreeCHR and proved it to be a valid representation of classical CHR. Until now, this framework only includes a translation of the very abstract operational semantics of CHR which, due to its abstract nature, introduces several practical issues. In this paper, we introduce an execution algorithm for FreeCHR. We derive it from the refined operational semantics of CHR, which resolve the issues introduced by the very abstract semantics. We also prove soundness of the algorithm with respect to the very abstract semantics of FreeCHR. Hereby we provide a unified and an easy to implement guideline for new CHR implementations, as well as an algorithmic definition of the refined operational semantics.

Romel Carrera, Leonidas Quiroz, Cesar Guevara et al.

This study presents a hybrid method for state-of-charge (SOC) estimation of lithium-ion batteries using LSTM neural networks optimized with genetic algorithms (GA), combined with Coulomb Counting (CC) as an initial estimator. Experimental tests were conducted using medium-voltage (48–72 V) lithium-ion battery packs under standardized driving cycles (NEDC and WLTP). The proposed method enhances prediction accuracy under dynamic conditions by recalibrating the LSTM output with CC estimates through a dynamic fusion parameter <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>α</mi></semantics></math></inline-formula>. The novelty of this approach lies in the integration of machine learning and physical modeling, optimized via evolutionary algorithms, to address limitations of standalone methods in real-time applications. The hybrid model achieved a mean absolute error (MAE) of 0.181%, outperforming conventional estimation strategies. These findings contribute to more reliable battery management systems (BMS) for electric vehicles and second-life applications.

Saifallah Ghobber, Hatem Mejjaoli

One of the best known time–frequency tools for examining non-transient signals is the linear canonical windowed transform, which has been used extensively in signal processing and related domains. In this paper, by involving the harmonic analysis for the linear canonical Dunkl transform, we introduce and then study the linear canonical Dunkl windowed transform (LCDWT). Given that localization operators are both theoretically and practically relevant, we will focus in this paper on a number of time–frequency analysis topics for the LCDWT, such as the <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msup><mi>L</mi><mi>p</mi></msup></semantics></math></inline-formula> boundedness and compactness of localization operators for the LCWGT. Then, we study their trace class characterization and show that they are in the Schatten–von Neumann classes. Then, we study their spectral properties in order to give some results on the spectrograms for the LCDWT.

J. M. Spivey

A. A. Shirshikova

This article explores the semantics and usage of prepositions in the English that denote temporal limits of actions. A review of various lexicographical sources, reference literature, and grammars is conducted, highlighting that not all sources provide comprehensive information on the meanings and functioning of prepositions, often offering only general information. Practical material for the study is extracted from the British National Corpus, comprising approximately two thousand contexts. It is established that making a definitive conclusion about including a temporal limit within the timeframe allocated for an action is not always possible. This semantic ambiguity is noted in around 20% of the total number of analyzed contexts. The study demonstrates that to resolve ambiguity and ensure successful communication, addressees often resort to using clarifying elements or complete / partial paraphrasing of the message text. Clarifications are found to be most typical in texts of a scientific research nature, schedules, legal and economic documents. The article concludes on the necessity of further research related to the semantics and usage of prepositions.

Vinícius Barros da Silva, João Peres Vieira, Edson Denis Leonel

The detection of limit cycles of differential equations poses a challenge due to the type of the nonlinear system, the regime of interest, and the broader context of applicable models. Consequently, attempts to solve Hilbert’s sixteenth problem on the maximum number of limit cycles of polynomial differential equations have been uniformly unsuccessful due to failing results and their lack of consistency. Here, the answer to this problem is finally obtained through information geometry, in which the Riemannian metrical structure of the parameter space of differential equations is investigated with the aid of the Fisher information metric and its scalar curvature R. We find that the total number of divergences of <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo>|</mo><mi mathvariant="normal">R</mi><mo>|</mo></mrow></semantics></math></inline-formula> to infinity provides the maximum number of limit cycles of differential equations. Additionally, we demonstrate that real polynomial systems of degree <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>n</mi><mo>≥</mo><mn>2</mn></mrow></semantics></math></inline-formula> have the maximum number of <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>2</mn><mo>(</mo><mi>n</mi><mo>−</mo><mn>1</mn><mo>)</mo><mo>(</mo><mn>4</mn><mo>(</mo><mi>n</mi><mo>−</mo><mn>1</mn><mo>)</mo><mo>−</mo><mn>2</mn><mo>)</mo></mrow></semantics></math></inline-formula> limit cycles. The research findings highlight the effectiveness of geometric methods in analyzing complex systems and offer valuable insights across information theory, applied mathematics, and nonlinear dynamics. These insights may pave the way for advancements in differential equations, presenting exciting opportunities for future developments.

Hua Sun, Yuyan Zhang, Ziliang Jiang et al.

Let <i>s</i>, <i>t</i> be two positive integers and <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi mathvariant="double-struck">k</mi></semantics></math></inline-formula> be an algebraically closed field with char (<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi mathvariant="double-struck">k</mi><mo>)</mo><mo>∤</mo><mi>s</mi><mi>t</mi></mrow></semantics></math></inline-formula>. We show that the Drinfeld double <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>D</mi><mo>(</mo><msubsup><mo>⋀</mo><mrow><mi>s</mi><mi>t</mi><mo>,</mo><mi>t</mi></mrow><mrow><mo>*</mo><mi>c</mi><mi>o</mi><mi>p</mi></mrow></msubsup><mo>)</mo></mrow></semantics></math></inline-formula> of generalized Taft–Hopf algebra <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msubsup><mo>⋀</mo><mrow><mi>s</mi><mi>t</mi><mo>,</mo><mi>t</mi></mrow><mrow><mo>*</mo><mi>c</mi><mi>o</mi><mi>p</mi></mrow></msubsup></semantics></math></inline-formula> has ribbon elements if and only if <i>t</i> is odd. Moreover, if <i>s</i> is even and <i>t</i> is odd, then <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>D</mi><mo>(</mo><msubsup><mo>⋀</mo><mrow><mi>s</mi><mi>t</mi><mo>,</mo><mi>t</mi></mrow><mrow><mo>*</mo><mi>c</mi><mi>o</mi><mi>p</mi></mrow></msubsup><mo>)</mo></mrow></semantics></math></inline-formula> has two ribbon elements, and if both <i>s</i> and <i>t</i> are odd, then <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>D</mi><mo>(</mo><msubsup><mo>⋀</mo><mrow><mi>s</mi><mi>t</mi><mo>,</mo><mi>t</mi></mrow><mrow><mo>*</mo><mi>c</mi><mi>o</mi><mi>p</mi></mrow></msubsup><mo>)</mo></mrow></semantics></math></inline-formula> has only one ribbon element. Finally, we compute explicitly all ribbon elements of <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>D</mi><mo>(</mo><msubsup><mo>⋀</mo><mrow><mi>s</mi><mi>t</mi><mo>,</mo><mi>t</mi></mrow><mrow><mo>*</mo><mi>c</mi><mi>o</mi><mi>p</mi></mrow></msubsup><mo>)</mo></mrow></semantics></math></inline-formula>.