Rafail Ostrovsky
Affiliations: University of California, Los Angeles, USA
According to our database^{1},
Rafail Ostrovsky
authored at least 336 papers
between 1986 and 2021.
Collaborative distances:
Collaborative distances:
Awards
IEEE Fellow
IEEE Fellow 2017, "For contributions to cryptography".
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on zbmath.org

on orcid.org

on cs.ucla.edu
On csauthors.net:
Bibliography
2021
Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND.
SIAM J. Discret. Math., 2021
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
CoRR, 2021
Proceedings of the 2nd Conference on InformationTheoretic Cryptography, 2021
Proceedings of the CCSW@CCS '21: Proceedings of the 2021 on Cloud Computing Security Workshop, 2021
Proceedings of the Advances in Cryptology  ASIACRYPT 2021, 2021
Proceedings of the Approximation, 2021
2020
SIAM J. Discret. Math., 2020
J. Cryptol., 2020
IACR Cryptol. ePrint Arch., 2020
IACR Cryptol. ePrint Arch., 2020
IACR Cryptol. ePrint Arch., 2020
CommunicationEfficient (Proactive) Secure Computation for Dynamic General Adversary Structures and Dynamic Groups.
IACR Cryptol. ePrint Arch., 2020
IACR Cryptol. ePrint Arch., 2020
IACR Cryptol. ePrint Arch., 2020
IACR Cryptol. ePrint Arch., 2020
IACR Cryptol. ePrint Arch., 2020
IACR Cryptol. ePrint Arch., 2020
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2020
Proceedings of the Progress in Cryptology  INDOCRYPT 2020, 2020
Proceedings of the Advances in Cryptology  EUROCRYPT 2020, 2020
2019
IACR Cryptol. ePrint Arch., 2019
IACR Cryptol. ePrint Arch., 2019
ResourceRestricted Cryptography: HonestMajority MPC from a CRS (and No Broadcast).
IACR Cryptol. ePrint Arch., 2019
IACR Cryptol. ePrint Arch., 2019
IACR Cryptol. ePrint Arch., 2019
IACR Cryptol. ePrint Arch., 2019
Games Econ. Behav., 2019
DURASIFT: A Robust, Decentralized, Encrypted Database Supporting Private Searches with Complex Policy Controls.
Proceedings of the 18th ACM Workshop on Privacy in the Electronic Society, 2019
Proceedings of the Advances in Cryptology  CRYPTO 2019, 2019
Proceedings of the Advances in Cryptology  ASIACRYPT 2019, 2019
2018
Continuously NonMalleable Codes in the SplitState Model from Minimal Assumptions.
IACR Cryptol. ePrint Arch., 2018
IACR Cryptol. ePrint Arch., 2018
IACR Cryptol. ePrint Arch., 2018
IACR Cryptol. ePrint Arch., 2018
IACR Cryptol. ePrint Arch., 2018
IACR Cryptol. ePrint Arch., 2018
IACR Cryptol. ePrint Arch., 2018
IACR Cryptol. ePrint Arch., 2018
IACR Cryptol. ePrint Arch., 2018
IACR Cryptol. ePrint Arch., 2018
Data Sci. J., 2018
Cryptogr. Commun., 2018
Proceedings of the Security and Cryptography for Networks  11th International Conference, 2018
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018
ETERNAL: Encrypted Transmission With an Errorcorrecting, Realtime, Noiseresilient Apparatus on Lightweight Devices.
Proceedings of the 2nd International Workshop on Multimedia Privacy and Security, 2018
Theoretical Foundations for Mobile Target Defense: Proactive Secret Sharing and Secure Multiparty Computation.
Proceedings of the From Database to Cyber Security, 2018
2017
Theory Comput., 2017
IEEE Trans. Inf. Theory, 2017
IACR Cryptol. ePrint Arch., 2017
DelayedInput NonMalleable Zero Knowledge and MultiParty Coin Tossing in Four Rounds.
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
Universally Composable Secure Two and Multiparty Computation in the Corruptible TamperProof Hardware Token Model.
IACR Cryptol. ePrint Arch., 2017
Algorithmica, 2017
Matrix Balancing in <i>L</i><sub>p</sub> Norms: Bounding the Convergence Rate of Osborne's Iteration.
Proceedings of the TwentyEighth Annual ACMSIAM Symposium on Discrete Algorithms, 2017
Proceedings of the Structural Information and Communication Complexity, 2017
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017
Proceedings of the Advances in Cryptology  EUROCRYPT 2017  36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017
Proceedings of the Advances in Cryptology  CRYPTO 2017, 2017
2016
On the Blackbox Use of Somewhat Homomorphic Encryption in NonInteractive TwoParty Protocols.
SIAM J. Discret. Math., 2016
IACR Cryptol. ePrint Arch., 2016
IACR Cryptol. ePrint Arch., 2016
IACR Cryptol. ePrint Arch., 2016
New Feasibility Results in Unconditional UCSecure Computation with (Malicious) PUFs.
IACR Cryptol. ePrint Arch., 2016
CoRR, 2016
Proceedings of the Theory of Cryptography  13th International Conference, 2016
Proceedings of the Security and Cryptography for Networks  10th International Conference, 2016
Proceedings of the 35th ACM SIGMODSIGACTSIGAI Symposium on Principles of Database Systems, 2016
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
Proceedings of the Advances in Cryptology  EUROCRYPT 2016, 2016
2015
J. Cryptol., 2015
Inf. Process. Lett., 2015
Inf. Comput., 2015
IACR Cryptol. ePrint Arch., 2015
IACR Cryptol. ePrint Arch., 2015
Provable Virus Detection: Using the Uncertainty Principle to Protect Against Malware.
IACR Cryptol. ePrint Arch., 2015
IACR Cryptol. ePrint Arch., 2015
IACR Cryptol. ePrint Arch., 2015
IACR Cryptol. ePrint Arch., 2015
IACR Cryptol. ePrint Arch., 2015
IACR Cryptol. ePrint Arch., 2015
IACR Cryptol. ePrint Arch., 2015
Electron. Colloquium Comput. Complex., 2015
CoRR, 2015
Proceedings of the Theory of Cryptography  12th Theory of Cryptography Conference, 2015
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015
The Hidden Graph Model: Communication Locality and Optimal Resiliency with Adaptive Faults.
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015
Proceedings of the Advances in Cryptology  EUROCRYPT 2015, 2015
Proceedings of the Advances in Cryptology  CRYPTO 2015, 2015
Incoercible Multiparty Computation and Universally Composable ReceiptFree Voting.
Proceedings of the Advances in Cryptology  CRYPTO 2015, 2015
Proceedings of the Approximation, 2015
Proceedings of the Approximation, 2015
2014
ACM Trans. Sens. Networks, 2014
IEEE Trans. Inf. Theory, 2014
Theor. Comput. Sci., 2014
Theor. Comput. Sci., 2014
J. Cryptol., 2014
J. Cryptol., 2014
J. ACM, 2014
IACR Cryptol. ePrint Arch., 2014
Impossibility Results for LeakageResilient Zero Knowledge and MultiParty Computation.
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
Optimally Resilient and Adaptively Secure MultiParty Computation with Low Communication Locality.
IACR Cryptol. ePrint Arch., 2014
CoRR, 2014
It's Not Easy Being Three: The Approximability of ThreeDimensional Stable Matching Problems.
CoRR, 2014
CoRR, 2014
CoRR, 2014
Bioinform., 2014
Proceedings of the Theory of Cryptography  11th Theory of Cryptography Conference, 2014
Proceedings of the Security and Cryptography for Networks  9th International Conference, 2014
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014
Proceedings of the PublicKey Cryptography  PKC 2014, 2014
Achieving Privacy in Verifiable Computation with Multiple Servers  Without FHE and without Preprocessing.
Proceedings of the PublicKey Cryptography  PKC 2014, 2014
Proceedings of the Automata, Languages, and Programming  41st International Colloquium, 2014
Proceedings of the Advances in Cryptology  EUROCRYPT 2014, 2014
2013
Sequential Aggregate Signatures, Multisignatures, and Verifiably Encrypted Signatures Without Random Oracles.
J. Cryptol., 2013
IACR Cryptol. ePrint Arch., 2013
IACR Cryptol. ePrint Arch., 2013
IACR Cryptol. ePrint Arch., 2013
IACR Cryptol. ePrint Arch., 2013
Electron. Colloquium Comput. Complex., 2013
CoRR, 2013
Secure EndtoEnd Communication with Optimal Throughput and Resilience against Malicious Adversary.
Proceedings of the Distributed Computing  27th International Symposium, 2013
Proceedings of the Theory of Cryptography  10th Theory of Cryptography Conference, 2013
Proceedings of the Theory of Cryptography  10th Theory of Cryptography Conference, 2013
Proceedings of the Theory of Cryptography  10th Theory of Cryptography Conference, 2013
Proceedings of the Information Theoretic Security  7th International Conference, 2013
Proceedings of the Automata, Languages, and Programming  40th International Colloquium, 2013
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013
Proceedings of the Advances in Cryptology  ASIACRYPT 2013, 2013
Generalizing the Layering Method of Indyk and Woodruff: Recursive Sketches for FrequencyBased Vectors on Streams.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013
2012
Theor. Comput. Sci., 2012
J. Comput. Syst. Sci., 2012
J. ACM, 2012
J. ACM, 2012
Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions.
IACR Cryptol. ePrint Arch., 2012
IACR Cryptol. ePrint Arch., 2012
IACR Cryptol. ePrint Arch., 2012
IACR Cryptol. ePrint Arch., 2012
IACR Cryptol. ePrint Arch., 2012
IACR Cryptol. ePrint Arch., 2012
IACR Cryptol. ePrint Arch., 2012
IACR Cryptol. ePrint Arch., 2012
IACR Cryptol. ePrint Arch., 2012
Electron. Colloquium Comput. Complex., 2012
Electron. Colloquium Comput. Complex., 2012
Proceedings of the Theory of Cryptography  9th Theory of Cryptography Conference, 2012
Proceedings of the Theory of Cryptography  9th Theory of Cryptography Conference, 2012
Proceedings of the Public Key Cryptography  PKC 2012, 2012
Proceedings of the Public Key Cryptography  PKC 2012, 2012
Proceedings of the Public Key Cryptography  PKC 2012, 2012
Proceedings of the Automata, Languages, and Programming  39th International Colloquium, 2012
Proceedings of the Automata, Languages, and Programming  39th International Colloquium, 2012
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012
Proceedings of the Advances in Cryptology  EUROCRYPT 2012, 2012
2011
J. Comb. Optim., 2011
IACR Cryptol. ePrint Arch., 2011
IACR Cryptol. ePrint Arch., 2011
IACR Cryptol. ePrint Arch., 2011
IACR Cryptol. ePrint Arch., 2011
NearLinear UnconditionallySecure Multiparty Computation with a Dishonest Minority.
IACR Cryptol. ePrint Arch., 2011
Electron. Colloquium Comput. Complex., 2011
Proceedings of the TwentySecond Annual ACMSIAM Symposium on Discrete Algorithms, 2011
Proceedings of the Advances in Cryptology  EUROCRYPT 2011, 2011
Proceedings of the Advances in Cryptology  CRYPTO 2011, 2011
Proceedings of the Coding and Cryptology  Third International Workshop, 2011
2010
SIAM J. Comput., 2010
IACR Cryptol. ePrint Arch., 2010
Correlated Product Security From Any OneWay Function and the New Notion of Decisional Correlated Product Security.
IACR Cryptol. ePrint Arch., 2010
IACR Cryptol. ePrint Arch., 2010
IACR Cryptol. ePrint Arch., 2010
Electron. Colloquium Comput. Complex., 2010
CoRR, 2010
Rademacher Chaos, Random Eulerian Graphs and The Sparse JohnsonLindenstrauss Transform
CoRR, 2010
CoRR, 2010
Efficiency Preserving Transformations for Concurrent Nonmalleable Zero Knowledge.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010
Proceedings of the Advances in Cryptology, 2010
2009
IEEE Trans. Inf. Theory, 2009
SIAM J. Comput., 2009
J. ACM, 2009
Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security.
IACR Cryptol. ePrint Arch., 2009
IACR Cryptol. ePrint Arch., 2009
Electron. Colloquium Comput. Complex., 2009
Electron. Colloquium Comput. Complex., 2009
CoRR, 2009
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009
2008
ACM Trans. Algorithms, 2008
IACR Cryptol. ePrint Arch., 2008
IACR Cryptol. ePrint Arch., 2008
CoRR, 2008
CoRR, 2008
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008
ConstantRound Concurrent Nonmalleable Zero Knowledge in the Bare PublicKey Model.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008
Proceedings of the Advances in Cryptology, 2008
Proceedings of the Advances in Cryptology, 2008
Proceedings of the Advances in Cryptology, 2008
2007
J. Cryptol., 2007
J. ACM, 2007
IACR Cryptol. ePrint Arch., 2007
IACR Cryptol. ePrint Arch., 2007
IACR Cryptol. ePrint Arch., 2007
IACR Cryptol. ePrint Arch., 2007
IACR Cryptol. ePrint Arch., 2007
IACR Cryptol. ePrint Arch., 2007
Electron. Colloquium Comput. Complex., 2007
Public Key Encryption Which is Simultaneously a LocallyDecodable ErrorCorrecting Code.
Electron. Colloquium Comput. Complex., 2007
CoRR, 2007
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007
A Survey of SingleDatabase Private Information Retrieval: Techniques and Applications.
Proceedings of the Public Key Cryptography, 2007
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007
Proceedings of the 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 2007
2006
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems.
Math. Oper. Res., 2006
IACR Cryptol. ePrint Arch., 2006
IACR Cryptol. ePrint Arch., 2006
IACR Cryptol. ePrint Arch., 2006
IACR Cryptol. ePrint Arch., 2006
Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions.
IACR Cryptol. ePrint Arch., 2006
Electron. Colloquium Comput. Complex., 2006
Electron. Colloquium Comput. Complex., 2006
Proceedings of the Advances in Cryptology, 2006
2005
J. Cryptol., 2005
Electron. Colloquium Comput. Complex., 2005
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005
Proceedings of the Advances in Cryptology, 2005
Proceedings of the Anonymous Communication and its Applications, 09.10.  14.10.2005, 2005
2004
Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces.
Mach. Learn., 2004
Stability Preserving Transformations: Packet Routing Networks with Edge Capacities and Speeds.
J. Interconnect. Networks, 2004
IACR Cryptol. ePrint Arch., 2004
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004
Proceedings of the Security in Communication Networks, 4th International Conference, 2004
Proceedings of the Advances in Cryptology, 2004
2003
SIAM J. Discret. Math., 2003
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data.
IACR Cryptol. ePrint Arch., 2003
IACR Cryptol. ePrint Arch., 2003
Proceedings of the Fourteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2003
Proceedings of the Advances in Cryptology, 2003
2002
SIAM J. Comput., 2002
J. ACM, 2002
IACR Cryptol. ePrint Arch., 2002
Proceedings of the Security in Communication Networks, Third International Conference, 2002
2001
J. Cryptol., 2001
IACR Cryptol. ePrint Arch., 2001
IACR Cryptol. ePrint Arch., 2001
Proceedings of the Advances in Cryptology, 2001
Proceedings of the Advances in Cryptology, 2001
2000
ACM Trans. Inf. Syst. Secur., 2000
SIAM J. Comput., 2000
SIAM J. Comput., 2000
J. Cryptol., 2000
J. Comput. Syst. Sci., 2000
J. Algorithms, 2000
Fast Verification of Any Remote Procedure Call: Short WitnessIndistinguishable OneRound Proofs for NP.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000
OneWay Trapdoor Permutations Are Sufficient for Nontrivial SingleServer Private Information Retrieval.
Proceedings of the Advances in Cryptology, 2000
Proceedings of the Advances in Cryptology, 2000
1999
J. Comput. Syst. Sci., 1999
Comb., 1999
Secure Computation with HonestLooking Parties: What If Nobody Is Truly Honest? (Extended Abstract).
Proceedings of the ThirtyFirst Annual ACM Symposium on Theory of Computing, 1999
Proceedings of the ThirtyFirst Annual ACM Symposium on Theory of Computing, 1999
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999
Proceedings of the Advances in Cryptology, 1999
Proceedings of the Advances in Cryptology, 1999
1998
SIAM J. Comput., 1998
J. Cryptol., 1998
IACR Cryptol. ePrint Arch., 1998
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998
Universal ServiceProviders for Database Private Information Retrieval (Extended Abstract).
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998
Proceedings of the Financial Cryptography, 1998
Proceedings of the Advances in Cryptology, 1998
1997
Proceedings of the TwentyNinth Annual ACM Symposium on the Theory of Computing, 1997
Universal <i>O</i>(Congestion + Dilation + log<sup>1+epsilon</sup><i>N</i>) Local Control Packet Switching Algorithms.
Proceedings of the TwentyNinth Annual ACM Symposium on the Theory of Computing, 1997
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997
Replication is NOT Needed: SINGLE Database, ComputationallyPrivate Information Retrieval.
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997
Proceedings of the Advances in Cryptology, 1997
Proceedings of the Advances in Cryptology, 1997
1996
J. ACM, 1996
IACR Cryptol. ePrint Arch., 1996
IACR Cryptol. ePrint Arch., 1996
Proceedings of the TwentyEighth Annual ACM Symposium on the Theory of Computing, 1996
Proceedings of the Seventh Annual ACMSIAM Symposium on Discrete Algorithms, 1996
1995
Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995
LogSpace Polynomial EndtoEnd Communication (Abstract).
Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995
1994
Electron. Colloquium Comput. Complex., 1994
Proceedings of the TwentySixth Annual ACM Symposium on Theory of Computing, 1994
Proceedings of the TwentySixth Annual ACM Symposium on Theory of Computing, 1994
Proceedings of the Fifth Annual ACMSIAM Symposium on Discrete Algorithms. 2325 January 1994, 1994
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994
1993
Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993
Proceedings of the Advances in Cryptology, 1993
1992
PhD thesis, 1992
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992
Proceedings of the STACS 92, 1992
Perfect ZeroKnowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract).
Proceedings of the Advances in Cryptology, 1992
Invariant Signatures and NonInteractive ZeroKnowledge Proofs are Equivalent (Extended Abstract).
Proceedings of the Advances in Cryptology, 1992
1991
Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991
OneWay Functions, Hard on Average Problems, and Statistical ZeroKnowledge Proofs.
Proceedings of the Sixth Annual Structure in Complexity Theory Conference, 1991
Proceedings of the Advances in Cryptology, 1991
1990
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990
Proceedings of the Advances In Computational Complexity Theory, 1990
1989
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989
Proceedings of the Distributed Computing And Cryptography, 1989
Proceedings of the Advances in Cryptology, 1989
1986
HOLMESI, a prologbased reason maintenance system for collecting information from multiple experts.
Proceedings of the Uncertainty in KnowledgeBased Systems, 1986