Results 71 to 80 of about 302,191 (279)

IMP with exceptions over decorated logic [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2018
In this paper, we facilitate the reasoning about impure programming languages, by annotating terms with “decorations”that describe what computational (side) effect evaluation of a term may involve.
Burak Ekici
doaj   +1 more source

Illinois-LH: A Denotational and Distributional Approach to Semantics

open access: yesInternational Workshop on Semantic Evaluation, 2014
This paper describes and analyzes our SemEval 2014 Task 1 system. Its features are based on distributional and denotational similarities; word alignment; negation; and hypernym/hyponym, synonym, and antonym relations.
Alice Lai, J. Hockenmaier
semanticscholar   +1 more source

Modeling and Accessing Smart Materials with Integrity Constraints in the Shapes Constraint Language and Ontologies—The SmaDi Way

open access: yesAdvanced Engineering Materials, Volume 27, Issue 8, April 2025.
Integrity constraints enforce consistency and completeness on data. The article discusses a newly developed validator for checking integrity constraints in Shapes Constraint Language (SHACL) through reduction to SPARQL Protocol and RDF Query Language (SPARQL) queries. It can be used with systems for ontology‐based database access.
Özgür L. Özçep   +5 more
wiley   +1 more source

Operational and denotational semantics of prolog

open access: yesThe Journal of Logic Programming, 1987
AbstractA Vienna Definition Language operational semantics of PROLOG, which includes the cut, the database, and the extra-logical operations, is presented. This semantics serves as the basis for deriving a denotational-continuation-style semantics of PROLOG through a systematic transformation of the operational semantics by a method described by Berry.
Bijan Arbab, Daniel M. Berry
openaire   +2 more sources

Adventures in time and space [PDF]

open access: yesLogical Methods in Computer Science, 2007
This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its first-order programs characterize the polynomial-time computable functions, and its
Norman Danner, James S. Royer
doaj   +1 more source

Inductive Definition and Domain Theoretic Properties of Fully Abstract [PDF]

open access: yes, 2007
A construction of fully abstract typed models for PCF and PCF^+ (i.e., PCF + "parallel conditional function"), respectively, is presented. It is based on general notions of sequential computational strategies and wittingly consistent non-deterministic ...
Luke Ong, Vladimir Sazonov
core   +3 more sources

Similarity Assessment of the Engineering Concepts: Decision‐Making Support and Metrics

open access: yesSystems Engineering, EarlyView.
ABSTRACT The new product development (NPD) process is a systematic approach to bring new products and innovations to market. Nowadays, this process is affected by a number of influencing factors associated with the fast‐paced technological changes. One of those factors is the distributed design nature of product development activities: team members are
Yaroslav Menshenin   +3 more
wiley   +1 more source

A Domain-Specific Language for Incremental and Modular Design of Large-Scale Verifiably-Safe Flow Networks (Preliminary Report) [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2011
We define a domain-specific language (DSL) to inductively assemble flow networks from small networks or modules to produce arbitrarily large ones, with interchangeable functionally-equivalent parts.
Azer Bestavros, Assaf Kfoury
doaj   +1 more source

Timed Soft Concurrent Constraint Programs: An Interleaved and a Parallel Approach

open access: yes, 2014
We propose a timed and soft extension of Concurrent Constraint Programming. The time extension is based on the hypothesis of bounded asynchrony: the computation takes a bounded period of time and is measured by a discrete global clock.
Bistarelli, Stefano   +3 more
core   +1 more source

How the Rejection of Incompatible Speech Acts Transforms Human Cognition

open access: yesEuropean Journal of Philosophy, EarlyView.
Abstract Engaging with the literature on transformative conceptions of rationality, I argue for the following position on the way reason transforms human cognition: when the capacity for knowing that one ought to do something is directed at one's own speech acts, an initially domain‐specific and practical grasp of genus/species relations – manifest in ...
Preston Stovall
wiley   +1 more source

Home - About - Disclaimer - Privacy