9842 search results - page 1953 / 1969 » The Complexity of the Matching-Cut Problem |
JELIA
2004
Springer
14 years 26 days 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...
JELIA
2004
Springer
14 years 26 days ago
2004
Springer
We briefly overview the most recent improvements we have incorporated to the existent implementations of the TAS methodology, the simplified ∆-tree representation of formulas i...
KR
2004
Springer
14 years 26 days ago
2004
Springer
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge repr...
MMAS
2004
Springer
14 years 25 days ago
2004
Springer
d to submit first an abstract (to signal your interest and contribution) and then a full paper (for review) to the workshop. All accepted papers will be published as a volume from ...
SWAT
2004
Springer
14 years 25 days ago
2004
Springer
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m ≥ n. We consider the problem of finding a translation or rigid motion of A that maximizes the tota...