Sciweavers

2576 search results - page 61 / 516
» The Complexity of Zero Knowledge
Sort
View
IJCAI
2007
15 years 1 months ago
Counting Complexity of Propositional Abduction
Abduction is an important method of non-monotonic reasoning with many applications in artificial intelligence and related topics. In this paper, we concentrate on propositional ab...
Miki Hermann, Reinhard Pichler
AAAI
1990
15 years 1 months ago
The Complexity of Closed World Reasoning and Circumscription
Closed world reasoning is a common nonmonotonic technique that allows for dealing with negative information in knowledge and data bases. We present a detailed analysis of the comp...
Marco Cadoli, Maurizio Lenzerini
FROCOS
2009
Springer
15 years 6 months ago
Taming the Complexity of Temporal Epistemic Reasoning
Temporal logic of knowledge is a combination of temporal and epistemic logic that has been shown to be very useful in areas such as distributed systems, security, and multi-agent s...
Clare Dixon, Michael Fisher, Boris Konev
CIE
2007
Springer
15 years 6 months ago
Circuit Complexity of Regular Languages
We survey our current knowledge of circuit complexity of regular languages and we prove that regular languages that are in AC0 and ACC0 are all computable by almost linear size ci...
Michal Koucký
CATS
2007
15 years 1 months ago
Effective Prediction and its Computational Complexity
A model for the problem of predicting the outputs of a process, based only on knowledge of previous outputs, is proposed in terms of a decision problem. The strength of this parti...
Richard Taylor