175 search results - page 26 / 35 » Generalizing stable semantics by preferences |
AAAI
2004
13 years 9 months ago
2004
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
We propose a graph-based semi-supervised symmetric matching framework that performs dense matching between two uncalibrated wide-baseline images by exploiting the results of sparse...
ACL
1997
13 years 8 months ago
1997
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
EMSOFT
2007
Springer
14 years 1 months ago
2007
Springer
We provide an algebraic formalisation of connectors in BIP. These are used to structure interactions in a component-based system. A connector relates a set of typed ports. Types a...
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
We present a novel approach to knowledge-based automated oneshot multi-issue bilateral negotiation handling, in a homogeneous setting, both numerical features and non-numerical on...