Sciweavers

3207 search results - page 396 / 642
» A Semantics for HTN Methods
Sort
View
TCS
2002
15 years 6 months ago
The continuum as a final coalgebra
oole.stanford.edu/pub/ABSTRACTS Pratt, V.R., "Transition and Cancellation in Concurrency and Branching Time", Math. Structures in Comp. Sci., 13:4, 485-529, August 2003. ...
Dusko Pavlovic, Vaughan R. Pratt
ICCS
2010
Springer
15 years 5 months ago
Introducing Rigor in Concept Maps
Although concept maps have been found to be effective in science education research, these are critiqued for being informal due to informal usage of relation and attribute names t...
Meena Kharatmal, G. Nagarjuna
ICST
2010
IEEE
15 years 5 months ago
Timed Moore Automata: Test Data Generation and Model Checking
Abstract—In this paper we introduce Timed Moore Automata, a specification formalism which is used in industrial train control applications for specifying the real-time behavior ...
Helge Löding, Jan Peleska
IJCAT
2010
93views more  IJCAT 2010»
15 years 5 months ago
FAETON: Form Analysis and Extraction Tool for ONtology construction
Abstract: This paper presents a method for semi-automatically building tailored application ontologies from a set of data acquisition forms. Such ontologies are intended to facilit...
Rafael Berlanga Llavori, Ernesto Jiménez-Ru...
NLE
2010
112views more  NLE 2010»
15 years 4 months ago
A non-negative tensor factorization model for selectional preference induction
Distributional similarity methods have proven to be a valuable tool for the induction of semantic similarity. Up till now, most algorithms use two-way cooccurrence data to compute...
Tim Van de Cruys