Results 51 to 60 of about 11,768 (185)
Probabilistic modal {\mu}-calculus with independent product [PDF]
Logical Methods in Computer Science, 2012 The probabilistic modal {\mu}-calculus is a fixed-point logic designed for expressing properties of probabilistic labeled transition systems (PLTS's). Two equivalent semantics have been studied for this logic, both assigning to each state a value in the ...
Matteo Mio
doaj +1 more source
What are particularistic pejoratives?
Mind &Language, EarlyView.Particularistic pejoratives (PPs) mock individuals based on their personal attributes yet lack a precise definition. This paper seeks to refine our understanding of PPs by examining their derogatory profiles across three dimensions: descriptiveness, intensity, and slurring potential.
Víctor Carranza‐Pinedo
wiley +1 more source
The Measurement Calculus [PDF]
, 2007 Measurement-based quantum computation has emerged from the physics community as a new approach to quantum computation where the notion of measurement is the main driving force of computation.
Abramsky S. +21 more
core +3 more sources
A Domain-Specific Language for Incremental and Modular Design of Large-Scale Verifiably-Safe Flow Networks (Preliminary Report) [PDF]
Electronic 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
Philosophical Perspectives, EarlyView.ABSTRACT Joint inquiry requires agents to exchange public content about some target domain, which in turn requires them to track which content a linguistic form contributes to a conversation. But, often, the inquiry delivers a necessary truth. For example, if we are inquiring whether a particular bird, Tweety, is a woodpecker, and discover that it is ...
Una Stojnić, Matthew Stone
wiley +1 more source
Timed Soft Concurrent Constraint Programs: An Interleaved and a Parallel Approach
, 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
The Gradability of ‘Conscious’
Philosophy and Phenomenological Research, EarlyView.ABSTRACT Are some creatures “more conscious” than others? A number of consciousness researchers have aimed to answer this question. Yet some have claimed that this question does not even make sense. They claim that “conscious” (in the phenomenal sense) never occurs as a gradable adjective, meaning an adjective that permits degree expressions (“more f ...
Andrew Y. Lee, Poppy Mankowitz
wiley +1 more source
An Adequate While-Language for Hybrid Computation
, 2019 Hybrid computation combines discrete and continuous dynamics in the form of an entangled mixture inherently present both in various natural phenomena, and in applications ranging from control theory to microbiology.
Goncharov, Sergey, Neves, Renato
core +1 more source
Verification of Control System Runtime Using an Executable Semantic Model
AlgorithmsThe paper outlines a methodology for validating the accuracy of a control system’s runtime implementation. The runtime takes the form of a virtual machine executing portable code compliant with IEC 61131-3 standards.
Jan Sadolewski, Bartosz Trybus
doaj +1 more source
QRB-Domains and the Probabilistic Powerdomain [PDF]
Logical Methods in Computer Science, 2012 Is there any Cartesian-closed category of continuous domains that would be closed under Jones and Plotkin's probabilistic powerdomain construction? This is a major open problem in the area of denotational semantics of probabilistic higher-order languages.
Jean Goubault-Larrecq
doaj +1 more source