Publications of Jean-Philippe Prost

Author	Title	Year	Book/Journal/Proceedings	DOI/URL
Mehdi Mirzapour and Jean-Philippe Prost and Christian Retoré	Linguistic Complexity: Introducing a New Categorial Metric [BibTeX]	2019	in Logic and Algorithms in Computational Linguistics 2018	URL
BibTeX: @inBook{Mirzapour2019, Booktitle = {Logic and Algorithms in Computational Linguistics 2018}, Author = {Mehdi Mirzapour and Jean-Philippe Prost and Christian Retoré}, Title = {Linguistic Complexity: Introducing a New Categorial Metric}, Editor = {Roussanka Loukanova}, Pages = {IN PRESS}, Publisher = {Springer}, Year = {2019}, Volume = {Studies in Computational Intelligence}, Series = {Advances in Intelligent Systems and Computing} % Url = {http://www.cambridgescholars.com/constraints-and-language}, }
Mirzapour, Mehdi and Prost, Jean-Philippe and Retor{\'e}, Christian	Categorial Proof Nets and Dependency Locality: A New Metric for Linguistic Complexity [BibTeX]	2018	in LACompLing: Logic and Algorithms in Computational Linguistics	URL
BibTeX: @inproceedings{mirzapour:lirmm-01916104, TITLE = {{Categorial Proof Nets and Dependency Locality: A New Metric for Linguistic Complexity}}, AUTHOR = {Mirzapour, Mehdi and Prost, Jean-Philippe and Retor{\'e}, Christian}, % URL = {https://hal-lirmm.ccsd.cnrs.fr/lirmm-01916104}, BOOKTITLE = {{LACompLing: Logic and Algorithms in Computational Linguistics}}, ADDRESS = {Stockholm, Sweden}, PAGES = {73--86}, YEAR = {2018}, % MONTH = Aug, KEYWORDS = {Logic ; Mathematics ; Computer science ; Computational linguistics ; Human processing} % PDF = {https://hal-lirmm.ccsd.cnrs.fr/lirmm-01916104/file/FULLTEXT01%20pages%2073%20-%2086.pdf}, % HAL_ID = {lirmm-01916104}, % HAL_VERSION = {v1}, }
Prost, J.-P., Coletta, R, & Lecoutre, C	Compilation de grammaire de propriétés pour l'analyse syntaxique par optimisation de contraintes [BibTeX]	2016	in Actes de TALN: Traitement Automatique des Langues Naturelles	URL
BibTeX: @inproceedings{prost:lirmm-01473863, TITLE = {{Compilation of a Property Grammar for Syntactic Parsing through Constraint Optimisation}}, AUTHOR = {Prost, Jean-Philippe and Coletta, Remi and Lecoutre, Christophe}, URL = {https://hal-lirmm.ccsd.cnrs.fr/lirmm-01473863}, BOOKTITLE = {{TALN: Traitement Automatique des Langues Naturelles}}, ADDRESS = {Paris, France}, YEAR = {2016}, MONTH = Jul, KEYWORDS = {Model-Theoretic Syntax ; Grammaticality Judgement ; Grammar engineering ; syntaxe par mod{\`e}les ; jugement de grammaticalit{\'e} ; ing{\'e}nierie de grammaire}, PDF = {https://hal-lirmm.ccsd.cnrs.fr/lirmm-01473863/file/taln2016-short.pdf}, HAL_ID = {lirmm-01473863}, HAL_VERSION = {v1}, }
Blache, P. & Prost, J.-P.	Model-Theoretic Syntax: Property Grammars, Status and Directions [BibTeX]	2014	in Constraints and Language. Blache, P., Christiansen, H., Dahl, V., Duchier, D. & villadsen J., J (Eds.). Cambridge Scholars Publishing, 2014, pp. 37-59 Book available at http://www.cambridgescholars.com/constraints-and-language
BibTeX: @InBook{Blache2014, Title = {Constraints and Language}, Author = {Philippe Blache and Jean-Philippe Prost}, Chapter = {Model-Theoretic Syntax: Property Grammars, Status and Directions}, Editor = {Philippe Blache and Henning Christiansen and Veronica Dahl and Denys Duchier and J{\o}rgen villadsen}, Pages = {37--59}, Publisher = {Cambridge Scholars Publishing}, Year = {2014}, Comment = {http://www.cambridgescholars.com/constraints-and-language} }
Prost, J.-P.	Exact Grammaticality Judgement of Likely Parse Tree (Jugement exact de grammaticalitï¿½ d'arbre syntaxique probable) [in French] [BibTeX]	2014	Proceedings of TALN 2014 (Volume 1: Long Papers), pp. 352-362	URL
BibTeX: @inproceedings{prost:2014:TALN, author = {Prost, Jean-Philippe}, title = {Exact Grammaticality Judgement of Likely Parse Tree (Jugement exact de grammaticalit{\'e} d'arbre syntaxique probable) [in French]}, booktitle = {Proceedings of TALN 2014 (Volume 1: Long Papers)}, month = {July}, year = {2014}, address = {Marseille, France}, publisher = {Association pour le Traitement Automatique des Langues}, pages = {352--362}, url = {http://www.aclweb.org/anthology/F14-1031} }
Prost, J.-P. & Lafourcade, M.	Pairing Model-Theoretic Syntax and Semantic Network for Writing Assistance [Abstract] [BibTeX]	2011	Proceedings of the 6th International Workshop on Constraints and Language Processing (CSLP@Context'11)	URL
Abstract: In this paper we investigate the possibility of a syntax-semantics interface between a framework for Model-Theoretic Syntax on one hand and a semantic network on the other hand. We focus on exploring the ability of such a pairing to solve a collection of grammar checking problems, with an emphasis on cases of missing words. We discuss a solution where constraint violations are interpreted as grammar errors and yield the re-generation of new candidate parses (partially unrealised) through tree operations. Follows a surface realisation phase, where missing words are filled through semantic network exploration.
BibTeX: @inproceedings{Prost2011, author = {Jean-Philippe Prost and Mathieu Lafourcade}, title = {Pairing Model-Theoretic Syntax and Semantic Network for Writing Assistance}, booktitle = {Proceedings of the 6th International Workshop on Constraints and Language Processing (CSLP@Context'11)}, year = {2011}, url = {publis/prostLafourcade2011-cslp.pdf} }
Pogodalla, S. & Prost, J.-P. (eds)	Logical Aspects of Computational Linguistics: 6th International Conference [BibTeX]	2011	Proceedings of LACL 2011
BibTeX: @proceedings{pogodalla2011logical, title={Logical Aspects of Computational Linguistics: 6th International Conference (LACL 2011)}, address={ Montpellier, France}, Month={June 29--July 1}, editor={Pogodalla, Sylvain and Prost, Jean-Philippe}, volume={6736}, year={2011}, publisher={Springer} }
Prost, J.-P.	Graded Grammaticality: a Computational Framework [BibTeX]	2010
BibTeX: @book{Prost2010, author = {Jean-Philippe Prost}, title = {Graded Grammaticality: a Computational Framework}, publisher = {LAP Lambert Academic Publishing}, year = {2010}, note = {in press} }
Tellier, I., Eshkol, I., Taalab, S. & Prost, J.-P.	POS-tagging for Oral Text with CRF and Category Decomposition [Abstract] [BibTeX]	2010	Research in Computing Science (46) : Natural Language Processing and its Applications, pp. 79ï¿½90.
Abstract: The ESLO (Enquï¿½te sociolinguistique d'Orlï¿½ans, it i.e. Sociolinguistic Survey of Orlï¿½ans) campaign gathered a large oral corpus, which was later transcribed into a text format. The purpose of this work is to assign morpho-syntactic labels to each unit of this corpus. To this end, we first studied the specificities of the labels required for oral data, and their various possible levels of description. This led to a new original hierarchical structure of labels. Then, since our new set of labels was different from any of those of existing taggers, which are usually not fit for oral data, we have built a new labelling tool using a Machine Learning approach. As a starting point, we used data labelled by Cordial and corrected by hand. We have applied CRF (Conditional Random Fields), trying to take the best possible advantage of the linguistic knowledge used to define the set of labels. We obtain an F-measure between 85 and 90, depending on the parameters.
BibTeX: @inproceedings{Tellier2010, author = {Isabelle Tellier and Iris Eshkol and Samer Taalab and Jean-Philippe Prost}, title = {POS-tagging for Oral Text with CRF and Category Decomposition}, booktitle = {Proceedings of 11th International Conference on Intelligent Text Processing and Computational Linguistics (CICling-2010)}, publisher = {Springer}, year = {2010}, note = {to appear} }
Duchier, D., Prost, J.-P. & Dao, T.-B.-H.	A Model-Theoretic Framework for Grammaticality Judgements [Abstract] [BibTeX]	2009	Proceedings of FG'09	URL
Abstract: Although the observation of grammaticality judgements is well acknowledged, their formal representation faces problems of different kinds: linguistic, psycholinguistic, logical, computational. In this paper we focus on addressing some of the logical and computational aspects, relegating the linguistic and psycholinguistic ones in the parameter space. We introduce a model-theoretic interpretation of Property Grammars, which lets us formulate numerical accounts of grammaticality judgements. Such a representation allows for both clear-cut binary judgements, and graded judgements. We discriminate between problems of Intersective Gradience (i.e., concerned with choosing the syntactic category of a model among a set of candidates) and problems of Subsective Gradience (i.e., concerned with estimating the degree of grammatical acceptability of a model). Intersective Gradience is addressed as an optimisation problem, while Subsective Gradience is addressed as an approximation problem.
BibTeX: @inproceedings{Duchier2009, author = {Denys Duchier and Jean-Philippe Prost and Thi-Bich-Hanh Dao}, title = {A Model-Theoretic Framework for Grammaticality Judgements}, booktitle = {Proceedings of FG'09}, publisher = {Springer}, year = {2009}, volume = {5591}, url = {publis/DuchierProstDao09-FG09-MTSjudgements.pdf} }
Prost, J.-P.	Grammar Error Detection with Best Approximated Parse [Abstract] [BibTeX]	2009	Proceedings of the 11th International Conference on Parsing Technologies (IWPT'09), pp. 172-175	URL
Abstract: In this paper, we propose that grammar error detection be disambiguated in generating the connected parse(s) of optimal merit for the full input utterance, in overcoming the cheapest error. The detected error(s) are described as violated grammatical constraints in a framework for Model-Theoretic Syntax (MTS). We present a parsing algorithm for MTS, which only relies on a grammar of well-formedness, in that the process does not require any extragrammatical resources, additional rules for constraint relaxation or error handling, or any recovery process.
BibTeX: @conference{Prost2009-iwpt09, author = {Jean-Philippe Prost}, title = {Grammar Error Detection with Best Approximated Parse}, booktitle = {Proceedings of the 11th International Conference on Parsing Technologies (IWPT'09)}, publisher = {Association for Computational Linguistics}, year = {2009}, pages = {172--175}, url = {http://www.aclweb.org/anthology-new/W/W09/W09-3826} }
Prost, J.-P.	Analyse relï¿½chï¿½e ï¿½ base de contraintes [Abstract] [BibTeX]	2009	Actes de TALN'09 (session poster)	URL
Abstract: [English version below] La question de la grammaticalitï¿½, et celle duale de lï¿½agrammaticalitï¿½, sont des sujets dï¿½licats ï¿½ aborder, dï¿½s lors que lï¿½on souhaite intï¿½grer diffï¿½rents degrï¿½s, tant de grammaticalitï¿½ que dï¿½agrammaticalitï¿½. En termes dï¿½analyse automatique, les problï¿½mes posï¿½s sont de lï¿½ordre de la reprï¿½sentation des connaissances, du traitement, et bien ï¿½videment de lï¿½ï¿½valuation. Dans cet article, nous nous concentrons sur lï¿½aspect traitement, et nous nous penchons sur la question de lï¿½analyse dï¿½ï¿½noncï¿½s agrammaticaux. Nous explorons la possibilitï¿½ de fournir une analyse la plus complï¿½te possible pour un ï¿½noncï¿½ agrammatical, sans lï¿½apport dï¿½information complï¿½mentaire telle que par le biais de mal-rï¿½gles ou autre grammaire dï¿½erreurs. Nous proposons une solution algorithmique qui permet lï¿½analyse automatique dï¿½un ï¿½noncï¿½ agrammatical, sur la seule base dï¿½une grammaire modï¿½le-thï¿½orique de bonne formation. Cet analyseur est prouvï¿½ gï¿½nï¿½rer une solution optimale, selon un critï¿½re numï¿½rique maximisï¿½. -- English -- The question of grammaticality, and the dual one of ungrammaticality, are topics delicate to address when interested in modeling different degrees, whether of grammaticality or ungrammaticality. As far as parsing is concerned, the problems are with regard to knowledge representation, processing, and obviously evaluation. In this paper, we concentrate on the processing aspect and we address the question of parsing ungrammatical utterances. We explore the possibility to provide a full parse for an ungrammatical utterance without relying on any kind of additional information, which would be provided by mal-rules or other error grammar. We propose an algorithmic solution in order to parse an ungrammatical utterance using only a model-theoretic grammar of well-formedness. The parser is proven to generate an optimal solution, according to a maximised criterion.
BibTeX: @inproceedings{prost2009-taln, author = {Jean-Philippe Prost}, title = {Analyse relï¿½chï¿½e ï¿½ base de contraintes}, booktitle = {Actes de TALN'09 (session poster)}, publisher = {ATALA}, year = {2009}, url = {http://www-lipn.univ-paris13.fr/taln09/pdf/TALN_47.pdf} }
Blache, P. & Prost, J.-P.	A Quantification Model of Grammaticality [Abstract] [BibTeX]	2008	Proceedings of the Fifth International Workshop on Constraints and Language Processing (CSLP2008)	URL
Abstract: The traditional binary notion of grammaticality is more and more often replaced by intermediate levels of acceptability, also called gradience. This paper aims to provide a numerical account of syntactic gradience. It introduces and investigates a numerical model with which acceptability can be predicted by factors derivable from the output of a parser. Its performance is compared to other experiments, and the fit of each model is evaluated. Our model shows a good correlation with human judgement of acceptability.
BibTeX: @inproceedings{Blache2008:cslp, author = {Blache, Philippe and Prost, Jean-Philippe}, title = {A Quantification Model of Grammaticality}, booktitle = {Proceedings of the Fifth International Workshop on Constraints and Language Processing (CSLP2008)}, year = {2008}, note = {to appear in Studies in Computational Intelligence, Springer}, url = {publis/blacheProst08-cslp.pdf} }
Prost, J.-P.	Modelling Syntactic Gradience with Loose Constraint-based Parsing [Abstract] [BibTeX]	2008	Ph.D. thesis. Macquarie University, Sydney, Australia, and Universitï¿½ de Provence, Aix-en-Provence, France (cotutelle)	URL
Abstract: The grammaticality of a sentence has conventionally been treated in a binary way: either a sentence is grammatical or not. A growing body of work, however, focuses on studying intermediate levels of acceptability, sometimes referred to as gradience. To date, the bulk of this work has concerned itself with the exploration of human assessments of syntactic gradience. This dissertation explores the possibility to build a robust computational model that accords with these human judgements. We suggest that the concepts of Intersective Gradience and Subsective Gradience introduced by Aarts for modelling graded judgements be extended to cover deviant language. Under such a new model, the problem then raised by gradience is to classify an utterance as a member of a specific category according to its syntactic characteristics. More specifically, we extend Intersective Gradience (IG) so that it is concerned with choosing the most suitable syntactic structure for an utterance among a set of candidates, while Subsective Gradience (SG) is extended to be concerned with calculating to what extent the chosen syntactic structure is typical from the category at stake. IG is addressed in relying on a criterion of optimality, while SG is addressed in rating an utterance according to its grammatical acceptability. As for the required syntactic characteristics, which serve as features for classifying an utterance, our investigation of different frameworks for representing the syntax of natural language shows that they can easily be represented in Model-Theoretic Syntax; we choose to use Property Grammars (PG), which offers to model the characterisation of an utterance. We present here a fully automated solution for modelling syntactic gradience, which characterises any well formed or ill formed input sentence, generates an optimal parse for it, then rates the utterance according to its grammatical acceptability. Through the development of such a new model of gradience, the main contribution of this work is three-fold. First, we specify a model-theoretic logical framework for PG, which bridges the gap observed in the existing formalisation regarding the constraint satisfaction and constraint relaxation mechanisms, and how they relate to the projection of a category during the parsing process. This new framework introduces the notion of loose satisfaction, along with a formulation in first-order logic, which enables reasoning about the characterisation of an utterance. Second, we present our implementation of Loose Satisfaction Chart Parsing (LSCP), a dynamic programming approach based on the above mechanisms, which is proven to always _nd the full parse of optimal merit. Although it shows a high theoretical worst time complexity, it performs sufficiently well with the help of heuristics to let us experiment with our model of gradience. And third, after postulating that human acceptability judgements can be predicted by factors derivable from LSCP, we present a numeric model for rating an utterance according to its syntactic gradience. We measure a good correlation with grammatical acceptability by human judgements. Moreover, the model turns out to outperform an existing one discussed in the literature, which was experimented with parses generated manually.
BibTeX: @phdthesis{Prost2008, author = {Jean-Philippe Prost}, title = {Modelling Syntactic Gradience with Loose Constraint-based Parsing}, school = {Macquarie University, Sydney, Australia, and Universitï¿½ de Provence, Aix-en-Provence, France (cotutelle)}, year = {2008}, note = {alternative url: http://hdl.handle.net/1959.14/28841}, url = {http://tel.archives-ouvertes.fr/tel-00352828/fr/} }
Prost, J.-P.	Numbat: Abolishing Privileges when Licensing New Constituents in Constraint-Oriented Parsing [Abstract] [BibTeX]	2006	Proceedings of the Third Workshop on Constraints and Language Processing (CSLP'06), pp. 17-24	URL
Abstract: The constraint-oriented approaches to language processing step back from the generative theory and make it possible, in theory, to deal with all types of linguistic relationships (e.g. dependency, linear precedence or immediate dominance) with the same importance when parsing an input utterance. Yet in practice, all implemented constraint-oriented parsing strategies still need to discriminate between ``important'' and ``not-so-important'' types of relations during the parsing process. In this paper we introduce a new constraint-oriented parsing strategy based on Property Grammars, which overcomes this drawback and grants the same importance to all types of relations.
BibTeX: @inproceedings{prost:2006:CSLP, author = {Prost, Jean-Philippe}, title = {Numbat: Abolishing Privileges when Licensing New Constituents in Constraint-Oriented Parsing}, booktitle = {Proceedings of the Third Workshop on Constraints and Language Processing}, publisher = {Association for Computational Linguistics}, year = {2006}, pages = {17--24}, url = {http://www.aclweb.org/anthology/W/W06/W06-0403} }
Blache, P., Christiansen, H., Dahl, V. & Prost, J.-P. (eds.)	Proceedings of CSLP-06, the 2006 Workshop on Constraints and Language Processing [BibTeX]	2006		URL
BibTeX: @proceedings{2006,, title = {Proceedings of CSLP-06, the 2006 Workshop on Constraints and Language Processing}, publisher = {Association for Computational Linguistics}, year = {2006}, Editor = {Philippe Blache and Henning Christiansen and Veronica Dahl and Jean-Philippe Prost}, Note = {hosted by CoLing/ACL 2006}, url = {http://www.aclweb.org/anthology/W/W06/#0400} }
Blache, P. & Prost, J.-P.	Gradience, Constructions and Constraint Systems (extended version) [Abstract] [BibTeX]	2005	Constraint Solving and Language Processing - CSLP 2004, pp. 74-89	URL
Abstract: This paper is concerned with the question of quantifying gradient degrees of acceptability by introducing the notion of Density in the context of constructional constraint language processing. We first present here our framework for language processing, where all linguistic knowledge is represented by means of constraints. The grammar itself is a constraint system. A constraint is a relation among categories, which encodes a linguistic property. But in contrast to more traditional constraint-based approaches, a constraint can hold and be assessed independently from the structure. In this context, we then introduce the notion of density, based on proportions of satisfied and violated linguistic properties. Our intuition is that density can be used as a means to measure fuzzy notions such as syntactic complexity or as a criterion to identify gradient levels of acceptability. We present and discuss early experimental results concerning density.
BibTeX: @incollection{blache2005:cslp, author = {Philippe Blache and Jean-Philippe Prost}, title = {Gradience, Constructions and Constraint Systems (extended version)}, booktitle = {Constraint Solving and Language Processing - CSLP 2004}, publisher = {Springer}, year = {2005}, volume = {3438}, pages = {74--89}, note = {extended version}, url = {http://halshs.archives-ouvertes.fr/docs/00/13/42/01/PDF/2124.pdf} }
Dale, R., Geldof, S. & Prost, J.-P.	Using Natural Language Generation in Automatic Route Description [Abstract] [BibTeX]	2005	Journal of Research and Practice in Information Technology Vol. 36(3), pp. 23-39	URL
Abstract: In this paper we tackle the problem of generating natural route descriptions on the basis of input obtained from a commercially available way-finding system. Our framework and architecture incorporates the use of general principles drawn from the domain of natural language generation. Through examples we demonstrate that it is possible to bridge the gap between underlying data representations and natural sounding linguistic descriptions. The work presented contributes both to the area of natural language generation and to the improvement of way-finding system interfaces.
BibTeX: @article{dale2005:JRPIT, author = {Dale, Robert and Geldof, Sabine and Prost, Jean-Philippe}, title = {Using Natural Language Generation in Automatic Route Description}, journal = {Journal of Research and Practice in Information Technology}, year = {2005}, volume = {36}, number = {3}, pages = {23--39}, url = {publis/dale-et-al2005-jrpit.pdf} }
Blache, P. & Prost, J.-P.	Gradience, Constructions and Constraint Systems [BibTeX]	2004	CSLP-04, Proceedings of the First Workshop on Constraint Solving and Language Processing, pp. 18-28	URL
BibTeX: @inproceedings{blache2004:cslp, author = {Philippe Blache and Jean-Philippe Prost}, title = {Gradience, Constructions and Constraint Systems}, booktitle = {CSLP-04, Proceedings of the First Workshop on Constraint Solving and Language Processing}, year = {2004}, pages = {18--28}, note = {prefer the extended version}, url = {publis/blacheProst04-Density.pdf} }
Dale, R., Geldof, S. & Prost, J.-P.	CORAL: using natural language generation for navigational assistance [Abstract] [BibTeX]	2003	Proceedings of the Twenty-Sixth Australasian Computer Science Conference (ACSC2003), pp. 35-44	URL
Abstract: In this paper we tackle the problem of generating natural route descriptions on the basis of input obtained from a commercially available way-finding system. Our framework and architecture incorporates the use of generic natural language generation techniques. Through examples we demonstrate that it is possible to bridge the gap between underlying representation and natural sounding descriptions. The work presented contributes both to the area of natural language generation and to the improvement of way-finding system interfaces.
BibTeX: @inproceedings{dale2003cun, author = {Dale, Robert and Geldof, Sabine and Prost, Jean-Philippe}, title = {CORAL: using natural language generation for navigational assistance}, booktitle = {Proceedings of the Twenty-Sixth Australasian Computer Science Conference (ACSC2003)}, year = {2003}, volume = {16}, pages = {35--44}, url = {publis/daleGeldofProst2003-ACSC.pdf} }
Dale, R., Geldof, S. & Prost, J.-P.	Generating more natural route descriptions [Abstract] [BibTeX]	2002	Proceedings of the 2002 Australasian Natural Language Processing Workshop, pp. 41-48	URL
Abstract: In this paper we tackle the problem of generating natural route descriptions on the basis of input obtained from a commercially available way-finding system. We adopt a standard pipelined natural language generation architecture, and focus in particular on the role of the generation subtasks of aggregation and referring expression generation in producing fluent output. Through examples we demonstrate that it is possible to bridge the gap between underlying representation and natural sounding descriptions. Further work along these lines will contribute both to the area of natural language generation and to the improvement of wayfinding system interfaces.
BibTeX: @inproceedings{dale2002:anlp, author = {Robert Dale and Sabine Geldof and Jean-Philippe Prost}, title = {Generating more natural route descriptions}, booktitle = {Proceedings of the 2002 Australasian Natural Language Processing Workshop}, year = {2002}, pages = {41--48}, url = {publis/daleGeldofProst2002-ANLP.pdf} }
Prost, J.-P.	Temporal Knowledge and Musical Perception : Application to Auditives Illusions [Abstract] [BibTeX]	1998	Proceedings of CASYS'98 : Computing Anticipatory SYStems	URL
Abstract: This paper proposes some clues for a formal framework for representing and manipulating knowledge about musical perception. Our purpose is to set up a perception model that will enable us to simulate the behaviour of an agent in listening situation. It will lead to produce an ï¿½intelligentï¿½ representation of a piece of music. We apply ourselves here to characterize intervention of Time in the musical perception in initiating a formal comparison between several models. Reasoning within a classical time logic supposes to take a priori time as a cause to describe the nature of knowledge. Our approach consists in supposing that the structure of knowledge a posteriori informs time; thus the nature of time is a consequence of the interpretation of events. This means we have to distinguish Universal Time from a bunchof Musical Times. We focus on some auditives illusions for their capacity to show particular properties of Musical Time.
BibTeX: @inproceedings{Prost1998, author = {Prost, Jean-Philippe}, title = {Temporal Knowledge and Musical Perception : Application to Auditives Illusions}, booktitle = {Proceedings of CASYS'98 : Computing Anticipatory SYStems}, publisher = {American Institute of Physics, New York, NY, USA}, year = {1998}, volume = {465}, note = {Copyright (1998) American Institute of Physics. This article may be downloaded for personal use only. Any other use requires prior permission of the author and the American Institute of Physics.}, url = {publis/prost98-casys.pdf} }
Bellot, D., Godefroid, C., Han, P., Prost, J.-P., Schlechta, K. & Wï¿½rbel, E.	A semantical approach to the concept of screened revision [BibTeX]	1997	Theoria Vol. LXIII(1-2), pp. 24-33	DOI URL
BibTeX: @article{bellot1997sac, author = {Bellot, David and Godefroid, Christophe and Han, P. and Prost, Jean-Philippe and Schlechta, Karl and Wï¿½rbel, Eric}, title = {A semantical approach to the concept of screened revision}, journal = {Theoria}, publisher = {Blackwell Synergy}, year = {1997}, volume = {LXIII}, number = {1-2}, pages = {24--33}, note = {http://www3.interscience.wiley.com/journal/120701474/abstract?CRETRY=1&SRETRY=0}, url = {http://www3.interscience.wiley.com/journal/120701474/abstract}, doi = {http://dx.doi.org/10.1111/j.1755-2567.1997.tb00738.x} }
Prost, J.-P.	Comparaison formelle de modï¿½les temporels pour la perception musicale [Abstract] [BibTeX]	1997	Masters thesis. Dï¿½partement Informatique de Luminy, Universitï¿½ de la Mï¿½diterrannï¿½e	URL
Abstract: Le but des recherches dans lesquelles s'insï¿½re ce travail est de proposer, ï¿½ terme, un cadre formel de reprï¿½sentation et de manipulation de connaissances musicales. ï¿½tablir un modï¿½le de perception devrait permettre de simuler le comportement auditif d'un agent en situation d'ï¿½coute, et conduire ï¿½ l'ï¿½laboration d'une reprï¿½sentation ``intelligente'' d'une oeuvre musicale. En particulier, nous utilisons ici des rï¿½sultats issus des sciences cognitives pour tenter de caractï¿½riser l'intervention du temps dans la perception musicale ; l'objectif de notre travail est donc d'amorcer une comparaison formelle entre diffï¿½rents modï¿½les de logique temporelle. Un premier ï¿½tat de l'art nous a conduit ï¿½ porter une attention plus particuliï¿½re sur plusieurs formalismes ; compte-tenu qu'il semble n'en exister aucun qui satisfasse toutes nos exigences, nous avons ï¿½tï¿½ amenï¿½s ï¿½ proposer que soit dï¿½fini un langage intermï¿½diaire entre tous. Les premiers rï¿½sultats que nous prï¿½sentons ici concernent une logique temporelle basï¿½e sur un raisonnement par intervalle, oï¿½ les treize opï¿½rateurs mis en ï¿½vidence par Allen sont ramenï¿½s aux deux seules opï¿½rations de succession et de superposition. Les conditions d'un recalage de notre travail dans le contexte de la thï¿½orie ï¿½tendue d'Allen-Hayes sont envisagï¿½es parmi les perspectives. Enfin un autre aspect de ce mï¿½moire concerne l'implï¿½mentation possible d'un tel modï¿½le.
BibTeX: @mastersthesis{Prost1997, author = {Prost, Jean-Philippe}, title = {Comparaison formelle de modï¿½les temporels pour la perception musicale}, school = {Dï¿½partement Informatique de Luminy, Universitï¿½ de la Mï¿½diterrannï¿½e}, year = {1997}, url = {publis/prost97-dea.pdf} }

Jean-Philippe Prost

Maître de Conférences en Informatique, spécialité Linguistique Computationnelle

Aix-Marseille Université et Université de Montpellier