1634 search results - page 133 / 327 » Reasoning about Knowledge Using Rough Sets |
CDC
2010
IEEE
13 years 5 months ago
2010
IEEE
Approximate policy iteration methods based on temporal differences are popular in practice, and have been tested extensively, dating to the early nineties, but the associated conve...
IJCAI
1989
13 years 11 months ago
1989
The knowledge to be acquired for the development of knowledge based systems is often distributed across a group of experts rather than available for elicitation from a single expe...
CADE
2005
Springer
14 years 11 months ago
2005
Springer
Abstract This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover using nominal techniques. Central to the formalisation is an inductive set that i...
JSAT
2006
13 years 10 months ago
2006
This paper reports about the 2005 comparative evaluation of solvers for quantified Boolean formulas (QBFs), the third in a series of non-competitive events established with the ai...
TACAS
2007
Springer
14 years 4 months ago
2007
Springer
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...