127 search results - page 6 / 26 » Composing Complete and Partial Knowledge |
COMSIS
2006
13 years 7 months ago
2006
Traditional knowledge representations were developed to encode complete, explicit and executable programs, a goal that makes them less than ideal for representing the incomplete an...
ENTCS
2006
13 years 7 months ago
2006
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
MFCS
2010
Springer
13 years 6 months ago
2010
Springer
We address the strategy problem for ω-regular two-player games with partial information, played on finite game graphs. We consider two different kinds of observability on a gene...
TPLP
2010
13 years 6 months ago
2010
The need for integration of ontologies with nonmonotonic rules has been gaining importance in a number of areas, such as the Semantic Web. A number of researchers addressed this p...
ICASSP
2008
IEEE
14 years 2 months ago
2008
IEEE
A knowledge representation formalism for SLU is introduced. It is used for incremental and partially automated annotation of the MEDIA corpus in terms of semantic structures. An a...