Sciweavers

1941 search results - page 50 / 389
» On the Hardness of Approximate Reasoning
Sort
View
LPNMR
2011
Springer
14 years 2 months ago
Approximations for Explanations of Inconsistency in Partially Known Multi-Context Systems
Abstract. Multi-context systems are a formalism to interlink decentralized and heterogeneous knowledge based systems (contexts), which interact via (possibly nonmonotonic) bridge r...
Thomas Eiter, Michael Fink, Peter Schüller
ESWS
2008
Springer
15 years 1 months ago
Numeric reasoning in the Semantic Web
Abstract. The Semantic Web is an effort by the W3C to enable integration and sharing of information across different applications and organizations using annotations by means of on...
Chimène Fankam, Stéphane Jean, Guy P...
TIME
1994
IEEE
15 years 4 months ago
Localized Temporal Reasoning: A State-Based Approach
We are concerned with temporalreasoning problems where there is uncertainty about the order in which events occur. The task of temporal reasoning is to derive an event sequence co...
Shieu-Hong Lin, Thomas Dean
AI
2002
Springer
14 years 11 months ago
On the computational complexity of assumption-based argumentation for default reasoning
ko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, th...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
ESOP
2010
Springer
15 years 9 months ago
Faulty Logic: Reasoning about Fault Tolerant Programs
Transient faults are single-shot hardware errors caused by high energy particles from space, manufacturing defects, overheating, and other sources. Such faults can be devastating f...
Matthew L. Meola and David Walker