English
Related papers

Related papers: Properties of Stable Model Semantics Extensions

200 papers

We endow prioritised default logic (PDL) with argumentation semantics using the ASPIC+ framework for structured argumentation, and prove that the conclusions of the justified arguments are exactly the prioritised default extensions.…

Artificial Intelligence · Computer Science 2015-07-02 Anthony P. Young , Sanjay Modgil , Odinaldo Rodrigues

Conceptual models as representations of real-world systems are based on diverse techniques in various disciplines but lack a framework that provides multidisciplinary ontological understanding of real-world phenomena. Concurrently, systems…

Software Engineering · Computer Science 2023-06-27 Sabah Al-Fedaghi

After a few decades of development, computational argumentation has become one of the active realms in AI. This paper considers extension-based concrete and abstract semantics of argumentation. For concrete ones, based on Grossi and…

Artificial Intelligence · Computer Science 2021-05-21 Lixing Tan , Zhaohui Zhu , Jinjin Zhang

Over the last decades the development of ASP has brought about an expressive modeling language powered by highly performant systems. At the same time, it gets more and more difficult to provide semantic underpinnings capturing the resulting…

Artificial Intelligence · Computer Science 2021-08-09 Pedro Cabalar , Jorge Fandinno , Torsten Schaub , Philipp Wanko

Epistemic logic programs constitute an extension of the stable models semantics to deal with new constructs called subjective literals. Informally speaking, a subjective literal allows checking whether some regular literal is true in all…

Artificial Intelligence · Computer Science 2021-07-01 Pedro Cabalar , Jorge Fandinno , Luis Fariñas del Cerro

Discrete-time models of non-uniformly sampled nonlinear systems under zero-order hold relate the next state sample to the current state sample, (constant) input value, and sampling interval. The exact discrete-time model, that is, the…

Systems and Control · Computer Science 2018-07-30 Alexis J. Vallarella , Hernan Haimovich

We study the status of preservation theorems such as the {\L}o\'s-Tarski theorem and the homomorphism preservation theorem in the context of semiring semantics. Semiring semantics has its origins in the provenance analysis of database…

Logic in Computer Science · Computer Science 2026-05-12 Sophie Brinke , Anuj Dawar , Erich Grädel , Benedikt Pago

A major difficulty in developing and maintaining very large knowledge bases originates from the variety of forms in which knowledge is made available to the KB builder. The objective of this research is to bring together two complementary…

Artificial Intelligence · Computer Science 2013-04-05 John Yen , Piero P. Bonissone

We consider abstract evolution equations with on-off time delay feedback. Without the time delay term, the model is described by an exponentially stable semigroup. We show that, under appropriate conditions involving the delay term, the…

Analysis of PDEs · Mathematics 2017-02-12 Cristina Pignotti

Good frames were suggested in [Sh:h] as the (bare-bones) parallel, in the context of AECs, to superstable (among elementary classes). Here we consider $(\mu,\lambda,\kappa)$-frames as candidates for being (in the context of AECs) the…

Logic · Mathematics 2023-05-04 Saharon Shelah

We consider the question of when sets definable in first-order expansions of groups contain the product of two infinite sets (we refer to this as the "productset property"). We first show that the productset property holds for any definable…

Logic · Mathematics 2023-11-03 Uri Andrews , Gabriel Conant , Isaac Goldbring

State-space models (SSMs) are a highly expressive model class for learning patterns in time series data and for system identification. Deterministic versions of SSMs (e.g. LSTMs) proved extremely successful in modeling complex time series…

The nonstandard approach to program semantics has successfully resolved the completeness problem of Floyd-Hoare logic. The known versions of nonstandard semantics, the Hungary semantics and axiomatic semantics, are so general that they are…

Logic in Computer Science · Computer Science 2017-03-02 Zhaowei Xu , Yuefei Sui , Wenhui Zhang

Large Language Models (LLMs) play a crucial role in capturing structured semantics to enhance language understanding, improve interpretability, and reduce bias. Nevertheless, an ongoing controversy exists over the extent to which LLMs can…

Computation and Language · Computer Science 2024-05-13 Ning Cheng , Zhaohui Yan , Ziming Wang , Zhijie Li , Jiaming Yu , Zilong Zheng , Kewei Tu , Jinan Xu , Wenjuan Han

A useful sampling-reconstruction model should be stable with respect to different kind of small perturbations, regardless whether they result from jitter, measurement errors, or simply from a small change in the model assumptions. In this…

General Mathematics · Mathematics 2007-05-31 E. costa-Reyes , A. Aldroubi , I. Krishtal

This paper proposes an analysis of asymptotically mean stationary (AMS) communication channels. A hierarchy based on stability properties (stationarity, quasi-stationarity, recurrence and asymptotically mean stationarity) of channels is…

Information Theory · Computer Science 2014-03-27 Francois Simon

While language progresses through a sequence of semantic states, the underlying dynamics of this progression remain elusive. Here, we treat the semantic progression of written text as a stochastic trajectory in a high-dimensional state…

Computation and Language · Computer Science 2026-01-30 Debayan Dasgupta

Recently, semantic communication (SC) has garnered increasing attention for its efficiency, yet it remains vulnerable to semantic jamming attacks. These attacks entail introducing crafted perturbation signals to legitimate signals over the…

Signal Processing · Electrical Eng. & Systems 2025-01-03 Kequan Zhou , Guangyi Zhang , Yunlong Cai , Qiyu Hu , Guanding Yu

We investigate language interpretations of two extensions of the Lambek calculus: with additive conjunction and disjunction and with additive conjunction and the unit constant. For extensions with additive connectives, we show that…

Logic · Mathematics 2020-08-04 Max Kanovich , Stepan Kuznetsov , Andre Scedrov

We systematically study several versions of the disjunction and the existence properties in modal arithmetic. First, we newly introduce three classes $\mathrm{B}$, $\Delta(\mathrm{B})$, and $\Sigma(\mathrm{B})$ of formulas of modal…

Logic · Mathematics 2022-12-20 Taishi Kurahashi , Motoki Okuda