9 citations · 15 across the 6 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
cs.LO2020
Traversal-invariant characterizations of logarithmic space
Siddharth Bhaskar, Steven Lindell, Scott Weinstein
We give a novel descriptive-complexity theoretic characterization of L and NL computable queries over finite structures using traversal invariance. We summarize this as (N)L = FO +…
cs.LO2014★ 4 cited
Deontic modality based on preference
Daniel Osherson, Scott Weinstein
Deontic modalities are here defined in terms of the preference relation explored in our previous work (Osherson and Weinstein, 2012). Some consequences of the system are discussed.
cs.LO2012★ 1 cited
Quantified preference logic
Daniel Osherson, Scott Weinstein
The logic of reason-based preference advanced in Osherson and Weinstein (2012) is extended to quantifiers. Basic properties of the new system are discussed.