Sciweavers

2858 search results - page 361 / 572
» Logics with Aggregate Operators
Sort
View
ICDT
2009
ACM
125views Database» more  ICDT 2009»
16 years 7 months ago
How big must complete XML query languages be?
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...
Clemens Ley, Michael Benedikt
ICFP
2006
ACM
16 years 6 months ago
Type-theoretic design patterns
The development of design patterns in object-oriented programming aims at capturing good software design in a re-usable generic form. However, design patterns are not expressible ...
Ondrej Rypacek, Roland Carl Backhouse, Henrik Nils...
WOLLIC
2007
Springer
16 years 18 days ago
Symmetries in Natural Language Syntax and Semantics: The Lambek-Grishin Calculus
In this paper, we explore the Lambek-Grishin calculus LG: a symmetric version of categorial grammar based on the generalizations of Lambek calculus studied in Grishin [1]. The voca...
Michael Moortgat
EACL
1993
ACL Anthology
15 years 7 months ago
Tuples, Discontinuity, and Gapping in Categorial Grammar
This paper solves some puzzles in the formalisation of logic for discontinuity in categorial grammar. A ‘tuple’ operation introduced in [Solias, 1992] is defined as a mode of...
Glyn Morrill, Teresa Solias
NDJFL
1998
105views more  NDJFL 1998»
15 years 6 months ago
Idempotent Full Paraconsistent Negations are not Algebraizable
Using methods of abstract logic and the theory of valuation, we prove that there is no paraconsistent negation obeying the law of double negation and such that ¬(a ∧ ¬a) is a t...
Jean-Yves Béziau