Filters








82,305 Hits in 2.6 sec

Semantics of interference control

R.D. Tennent
1983 Theoretical Computer Science  
Interference is even less evident if a procedure can update a non-local variable, for then tht: procedure name may be a 'higher-order' alias for that variable.  ...  An approach to syntactic control of interference shown to be sound using a denotational semantic model. desk bed by Reynolds (1978, is Introduction Two program phrases ittterfere if executing (or evaluating  ...  error where a = PUPjfts :TUY(P)jus = u ?P+_Txln Ns), error where a = g[PIjtts - Table 3 . 3 Non-standard semantics.  ... 
doi:10.1016/0304-3975(82)90123-2 fatcat:c527alrghfd7hdlrcd3smvt4yu

A non-standard semantics for program slicing and dependence analysis

Sebastian Danicic, Mark Harman, John Howroyd, Lahcen Ouarbya
2007 The Journal of Logic and Algebraic Programming  
We introduce a new non-strict semantics for a simple while language.  ...  We demonstrate that this semantics allows us to give a denotational definition of variable dependence and neededness, which is consistent with program slicing.  ...  They introduce a non-standard semantics, called transfinite semantics using a metric structure on their value domains.  ... 
doi:10.1016/j.jlap.2007.02.010 fatcat:o5qyatnfrzexfc3fpktppo2xmq

Latent Semantic Word Sense Induction and Disambiguation

Tim Van de Cruys, Marianna Apidianaki
2011 Annual Meeting of the Association for Computational Linguistics  
The induction step and the disambiguation step are based on the same principle: words and contexts are mapped to a limited number of topical dimensions in a latent semantic word space.  ...  In this paper, we present a unified model for the automatic induction of word senses from text, and the subsequent disambiguation of particular word instances using the automatically extracted sense inventory  ...  Van de Cruys (2008) proposes a model for sense induction based on latent semantic dimensions.  ... 
dblp:conf/acl/CruysA11 fatcat:ucimnwsmlrhy5douburxsvqnzm

The Interactive Behavior in the Relation between Simple and Complex Structure of Concept and Semantic Relations in an Agricultural Ontology (VocBench)

Maziar Amirhosseini
2020 International journal of information science and management  
Our scientific guess is that there is a significant relation between the structure of concepts and the number of semantic relations.  ...  The mix-method of deductive and inductive approach is adapted in operating the research methodology, especially for data collection.  ...  a single-word term (National Information Standards Organization, NISO, 2005) .  ... 
doaj:e33ac9de2c824bb7af7cbea3e2251448 fatcat:6d2uxdw6d5h47aqpio65bojoaq

Infinite derivations as failures

Andrea Corradi, Federico Frassetto
2015 Italian Conference on Computational Logic  
We present a Prolog meta-interpreter that checks for the presence of cyclic computations at runtime and returns a failure if this is the case, thus allowing inductive predicates to properly deal with cyclic  ...  When operating on cyclic data, programmers have to take care in assuring that their programs will terminate; in our opinion, this is a task for the interpreter.  ...  Since infinite derivations do not belong to the inductive semantics [3] , we propose a new operational semantics where infinite regular derivations of inductive predicate fail.  ... 
dblp:conf/cilc/CorradiF15 fatcat:qk2jh6z7rrhmbodcx5ywsyxxaa

Completeness for Ancestral Logic via a Computationally-Meaningful Semantics [chapter]

Liron Cohen
2017 Lecture Notes in Computer Science  
While the expressiveness of AL renders any effective proof system for it incomplete with respect to the standard semantics, there are useful approximations.  ...  In this paper we show that such a Gentzen-style approximation is both sound and complete with respect to a natural, computationally-meaningful Henkin-style semantics for AL.  ...  The author is indebt to A. Avron for his invaluable comments and expertise that greatly assisted this research.  ... 
doi:10.1007/978-3-319-66902-1_15 fatcat:4eucgtab3zcfdbszl6fkowadre

The Well-Founded Semantics Is the Principle of Inductive Definition [chapter]

Marc Denecker
1998 Lecture Notes in Computer Science  
In the past, there have been several attempts to explain logic programming under the well-founded semantics as a logic of inductive definitions.  ...  semantics.  ...  Standard versus ultimate well-founded semantics.  ... 
doi:10.1007/3-540-49545-2_1 fatcat:uo2lssb2qvbxpmpw53bq7crd5e

Flexible Coinduction for Infinite Behaviour

Francesco Dagnino
2018 Italian Conference on Theoretical Computer Science  
They support a flexible form of coinduction, subsuming even induction, which allows one to mediate between the two standard semantics.  ...  Generalized inference systems have been recently defined to overcome the strong dichotomy between inductive and coinductive interpretations.  ...  Following these remarks, what we plan to do is to define a canonical construction that, starting from a standard big-step semantics for finite computations, produces an extended semantics including diverging  ... 
dblp:conf/ictcs/Dagnino18 fatcat:xxfakpyqwzc2jcaupyj5bafe7u

Deriving Relationship Between Semantic Models - An Approach for cCSP [article]

Shamim H. Ripon, Michael Butler
2010 arXiv   pre-print
Formal semantics offers a complete and rigorous definition of a language. It is important to define different semantic models for a language and different models serve different purposes.  ...  We extract traces from operational rules and use induction over traces to show the correspondence between the two semantics of cCSP.  ...  A non-terminal event changes the state of the process inside the block.  ... 
arXiv:1002.3330v2 fatcat:czsnbzym2jg2lgsf4gvz3n44hu

Coinductive big-step operational semantics for type soundness of Java-like languages

Davide Ancona
2011 Proceedings of the 13th Workshop on Formal Techniues for Java-Like Programs - FTfJP '11  
We define a coinductive semantics for a simple Java-like language by simply interpreting coinductively the rules of a standard big-step operational semantics.  ...  We prove that such a semantics is sound w.r.t. the usual small-step operational semantics, and then prove soundness of a conventional nominal type system w.r.t. the coinductive semantics.  ...  After defining the standard small-step semantics of our reference language (Section 2), in Section 3 we define a coinductive semantics by simply interpreting coinductively the rules of a standard inductive  ... 
doi:10.1145/2076674.2076679 dblp:conf/ecoop/Ancona11 fatcat:2v5n5wmxlfdhvptssuj4vto45u

A uniform semantic proof for cut-elimination and completeness of various first and higher order logics

Mitsuhiro Okada
2002 Theoretical Computer Science  
Then we show that this semantic framework allows us to derive a uniform semantic proof of the (ÿrst order and) higher order cut-elimination theorem (as well as a (ÿrst order and) higher order phase-semantic  ...  We present a natural generalization of Girard's (ÿrst order) phase semantics of linear logic (Theoret. Comput. Sci. 50 (1987)) to intuitionistic and higher-order phase semantics.  ...  This paper is the full and revised version of the ÿrst part of Okada [20] (the extended abstract "Phase Semantics for Higher Order Completeness, Cut-Elimination and Normalization Proofs" appeared in  ... 
doi:10.1016/s0304-3975(02)00024-5 fatcat:dwlmhsceknfytalgc5pud5cuum

PVS Embedding of cCSP Semantic Models and Their Relationship

Shamim H. Ripon, Michael J. Butler
2009 Electronical Notes in Theoretical Computer Science  
We show how these semantic embeddings are used to define and prove a relationship between the semantic models by using the powerful induction mechanism of PVS.  ...  This paper demonstrates an embedding of the semantic models of the cCSP process algebra in the general purpose theorem prover PVS. cCSP is a language designed to model long-running business transactions  ...  The inductive proofs have followed similar steps as the steps in the hand proofs, and it has given us confidence in our language definitions.  ... 
doi:10.1016/j.entcs.2009.08.020 fatcat:l6klx2exevgzhdf6ulsgyhsgjm

A Co-inductive Language and Truth Degrees [chapter]

Shunsuke Yatabe
2011 Lecture Notes in Computer Science  
We investigate what happens if PA LTr2, a co-inductive language, formalizes itself.  ...  The existence of non-standard natural numbers is a direct consequence of the fact that such results are definable in the language: the concept of finiteness is forced to permit non-standard numbers since  ...  Roughly speaking, co-induction involves it (they were closely related in origin [Ml88] ): any model of PA LTr 2 instantiates a non-standard natural number d s.t.  ... 
doi:10.1007/978-3-642-23211-4_13 fatcat:cotefhhu35bvhdbvj4phjlmycu

The Interval Domain: A Matchmaker for aCTL and aPCTL

Michael Huth
1998 Electronical Notes in Theoretical Computer Science  
We give a non-standard semantics to the action-based temporal logic aCTL, where the propositional clauses are interpreted in a fuzzy and the modalities in a probabilistic way the until-construct is evaluated  ...  Thus, any i n teresting probabilistic dynamics of aPCTL formulas with \pattern" has to happen within the n-dimensional interval determined by our non-standard aCTL semantics ] ].  ...  In 7] one nds a non-standard semantics of the model mu-calculus 10] over the unit interval 0 1] instead of the usual domain of truth values fff < ttg.  ... 
doi:10.1016/s1571-0661(05)80234-8 fatcat:k2gijulmxbgynfl7sm5b4kq56e

Page 3546 of Mathematical Reviews Vol. , Issue 2004e [page]

2004 Mathematical Reviews  
Summary: “We give a uniform presentation of representation and decidability results related to the Kripke-style semantics of several non-classical logics.  ...  The ampliativity of inductive reasoning requires that such reasoning exhibit a certain non-monotonic character, as many logicians and computer scien- tists might say.  ... 
« Previous Showing results 1 — 15 out of 82,305 results