Sciweavers

780 search results - page 3 / 156
» Reasoning about sets using redescription mining
Sort
View
QEST
2010
IEEE
13 years 3 months ago
Reasoning about MDPs as Transformers of Probability Distributions
We consider Markov Decision Processes (MDPs) as transformers on probability distributions, where with respect to a scheduler that resolves nondeterminism, the MDP can be seen as ex...
Vijay Anand Korthikanti, Mahesh Viswanathan, Gul A...
LOGCOM
1998
178views more  LOGCOM 1998»
13 years 5 months ago
Applying the Mu-Calculus in Planning and Reasoning about Action
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
Munindar P. Singh
CORR
2002
Springer
133views Education» more  CORR 2002»
13 years 5 months ago
Complete Axiomatizations for Reasoning About Knowledge and Time
Sound and complete axiomatizations are provided for a number of different logics involving modalities for knowledge and time. These logics arise from different choices for various ...
Joseph Y. Halpern, Ron van der Meyden, Moshe Y. Va...
ECOI
2007
101views more  ECOI 2007»
13 years 5 months ago
Reasoning about taxonomies in first-order logic
Experts often disagree about the organization of biological taxa. The shifting definitions of taxonomic names complicate otherwise simple queries concerning these taxa. For examp...
David Thau, Bertram Ludäscher
CONCUR
2011
Springer
12 years 5 months ago
Reasoning about Threads with Bounded Lock Chains
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...
Vineet Kahlon