Constraint LTL Satisfiability Checking without Automata

This paper introduces a novel technique to decide the satisfiability of formulae written in the language of Linear Temporal Logic with Both future and past operators and atomic formulae belonging to constraint system D (CLTLB(D) for short). The technique is based on the concept of bounded satisfiability, and hinges on an encoding of CLTLB(D) formulae into QF-EUD, the theory of quantifier-free equality and uninterpreted functions combined with D. Similarly to standard LTL, where bounded model-checking and SAT-solvers can be used as an alternative to automata-theoretic approaches to model-checking, our approach allows users to solve the satisfiability problem for CLTLB(D) formulae through SMT-solving techniques, rather than by checking the emptiness of the language of a suitable automaton A_{\phi}. The technique is effective, and it has been implemented in our Zot formal verification tool.Comment: 39 page

Jamesian Pluralism and Moral Conflict

While most pragmatists view themselves as pluralists of one sort or another, Talisse and Aikin argue thatthe two views are, in fact, "not compatible". However, while their charge may be true of the types of pluralism that they consider, these pluralisms all presuppose a type of realism about value that the pragmatic pluralist need not accept. In what follows, I'll argue that the 'non-realist' account of value that one finds in James underwrites a type of pluralism that is both substantial and compatible with pragmatis