default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRonald Fagin
Person information
- affiliation: IBM Almaden Research Center, San Jose, USA
- award (2014): Gödel Prize
- award (2012): W. Wallace McDowell Award
- award (2004): SIGMOD Edgar F. Codd Innovations Award
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c89]Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta:
On the Number of Quantifiers Needed to Define Boolean Functions. MFCS 2024: 34:1-34:16- [c88]Ronald Fagin, Phokion G. Kolaitis, Domenico Lembo, Lucian Popa, Federico Scafoglieri:
Combining Entity Resolution and Query Answering in Ontologies: A Formal Conceptual Framework. SEBD 2024: 633-642 - [i12]Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta, R. Ryan Williams:
Parallel Play Saves Quantifiers. CoRR abs/2402.10293 (2024) - [i11]Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta:
On the Number of Quantifiers Needed to Define Boolean Functions. CoRR abs/2407.00688 (2024) - 2023
- [c87]Ronald Fagin, Phokion G. Kolaitis, Domenico Lembo, Lucian Popa, Federico Scafoglieri:
A Framework for Combining Entity Resolution and Query Answering in Knowledge Bases. KR 2023: 229-239 - [i10]Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta:
A Finer Analysis of Multi-Structural Games and Beyond. CoRR abs/2301.13329 (2023) - [i9]Ronald Fagin, Phokion G. Kolaitis, Domenico Lembo, Lucian Popa, Federico Scafoglieri:
A Framework for Combining Entity Resolution and Query Answering in Knowledge Bases. CoRR abs/2303.07469 (2023) - 2022
- [c86]Ronald Fagin
, Jonathan Lenchner, Nikhil Vyas, R. Ryan Williams:
On the Number of Quantifiers as a Complexity Measure. MFCS 2022: 48:1-48:14 - [i8]Ronald Fagin, Jonathan Lenchner, Nikhil Vyas, Ryan Williams:
On the Number of Quantifiers as a Complexity Measure. CoRR abs/2207.00104 (2022) - 2021
- [c85]Shqiponja Ahmetaj, Vasilis Efthymiou, Ronald Fagin, Phokion G. Kolaitis, Chuan Lei, Fatma Özcan, Lucian Popa:
Ontology-Enriched Query Answering on Relational Databases. AAAI 2021: 15247-15254 - [c84]Ronald Fagin, Jonathan Lenchner, Kenneth W. Regan, Nikhil Vyas:
Multi-Structural Games and Number of Quantifiers. LICS 2021: 1-13 - [c83]Ronald Fagin, Georg Gottlob, Christos H. Papadimitriou, Moshe Y. Vardi, Giorgio Ausiello, Maurizio Lenzerini, Domenico Saccà, Luigi Palopoli, Francesco Scarcello:
Panel on "Past and Future of Computer Science Theory" (Discussion Paper). SEBD 2021: 531-542 - [i7]Ronald Fagin, Jonathan Lenchner, Kenneth W. Regan, Nikhil Vyas:
Multi-Structural Games and Number of Quantifiers. CoRR abs/2104.14709 (2021) - 2020
- [i6]Ryan Riegel, Alexander G. Gray, Francois P. S. Luus, Naweed Khan, Ndivhuwo Makondo, Ismail Yunus Akhalwaya, Haifeng Qian, Ronald Fagin, Francisco Barahona, Udit Sharma, Shajith Ikbal, Hima Karanam, Sumit Neelam, Ankita Likhyani, Santosh K. Srivastava:
Logical Neural Networks. CoRR abs/2006.13155 (2020) - [i5]Ronald Fagin, Ryan Riegel, Alexander G. Gray:
Foundations of Reasoning with Uncertainty via Real-valued Logics. CoRR abs/2008.02429 (2020)
2010 – 2019
- 2019
- [j87]Douglas Burdick, Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang-Chiew Tan:
Expressive power of entity-linking frameworks. J. Comput. Syst. Sci. 100: 44-69 (2019) - [c82]Liat Peterfreund, Balder ten Cate, Ronald Fagin, Benny Kimelfeld:
Recursive Programs for Document Spanners. ICDT 2019: 13:1-13:18 - 2018
- [r5]Ronald Fagin:
Equality-Generating Dependencies. Encyclopedia of Database Systems (2nd ed.) 2018 - [r4]Ronald Fagin:
Score Aggregation. Encyclopedia of Database Systems (2nd ed.) 2018 - [r3]Ronald Fagin:
Tuple-Generating Dependencies. Encyclopedia of Database Systems (2nd ed.) 2018 - 2017
- [c81]Douglas Burdick, Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan:
Expressive Power of Entity-Linking Frameworks. ICDT 2017: 10:1-10:18 - [i4]Liat Peterfreund, Balder ten Cate, Ronald Fagin, Benny Kimelfeld:
Recursive Programs for Document Spanners. CoRR abs/1712.08198 (2017) - 2016
- [j86]Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee:
An Algorithmic View of Voting. SIAM J. Discret. Math. 30(4): 1978-1996 (2016) - [j85]Ronald Fagin, Benny Kimelfeld, Frederick Reiss, Stijn Vansummeren:
Declarative Cleaning of Inconsistencies in Information Extraction. ACM Trans. Database Syst. 41(1): 6:1-6:44 (2016) - [j84]Douglas Burdick, Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang-Chiew Tan:
A Declarative Framework for Linking Entities. ACM Trans. Database Syst. 41(3): 17:1-17:38 (2016) - [c80]Ronald Fagin:
Optimal Score Aggregation Algorithms. PODS 2016: 55 - 2015
- [j83]Ronald Fagin, Benny Kimelfeld, Frederick Reiss, Stijn Vansummeren:
Document Spanners: A Formal Approach to Information Extraction. J. ACM 62(2): 12:1-12:51 (2015) - [j82]Ronald Fagin, Benny Kimelfeld, Frederick Reiss, Stijn Vansummeren:
A Relational Framework for Information Extraction. SIGMOD Rec. 44(4): 5-16 (2015) - [c79]Douglas Burdick, Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan:
A Declarative Framework for Linking Entities. ICDT 2015: 25-43 - [c78]Ronald Fagin, Benny Kimelfeld, Phokion G. Kolaitis:
Dichotomies in the Complexity of Preferred Repairs. PODS 2015: 3-15 - 2014
- [c77]Michael Benedikt, Ronald Fagin, Wim Martens:
The ICDT 2014 Test of Time Award. ICDT 2014: 257 - [c76]Ronald Fagin, Benny Kimelfeld, Frederick Reiss, Stijn Vansummeren:
Cleaning inconsistencies in information extraction via prioritized repairs. PODS 2014: 164-175 - 2013
- [j81]Marcelo Arenas, Pablo Barceló, Ronald Fagin, Leonid Libkin:
Solutions and query rewriting in data exchange. Inf. Comput. 228: 28-61 (2013) - [c75]Ronald Fagin:
Applying theory to practice. CIKM 2013: 3-4 - [c74]Ronald Fagin, Benny Kimelfeld, Frederick Reiss, Stijn Vansummeren:
Spanners: a formal framework for information extraction. PODS 2013: 37-48 - [i3]Ronald Fagin, Joseph Y. Halpern:
A New Approach to Updating Beliefs. CoRR abs/1304.1119 (2013) - 2012
- [c73]Hugh Darwen, C. J. Date, Ronald Fagin:
A normal form for preventing redundant tuples in relational databases. ICDT 2012: 114-126 - [c72]Ronald Fagin, Phokion G. Kolaitis:
Local transformations and conjunctive-query equivalence. PODS 2012: 179-190 - 2011
- [j80]Marcelo Arenas, Ronald Fagin, Alan Nash:
Composition with Target Constraints. Log. Methods Comput. Sci. 7(3) (2011) - [j79]Ronald Fagin, Benny Kimelfeld, Phokion G. Kolaitis:
Probabilistic data exchange. J. ACM 58(4): 15:1-15:55 (2011) - [j78]Albert Atserias, Mikolaj Bojanczyk, Balder ten Cate, Ronald Fagin, Floris Geerts, Kenneth A. Ross:
Foreword. Theory Comput. Syst. 49(2): 365-366 (2011) - [j77]Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan:
Reverse data exchange: Coping with nulls. ACM Trans. Database Syst. 36(2): 11:1-11:42 (2011) - [c71]Ronald Fagin, Benny Kimelfeld, Yunyao Li, Sriram Raghavan, Shivakumar Vaithyanathan:
Rewrite rules for search database systems. PODS 2011: 271-282 - [p1]Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan:
Schema Mapping Evolution Through Composition and Inversion. Schema Matching and Mapping 2011: 191-222 - 2010
- [j76]Ronald Fagin, Alan Nash:
The structure of inverses in schema mappings. J. ACM 57(6): 31:1-31:57 (2010) - [j75]Alexandre V. Evfimievski, Ronald Fagin, David P. Woodruff:
Epistemic privacy. J. ACM 58(1): 2:1-2:45 (2010) - [c70]Ronald Fagin, Benny Kimelfeld, Phokion G. Kolaitis:
Probabilistic data exchange. ICDT 2010: 76-88 - [c69]Marcelo Arenas, Ronald Fagin, Alan Nash:
Composition with target constraints. ICDT 2010: 129-142 - [c68]Ronald Fagin, Benny Kimelfeld, Yunyao Li, Sriram Raghavan, Shivakumar Vaithyanathan:
Understanding queries in a search database system. PODS 2010: 273-284
2000 – 2009
- 2009
- [c67]Ronald Fagin:
Finite Model Theory and its Origins. APCCM 2009: 3 - [c66]Ronald Fagin, Laura M. Haas, Mauricio A. Hernández, Renée J. Miller, Lucian Popa, Yannis Velegrakis:
Clio: Schema Mapping Creation and Data Exchange. Conceptual Modeling: Foundations and Applications 2009: 198-236 - [c65]Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan:
Reverse data exchange: coping with nulls. PODS 2009: 23-32 - [e6]Ronald Fagin:
Database Theory - ICDT 2009, 12th International Conference, St. Petersburg, Russia, March 23-25, 2009, Proceedings. ACM International Conference Proceeding Series 361, ACM 2009, ISBN 978-1-60558-423-2 [contents] - [r2]Ronald Fagin:
Equality-Generating Dependencies. Encyclopedia of Database Systems 2009: 1009-1010 - [r1]Ronald Fagin:
Tuple-Generating Dependencies. Encyclopedia of Database Systems 2009: 3201-3202 - 2008
- [j74]Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan:
Quasi-inverses of schema mappings. ACM Trans. Database Syst. 33(2): 11:1-11:52 (2008) - [c64]Ronald Fagin, Phokion G. Kolaitis, Alan Nash, Lucian Popa:
Towards a theory of schema-mapping optimization. PODS 2008: 33-42 - [c63]Alexandre V. Evfimievski, Ronald Fagin, David P. Woodruff:
Epistemic privacy. PODS 2008: 171-180 - [c62]Alexandr Andoni, Ronald Fagin, Ravi Kumar, Mihai Patrascu, D. Sivakumar:
Corrigendum to "efficient similarity search and classification via rank aggregation" by Ronald Fagin, Ravi Kumar and D. Sivakumar (proc. SIGMOD'03). SIGMOD Conference 2008: 1375-1376 - 2007
- [j73]Ronald Fagin:
Inverting schema mappings. ACM Trans. Database Syst. 32(4): 25 (2007) - [c61]Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan:
Quasi-inverses of schema mappings. PODS 2007: 123-132 - 2006
- [j72]Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee:
Comparing Partial Rankings. SIAM J. Discret. Math. 20(3): 628-648 (2006) - [c60]Ronald Fagin:
Inverting schema mappings. PODS 2006: 50-59 - 2005
- [j71]Ronald Fagin, Phokion G. Kolaitis, Renée J. Miller, Lucian Popa:
Data exchange: semantics and query answering. Theor. Comput. Sci. 336(1): 89-124 (2005) - [j70]Ronald Fagin, Phokion G. Kolaitis, Lucian Popa:
Data exchange: getting to the core. ACM Trans. Database Syst. 30(1): 174-210 (2005) - [j69]Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan:
Composing schema mappings: Second-order dependencies to the rescue. ACM Trans. Database Syst. 30(4): 994-1055 (2005) - [c59]Ronald Fagin, Ramanathan V. Guha, Ravi Kumar, Jasmine Novak, D. Sivakumar, Andrew Tomkins:
Multi-structural databases. PODS 2005: 184-195 - [c58]Ronald Fagin, Phokion G. Kolaitis, Ravi Kumar, Jasmine Novak, D. Sivakumar, Andrew Tomkins:
Efficient Implementation of Large-Scale Multi-Structural Databases. VLDB 2005: 958-969 - [e5]Harold N. Gabow, Ronald Fagin:
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005. ACM 2005, ISBN 1-58113-960-8 [contents] - 2004
- [c57]Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee:
Comparing and Aggregating Rankings with Ties. PODS 2004: 47-58 - [c56]Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan:
Composing Schema Mappings: Second-Order Dependencies to the Rescue. PODS 2004: 83-94 - [c55]Marcelo Arenas, Pablo Barceló, Ronald Fagin, Leonid Libkin:
Locally Consistent Transformations and Query Answering in Data Exchange. PODS 2004: 229-240 - 2003
- [j68]Ronald Fagin, Amnon Lotem, Moni Naor:
Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci. 66(4): 614-656 (2003) - [j67]Ronald Fagin, Ravi Kumar, D. Sivakumar:
Comparing Top k Lists. SIAM J. Discret. Math. 17(1): 134-160 (2003) - [c54]Ronald Fagin, Phokion G. Kolaitis, Renée J. Miller, Lucian Popa:
Data Exchange: Semantics and Query Answering. ICDT 2003: 207-224 - [c53]Ronald Fagin, Phokion G. Kolaitis, Lucian Popa:
Data exchange: getting to the core. PODS 2003: 90-101 - [c52]Ronald Fagin, Ravi Kumar, D. Sivakumar:
Efficient similarity search and classification via rank aggregation. SIGMOD Conference 2003: 301-312 - [c51]Ronald Fagin, Ravi Kumar, D. Sivakumar:
Comparing top k lists. SODA 2003: 28-36 - [c50]Ronald Fagin, Ravi Kumar, Kevin S. McCurley, Jasmine Novak, D. Sivakumar, John A. Tomlin, David P. Williamson:
Searching the workplace web. WWW 2003: 366-375 - 2002
- [j66]Periklis Andritsos, Ronald Fagin, Ariel Fuxman, Laura M. Haas, Mauricio A. Hernández, C. T. Howard Ho, Anastasios Kementsietsidis, Renée J. Miller, Felix Naumann, Lucian Popa, Yannis Velegrakis, Charlotte Vilarem, Ling-Ling Yan:
Schema Management. IEEE Data Eng. Bull. 25(3): 32-38 (2002) - [j65]Miklós Ajtai, Randal C. Burns, Ronald Fagin, Darrell D. E. Long, Larry J. Stockmeyer:
Compactly encoding unstructured inputs with differential compression. J. ACM 49(3): 318-367 (2002) - [j64]Moses Charikar, Ronald Fagin, Venkatesan Guruswami, Jon M. Kleinberg, Prabhakar Raghavan, Amit Sahai:
Query Strategies for Priced Information. J. Comput. Syst. Sci. 64(4): 785-819 (2002) - [j63]Lenore Cowen, Ronald Fagin, Joe Kilian, Jon M. Kleinberg:
Guest Editor's Foreword. J. Comput. Syst. Sci. 65(1): 1 (2002) - [j62]Ronald Fagin:
Combining Fuzzy Information: an Overview. SIGMOD Rec. 31(2): 109-118 (2002) - [c49]Lucian Popa, Yannis Velegrakis, Renée J. Miller, Mauricio A. Hernández, Ronald Fagin:
Translating Web Data. VLDB 2002: 598-609 - [i2]Ronald Fagin, Amnon Lotem, Moni Naor:
Optimal Aggregation Algorithms for Middleware. CoRR cs.DB/0204046 (2002) - 2001
- [j61]Renée J. Miller, Mauricio A. Hernández, Laura M. Haas, Ling-Ling Yan, C. T. Howard Ho, Ronald Fagin, Lucian Popa:
The Clio Project: Managing Heterogeneity. SIGMOD Rec. 30(1): 78-83 (2001) - [c48]Ronald Fagin, Amnon Lotem, Moni Naor:
Optimal Aggregation Algorithms for Middleware. PODS 2001 - [c47]Aya Soffer, David Carmel, Doron Cohen, Ronald Fagin, Eitan Farchi, Michael Herscovici, Yoëlle S. Maarek:
Static Index Pruning for Information Retrieval Systems. SIGIR 2001: 43-50 - [c46]Ling-Ling Yan, Renée J. Miller, Laura M. Haas, Ronald Fagin:
Data-Driven Understanding and Refinement of Schema Mappings. SIGMOD Conference 2001: 485-496 - 2000
- [j60]Miklós Ajtai, Ronald Fagin, Larry J. Stockmeyer:
The Closure of Monadic NP. J. Comput. Syst. Sci. 60(3): 660-716 (2000) - [j59]Ronald Fagin, Edward L. Wimmers:
A formula for incorporating weights into scoring rules. Theor. Comput. Sci. 239(2): 309-338 (2000) - [c45]Ronald Fagin:
Logic, Complexity, and Games. LICS 2000: 3 - [c44]Ronald Fagin, Yoëlle S. Maarek:
Allowing users to weight search terms. RIAO 2000: 682-700 - [c43]Ronald Fagin, Anna R. Karlin, Jon M. Kleinberg, Prabhakar Raghavan, Sridhar Rajagopalan, Ronitt Rubinfeld, Madhu Sudan, Andrew Tomkins:
Random walks with "back buttons" (extended abstract). STOC 2000: 484-493 - [c42]Moses Charikar, Ronald Fagin, Venkatesan Guruswami, Jon M. Kleinberg, Prabhakar Raghavan, Amit Sahai:
Query strategies for priced information (extended abstract). STOC 2000: 582-591
1990 – 1999
- 1999
- [j58]Ronald Fagin, Joseph Y. Halpern, Yoram Moses, Moshe Y. Vardi:
Common Knowledge Revisited. Ann. Pure Appl. Log. 96(1-3): 89-105 (1999) - [j57]Ronald Fagin, John Geanakoplos, Joseph Y. Halpern, Moshe Y. Vardi:
The hierarchical approach to modeling knowledge and common knowledge. Int. J. Game Theory 28(3): 331-365 (1999) - [j56]Ronald Fagin:
Combining Fuzzy Information from Multiple Systems. J. Comput. Syst. Sci. 58(1): 83-99 (1999) - 1998
- [j55]Ronald Fagin, Larry J. Stockmeyer:
Relaxing the Triangle Inequality in Pattern Matching. Int. J. Comput. Vis. 30(3): 219-231 (1998) - [c41]Ronald Fagin:
Fuzzy Queries in Multimedia Database Systems. PODS 1998: 1-10 - [c40]Miklós Ajtai, Ronald Fagin, Larry J. Stockmeyer:
The Closure of Monadic NP (Extended Abstract). STOC 1998: 309-318 - [i1]Ronald Fagin, Joseph Y. Halpern, Yoram Moses, Moshe Y. Vardi:
Common knowledge revisited. CoRR cs.LO/9809003 (1998) - 1997
- [j54]Ronald Fagin, Joseph Y. Halpern, Yoram Moses, Moshe Y. Vardi:
Knowledge-Based Programs. Distributed Comput. 10(4): 199-225 (1997) - [j53]Ronald Fagin, Joseph Y. Halpern, Yoram Moses, Moshe Y. Vardi:
Reasoning about Knowledge: A Response by the Authors. Minds Mach. 7(1): 113 (1997) - [j52]Ronald Fagin:
Comparing the Power of Games on Graphs. Math. Log. Q. 43: 431-455 (1997) - [j51]Sanjeev Arora, Ronald Fagin:
On Winning Strategies in Ehrenfeucht-Fraïssé Games. Theor. Comput. Sci. 174(1-2): 97-121 (1997) - [c39]Arnaud Durand, Ronald Fagin, Bernd Loescher:
Spectra with Only Unary Function Symbols. CSL 1997: 189-202 - [c38]Ronald Fagin, Edward L. Wimmers:
Incorporating User Preferences in Multimedia Queries. ICDT 1997: 247-261 - 1996
- [j50]David M. Choy, Ronald Fagin, Larry J. Stockmeyer:
Efficiently Extendible Mappings for Balanced Data Distribution. Algorithmica 16(2): 215-232 (1996) - [j49]Ronald Fagin, Moni Naor, Peter Winkler:
Comparing Information Without Leaking It. Commun. ACM 39(5): 77-85 (1996) - [c37]Ronald Fagin:
Easier Ways to Win Logical Games. Descriptive Complexity and Finite Models 1996: 1-32 - [c36]Ronald Fagin:
Combining Fuzzy Information from Multiple Systems. PODS 1996: 216-226 - [c35]Mary Tork Roth, Manish Arya, Laura M. Haas, Michael J. Carey, William F. Cody, Ronald Fagin, Peter M. Schwarz, Joachim Thomas, Edward L. Wimmers:
The Garlic Project. SIGMOD Conference 1996: 557 - [c34]Ronald Fagin, Joseph Y. Halpern, Yoram Moses, Moshe Y. Vardi:
Common Knowledge Revisited. TARK 1996: 283-298 - 1995
- [b2]Ronald Fagin:
Reasoning about knowledge. MIT Press 1995, ISBN 0262061627, pp. I-XIII, 1-477 - [b1]Ronald Fagin, Joseph Y. Halpern, Yoram Moses, Moshe Y. Vardi:
Reasoning About Knowledge. MIT Press 1995, ISBN 9780262562003 - [j48]Ronald Fagin, Joseph Y. Halpern, Moshe Y. Vardi:
A Nonstandard Approach to the Logical Omniscience Problem. Artif. Intell. 79(2): 203-240 (1995) - [j47]Ronald Fagin, Larry J. Stockmeyer, Moshe Y. Vardi:
On Monadic NP vs. Monadic co-NP. Inf. Comput. 120(1): 78-92 (1995) - [c33]Ronald Fagin, Joseph Y. Halpern, Yoram Moses, Moshe Y. Vardi:
Knowledge-Based Programs. PODC 1995: 153-163 - [c32]Michael J. Carey, Laura M. Haas, Peter M. Schwarz, Manish Arya, William F. Cody, Ronald Fagin, Myron Flickner, Allen Luniewski, Wayne Niblack, Dragutin Petkovic, Joachim Thomas, John H. Williams, Edward L. Wimmers:
Towards Heterogeneous Multimedia Information Systems: The Garlic Approach. RIDE-DOM 1995: 124-131 - [c31]William F. Cody, Laura M. Haas, Wayne Niblack, Manish Arya, Michael J. Carey, Ronald Fagin, Myron Flickner, Denis Lee, Dragutin Petkovic, Peter M. Schwarz, Joachim Thomas, Mary Tork Roth, John H. Williams, Edward L. Wimmers:
Querying Multimedia Data from Multiple Repositories by Content: the Garlic Project. VDB 1995: 17-35 - 1994
- [j46]Ronald Fagin, Joseph Y. Halpern:
Reasoning About Knowledge and Probability. J. ACM 41(2): 340-367 (1994) - [j45]Ronald Fagin:
A Quantitative Analysis of Modal Logic. J. Symb. Log. 59(1): 209-252 (1994) - [c30]Ronald Fagin, Joseph Y. Halpern, Yoram Moses, Moshe Y. Vardi:
An Operational Semantics for Knowledge Bases. AAAI 1994: 1142-1147 - [c29]Ronald Fagin:
Comparing the Power of Monadic NP Games. LCC 1994: 414-425 - [e4]Ronald Fagin:
Proceedings of the 5th Conference on Theoretical Aspects of Reasoning about Knowledge, Pacific Grove, CA, USA, March 1994. Morgan Kaufmann 1994 [contents] - 1993
- [j44]C. J. Date, Ronald Fagin:
Response to "Remarks on Two New Theorems of Date and Fagin". SIGMOD Rec. 22(1): 57-58 (1993) - [j43]Ronald Fagin:
Finite-Model Theory - A Personal Perspective. Theor. Comput. Sci. 116(1): 3-31 (1993) - [c28]Ronald Fagin, Larry J. Stockmeyer, Moshe Y. Vardi:
On Monadic NP vs. Monadic co-NP (Extended Abstract). SCT 1993: 19-30 - 1992
- [j42]Joseph Y. Halpern, Ronald Fagin:
Two Views of Belief: Belief as Generalized Probability and Belief as Evidence. Artif. Intell. 54(2): 275-317 (1992) - [j41]Ronald Fagin, Joseph Y. Halpern, Moshe Y. Vardi:
What Can Machines Know? On the Properties of Knowledge in Distributed Systems. J. ACM 39(2): 328-376 (1992) - [j40]Ronald Fagin, Joseph Y. Halpern, Moshe Y. Vardi:
What Is an Inference Rule? J. Symb. Log. 57(3): 1018-1045 (1992) - [j39]C. J. Date, Ronald Fagin:
Simple Conditions for Guaranteeing Higher Normal Forms in Relational Databases. ACM Trans. Database Syst. 17(3): 465-476 (1992) - [c27]Ronald Fagin, John Geanakoplos, Joseph Y. Halpern, Moshe Y. Vardi:
The Expressive Power of the Kierarchical Approach to Modeling Knowledge and Common Knowledge. TARK 1992: 229-244 - 1991
- [j38]Ronald Fagin, Joseph Y. Halpern:
Uncertainty, belief, and probability. Comput. Intell. 7: 160-173 (1991) - [j37]Ronald Fagin, Joseph Y. Halpern, Moshe Y. Vardi:
A Model-Theoretic Analysis of Knowledge. J. ACM 38(2): 382-428 (1991) - 1990
- [j36]Ronald Fagin, Joseph Y. Halpern, Nimrod Megiddo:
A Logic for Reasoning about Probabilities. Inf. Comput. 87(1/2): 78-128 (1990) - [j35]Miklós Ajtai, Ronald Fagin:
Reachability Is Harder for Directed than for Undirected Finite Graphs. J. Symb. Log. 55(1): 113-150 (1990) - [c26]Joseph Y. Halpern, Ronald Fagin:
Two Views of Belief: Belief as Generalized Probability and Belief as Evidence. AAAI 1990: 112-119 - [c25]Ronald Fagin:
Finite-Model Theory - a Personal Perspective. ICDT 1990: 3-24 - [c24]Ronald Fagin, Joseph Y. Halpern, Moshe Y. Vardi:
What is an inference rule? Jerusalem Conference on Information Technology 1990: 391-401 - [c23]Ronald Fagin, Joseph Y. Halpern, Moshe Y. Vardi:
A Nonstandard Approach to the Logical Omniscience Problem. TARK 1990: 41-55 - [c22]Ronald Fagin, Joseph Y. Halpern:
A new approach to updating beliefs. UAI 1990: 347-374
1980 – 1989
- 1989
- [j34]Joseph Y. Halpern, Ronald Fagin:
Modelling Knowledge and Action in Distributed Systems. Distributed Comput. 3(4): 159-177 (1989) - [c21]Ronald Fagin, Joseph Y. Halpern:
Uncertainty, Belief, and Probability. IJCAI 1989: 1161-1167 - 1988
- [j33]Ronald Fagin, Joseph Y. Halpern:
I'm OK if you're OK: On the notion of trusting communication. J. Philos. Log. 17(4): 329-354 (1988) - [c20]Joseph Y. Halpern, Ronald Fagin:
Modelling Knowledge and Action in Distributed Systems. Concurrency 1988: 18-32 - [c19]Miklós Ajtai, Ronald Fagin:
Reachability Is Harder for Directed than for Undirected Finite Graphs (Preliminary Version). FOCS 1988: 358-367 - [c18]Ronald Fagin, Joseph Y. Halpern, Nimrod Megiddo:
A Logic for Reasoning about Probabilities. LICS 1988: 410-421 - [c17]Ronald Fagin, Joseph Y. Halpern:
Reasoning about Knowledge and Probability. TARK 1988: 277-293 - 1987
- [j32]Ronald Fagin, Joseph Y. Halpern:
Belief, Awareness, and Limited Reasoning. . Artif. Intell. 34(1): 39-76 (1987) - [j31]Yehoshua Sagiv, Claude Delobel, Douglas Stott Parker Jr., Ronald Fagin:
Correction to "An equivalence between relational database dependencies and a fragment of propositional logic". J. ACM 34(4): 1016-1018 (1987) - [c16]Ronald Fagin, Joseph Y. Halpern:
I'm OK if You're OK: On the Notion of Trusting Communication. LICS 1987: 280-292 - 1986
- [j30]Ronald Fagin, Gabriel M. Kuper, Jeffrey D. Ullman, Moshe Y. Vardi:
Updating Logical Databases. Adv. Comput. Res. 3: 1-18 (1986) - [j29]Yoshito Hanatani, Ronald Fagin:
A Simple Characterization of Database Dependency Implication. Inf. Process. Lett. 22(6): 281-283 (1986) - [c15]Ronald Fagin, Joseph Y. Halpern, Moshe Y. Vardi:
What Can Machines Know? On the Epistemic Properties of Machines. AAAI 1986: 428-435 - [c14]Ronald Fagin, Moshe Y. Vardi:
Knowledge and Implicit Knowledge in a Distributed Environment: Preliminary Report. TARK 1986: 187-206 - 1985
- [j28]Allan Borodin, Ronald Fagin, John E. Hopcroft, Martin Tompa:
Decreasing the Nesting Depth of Expressions Involving Square Roots. J. Symb. Comput. 1(2): 169-188 (1985) - [j27]Ronald Fagin, Maria M. Klawe, Nicholas Pippenger, Larry J. Stockmeyer:
Bounded-Depth, Polynomial-Size Circuits for Symmetric Functions. Theor. Comput. Sci. 36: 239-250 (1985) - [c13]Ronald Fagin, Joseph Y. Halpern:
Belief, Awareness, and Limited Reasoning: Preliminary Report. IJCAI 1985: 491-501 - [c12]Joseph Y. Halpern, Ronald Fagin:
A Formal Model of Knowledge, Action, and Communication in Distributed Systems: Preliminary Report. PODC 1985: 224-236 - [c11]Ronald Fagin, Moshe Y. Vardi:
An Internal Semantics for Modal Logic: Preliminary Report. STOC 1985: 305-315 - 1984
- [j26]Catriel Beeri, Martin Dowd, Ronald Fagin, Richard Statman:
On the Structure of Armstrong Relations for Functional Dependencies. J. ACM 31(1): 30-46 (1984) - [j25]Marco A. Casanova, Ronald Fagin, Christos H. Papadimitriou:
Inclusion Dependencies and Their Interaction with Functional Dependencies. J. Comput. Syst. Sci. 28(1): 29-59 (1984) - [c10]Ronald Fagin, Joseph Y. Halpern, Moshe Y. Vardi:
A Model-Theoretic Analysis of Knowledge: Preliminary Report. FOCS 1984: 268-278 - [c9]Ronald Fagin, Moshe Y. Vardi:
The Theory of Data Dependencies - An Overview. ICALP 1984: 1-22 - [e3]Daniel J. Rosenkrantz, Ronald Fagin:
Proceedings of the Third ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, April 2-4, 1984, Waterloo, Ontario, Canada. ACM 1984, ISBN 0-89791-128-8 [contents] - 1983
- [j24]Ronald Fagin, John H. Williams:
A Fair Carpool Scheduling Algorithm. IBM J. Res. Dev. 27(2): 133-139 (1983) - [j23]Ronald Fagin, Moshe Y. Vardi:
Armstrong Databases for Functional and Inclusion Dependencies. Inf. Process. Lett. 16(1): 13-19 (1983) - [j22]Catriel Beeri, Ronald Fagin, David Maier, Mihalis Yannakakis:
On the Desirability of Acyclic Database Schemes. J. ACM 30(3): 479-513 (1983) - [j21]Ronald Fagin:
Degrees of Acyclicity for Hypergraphs and Relational Database Schemes. J. ACM 30(3): 514-550 (1983) - [j20]Ronald Fagin, David Maier, Jeffrey D. Ullman, Mihalis Yannakakis:
Tools for Template Dependencies. SIAM J. Comput. 12(1): 36-59 (1983) - [c8]Ronald Fagin:
Acyclic Database Schemes (of Various Degrees): A Painless Introduction. CAAP 1983: 65-89 - [c7]Ronald Fagin, Jeffrey D. Ullman, Moshe Y. Vardi:
On the Semantics of Updates in Databases. PODS 1983: 352-365 - [e2]Ronald Fagin, Philip A. Bernstein:
Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, March 21-23, 1983, Colony Square Hotel, Atlanta, Georgia, USA. ACM 1983, ISBN 0-89791-097-4 [contents] - [e1]David S. Johnson, Ronald Fagin, Michael L. Fredman, David Harel, Richard M. Karp, Nancy A. Lynch, Christos H. Papadimitriou, Ronald L. Rivest, Walter L. Ruzzo, Joel I. Seiferas:
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 25-27 April, 1983, Boston, Massachusetts, USA. ACM 1983 [contents] - 1982
- [j19]Ronald Fagin:
Horn clauses and database dependencies. J. ACM 29(4): 952-985 (1982) - [j18]Ronald Fagin, Alberto O. Mendelzon, Jeffrey D. Ullman:
A Simplified Universal Relation Assumption and Its Properties. ACM Trans. Database Syst. 7(3): 343-360 (1982) - [c6]Marco A. Casanova, Ronald Fagin, Christos H. Papadimitriou:
Inclusion Dependencies and Their Interaction with Functional Dependencies. PODS 1982: 171-176 - 1981
- [j17]Yehoshua Sagiv, Claude Delobel, Douglas Stott Parker Jr., Ronald Fagin:
An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic. J. ACM 28(3): 435-453 (1981) - [j16]J. Lawrence Carter, Ronald Fagin:
A Note on the Existence of Continuous Functionals. Theor. Comput. Sci. 16: 231-235 (1981) - [j15]Ronald Fagin:
A Normal Form for Relational Databases That Is Based on Domians and Keys. ACM Trans. Database Syst. 6(3): 387-415 (1981) - [c5]Catriel Beeri, Ronald Fagin, David Maier, Alberto O. Mendelzon, Jeffrey D. Ullman, Mihalis Yannakakis:
Properties of Acyclic Database Schemes. STOC 1981: 355-362 - 1980
- [c4]Ronald Fagin:
Horn Clauses and Database Dependencies (Extended Abstract). STOC 1980: 123-134
1970 – 1979
- 1979
- [j14]Ronald Fagin, Jürg Nievergelt, Nicholas Pippenger, H. Raymond Strong:
Extendible Hashing - A Fast Access Method for Dynamic Files. ACM Trans. Database Syst. 4(3): 315-344 (1979) - [c3]Ronald Fagin:
Normal Forms and Relational Database Operators. SIGMOD Conference 1979: 153-160 - 1978
- [j13]Malcolm C. Easton, Ronald Fagin:
Cold-Start vs. Warm-Start Miss Ratios. Commun. ACM 21(10): 866-872 (1978) - [j12]Ronald Fagin, Thomas G. Price:
Efficient Calculation of Expected Miss Ratios in the Independent Reference Model. SIAM J. Comput. 7(3): 288-297 (1978) - [j11]Ronald Fagin:
On an Authorization Mechanism. ACM Trans. Database Syst. 3(3): 310-319 (1978) - 1977
- [j10]Ronald Fagin:
The number of finite relational structures. Discret. Math. 19(1): 17-21 (1977) - [j9]Ronald Fagin:
Functional Dependencies in a Relational Data Base and Propositional Logic. IBM J. Res. Dev. 21(6): 543-544 (1977) - [j8]Ronald Fagin:
Asymptotic Miss Ratios over Independent References. J. Comput. Syst. Sci. 14(2): 222-250 (1977) - [j7]Ronald Fagin:
Multivalued Dependencies and a New Normal Form for Relational Databases. ACM Trans. Database Syst. 2(3): 262-278 (1977) - [c2]Catriel Beeri, Ronald Fagin, John H. Howard:
A Complete Axiomatization for Functional and Multivalued Dependencies in Database Relations. SIGMOD Conference 1977: 47-61 - [c1]Ronald Fagin:
The Decomposition Versus Synthetic Approach to Relational Database Design. VLDB 1977: 441-446 - 1976
- [j6]Ronald Fagin:
A Counterintuitive Example of Computer Paging. Commun. ACM 19(2): 96-97 (1976) - [j5]Ronald Fagin, Malcolm C. Easton:
The independence of miss ratio on page size. J. ACM 23(1): 128-146 (1976) - [j4]Ronald Fagin:
Probabilities on Finite Models. J. Symb. Log. 41(1): 50-58 (1976) - 1975
- [j3]Ronald Fagin:
Monadic generalized spectra. Math. Log. Q. 21(1): 89-96 (1975) - [j2]Ronald Fagin:
A two-cardinal characterization of double spectra. Math. Log. Q. 21(1): 121-122 (1975) - [j1]Ronald Fagin:
A spectrum hierarchy. Math. Log. Q. 21(1): 123-134 (1975)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-31 20:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
