Sciweavers

4595 search results - page 826 / 919
» Reasoning about Plans
Sort
View
COCO
2004
Springer
84views Algorithms» more  COCO 2004»
14 years 2 months ago
Properties of NP-Complete Sets
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
Christian Glaßer, Aduri Pavan, Alan L. Selma...
INEX
2004
Springer
14 years 2 months ago
If INEX Is the Answer, What Is the Question?
The INEX query languages allow the extraction of fragments from selected documents. This power is not much used in INEX queries. The paper suggests reasons why, and considers which...
Richard A. O'Keefe
KR
2004
Springer
14 years 2 months ago
Updating of a Possibilistic Knowledge Base by Crisp or Fuzzy Transition Rules
In this paper, partial knowledge about the possible transitions which can take place in a dynamical environment is represented by a set of pairs of propositional formulae, with th...
Boris Mailhé, Henri Prade
ROBOCUP
2004
Springer
133views Robotics» more  ROBOCUP 2004»
14 years 2 months ago
Towards a League-Independent Qualitative Soccer Theory for RoboCup
The paper discusses a top-down approach to model soccer knowledge, as it can be found in soccer theory books. The goal is to model soccer strategies and tactics in a way that they ...
Frank Dylla, Alexander Ferrein, Gerhard Lakemeyer,...
HICSS
2003
IEEE
112views Biometrics» more  HICSS 2003»
14 years 2 months ago
Creating a Scenariologic - Design and Application of a Repeatable Methodology
Context scenarios are widely used for assessing the robustness of strategies and policies in both the private and the public sector. Royal Dutch Shell, for instance, has become re...
Bert Enserink