1027 search results - page 28 / 206 » Representing and Reasoning with Operational Semantics |
SDB
1995
14 years 2 months ago
1995
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...
ECSQARU
2001
Springer
14 years 3 months ago
2001
Springer
Abstract. A great deal of research has been devoted to nontrivial reasoning in inconsistent knowledge bases. Coherence-based approaches proceed by a consolidation operation which s...
LICS
2006
IEEE
14 years 4 months ago
2006
IEEE
In this paper we show that the Stone representation theorem for Boolean algebras can be generalized to combinatory algebras. In every combinatory algebra there is a Boolean algebr...
SWAP
2007
14 years 11 hour ago
2007
We address the problem of reasoning with instances of heterogeneously formalized ontologies. Given a set of semantic mappings, reconciling conceptual and instance level heterogenei...
ATVA
2005
Springer
14 years 4 months ago
2005
Springer
We introduce a family of temporal logics to specify the behavior of systems with Zeno behaviors. We extend linear-time temporal logic LTL to authorize models admitting Zeno sequen...