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.
Filters
A Finite-state Approach to Events in Natural Language Semantics
2004
Journal of Logic and Computation
Preserved Fulltext
Events in natural language semantics are characterized in terms of regular languages, each string in which can be regarded as a temporal sequence of observations. ...
The usual regular constructs (concatenation, etc.) are supplemented with superposition, inducing a useful notion of entailment, distinct from that given by models of predicate logic. ...
Acknowledgment My thanks to my referees for their constructive criticism. ...
doi:10.1093/logcom/14.1.79
fatcat:d7u64klsrvhp7brcgayu4ighi4
An activity description language for activity recognition
2017
2017 International Conference on Internet of Things, Embedded Systems and Communications (IINTEC)
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.
In this paper, we present a new language dedicated to end users, to describe their activities. We call it ADeL (Activity Description Language). ...
This language is intended to be part of a complete recognition system. Such a system has to be real time, reactive, correct, and dependable. ...
Semantics To provide the language with sound foundations we turn to a formal semantic approach. We supply our language with two complementary semantics. ...
doi:10.1109/iintec.2017.8325935
dblp:conf/iintec/SarrayRMRG17
fatcat:ar45zjj56jh5vbuvbthivdvy64
Compilation of the ELECTRE reactive language into finite transition systems
1995
Theoretical 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 2019; you can also visit the original URL.
The file type is application/pdf.
This result gives a means of compiling the ELECTRE language into a finite-state machine. ' This assumption makes ELECTRE different from the synchronous languages we quoted in Section 1. ' Natural termination ...
We present in this paper an operational semantics for the ELECTRE reactive language . This language is based on an asynchronous approach to real-time systems. ...
Clearly, the number of events to be considered in one state is finite. ...
doi:10.1016/0304-3975(94)00136-7
fatcat:5lw4hih7znd2pnnjhlli4d3e4m
Disciplined Heterogeneous Modeling
[chapter]
2010
Lecture Notes 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 2013; you can also visit the original URL.
The file type is application/pdf.
An alternative approach is to embrace heterogeneity and to provide mechanisms for a diversity of models to interact. ...
It instead focuses on the interactions between diverse models, reducing the nature of those interactions to a minimum that achieves a well-defined composition. ...
For the particular topics in this paper, I give credit to Christopher Brooks, Joe Buck, Thomas Huining Feng, Soonhoi Ha, Jie Liu, Xiaojun Liu, Dave Messerschmitt, Stephen Neuendorffer, Tom Parks, John ...
doi:10.1007/978-3-642-16129-2_20
fatcat:xsrp6szcrvdxpopokhf4bfepzy
Formally Defining and Iterating Infinite Models
[chapter]
2012
Lecture Notes 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.
This paper proposes a formal definition of an infinite model, as well as a formal framework to reason on queries over infinite models. ...
First, we precisely identify the MOF parts which must be refined to support infinite structure. ...
A coinductive semantics may be implemented in several ways: in a programming language with lazy constructs that will evaluate only the finite browsed part of the model, or with data stream primitives randomly ...
doi:10.1007/978-3-642-33666-9_9
fatcat:iguuu2eddrdvpbqdjsoygch2pi
Why Bother With Syntax?
[article]
2015
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.
This short note discusses the role of syntax vs. semantics and the interplay between logic, philosophy, and language in computer science and game theory. ...
Acknowledgments: Thanks to Adam Bjorndahl for and the two reviewers of this paper for very useful comments. ...
Rather, just as in the semantic approach, where the modeler must decide exactly what the state space should be, in the syntactic approach, the modeler must decide on the choice of language. ...
arXiv:1506.05282v1
fatcat:72fyvt4sfrefhnd736amjjldtu
Finite-state methods and models in natural language processing
2011
Natural Language Engineering
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.
those who wished to remain anonymous. ...
The guest editors would like to express their thanks to the authors, to the editor, Ruslan Mitkov, and the regular editorial board and staff of the journal for their help during the whole process. ...
Introduction For the past two decades, specialised events on finite-state methods have been successful in presenting interesting studies on natural language processing to the public through journals and ...
doi:10.1017/s1351324911000015
fatcat:a45ce6spsjdlbn2k7ojjiehcoi
Pattern Based Property Specification and Verification for Service Composition
[chapter]
2006
Lecture Notes 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 2009; you can also visit the original URL.
The file type is application/pdf.
A Finite State Automata based framework for verifying BPEL schemas against PROPOLS properties is also discussed. ...
In this paper, we propose a property pattern based specification language, named PROPOLS, and use it to verify BPEL service composition schemas. ...
We would like to thank Dr. Howard Foster at Imperial College, London, for his help in using his tool to translate BPEL schemas to Labeled Transition Systems. ...
doi:10.1007/11912873_18
fatcat:uqm27gwdajbg5h62ucm6ugb43i
Why Bother with Syntax?
[chapter]
2017
Outstanding Contributions to Logic
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.
Rohit has been interested in the interplay between logic, philosophy, and language ever since I've known him. Over the years, both of us have gotten interested in game theory. ...
Rohit and I go back a long way. ...
Acknowledgments: Thanks to Adam Bjorndahl for and the two reviewers of this paper for very useful comments. ...
doi:10.1007/978-3-319-47843-2_7
fatcat:mjrky2dsyngbvns36as7nklwki
Abstract object types for databases
[chapter]
1988
Lecture Notes 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.
Our approach combines the object-oriented paradigm with experiences in formal methods in software engineering, especially algebraic data type theory, logical approaches to systems specification and design ...
a sound theory, and design-in-the-large issues like modularization and parameterization. ...
We are in a position to confirm experiences made elsewhere with formal methods in software engineering: striving for semantic clarity has a beneficial effect on developing languages and methods. ...
doi:10.1007/3-540-50345-5_10
fatcat:lz3i7wzojzbovcrx6wgcrsr5ri
Efficient Decompositional Model Checking for Regular Timing Diagrams
[chapter]
1999
Lecture Notes 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 2011; you can also visit the original URL.
The file type is application/pdf.
We introduce a class of timing diagrams called Regular Timing Diagrams (RTD's). RTD's have a precise syntax, and a formal semantics that is simple and corresponds to common usage. ...
Timing diagrams are widely used in industrial practice to express precedence and timing relationships amongst a collection of signals. ...
Acknowledgments We would like to thank Bob Kurshan, Kathi Fisler and Steve Keckler for helpful discussions and insightful comments. ...
doi:10.1007/3-540-48153-2_7
fatcat:mja3q4hq5fd5fonn4urrgeybvm
Jumping Finite Automata for Tweet Comprehension
2019
2019 International Multidisciplinary Information Technology and Engineering Conference (IMITEC)
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.
In addition, we present a software tool called Automata-Aided Tweet Comprehension (ATC) tool that takes raw tweets as input, preprocesses, recognise the syntax and extracts semantic information to 86% ...
Twitter is rich in such data but there are a number of technical challenges in comprehending tweets including ambiguity of the language used in tweets which is exacerbated in under resourced languages. ...
In order to achieve comprehensive WordNet in languages other than English, two main approaches have been used [11] : a). ...
doi:10.1109/imitec45504.2019.9015850
fatcat:urzydwoltrevrelphbgoe7kmaq
Modal Scenarios as Automata
[chapter]
2014
Lecture Notes 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.
In translating LSCs into automata over infinite words, an intermediate step constructs a kind of transition system that we call a modal state structure (MSS). ...
Scenario-based modeling in live sequence charts (LSC) involves specifying multi-modal inter-object scenarios, in which events can be mandatory (hot) or possible (cold). ...
In MSS, in contrast, modality is attached to states, and its interpretation is of a different nature. ...
doi:10.1007/978-3-642-45321-2_7
fatcat:fgcxtbsnxzbrbmyfwm34ogzw2a
A Synchronous Approach to Activity Recognition
2018
2018 IEEE 12th International Conference on Semantic Computing (ICSC)
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.
We propose to describe activities as a series of actions, triggered and driven by environmental events. ...
In our target applications, the data coming from sensors (video-cameras, etc.) are first processed to recognize and track objects and to detect low-level events. ...
turn to a formal semantic approach. ...
doi:10.1109/icsc.2018.00058
dblp:conf/semco/SarrayRMG18
fatcat:7cdjm3liynhfjphjzivx234k5e
Page 2926 of Mathematical Reviews Vol. , Issue 2000d
[page]
2000
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
A conflict event domain is said to be recognizable if it is iso- morphic to the domain of configurations of some finite trace automaton. ...
that are required in order to implement the approach. ...
« Previous
Showing results 1 — 15 out of 44,815 results