Ronald Fagin

From MaRDI portal
Person:388219

Available identifiers

zbMath Open fagin.ronaldDBLPf/RonaldFaginWikidataQ93124 ScholiaQ93124MaRDI QIDQ388219

List of research outcomes





PublicationDate of PublicationType
On the number of quantifiers as a complexity measure2024-08-06Paper
Comparing the power of monadic NP games2023-12-12Paper
A nonstandard approach to the logical omniscience problem2022-09-21Paper
Recursive Programs for Document Spanners2022-07-21Paper
New foundations of reasoning via real-valued first-order logics2022-06-30Paper
A Declarative Framework for Linking Entities2021-11-25Paper
Declarative Cleaning of Inconsistencies in Information Extraction2021-11-25Paper
Knowledge-based programs2020-12-02Paper
Expressive power of entity-linking frameworks2019-05-02Paper
Expressive Power of Entity-Linking Frameworks2018-07-18Paper
Knowledge-based programs2017-09-29Paper
A Declarative Framework for Linking Entities2017-06-13Paper
An algorithmic view of voting2016-10-20Paper
Document spanners: a formal approach to information extraction2016-03-24Paper
Compactly encoding unstructured inputs with differential compression2015-12-07Paper
Query strategies for priced information (extended abstract)2014-09-26Paper
Random walks with “back buttons” (extended abstract)2014-09-26Paper
Probabilistic data exchange2014-02-17Paper
Solutions and query rewriting in data exchange2013-12-19Paper
Composition with Target Constraints2012-04-02Paper
The structure of inverses in schema mappings2011-05-16Paper
Epistemic privacy2011-05-16Paper
Data exchange: getting to the core2008-12-21Paper
Inverting schema mappings2008-12-21Paper
Comparing Partial Rankings2007-09-06Paper
Data exchange: semantics and query answering2005-06-10Paper
https://portal.mardi4nfdi.de/entity/Q46619712005-03-30Paper
https://portal.mardi4nfdi.de/entity/Q44712702004-07-28Paper
Comparing Top k Lists2004-01-08Paper
Optimal aggregation algorithms for middleware.2003-08-19Paper
https://portal.mardi4nfdi.de/entity/Q44145362003-07-25Paper
Random walks with ``back buttons2003-05-06Paper
A nonstandard approach to the logical omniscience problem2003-02-04Paper
Query strategies for priced information2002-09-12Paper
https://portal.mardi4nfdi.de/entity/Q45425492002-08-01Paper
The closure of monadic NP2000-08-27Paper
A formula for incorporating weights into scoring rules2000-08-21Paper
Combining fuzzy information from multiple systems2000-02-17Paper
Common knowledge revisited1999-06-24Paper
The hierarchical approach to modeling knowledge and common knowledge1999-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42189321998-11-15Paper
On winning strategies in Ehrenfeucht-Fraïssé games1998-10-22Paper
Comparing the Power of Games on Graphs1998-05-10Paper
https://portal.mardi4nfdi.de/entity/Q43535571997-09-10Paper
Efficiently extendible mappings for balanced data distribution1996-08-12Paper
On monadic NP vs monadic co-NP1995-09-17Paper
https://portal.mardi4nfdi.de/entity/Q48454721995-09-11Paper
Reasoning about knowledge and probability1995-02-13Paper
What can machines know?1994-08-21Paper
A model-theoretic analysis of knowledge1994-08-21Paper
Finite-model theory -- A personal perspective1994-06-05Paper
A quantitative analysis of modal logic1994-05-18Paper
https://portal.mardi4nfdi.de/entity/Q46946851993-06-29Paper
What is an inference rule?1993-04-01Paper
Two views of belief: Belief as generalized probability and belief as evidence1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39793881992-06-26Paper
A logic for reasoning about probabilities1992-06-25Paper
Reachability is harder for directed than for undirected finite graphs1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57504231989-01-01Paper
Modelling knowledge and action in distributed systems1989-01-01Paper
Belief, awareness, and limited reasoning1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34767901988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38147971988-01-01Paper
I'm OK if you're OK: On the notion of trusting commmunication1988-01-01Paper
Correction to “An equivalence between relational database dependencies and a fragment of propositional logic”1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47282891986-01-01Paper
A simple characterization of database dependency implication1986-01-01Paper
Bounded-depth, polynomial-size circuits for symmetric functions1985-01-01Paper
Decreasing the nesting depth of expressions involving square roots1985-01-01Paper
Inclusion dependencies and their interaction with functional dependencies1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36772031984-01-01Paper
On the Structure of Armstrong Relations for Functional Dependencies1984-01-01Paper
On the Desirability of Acyclic Database Schemes1983-01-01Paper
Armstrong databases for functional and inclusion dependencies1983-01-01Paper
Degrees of acyclicity for hypergraphs and relational database schemes1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33091021983-01-01Paper
Tools for Template Dependencies1983-01-01Paper
Horn clauses and database dependencies1982-01-01Paper
A simplied universal relation assumption and its properties1982-01-01Paper
An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic1981-01-01Paper
A normal form for relational databases that is based on domains and keys1981-01-01Paper
A note on the existence of continuous functionals1981-01-01Paper
Efficient Calculation of Expected Miss Ratios in the Independent Reference Model1978-01-01Paper
Cold-start vs. warm-start miss ratios1978-01-01Paper
Functional Dependencies in a Relational Database and Propositional Logic1977-01-01Paper
The number of finite relational structures1977-01-01Paper
Asymptotic miss ratios over independent references1977-01-01Paper
Probabilities on finite models1976-01-01Paper
A counterintuitive example of computer paging1976-01-01Paper
The independence of miss ratio on page size1976-01-01Paper
A spectrum hierarchy1975-01-01Paper
Monadic generalized spectra1975-01-01Paper
A two‐cardinal characterization of double spectra1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40581321974-01-01Paper
Representation theory for a class of denumerable Markov chains1968-01-01Paper

Research outcomes over time

This page was built for person: Ronald Fagin