Results 31 to 40 of about 6,875,268 (299)
Interval-based Synthesis [PDF]
We introduce the synthesis problem for Halpern and Shoham's modal logic of intervals extended with an equivalence relation over time points, abbreviated HSeq.
Angelo Montanari, Pietro Sala
doaj +1 more source
Specification Structures and propositions-as-types for concurrency
Many different notions of “property of interest” and methods of verifying such properties arise naturally in programming. A general framework of “Specification Structures” is presented for combining different notions and methods in a coherent fashion. This is then applied to concurrency in the setting of Interaction Categories.
Samson Abramsky +2 more
openaire +3 more sources
Forms of Representation of Propositional Argument in Bulgarian, Polish and Russian Expressions Based on the Mental Predicate This article offers a discussion of Bulgarian, Polish and Russian mental verbs from the perspective of syntactic valence.
Aleksander Kiklewicz
doaj +1 more source
Structural completeness in propositional logics of dependence [PDF]
In this paper we prove that three of the main propositional logics of dependence (including propositional dependence logic and inquisitive logic), none of which is structural, are structurally complete with respect to a class of substitutions under which the logics are closed.
Rosalie Iemhoff, Fan Yang 0004
openaire +5 more sources
Over the past 50 years, the science of pediatric rheumatology has grown exponentially due to an expansion in the understanding of complex rheumatic conditions and a surge in novel targeted therapeutics. Physician‐scientists in the field of pediatric rheumatology have played major roles in these advancements that have improved the care of children ...
Ekemini A. Ogbu +2 more
wiley +1 more source
Strong Equivalence of Qualitative Optimization Problems [PDF]
We introduce the framework of qualitative optimization problems (or, simply, optimization problems) to represent preference theories. The formalism uses separate modules to describe the space of outcomes to be compared (the generator) and the preferences
Truszczyński, Miroslaw +2 more
core +3 more sources
A proof-theoretic analysis of the classical propositional matrix method [PDF]
The matrix method, due to Bibel and Andrews, is a proof procedure designed for automated theorem-proving. We show that underlying this method is a fully structured combinatorial model of conventional classical proof theory.
Ritter, E +5 more
core +1 more source
dynoGP: Deep Gaussian Processes for Dynamic System Identification
This work introduces a novel class of deep models for system identification, dynamical deep Gaussian processes, which combine the strengths of data‐driven methods, such as those based on neural network architectures, with the ability to output a probability distribution for uncertainty representation.
Alessio Benavoli +3 more
wiley +1 more source
Traditionally, ontology engineering is based on the presumption that the meaning of a proposition results from the combination of the meaning of its elements (concepts) and its syntactical structure.
Stefan Heßbrüggen-Walter
doaj +1 more source
This perspective reframes additive manufacturing for electrical machines as a qualification‐limited materials and architecture design problem. It links process–structure–property–performance relationships to magnetic, conducting, dielectric, and thermal property windows, highlighting where AM can enable segmented magnetic circuits, permanent magnet ...
Dénes Fodor, Loránd Szabó
wiley +1 more source

