Theoretical Computer Science
Reflexive autoepistemic logic and logic programming
Proceedings of the second international workshop on Logic programming and non-monotonic reasoning
Type-logical semantics
LACL '97 Selected papers from the Second International Conference on Logical Aspects of Computational Linguistics
Towards abstract categorial grammars
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
On anaphora and the binding principles in categorial grammar
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
Journal of Logic, Language and Information
Logic programming of the displacement calculus
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
| Hi-index | 0.00 |
The displacement calculus of Morrill, Valentin and Fadda (2011) [25] aspires to replace the calculus of Lambek (1958) [13] as the foundation of categorial grammar by accommodating intercalation as well as concatenation while remaining free of structural rules and enjoying Cut-elimination and its good corollaries. Jager (2005) [11] proposes a type logical treatment of anaphora with syntactic duplication using limited contraction. Morrill and Valentin (2010) [24] apply (modal) displacement calculus to anaphora with lexical duplication and propose extension with a negation as failure in conjunction with additives to capture binding conditions. In this paper we present an account of anaphora developing characteristics and employing machinery from both of these proposals.