Sciweavers

2145 search results - page 213 / 429
» Lax Logical Relations
Sort
View
FORMATS
2007
Springer
14 years 2 months ago
On the Expressiveness of MTL Variants over Dense Time
The basic modal operator bounded until of Metric Temporal Logic (MTL) comes in several variants. In particular it can be strict (when it does not constrain the current instant) or...
Carlo A. Furia, Matteo Rossi
LICS
1994
IEEE
14 years 11 days ago
Subtyping and Parametricity
In this paper we study the interaction of subtyping and parametricity. We describe a logic for a programming language with parametric polymorphism and subtyping. The logic support...
Gordon D. Plotkin, Martín Abadi, Luca Carde...
ATAL
2007
Springer
14 years 7 days ago
A grounded specification language for agent programs
This paper studies the relation between agent specification and agent programming languages. In particular, it shows that an agent programming language obeys some desirable proper...
Mehdi Dastani, M. Birna van Riemsdijk, John-Jules ...
ECAI
2006
Springer
13 years 12 months ago
Discovering Missing Background Knowledge in Ontology Matching
Semantic matching determines the mappings between the nodes of two graphs (e.g., ontologies) by computing logical relations (e.g., subsumption) holding among the nodes that corresp...
Fausto Giunchiglia, Pavel Shvaiko, Mikalai Yatskev...
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
13 years 11 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen