Sciweavers

237 search results - page 2 / 48
» On the decidability and complexity of reasoning about only k...
Sort
View
ICCBR
2001
Springer
13 years 11 months ago
Helping a CBR Program Know What It Knows
Case-based reasoning systems need to know the limitations of their expertise. Having found the known source cases most relevant to a target problem, they must assess whether those ...
Bruce M. McLaren, Kevin D. Ashley
AAAI
1990
13 years 8 months ago
Decidable Reasoning in First-Order Knowledge Bases with Perfect Introspection
Since knowledge bases (KBs) are usually incomplete, they should be able to provide information regarding their own incompleteness, which requires them to introspect on what they k...
Gerhard Lakemeyer
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
14 years 7 months ago
From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon
SIAMCOMP
2011
13 years 2 months ago
The Complexity of Early Deciding Set Agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon
FOSSACS
2004
Springer
14 years 21 days ago
Reasoning about Dynamic Policies
People often need to reason about policy changes before they are adopted. For example, suppose a website manager knows that users want to enter her site without going through the w...
Riccardo Pucella, Vicky Weissman