Sciweavers

9842 search results - page 1953 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
JELIA
2004
Springer
15 years 3 months ago
Practical Reasoning for Uncertain Agents
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...
Nivea de Carvalho Ferreira, Michael Fisher, Wiebe ...
JELIA
2004
Springer
15 years 3 months ago
tascpl: TAS Solver for Classical Propositional Logic
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...
Manuel Ojeda-Aciego, Agustín Valverde
KR
2004
Springer
15 years 3 months ago
On Eliminating Disjunctions in Stable Logic Programming
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...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
MMAS
2004
Springer
15 years 3 months ago
Agent Server Technology for Managing Millions of Agents
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 ...
Gaku Yamamoto
SWAT
2004
Springer
103views Algorithms» more  SWAT 2004»
15 years 3 months ago
Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion
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...
Mark de Berg, Sergio Cabello, Panos Giannopoulos, ...
« Prev « First page 1953 / 1969 Last » Next »