7,384 research outputs found
Autumn Attic, Group exhibition curated by Katie Pratt
No full textAutumn Attic, Flowers Gallery, Shoreditch London, 12th August -18th September 2021Exhibiting Artists: SUZY BABINGTON, PRUNELLA CLOUGH, BERNARD COHEN, ANTHONY DALEY, IAN DAWSON, ADAM GILLAM, JASON GUBBIOTTI, KATIE PRATT, KATIE TRICK. Curated by Katie PrattThis exhibition brings together the works of nine artists using distinct modes of artistic enquiry to explore the alchemical shift between intention and outcome. The techniques employed in Autumn Attic range from improvisational gestures to algorithmic strategies, incorporating chance, imagination, process and error. The attic referred to in the exhibition title is a metaphor for the part of the artistic and imaginative psyche where latent ideas are given space to evolve.Work exhibited by Ian Dawson: Motisfont 4, 2021, 3D printed plastic, 30 x 54 x 29 cm. Orkney Star Stone 2021, 3D Printed plastic, 60cm x 50cm x 25cm. Cornpick, 2021, 3D printed plastic, 85 x 40 x 50 cm, <br/
Fluted Logic with Counting
Get PDFThe fluted fragment is a fragment of first-order logic in which the order of quantification of variablescoincides with the order in which those variables appear as arguments of predicates. It is knownthat the fluted fragment possesses the finite model property. In this paper, we extend the flutedfragment by the addition of counting quantifiers. We show that the resulting logic retains thefinite model property, and that the satisfiability problem for its (m + 1)-variable sub-fragmentis in m-NExpTime for all positive m. We also consider the satisfiability and finite satisfiabilityproblems for the extension of any of these fragments in which the fluting requirement applies onlyto sub-formulas having at least three free variables
Walking on Words
Get PDFAny function f with domain {1, … , m} and co-domain {1, … , n} induces a natural map from words of length n to those of length m: the ith letter of the output word (1 ≤ i ≤ m) is given by the f(i)th letter of the input word. We study this map in the case where f is a surjection satisfying the condition |f(i+1)-f(i)| ≤ 1 for 1 ≤ i < m. Intuitively, we think of f as describing a "walk" on a word u, visiting every position, and yielding a word w as the sequence of letters encountered en route. If such an f exists, we say that u generates w. Call a word primitive if it is not generated by any word shorter than itself. We show that every word has, up to reversal, a unique primitive generator. Observing that, if a word contains a non-trivial palindrome, it can generate the same word via essentially different walks, we obtain conditions under which, for a chosen pair of walks f and g, those walks yield the same word when applied to a given primitive word. Although the original impulse for studying primitive generators comes from their application to decision procedures in logic, we end, by way of further motivation, with an analysis of the primitive generators for certain word sequences defined via morphisms
From TimeML to TPL
Get PDFThis paper describes a subset of the temporal mark-up language TimeML,
and explains its relation to various formalisms found in the
literature on interval temporal logic. The subset of TimeML we
describe can be viewed as an interval temporal logic with a tractable
satisfiability problem, but very limited expressive power. Most
crucially, that logic does not permit quantification over events. The
contribution of this paper is to point out that, by choosing an
appropriate interval temporal logic, it is possible to introduce
quantification into representations of event-structure without
sacrificing decidability
Adding Transitivity and Counting to the Fluted Fragment
Get PDFWe study the impact of adding both counting quantifiers and a single transitive relation to the fluted fragment - a fragment of first-order logic originating in the work of W.V.O. Quine. The resulting formalism can be viewed as a multi-variable, non-guarded extension of certain systems of description logic featuring number restrictions and transitive roles, but lacking role-inverses. We establish the finite model property for our logic, and show that the satisfiability problem for its k-variable sub-fragment is in (k+1)-NExpTime. We also derive ExpSpace-hardness of the satisfiability problem for the two-variable, fluted fragment with one transitive relation (but without counting quantifiers), and prove that, when a second transitive relation is allowed, both the satisfiability and the finite satisfiability problems for the two-variable fluted fragment with counting quantifiers become undecidable
The Fluted Fragment with Transitivity
Get PDFWe study the satisfiability problem for the fluted fragment extended with transitive relations. We show that the logic enjoys the finite model property when only one transitive relation is available. On the other hand we show that the satisfiability problem is undecidable already for the two-variable fragment of the logic in the presence of three transitive relations
Decidability of the Logic of the Reflexive Sub-interval Relation over Finite Linear Orders
Get PDFAn interval temporal logic is a propositional, multimodal logic interpreted over interval structures of partial orders. The semantics of each modal operator are given in the standard way with respect to one of the natural accessibility relations defined on such interval structures. In this paper, we consider the modal operators based on the (reflexive) subinterval relation and the (reflexive) super-interval relation. We show that the satisfiability problems for the interval temporal logics featuring either or both of these modalities, interpreted over interval structures of finite linear orders, are all PSPACEcomplete. These results fill a gap in the known complexity results for interval temporal logics
Passive and Active Network Measurement, 5th International Workshop, PAM 2004, Antibes Juan-les-Pins, France, April 19-20, 2004, Proceedings
No full textPassive and Active Network Measurement, 5th International Workshop, PAM 2004, Antibes Juan-les-Pins, France, April 19-20, 2004, Proceedings
No full textPassive and Active Network Measurement, 5th International Workshop, PAM 2004, Antibes Juan-les-Pins, France, April 19-20, 2004, Proceedings
No full text- …
