Results 111 to 120 of about 2,907 (227)

I-Semantics: Foundational Questions

Studia Semiotyczne, 2019
DOI: http://doi.org/10.26333/sts.xxxi2.05 What is the scope of a semantic theory consistent with the theoretical assumptions adopted by the generative program?
Adriano Marques da Silva
doaj  

A crisis of authority in scientific discourse. [PDF]

Cult Stud Sci Educ, 2021
Nichols MD, Petzold AM.
europepmc   +1 more source

Programming Denotational Semantics [PDF]

The Computer Journal, 1983
openaire   +1 more source

Denotational Semantics for a Probabilistic Timed Shared-Variable Language

, 2012
Complex software systems typically involve features like time, concurrency and probability, where probabilistic computations play an increasing role. It is challenging to formalize languages comprising all these features.
Huibiao Zhu, Jeff W. Sanders, Jifeng He, Shengchao Qin, Zhu, Huibiao, Sanders, Jeff W., Qin, Shengchao; id_orcid, He, Jifeng, Qin, Shengchao   +8 more
core   +1 more source

Logic + probabilistic programming + causal laws. [PDF]

R Soc Open Sci, 2023
Belle V.
europepmc   +1 more source

From Operational to Denotational Semantics

, 1989
In this paper it is shown how operational semantic methods may be naturally extended to encompass many of the concepts of denotational semantics. This work builds on the standard development of an operational semantics as an interpreter and operational ...
Scott Smith
core  

Fully abstract denotational semantics for flat Concurrent Prolog

, 1988
A denotational, hence, compositional semantics for a subset of Concurrent Prolog is developed and related to an operational semantics. The denotational semantics makes divergence and the resultant substitutions of finite computations together with the ...
Gerth, R., Shapiro, E, Gerth, RT Rob, Lichtenstein, Y, Codish, M., Lichtenstein, Yossi, Lichtenstein, Y., Codish, M, Shapiro, E., Gerth, R.T.   +9 more
core   +1 more source

A Denotational Semantics for Logic Programming

, 1985
A fully abstract denotational semantics for logic programming has not been constructed yet. In this paper we present a denotational semantics that is almost fully abstract. We take the meaning of a logic program to be an element in a Plotkin power domain
Frandsen, Gudmund Skovbjerg
core  

The Gauss-Markov adjunction provides categorical semantics of residuals in supervised learning

Discover Artificial Intelligence
Enhancing the intelligibility and interpretability of machine learning is a crucial task in responding to the demand for Explicability as an AI principle, and in promoting the better social implementation of AI.
Moto Kamiura
doaj   +1 more source

Denotational semantics of nets with nondeterminism [PDF]

, 1986
We define a topological framework for streams of traces. With this approach Kahn's method generalizes to nets with bounded nondeterminism. We consider fixpoints of multivalued functions. We have a standard fixed point theorem, which can be used to model feed back loops. These fixed points can also be obtained by iteration.
openaire   +1 more source