default search action
Search dblp for Publications
export results for "Francis Giannesini"
@article{DBLP:journals/robotica/Rose88a, author = {J. A. Rose}, title = {\emph{Prolog} by Francis Giannesini and Henry Kanoui, Robert Pasero and Michel van Caneghem\emph{Prolog Programming for Artificial Intelligence} by Ivan Bratko, both published by Addison-Wesley Publishers, Wokingham, England, 1986, (both at {\textsterling}19.95)}, journal = {Robotica}, volume = {6}, number = {2}, pages = {170}, year = {1988}, url = {https://doi.org/10.1017/S0263574700004197}, doi = {10.1017/S0263574700004197}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/robotica/Rose88a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/daglib/0070707, author = {Francis Giannesini and Henry Kanoui and Robert Pasero and Michel Van Caneghem}, title = {Prolog}, series = {International computer science series}, publisher = {Addison-Wesley}, year = {1986}, url = {http://dl.acm.org/citation.cfm?id=21751}, isbn = {0-201-12911-6}, timestamp = {Mon, 29 Aug 2011 01:00:00 +0200}, biburl = {https://dblp.org/rec/books/daglib/0070707.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jlp/GiannesiniC84, author = {Francis Giannesini and Jacques Cohen}, title = {Parser Generation and Grammar Manipulation Using Prolog's Infinite Trees}, journal = {J. Log. Program.}, volume = {1}, number = {3}, pages = {253--265}, year = {1984}, url = {https://doi.org/10.1016/0743-1066(84)90013-X}, doi = {10.1016/0743-1066(84)90013-X}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jlp/GiannesiniC84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.