Sciweavers

122 search results - page 2 / 25
» Computational Semantics of Time Negation Interaction
Sort
View
ICLP
2009
Springer
14 years 1 days ago
An Engine for Computing Well-Founded Models
The seemingly simple choice of whether to use call variance or call subsumption in a tabled evaluation deeply affects an evaluation’s properties. Most tabling implementations hav...
Terrance Swift
DLT
2006
13 years 6 months ago
Well-Founded Semantics for Boolean Grammars
Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...
Vassilis Kountouriotis, Christos Nomikos, Panos Ro...
ISORC
1998
IEEE
13 years 9 months ago
Specification of Real-Time Interaction Constraints
We present a coordination language and its semantics for specification and implementation of object-oriented realtime systems. Real-time systems operate under real-time constraint...
Brian Nielsen, Shangping Ren, Gul Agha
CHI
2002
ACM
14 years 5 months ago
Interactive querying of time series data
Title of Dissertation: INTERACTIVE GRAPHICAL QUERYING OF TIME SERIES AND LINEAR SEQUENCE DATA SETS Harry Hochheiser, Doctor of Philosophy, 2003 Dissertation directed by: Professor...
Harry Hochheiser
CSREAPSC
2006
13 years 6 months ago
An Inexact Matching Method Based on Ontology and Semantic Distance for Resource Discovery and Interaction
- To overcome shortcomings of Exact Matching Method (EMM) and Substitute Description Method (SDM), an Inexact Matching Method Based on Ontology and Semantic Distance (OSDIMM) is in...
Tang Shancheng, Qian Yi, Wang Wei