Scott Weinstein

Proceedings of the Provenance of Elegance in Computation - Essays Dedicated to Val Tannen, 2024

2023

Reconciling Individual Probability Forecasts✱.

[BibT_eX]

[DOI]

Aaron Roth

Alexander Tolbert

Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency, 2023

2015

Infinitary Methods in Finite Model Theory.

[BibT_eX]

[DOI]

Henry Towsner

Proceedings of the Logic Without Borders, 2015

2014

Deontic modality based on preference.

[BibT_eX]

[DOI]

CoRR, 2014

2013

Modal Logic for Preference Based on Reasons.

[BibT_eX]

[DOI]

Proceedings of the In Search of Elegance in the Theory and Practice of Computation, 2013

2012

Algorithmic analysis of array-accessing programs.

[BibT_eX]

[DOI]

Rajeev Alur

Pavol Cerný

ACM Trans. Comput. Log., 2012

Preference based on Reasons.

[BibT_eX]

[DOI]

Rev. Symb. Log., 2012

Notes on random reals

[BibT_eX]

[DOI]

CoRR, 2012

Quantified preference logic

[BibT_eX]

[DOI]

CoRR, 2012

2011

Formal Learning Theory in Context.

[BibT_eX]

[DOI]

Proceedings of the Inductive Logic, 2011

2008

Recognizing Strong Random Reals.

[BibT_eX]

[DOI]

Rev. Symb. Log., 2008

2007

Finite Model Theory and Its Applications

[BibT_eX]

[DOI]

Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-540-68804-4, 2007

Book Review.

[BibT_eX]

[DOI]

J. Log. Lang. Inf., 2007

2006

Elementary Proof of a Theorem of Jean Ville

[BibT_eX]

[DOI]

Elliott H. Lieb

CoRR, 2006

2003

Interaction between path and type constraints.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2003

2001

Constraints for Semi-structured Data and XML.

[BibT_eX]

[DOI]

SIGMOD Rec., 2001

2000

Path Constraints in Semistructured Databases.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2000

The Role of Decidability in First Order Separations over Classes of Finite Structures.

[BibT_eX]

[DOI]

Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, 2000

1999

Specifying and Reasoning about Workflows with Path Constraints.

[BibT_eX]

[DOI]

Proceedings of the Internet Applications, 5th International Computer Science Conference, 1999

Query Optimization for Semistructured Data Using Path Constraints in a Deterministic Data Model.

[BibT_eX]

[DOI]

Proceedings of the Research Issues in Structured and Semistructured Database Programming, 1999

1998

Elementary Properties of the Finite Ranks.

[BibT_eX]

[DOI]

Math. Log. Q., 1998

Path Constraints in Semistructured and Structured Databases.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1998

1997

Formal Learning Theory.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Logic and Language., 1997

1995

Infinitary Logic and Inductive Definability over Finite Structures

[BibT_eX]

[DOI]

Anuj Dawar

Inf. Comput., June, 1995

On the danger of half-truths.

[BibT_eX]

[DOI]

J. Philos. Log., 1995

Centering: A Framework for Modeling the Local Coherence of Discourse.

[BibT_eX]

Barbara J. Grosz

Aravind K. Joshi

Comput. Linguistics, 1995

<i>k</i>-universal finite graphs.

[BibT_eX]

[DOI]

Eric Rosen

Saharon Shelah

Proceedings of the Logic and Random Structures, 1995

First Order Logic, Fixed Point Logic and Linear Order.

[BibT_eX]

[DOI]

Anuj Dawar

Proceedings of the Computer Science Logic, 9th International Workshop, 1995

1994

Preservation Theorems in Finite Model Theory.

[BibT_eX]

[DOI]

Eric Rosen

Proceedings of the Logical and Computational Complexity. Selected Papers. Logic and Computational Complexity, 1994

1993

Relevant consequence and empirical inquiry.

[BibT_eX]

[DOI]

J. Philos. Log., 1993

1992

A Universal Method of Scientific Inquiry.

[BibT_eX]

[DOI]

Mach. Learn., 1992

1991

A Universal Inductive Inference Machine.

[BibT_eX]

[DOI]

J. Symb. Log., 1991

1990

Minimal Consequence in Sentential Logic.

[BibT_eX]

[DOI]

Mary-Angela Papalaskari

J. Log. Program., 1990

A Mechanical Method of Successful Scientific Inquiry.

[BibT_eX]

[DOI]

Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990

1989

Paradigms of truth detection.

[BibT_eX]

[DOI]

J. Philos. Log., 1989

On Approximate Truth.

[BibT_eX]

[DOI]

Proceedings of the Second Annual Workshop on Computational Learning Theory, 1989

1988

Synthesizing Inductive Expertise

[BibT_eX]

[DOI]

Inf. Comput., May, 1988

Mechanical Learners Pay a Price for Bayesianism.

[BibT_eX]

[DOI]

J. Symb. Log., 1988

1986

Aggregating Inductive Expertise

[BibT_eX]

[DOI]

Inf. Control., July, 1986

Identification in the limit of first order structures.

[BibT_eX]

[DOI]

J. Philos. Log., 1986

1983

The intended interpretation of intuitionistic logic.

[BibT_eX]

[DOI]

J. Philos. Log., 1983

Formal Theories of Language Acquisition: Practical and Theoretical Perspectives.

[BibT_eX]

[DOI]

Proceedings of the 8th International Joint Conference on Artificial Intelligence. Karlsruhe, 1983

Providing a Unified Account of Definite Noun Phrases in Discourse.

[BibT_eX]

[DOI]

Barbara J. Grosz

Aravind K. Joshi

Proceedings of the 21st Annual Meeting of the Association for Computational Linguistics, 1983

1982

Criteria of Language Learning

[BibT_eX]

[DOI]

Inf. Control., February, 1982

Learning Strategies

[BibT_eX]

[DOI]

Inf. Control., 1982

Ideal Learning Machines.

[BibT_eX]

[DOI]

Cogn. Sci., 1982

1981

Control of Inference: Role of Some Aspects of Discourse Structure-Centering.

[BibT_eX]

[DOI]

Aravind K. Joshi