sign in · help · news · about ·

BibSonomy :: author :: Faron ::

tag user group author concept BibTeX key search:all

The blue social bookmark and publication sharing system.

>
|
<

bookmarks

bookmarks per page: 5 10 20 50 100

RSS BibTeX RDF more

publications

(101)

<< < 1 | 2 | 3 > >>

Using Ontologies of Software: Example of R Functions Management.
Pascal Neveu, Caroline Domerg, Juliette Fabre, Vincent Négre, Emilie Gennari, Anne Tireau, Olivier Corby, Catherine Faron-Zucker, and Isabelle Mirbel RED, volume 6799 of Lecture Notes in Computer Science, page 43-56. Springer, (2010)
to dblp by dblp on Jan 31, 2012, 12:00 AM
URL | BibTeX
The Nonexistence of Finite Axiomatisations for CCS Congruences
Faron Moller LICS, page 142-153. IEEE Computer Society, (1990)
to dblp by dblp on Jan 20, 2012, 12:00 AM
URL | BibTeX
On the Expressive Power of CTL.
Faron Moller, and Alexander Moshe Rabinovich LICS, page 360-368. IEEE Computer Society, (1999)
to dblp by dblp on Jan 20, 2012, 12:00 AM
URL | BibTeX
Decomposability, Decidability and Axiomatisability for Bisimulation Equivalence on Basic Parallel Processes
Søren Christensen, Yoram Hirshfeld, and Faron Moller LICS, page 386-396. IEEE Computer Society, (1993)
to dblp by dblp on Jan 20, 2012, 12:00 AM
URL | BibTeX
Solearn: A Social Learning Network.
Khaled Halimi, Hassina Seridi, and Catherine Faron-Zucker CASoN, page 130-135. IEEE, (2011)
to dblp by dblp on Dec 20, 2011, 12:00 AM
URL | BibTeX
On the Computational Complexity of Bisimulation.
Faron Moller, and Scott A. Smolka ACM Comput. Surv. 27(2):287-289 (1995)
to dblp by dblp and 1 other user on Dec 5, 2011, 12:00 AM
URL | BibTeX
Logics for Concurrency: Structure Versus Automata.
Faron Moller ACM Comput. Surv. 28(4es):50 (1996)
to dblp by dblp on Dec 5, 2011, 12:00 AM
URL | BibTeX
RDF/SPARQL Design Pattern for Contextual Metadata.
Olivier Corby, and Catherine Faron-Zucker Web Intelligence, page 470-473. IEEE Computer Society, (2007)
to dblp by dblp on Nov 24, 2011, 12:00 AM
URL | BibTeX
A Polynomial-time Algorithm for Deciding Equivalence of Normed Context-free Processes
Yoram Hirshfeld, Mark Jerrum, and Faron Moller FOCS, page 623-631. IEEE Computer Society, (1994)
to dblp by dblp on Oct 19, 2011, 12:00 AM
URL | BibTeX
Unique Decomposition of Processes.
Robin Milner, and Faron Moller Theor. Comput. Sci. 107(2):357-363 (1993)
to dblp by dblp on Sep 7, 2011, 12:00 AM
URL | BibTeX
Ontocompo - An Ontology-based Interactive System to Compose Applications.
Christian Brel, Anne-Marie Pinna-Dery, Catherine Faron-Zucker, Philippe Renevier-Gonin, and Michel Riveill WEBIST, page 322-327. SciTePress, (2011)
to dblp by dblp on Aug 26, 2011, 12:00 AM
URL | BibTeX
An Ontological Approach for Modeling Technical Standards for Compliance Checking.
Khalil Riad Bouzidi, Catherine Faron-Zucker, Bruno Fiés, and Nhan Le Thanh RR, volume 6902 of Lecture Notes in Computer Science, page 244-249. Springer, (2011)
to dblp by dblp on Aug 25, 2011, 12:00 AM
URL | BibTeX
Ontology-based semantic relatedness for detecting the relevance of learning resources.
Amel Yessad, Catherine Faron-Zucker, Rose Dieng-Kuntz, and Med Tayeb Laskri Interactive Learning Environments 19(1):63-80 (2011)
to dblp by dblp on Aug 23, 2011, 12:00 AM
URL | BibTeX
SweetWiki: a semantic wiki
Michel Buffa, Fabien Gandon, Peter Sander, Catherine Faron, and Guillaume Ereteo Web Semantics: Science, Services and Agents on the World Wide Web (2011)
to my_thesis ontology_engineering semantic_wiki by bluedolphin on Jul 9, 2011, 5:31 PM
URL | BibTeX
Petri Nets and Regular Processes.
Petr Jancar, Javier Esparza, and Faron Moller J. Comput. Syst. Sci. 59(3):476-503 (1999)
to dblp by dblp on Jul 5, 2011, 12:00 AM
URL | BibTeX
Deciding Bisimilarity between BPA and BPP Processes.
Petr Jancar, Antonín Kucera, and Faron Moller CONCUR, volume 2761 of Lecture Notes in Computer Science, page 157-171. Springer, (2003)
to dblp by dblp on Jul 5, 2011, 12:00 AM
URL | BibTeX
Building Concept Lattices by Learning Concepts from RDF Graphs Annotating Web Documents.
Alexandre Delteil, Catherine Faron, and Rose Dieng ICCS, volume 2393 of Lecture Notes in Computer Science, page 191-204. Springer, (2002)
to dblp by dblp and 1 other user on Jun 30, 2011, 12:00 AM
URL | BibTeX
Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds.
Petr Jancar, Antonín Kucera, Faron Moller, and Zdenek Sawa FoSSaCS, volume 2303 of Lecture Notes in Computer Science, page 172-186. Springer, (2002)
to dblp by dblp on Jun 29, 2011, 12:00 AM
URL | BibTeX
Decidable Subsets of CCS.
Søren Christensen, Yoram Hirshfeld, and Faron Moller Comput. J. 37(4):233-242 (1994)
to dblp by dblp on Jun 28, 2011, 12:00 AM
URL | BibTeX
Formal Methods in Computation.
Faron Moller Comput. J. 45(1):1 (2002)
to dblp by dblp on Jun 28, 2011, 12:00 AM
URL | BibTeX

<< < 1 | 2 | 3 > >>publications per page: 5 10 20 50 100

a gripper