Publications
2022
- H. Bunt, M. Amblard, J. Bos, K. Fort, Ph. de Groote, B.
Guillaume, C. Li, P. Ludmann, M. Musiol, S. Pavlova, G.
Perrier, and S. Pogodalla. Quantification
Annotation in ISO 24617-12, Second Draft. In N.
Calzolari, F. Béchet, Hélène Mazo, J. Odijk, S. Piperidis, Ph.
Blache, K. Choukri, C. Cieri, Th. Declerck, S. Goggi, H.
Isahara, B. Maegaard, and J. Mariani, editors, Proceedings
of the 13th Language Resources and Evaluation Conference
(LREC 2022), pages 3407–3416. European Language
Resources Association, 2022.
- Ph. de Groote. Ty2
revisited. In HyLo 2022 - Workshop on Hybrid Logic
and Applications, Chania, Greece, April
2022. (slides)
- Ph. de Groote. Deriving
formal semantic representations from dependency structures
—Extended Abstract— . In D. Bekki, editor, LENLS19 -
Logic and Engineering of Natural Language Semantics 19,
online proceedings, pages 87–91, Tokyo, Japan, November
2022.
- P. Ludmann, S. Pogodalla, and Ph. de Groote. Multityped
Abstract Categorial Grammars and Their Composition. In
A. Ciabattoni, E. Pimentel, and R. J. G. B. de Queiroz,
editors, WoLLIC 2022 - 28th International Workshop on
Logic, Language, Information, and Computation, volume
13468 of Lecture Notes in Computer Science, pages 105–122.
Springer, 2022.
- M. Musiol, M. Rebuschi, S. Buchel, A. Lecomte, Ph. de
Groote, and M. Amblard. Le
problème de l’analyse des troubles de la pensée dans le
discours avec la personne schizophrène : proposition
méthodologique. L’Évolution Psychiatrique,
87(2):347–369, 2022.
2021
- M. Amblard, M. Boritchev, and Ph. de Groote. An
inquisitive account of wh-questions through event semantics.
In LACL 2021 - Logical Aspects of Computational
Linguistics, Montpellier (online), France, December
2021.
- M. Amblard, K. Fort, B. Guillaume, Ph. de Groote, C. Li, P.
Ludmann, M. Musiol, S. Pavlova, G. Perrier, and S. Pogodalla.
The
Annotators Did Not Agree on Some of the Guidelines Examples.
In ISA 2021 - 17th Workshop on Interoperable Semantic
Annotation, Groningen/Virtual, Netherlands, June 2021.
- M. Boritchev and Ph. de Groote. On
dialogue modeling: a dynamic epistemic inquisitive approach.
In N. Okazaki, K. Yada, K. Satoh, and K. Mineshima, editors, JSAI-isAI
2020 Workshops, JURISIN, LENLS 2020 Workshops, Virtual
Event, November 15–17, 2020, Revised Selected Papers,
volume 12758 of Lecture Notes in Computer Science, pages
21–36,
Springer, 2021.
- Ph. de Groote and V. Richard. Embedding
Intensional Semantics into Inquisitive Semantics. In H.
Björklund and F. Drewes, editors, Proceedings of the 17th
Meeting on the Mathematics of Language, MoL 2021, pages
64–74. ACL, 2021.
- J. Maršík, M. Amblard, and Ph. de Groote. Introducing
(|λ|), a
λ-calculus for effectful computation. Theoretical
Computer Science, 869:108–155, 2021.
2020
- M. Amblard, C. Beysson, Ph. de Groote, B. Guillaume, and S.
Pogodalla. A
French version of the FraCaS test suite. In Proceedings
of the Twelfth Language Resources and Evaluation Conference,
pages 5887–5895, Marseille, France, May 2020. European
Language Resources Association.
- W. Babonnaud and Ph. de Groote. Lexical
selection, coercion, and record types. In LENLS17 :
Logic & Engineering of Natural Language Semantics,
Online, Japan, November 2020.
- M. Boritchev and Ph. de Groote. On dialogue modeling: a
dynamic epistemic inquisitive approach. In LENLS17 : Logic
& Engineering of Natural Language Semantics, Online,
Japan, November 2020.
2019
- Ph. de Groote, F. Drewes, G. Penn, editors. MOL
2019,
the 16th Meeting on the Mathematics of Language,
Toronto, Canada, July 18-19, 2019, Proceedings of the
conference. Association for Computational Linguistics (ACL),
2019.
2018
- Ph. de Groote. New Progress in Continuation-Based
Dynamic Logic. In K. Angelov, K. Liefke, R. Loukanova,
M. Moortgat, S. Tojo, editors, LACompLing2018 - Symposium
on Logic and Algorithms in Computational Linguistics,
Stockholm, Sweden, August 2018.
2017
- C. Beysson, S. Blind, Ph. de Groote and B. Guillaume. Generalized
quantifiers and dynamicity. In QUAD: QUantifiers And
Determiners, ESSLLI 2017 workshop, Toulouse, July 17–21,
2017.
- M. Kanazawa, Ph. de Groote, and M. Sadrzadeh, editors. MOL 2017, the 15th Meeting on the
Mathematics of Language, London, UK, July 13-14,
2017, Proceedings of the conference. Association for
Computational Linguistics (ACL), 2017.
2016
- Ph. de Groote. Lambek
Categorial Grammars as Abstract Categorial Grammars. In
Proceedings of the Thirtienth International Workshop of
Logic and Engineering of Natural Language Semantics (LENLS
13), JSAI, 2016.
- S. Qian, Ph. de Groote, and M. Amblard. Modal Subordination in Type Theoretic
Dynamic Logic. Linguistic issues in Language
Technology, 14(1): 1–54, 2016.
- M. Amblard, Ph. de Groote, S. Pogodalla, and C. Retoré,
editors. Logical
Aspects of Computational Linguistics. Celebrating 20 Years
of LACL (1996-2016), 9th International Conference,
LACL 2016, Nancy, France, December 5-7, 2016, Proceedings.
Volume 10054 of Lecture Notes in Computer Science,
Springer, 2016.
2015
- Ph. de Groote. Modularity
and compositionality: The case of temporal modifiers. In
S. D’Antonio, M. Moroney, and C.-R. Little, editors, Semantics
and Linguistic Theory (SALT), volume 25, pages 656–675.
LSA and CLC Publications, 2015.
- Ph. de Groote. Abstract
Categorial Parsing as Linear Logic Programming. In M.
Kuhlmann, M. Kanazawa, G. M. Kobele, editors, Proceedings
of the 14th Meeting on the Mathematics of Language, MoL 2015,
pages 15–25. ACL, 2015.
- Ph. de Groote. Proof-Theoretic
Aspects of the Lambek-Grishin Calculus. In V. de Paiva,
R. J. G. B. de Queiroz, L. S. Moss, D. Leivant, A. Grisi de
Oliveira, editors, Logic, Language, Information, and
Computation – 22nd International Workshop, WoLLIC 2015,
volume 9160 of Lecture Notes in Computer Science,
pages 109–123, Springer 2015.
- Ph. de Groote. On
Logical Relations and Conservativity. In M. Kanazawa, L.
S. Moss, V. de Paiva, editors, Third Workshop on Natural
Language and Computer Science, NLCS@ICALP/LICS 2015,
volume 32 of EPiC Series in Computing, pages 1–11,
EasyChair, 2015.
- Ph. de Groote, and Y. Winter. A
Type-Logical Account of Quantification in Event Semantics.
In T. Murata, K. Mineshima, and D. Bekki, editors, New
Frontiers in Artificial Intelligence, JSAI-isAI 2014
Workshops, LENLS, JURISIN, and GABA, Kanagawa, Japan,
October 27-28, 2014, Revised Selected Papers, volume
9067 of Lecture Notes in Artificial Intelligence,
pages 53–65, Springer, 2015.
2014
- L. Danlos, Ph. de Groote, and S. Pogodalla. A
Type-Theoretic Account of Neg-Raising Predicates in Tree
Adjoining Grammars. In Y. Nakano, K. Satoh, and D.
Bekki, editors, New Frontiers in Artificial Intelligence,
JSAI-isAI 2013 Workshops, LENLS, JURISIN, MiMI, AAA, and DDS,
Kanagawa, Japan, October 27-28, 2013, Revised Selected Papers,
volume 8417 of Lecture Notes in Artificial Intelligence,
pages 3–16, Springer, 2014.
2013
2012
- C. Blom, Ph. de Groote, Y. Winter, and J. Zwarts. Implicit
Arguments:
Event Modification or Option Type Categories? In M.
Aloni, V. Kimmelman, F. Roelofsen, G. W. Sassoon, K. Schulz
and M. Westera , editors, Logic,
Language and Meaning, 18th Amsterdam Colloquium,
Amsterdam , The Netherlands, December 19- 21, 2011, Revised
Selected Papers, volume 7218 of Lecture Notes in Computer Science, pages
240–250, Springer, 2012.
- Ph. de Groote and M.-J. Nederhof, editors. Formal Grammar,
15th and 16th International Conferences, FG 2010, Copenhagen,
Denmark, August 2010, FG 2011, Ljubljana, Slovenia, August
2011, Revised Selected Papers. Volume 7395 of Lecture Notes in Computer
Science, Springer, 2012.
2011
- Ph. de Groote, S. Pogodalla and C. Pollard. About
Parallel and Syntactocentric Formalisms: A Perspective from
the Encoding of Convergent Grammar into Abstract Categorial
Grammar. Fundamenta
Informaticae, 106(2-4): 211-231, 2011.
- Ph. deGroote, M. Eggand and L.Kallmeyer, editors. Formal Grammar,
14th International Conference, FG 2009, Bordeaux, France, July
25-26, 2009, Revised Selected Papers. Volume 5591 of Lecture Notes in Artificial
Intelligence, Springer, 2011.
2010
2009
- Ph. de Groote, S. Pogodalla, and C. Pollard. On
the Syntax-Semantics Interface: From Convergent Grammar to
Abstract Categorial Grammar. In H. Ono, M. Kanazawa, R.
de Queiroz, editors, Logic, Language,
Information and Computation, 16th International Workshop,
WoLLIC 2009, volume 5514 of Lecture Notes in Computer Science, pages
182–196, Springer, 2009.
2007
- Ph. de Groote, S. Maarek, and R. Yoshinaka. On
Two Extensions of Abstract Categorial Grammars. In N.
Dershowitz and A. Voronkov, editors, Logic for Programming, Artificial Intelligence, and
Reasoning, 14th International Conference, LPAR 2007,
volume 4790 of Lecture
Notes in Computer Science, pages 273–287, Springer,
2007.
- Ph. de Groote and S. Maarek. Type-theoretic
Extensions of Abstract Categorial Grammars. In New
Directions in Type-theoretic Grammars (NDTTG 2007),
ESSLLI 2007 workshop, Dublin, August 6–10, 2007.
2006
2005
2004
- Ph. de Groote, B. Guillaume, and S. Salvati. Vector
Addition
Tree Automata. In 19th IEEE Symposium on Logic in Computer Science
(LICS 2004), pages 64–73. IEEE Computer Society,
2004.
- Ph. de Groote and S. Salvati. Higher-Order
Matching
in the Linear lambda-Calculus with Pairing. In J.
Marcinkowski and A. Tarlecki, editors, Computer Science Logic, 18th
International Workshop, volume 3210 of Lecture Notes in Computer
Science, pages 220–234. Springer Verlag, 2004.
- Ph. de Groote, S. Pogodalla. On
the Expressive Power of Abstract Categorial Grammars:
Representing Context-Free Formalisms. Journal of Logic, Language and
Information 13(4): 421–438, 2004.
2003
- Ph. de Groote and S. Pogodalla. m-Linear
Context-Free
Rewriting
Systems as Abstract Categorial Grammars. In R. T.
Oehrle and J. Rogers, editors, proceedings of Mathematics of Language, (MOL-8),
pages 71–80, 2003.
- S. Salvati and Ph. de Groote. On
the Complexity of Higher-Order Matching in the Linear
lambda-Calculus. In R. Nieuwenhuis, editor, 14th International Conference on
Rewriting Techniques and Applications, volume 2706 of
Lecture Notes in Computer
Science, pages 234–245. Springer Verlag, 2003.
2002
2001
- Ph. de Groote. Type
raising,
continuations, and classical logic. In R. van Rooy
and M. Stokhof, editors, Thirteenth
Amsterdam Colloquium, pages 97-101, Institute for
Logic, Language and Computation, Universiteit van Amsterdam,
2001.
- G. Bonfante and Ph. de Groote. Stochastic
Lambek
Categorial Grammars. In proceedings of sixth Conference on Formal
Grammars and the Seventh Meeting on Mathematics of Language,
Electronic Notes in
Theoretical Computer Science 53, Elsevier, 2001.
- Ph. de Groote. Towards
Abstract
Categorial Grammars. In: Association for Computational Linguistics, 39th
Annual Meeting and 10th Conference of the European Chapter,
Proceedings of the Conference, pages 148–155,
Toulouse, France, 2001.
- Ph. de Groote. Strong
Normalization
of Classical Natural Deduction with Disjunction. In S.
Abramsky, editor, Fifth
International Conference on Typed Lambda Calculi and
Applications, TLCA’01, volume 2044 of Lecture Notes in Computer
Science, pages 182–196. Springer Verlag, 2001.
- Ph. de Groote, G. Morrill and C. Retoré, editors. Logical Aspects of
Computational Linguistics, Fourth International
Conference, LACL’01. Volume 2099 of Lecture Notes in Artificial Intelligence,
Springer Verlag, 2001.
2000
- Ph. de Groote. Proof-search
in
implicative linear logic as a matching problem. In
M. Parigot and A. Voronkov, editors, 7th International Conference on Logic Programming
and Automated Reasoning, volume 1955 of Lecture Notes in Artificial
Intelligence, pages 257–274. Springer Verlag, 2000.
- Ph. de Groote. Higher-order
linear
matching is NP-complete. In L. Bachmair, editor, 11th International Conference on
Rewriting Techniques and Applications, volume 1833 of
Lecture Notes in Computer
Science, pages 127–140. Springer Verlag, 2000.
1999
- Ph. de Groote. A
dynamic programming approach to categorial deduction.
In H. Ganzinger, editor, 16th
International Conference on Automated Deduction,
volume 1632 of Lecture
Notes in Artificial Intelligence, pages 1–15.
Springer Verlag, 1999.
- Ph. de Groote. On
the Strong Normalisation of Natural Deduction with
Permutation-Conversions. In P. Narendran and M.
Rusinowitch, editors, 10th
International Conference on Rewriting Techniques and
Applications, RTA’99, volume 1631 of Lecture Notes in Computer
Science, pages 45–59. Springer Verlag, 1999.
- Ph. de Groote. The
Non-associative Lambek calculus with product in polynomial
time. In N. V. Murray, editor, Automatic Reasoning with
Analytic Tableaux and Related Methods, volume 1617 of
Lecture Notes in Artificial
Intelligence, pages 128–139. Springer Verlag, 1999.
- Ph. de Groote. An
algebraic correctness criterion for intuitionistic
multiplicative proofnets. Theoretical Computer Science,
224:115–134, 1999.
1998
1997
- Ph. de Groote. On
the expressive power of the Lambek calculus extended with a
structural modality — Abstract. In R. de Queiroz,
4th Workshop on Logic,
Language, Information and Computation, WoLLIC’97, Logic Journal of the IGPL,
Volume 6, pages 886–889, November 1997.
- Ph. de Groote. An
algebraic correctness criterion for intuitionistic
proof-nets. In S. Adian and A. Nerode, editors, 4th International Symposium on
Logical Foundations of Computer Science,
Yaroslavl’97, volume 1234 of Lecture Notes in Computer Science, pages
130–140. Springer Verlag,
1997.
- D. Bechet, Ph. de Groote, and C. Retoré. A
complete axiomatisation of the inclusion of series-parallel
partial orders. In H. Comon, editor, 8th International Conference on
Rewriting Techniques
and Applications, RTA’97, volume 1232 of Lecture Notes in Computer
Science, pages 230–240. Springer Verlag, 1997.
- D. Bechet and Ph. de Groote. Constructing
different
phonological
bracketings from a proof net. In C. Retoré,
editor, Logical Aspects of
Computational Linguistics, LACL’96, volume 1328 of Lecture Notes in Artificial
Intelligence, pages 118–133. Springer Verlag, 1997.
- Ph. de Groote and J.R. Hindley, editors. Typed Lambda Calculi and
Applications, Third International Conference on
Typed Lambda Calculi and Applications, TLCA’97, volume 1210 of
Lecture Notes in Computer
Science, Springer Verlag, 1997.
1996
- Ph. de Groote. Partially
commutative
linear logic: sequent calculus and phase semantics.
In M. Abrusci and C. Casadio, editors, Proofs and Linguistic Categories,
Proceedings 1996 Roma Workshop. Cooperativa Libraria
Universitaria Editrice Bologna, 1996.
- Ph. de Groote and C. Retoré. On
the semantic readings of proof nets. In Geert-Jan
Kruijff, Glyn Morrill, and Dick Oehrle, editors, Formal Grammar, pages
57–70, Prague, August 1996. FoLLI.
1995
- Ph. de Groote. Linear
logic with Isabelle: pruning the proof search tree.
In P. Baumgartner, R. Hähnle and J. Possega, editors, 4th Workshop on Theorem Proving
with Analytic Tableaux and Related Methods, volume
918 of Lecture Notes in
Artificial Intelligence, pages 263–277. Springer
Verlag, 1995.
- Ph. de Groote. A
simple calculus of exception handling. In M.
Dezani-Ciancaglini and G. Plotkin, editors, Second International Conference
on Typed Lambda Calculi and Applications, TLCA’95,
volume 902 of Lecture Notes
in Computer Science, pages 201–215. Springer Verlag,
1995.
- Ph. de Groote, editor. The Curry-Howard Isomorphism, volume 8 of Cahier du centre de Logique.
Université Catholique de Louvain, Academia, 1995.
1994
- Ph. de Groote. Strong
normalization
in a non-deterministic typed lambda-calculus. In
A. Nerode and Yu. V. Matiyasevich, editors, 3rd international symposium on
Logical Foundations of Computer Science, St Petersburg’94,
volume 813 of Lecture Notes
in Computer Science, pages 142–152. Springer Verlag,
1994.
- Ph. de Groote. On
the relation between the lambda-mu-calculus and the
syntactic theory of sequential control. In F.
Pfenning, editor, 5th
International Conference on Logic Programming and Automated
Reasoning, LPAR’94, volume 822 of Lecture Notes in Artificial
Intelligence, pages 31–43. Springer Verlag, 1994.
- Ph. de Groote. A
CPS-translation of the lambda-mu-calculus. In S.
Tison, editor, 19th
International Colloquium on Trees in Algebra and
Programming, CAAP’94, volume 787 of Lecture Notes in Computer
Science, pages 85–99. Springer Verlag, 1994.
1993
- Ph. de Groote. The
conservation theorem revisited. In M. Bezem and
J.F. Groote, editors, International
Conference on Typed Lambda Calculi and Applications, TLCA’93,
volume 664 of Lecture Notes
in Computer Science, pages 163–178. Springer Verlag,
1993.
- Ph. de Groote. Defining
lambda-typed
lambda-calculi by axiomatizing the typing relation.
In P. Enjalbert, A. Finkel, and K.W. Wagner, editors, 10th Annual Symposium on
Theoretical Aspects of Computer Science, STACS’93,
volume 665 of Lecture Notes
in Computer Science, pages 712–723. Springer Verlag,
1993.
1992
- Ph. de Groote. Denotations
for
classical proofs – preliminary results. In A.
Nerode and M. Taitslin, editors, Second International Symposium on Logical
Foundations of Computer Science, Tver’92, volume 620
of Lecture Notes in
Computer Science, pages 105–116. Springer Verlag,
1992.
1991
- Ph. de Groote. Nederpelt’s calculus extended with a
notion of context as a logical framework. In G. Huet and
G. Plotkin, editors, Logical
Frameworks, pages 69–86. Cambridge University Press,
1991.
- Ph. de Groote. Définition
et
Propriétés d’un métacalcul de représentation de théories.
Thèse de doctorat, Université Catholique de Louvain, Faculté
des Sciences Appliquées, Février 1991.