Sciweavers

163 search results - page 20 / 33
» Computationally Convincing Proofs of Knowledge
Sort
View
LPNMR
2009
Springer
14 years 2 months ago
Belief Revision with Bounded Treewidth
Problems arising from the revision of propositional knowledge bases have been intensively studied for two decades. Many different approaches to revision have thus been suggested, w...
Reinhard Pichler, Stefan Rümmele, Stefan Wolt...
ICDE
2007
IEEE
104views Database» more  ICDE 2007»
14 years 1 months ago
Filtering Frequent Spatial Patterns with Qualitative Spatial Reasoning
In frequent geographic pattern mining a large amount of patterns can be non-novel and non-interesting. This problem has been addressed recently, and background knowledge is used t...
Vania Bogorny, Bart Moelans, Luis Otávio Al...
CADE
2007
Springer
14 years 1 months ago
Semantic Selection of Premisses for Automated Theorem Proving
We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in first-order logic. The algorithm uses interpret...
Petr Pudlak
PODC
2011
ACM
12 years 10 months ago
Securing social networks
We present a cryptographic framework to achieve access control, privacy of social relations, secrecy of resources, and anonymity of users in social networks. The main idea is to u...
Michael Backes, Matteo Maffei, Kim Pecina
AAAI
2008
13 years 10 months ago
An Extended Interpreted System Model for Epistemic Logics
The interpreted system model offers a computationally grounded model, in terms of the states of computer processes, to S5 epistemic logics. This paper extends the interpreted syst...
Kaile Su, Abdul Sattar