28 search results - page 2 / 6 » Complete Axiomatisations of Properties of Finite Sets |
74
Voted
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
JSYML
2008
14 years 9 months ago
2008
. We give a novel application of algebraic logic to first order logic. A new, flexible construction is presented for representable but not completely representable atomic relation ...
SEMWEB
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we consider the problem of materializing the complete finite RDFS closure in a scalable manner; this includes those parts of the RDFS closure that are often ignored...
ATAL
2007
Springer
15 years 3 months ago
2007
Springer
Agents that must reach agreements with other agents need to reason about how their preferences, judgments, and beliefs might be aggregated with those of others by the social choic...
82
Voted
JELIA
2004
Springer
15 years 2 months ago
2004
Springer
Logical formalisation of agent behaviour is desirable, not only in order to provide a clear semantics of agent-based systems, but also to provide the foundation for sophisticated r...