A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
A Faithful Semantics for Generalised Symbolic Trajectory Evaluation
2009
Logical Methods in Computer Science
Preserved Fulltext
Other Versions
Generalised Symbolic Trajectory Evaluation (GSTE) is a high-capacity formal verification technique for hardware. ...
The contribution of this paper is a faithful semantics for GSTE. ...
Thanks to Tom Melham, Mary Sheeran, Rachel Tzoref, and the anonymous referees for commenting on earlier drafts of this paper. ...
doi:10.2168/lmcs-5(2:1)2009
fatcat:zxfqftkpwfcmtpymbujplzen6a
The mystery of the missing core in Pauline theology: The case for a multi-dimensional interpretation with reference to J H Roberts and J C Beker
2001
HTS Teologiese Studies/Theological Studies
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The text theory used for this purpose is that of A J Greimas as developed by D Patte and originally elaborated by the author of this article (J A Loubser). ...
This article analyses features concerning the search for a centre for Pauline theology and indicates why such an endeavour is better carried out within the context of multi-dimensional scriptural exegesis ...
In a poetic text one would, for example, expect to find that the narrative semantics dominate. ...
doi:10.4102/hts.v57i1/2.1865
fatcat:bu5nuiy5zbblpew36xipr47ffy
On the computational complexity of dynamic slicing problems for program schemas
2011
Mathematical Structures in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
For both definitions, we compute complexity bounds for the problems of establishing whether a given slice of a linear schema is a dynamic slice and whether a linear schema has a non-trivial dynamic slice ...
All program slicing algorithms take account of the structural properties of a program such as control dependence and data dependence rather than the semantics of its functions and predicates, and thus ...
A trajectory is a path through a program, where each node is represented by a line number and so for path ρ we have thatρ is the corresponding trajectory. ...
doi:10.1017/s0960129511000223
fatcat:o3l7ummglrhrrifvwr3gooowcq
On the computational complexity of dynamic slicing problems for program schemas
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
For both definitions, we compute complexity bounds for the problems of establishing whether a given slice of a linear schema is a dynamic slice and whether a linear schema has a non-trivial dynamic slice ...
All program slicing algorithms take account of the structural properties of a program such as control dependence and data dependence rather than the semantics of its functions and predicates, and thus ...
A trajectory is a path through a program, where each node is represented by a line number and so for path ρ we have thatρ is the corresponding trajectory. ...
arXiv:1705.07686v1
fatcat:ojbkyxzhfzgp3bvkv64xgkvywy
Reactiveness and navigation in computer games: Different needs, different approaches
2011
2011 IEEE Conference on Computational Intelligence and Games (CIG'11)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
o u l , S o u t h K o r e a , A u g u s t 3 1 s t -S e p t e m b e r 3 r d 2 0 1 1 Publisher IEEE Link to online version http://dx. ...
Figure 10 : 10 Generalisation score of the best individual every 50000 evaluations, for all three approaches, averaged across 30 independent runs. ...
Generalisation Issues A difficulty with such a dynamic problem is that of generalisation performance. ...
doi:10.1109/cig.2011.6032017
dblp:conf/cig/PerezNOB11
fatcat:yrunysbxa5g43emliqhchzz4me
Interpretability and Explainability: A Machine Learning Zoo Mini-tour
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The review is intended for a general machine learning audience with interest in exploring the problems of interpretation and explanation beyond logistic regression or random forest variable importance. ...
This work is not an exhaustive literature survey, but rather a primer focusing selectively on certain lines of research which the authors found interesting or informative. ...
Symbolic Regression Symbolic regression is a problem of inferring an analytic form for an unknown function which can only be queried [63, 64] . ...
arXiv:2012.01805v1
fatcat:rges764sdnchtb32fkaa44tsdq
Language as an evolutionary system
2005
Physics of Life Reviews
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
According to this view language codes cultural information and as such forms the basis for the evolution of complexity in human culture. ...
John Maynard Smith and Eörs Szathmáry argued that human language signified the eighth major transition in evolution: human language marked a new form of information transmission from one generation to ...
The level of abstraction we will aim for captures the property that language is mapping from a "characteristic kind of semantic or pragmatic function onto a characteristic kind of symbol sequence" [73 ...
doi:10.1016/j.plrev.2005.06.001
fatcat:4guqu6lmnjh53pkpj5ymmqtwau
An Adequate While-Language for Hybrid Computation
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2019 pre-print arXiv:1902.07684v1 fatcat:pzazlhxx6vcvdnvgqjwu44kccm
Here, we introduce a language for hybrid computation, inspired by the fine-grain call-by-value paradigm, and equip it with a denotational and computationally adequate denotational semantics. ...
The emergent behaviours bear signs of both computational and physical processes, and thus present difficulties not only for analysis, but also for describing them adequately in a structural, well-founded ...
Unlike duration semantics, evolution semantics is not total: for a given p, p, t ⤋ v may not be derivable for any v and t, which yields an empty trajectory for p, i.e. a totally undefined function. ...
arXiv:1902.07684v2
fatcat:t5xkcg5ghzf43fbjwrbdgwlte4
Discretisation and continuity: The emergence of symbols in communication
2021
Cognition
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
In this paper, we investigate the emergence of discrete symbols in regions with a continuous semantics by simulating the learning process of two agents that acquire a shared signalling system. ...
We identify two causes for the emergence of discretisation that do not originate in discrete semantics: 1) premature convergence to sub-optimal signalling conventions and 2) topological mismatch between ...
/emergence-of-symbols, archived at Zenodo with DOI https://doi.org/10.5281/zenodo. 4717800. ...
doi:10.1016/j.cognition.2021.104787
pmid:34303183
pmcid:PMC8381766
fatcat:znkeopdkgvahznwu6seoa7u5ne
Amorphous program slicing
2003
Journal of Systems and Software
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Amorphous slicing removes the limitation to component deletion as the only means of simplification, while retaining the semantic property that a slice preserves the selected behaviour of interest from ...
After this definition, an algorithm for computing amorphous slices, based on the System Dependence Graph, is presented. ...
semantically equivalent to q, written p ≈ (V,i) SP q, iff for all states σ, when the execution of p in σ gives rise to a trajectory T p and the execution of q in σ gives rise to a trajectory T q , then ...
doi:10.1016/s0164-1212(02)00135-8
fatcat:ylgtn56ru5eilc3uxmuxyjvm24
Modeling language acquisition in atypical phenotypes
2003
Psychological review
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
These simulations motivate serious consideration of the theoretical implications of the claim that a developmental disorder fits within the parameter space of a particular computational model of normal ...
The authors examine these issues in depth with respect to a series of new simulations investigating past-tense formation in Williams syndrome. ...
faithful servant to that goal. ...
doi:10.1037/0033-295x.110.4.647
pmid:14599237
fatcat:5p5kiv252rhudg4sf2xqupqfda
Quantum theory as inductive inference
2011
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We present the elements of a new approach to the foundations of quantum theory and probability theory which is based on the algebraic approach to integration, information geometry, and maximum relative ...
The symbol [Dω : Dφ] t denotes Connes' cocycle [25] , which is a non-commutative generalisation of the Radon-Nikodým derivative. The properties of D γ are analysed in [85] . ...
For γ ∈]0, 1[, D γ is both Petz's f-deviation [101] (which is a non-commutative generalisation of the Csiszár-Morimoto deviation) and the non-commutative generalisation of Bregman's deviation (see [ ...
arXiv:1009.2423v4
fatcat:iexok7kmafbpdlagoytvbfqtwm
Risk Structures: Towards Engineering Risk-aware Autonomous Systems
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Inspired by widely-used techniques of causal modelling in risk, failure, and accident analysis, this work discusses a compositional framework for risk modelling. ...
Risk models capture fragments of the space of risky events likely to occur when operating a machine in a given environment. ...
I am deeply grateful to Jim Woodcock and Simon Foster for many inspiring discussions, strongest guidance, particularly on the use of algebraic methods, and for feedback on previous versions of this manuscript ...
arXiv:1904.10386v1
fatcat:xx7og422wvebngcwjzgvsx3dre
Complex Dynamic Systems also Predict Dissociations, but They Do Not Reduce to Autonomous Components
1997
Cognitive Neuropsychology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A simple model with these properties that produces both regularisation errors (PINT named to rhyme with MINT) and semantic errors (BUSH named as TREE) is described. ...
Reported generic behaviours of a complex system, the simulated dissociation of errors, and the established bidirectional nature of perception all demonstrate the utility of a cognitive systems approach ...
with the trajectory of a dynamic system. ...
doi:10.1080/026432997381646
fatcat:u2hdfpv6c5cxhffhibivoa5wka
Index—Volumes 1–89
1997
Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
of control actions 1241
trajectory traversals 1278
transcription phonetic -50
transfer
frames 121
of control mechanisms 234
real-w,orld -478
use
of semantic information in the Q* algorithm
415 ...
238
run-time -1209
symbolic programming 140
knowledge about elementary -140
symbolic reasoning 201,661,915,957
about change 1104
symbolic relationships 1283
symbolic representation 1185, 1254 ...
doi:10.1016/s0004-3702(97)80122-1
fatcat:6az7xycuifaerl7kmv7l3x6rpm
« Previous
Showing results 1 — 15 out of 1,489 results