default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDScott Weinstein
Person information
- affiliation: University of Pennsylvania, Philadelphia, PA, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c17]Siddharth Bhaskar, Steven Lindell, Scott Weinstein:
Traversal-Invariant Characterizations of Logarithmic Space. Tannen's Festschrift 2024: 2:1-2:17- 2023
- [c16]Aaron Roth
, Alexander Tolbert, Scott Weinstein:
Reconciling Individual Probability Forecasts✱. FAccT 2023: 101-110 - 2022
- [i6]Aaron Roth, Alexander Tolbert, Scott Weinstein:
Reconciling Individual Probability Forecasts. CoRR abs/2209.01687 (2022) - 2020
- [i5]Siddharth Bhaskar, Steven Lindell, Scott Weinstein:
Traversal-invariant characterizations of logarithmic space. CoRR abs/2006.07067 (2020)
2010 – 2019
- 2015
- [p2]Steven Lindell, Henry Towsner, Scott Weinstein:
Infinitary Methods in Finite Model Theory. Logic Without Borders 2015: 305-318 - 2014
- [i4]Daniel N. Osherson, Scott Weinstein:
Deontic modality based on preference. CoRR abs/1409.0824 (2014) - 2013
- [c15]Daniel N. Osherson, Scott Weinstein:
Modal Logic for Preference Based on Reasons. In Search of Elegance in the Theory and Practice of Computation 2013: 516-541 - 2012
- [j24]Daniel N. Osherson, Scott Weinstein:
Preference based on Reasons. Rev. Symb. Log. 5(1): 122-147 (2012) - [j23]Rajeev Alur, Pavol Cerný, Scott Weinstein:
Algorithmic analysis of array-accessing programs. ACM Trans. Comput. Log. 13(3): 27:1-27:29 (2012) - [i3]Daniel N. Osherson, Scott Weinstein:
Quantified preference logic. CoRR abs/1208.2921 (2012) - [i2]Daniel N. Osherson, Scott Weinstein:
Notes on random reals. CoRR abs/1209.2875 (2012) - 2011
- [r1]Daniel N. Osherson, Scott Weinstein:
Formal Learning Theory in Context. Inductive Logic 2011: 707-717
2000 – 2009
- 2009
- [c14]Rajeev Alur, Pavol Cerný, Scott Weinstein:
Algorithmic Analysis of Array-Accessing Programs. CSL 2009: 86-101 - 2008
- [j22]Daniel N. Osherson, Scott Weinstein:
Recognizing Strong Random Reals. Rev. Symb. Log. 1(1): 56-63 (2008) - 2007
- [b1]Erich Grädel, Phokion G. Kolaitis, Leonid Libkin, Maarten Marx, Joel Spencer, Moshe Y. Vardi, Yde Venema, Scott Weinstein:
Finite Model Theory and Its Applications. Texts in Theoretical Computer Science. An EATCS Series, Springer 2007, ISBN 978-3-540-00428-8, pp. 1-437 - [j21]Steven Lindell, Scott Weinstein:
Book Review. J. Log. Lang. Inf. 16(2): 233-239 (2007) - 2006
- [i1]Elliott H. Lieb, Daniel N. Osherson, Scott Weinstein:
Elementary Proof of a Theorem of Jean Ville. CoRR abs/cs/0607054 (2006) - 2003
- [j20]Peter Buneman, Wenfei Fan, Scott Weinstein:
Interaction between path and type constraints. ACM Trans. Comput. Log. 4(4): 530-577 (2003) - 2001
- [j19]Peter Buneman, Wenfei Fan, Jérôme Siméon, Scott Weinstein:
Constraints for Semi-structured Data and XML. SIGMOD Rec. 30(1): 47-45 (2001) - 2000
- [j18]Peter Buneman, Wenfei Fan, Scott Weinstein:
Path Constraints in Semistructured Databases. J. Comput. Syst. Sci. 61(2): 146-193 (2000) - [c13]Steven Lindell, Scott Weinstein:
The Role of Decidability in First Order Separations over Classes of Finite Structures. LICS 2000: 45-50
1990 – 1999
- 1999
- [c12]Peter Buneman, Wenfei Fan, Scott Weinstein:
Query Optimization for Semistructured Data Using Path Constraints in a Deterministic Data Model. DBPL 1999: 208-223 - [c11]Wenfei Fan, Scott Weinstein:
Specifying and Reasoning about Workflows with Path Constraints. ICSC 1999: 226-235 - [c10]Peter Buneman, Wenfei Fan, Scott Weinstein:
Interaction between Path and Type Constraints. PODS 1999: 56-67 - 1998
- [j17]Anuj Dawar, Kees Doets, Steven Lindell, Scott Weinstein:
Elementary Properties of the Finite Ranks. Math. Log. Q. 44: 349-353 (1998) - [c9]Peter Buneman, Wenfei Fan, Scott Weinstein:
Path Constraints in Semistructured and Structured Databases. PODS 1998: 129-138 - 1997
- [p1]Daniel N. Osherson, Dick de Jongh, Eric Martin, Scott Weinstein:
Formal Learning Theory. Handbook of Logic and Language 1997: 737-775 - 1995
- [j16]Barbara J. Grosz, Aravind K. Joshi, Scott Weinstein:
Centering: A Framework for Modeling the Local Coherence of Discourse. Comput. Linguistics 21(2): 203-225 (1995) - [j15]Anuj Dawar, Steven Lindell, Scott Weinstein:
Infinitary Logic and Inductive Definability over Finite Structures. Inf. Comput. 119(2): 160-175 (1995) - [j14]Daniel N. Osherson, Scott Weinstein:
On the danger of half-truths. J. Philos. Log. 24(1): 85-115 (1995) - [c8]Anuj Dawar, Steven Lindell, Scott Weinstein:
First Order Logic, Fixed Point Logic and Linear Order. CSL 1995: 161-177 - [c7]Eric Rosen, Saharon Shelah, Scott Weinstein:
k-universal finite graphs. Logic and Random Structures 1995: 65-77 - 1994
- [c6]Eric Rosen, Scott Weinstein:
Preservation Theorems in Finite Model Theory. LCC 1994: 480-502 - 1993
- [j13]Daniel N. Osherson, Scott Weinstein:
Relevant consequence and empirical inquiry. J. Philos. Log. 22(4): 437-448 (1993) - 1992
- [j12]Daniel N. Osherson, Michael Stob, Scott Weinstein:
A Universal Method of Scientific Inquiry. Mach. Learn. 9: 261-271 (1992) - 1991
- [j11]Daniel N. Osherson, Michael Stob, Scott Weinstein:
A Universal Inductive Inference Machine. J. Symb. Log. 56(2): 661-672 (1991) - 1990
- [j10]Mary-Angela Papalaskari, Scott Weinstein:
Minimal Consequence in Sentential Logic. J. Log. Program. 9(1): 19-31 (1990) - [c5]Daniel N. Osherson, Michael Stob, Scott Weinstein:
A Mechanical Method of Successful Scientific Inquiry. COLT 1990: 187-201
1980 – 1989
- 1989
- [j9]Daniel N. Osherson, Scott Weinstein:
Paradigms of truth detection. J. Philos. Log. 18(1): 1-42 (1989) - [c4]Daniel N. Osherson, Michael Stob, Scott Weinstein:
On Approximate Truth. COLT 1989: 88-101 - 1988
- [j8]Daniel N. Osherson, Michael Stob, Scott Weinstein:
Synthesizing Inductive Expertise. Inf. Comput. 77(2): 138-161 (1988) - [j7]Daniel N. Osherson, Michael Stob, Scott Weinstein:
Mechanical Learners Pay a Price for Bayesianism. J. Symb. Log. 53(4): 1245-1251 (1988) - 1986
- [j6]Daniel N. Osherson, Michael Stob, Scott Weinstein:
Aggregating Inductive Expertise. Inf. Control. 70(1): 69-95 (1986) - [j5]Daniel N. Osherson, Scott Weinstein:
Identification in the limit of first order structures. J. Philos. Log. 15(1): 55-81 (1986) - 1983
- [j4]Scott Weinstein:
The intended interpretation of intuitionistic logic. J. Philos. Log. 12(2): 261-270 (1983) - [c3]Barbara J. Grosz, Aravind K. Joshi, Scott Weinstein:
Providing a Unified Account of Definite Noun Phrases in Discourse. ACL 1983: 44-50 - [c2]Daniel N. Osherson, Michael Stob, Scott Weinstein:
Formal Theories of Language Acquisition: Practical and Theoretical Perspectives. IJCAI 1983: 566-572 - 1982
- [j3]Daniel N. Osherson, Michael Stob, Scott Weinstein:
Ideal Learning Machines. Cogn. Sci. 6(3): 277-290 (1982) - [j2]Daniel N. Osherson, Scott Weinstein:
Criteria of Language Learning. Inf. Control. 52(2): 123-138 (1982) - [j1]Daniel N. Osherson, Michael Stob, Scott Weinstein:
Learning Strategies. Inf. Control. 53(1/2): 32-51 (1982) - 1981
- [c1]Aravind K. Joshi, Scott Weinstein:
Control of Inference: Role of Some Aspects of Discourse Structure-Centering. IJCAI 1981: 385-387
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-06-10 20:30 CEST 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:
