Sciweavers

193 search results - page 10 / 39
» A Tractable Class of Abduction Problems
Sort
View
ECAI
2004
Springer
15 years 2 months ago
Tractability Results for Automatic Contracting
Abstract. Automated negotiation techniques have received considerable attention over the past decade, and much progress has been made in developing negotiation protocols and strate...
Paul E. Dunne, Michael Laurence, Michael Wooldridg...
ECAI
2008
Springer
14 years 11 months ago
Towards Efficient Belief Update for Planning-Based Web Service Composition
At the "functional level", Semantic Web Services (SWS) are described akin to planning operators, with preconditions and effects relative to an ontology; the ontology prov...
Jörg Hoffmann
AIPS
2006
14 years 11 months ago
On Some Tractable Cases of Logical Filtering
Filtering denotes any method whereby an agent updates its belief state--its knowledge of the state of the world--from a sequence of actions and observations. In logical filtering,...
T. K. Satish Kumar, Stuart J. Russell
CORR
2006
Springer
76views Education» more  CORR 2006»
14 years 9 months ago
The Quantum Separability Problem for Gaussian States
Determining whether a quantum state is separable or entangled is a problem of fundamental importance in quantum information science. This is a brief review in which we consider th...
Stefano Mancini, Simone Severini
FOCS
2003
IEEE
15 years 2 months ago
The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
Martin Grohe