*banner
 

Practical Ontologies with Infinite Lattices
Ben Lickly, Charles Shelton, Beth Osyk

Citation
Ben Lickly, Charles Shelton, Beth Osyk. "Practical Ontologies with Infinite Lattices". Talk or presentation, 16, February, 2011; Poster presented at the Ninth Biennial Ptolemy Miniconference, Berkeley, CA.

Abstract
Ontology analysis is a powerful technique for allowing model builders to define and run static analyses dealing with any type of information that they see fit for their particular domain. These domains are typically represented as finite lattices, but certain types of infinite lattices offer more power and precision. This poster presents a motivating example of one case in which infinite lattices allow for a simpler, more structured, and understandable analysis.

Electronic downloads

Citation formats  
  • HTML
    Ben Lickly, Charles Shelton, Beth Osyk. <a
    href="http://chess.eecs.berkeley.edu/pubs/828.html"><i>Practical
    Ontologies with Infinite Lattices</i></a>, Talk
    or presentation,  16, February, 2011; Poster presented at
    the <a
    href="http://ptolemy.eecs.berkeley.edu/conferences/11"
    >Ninth Biennial Ptolemy Miniconference</a>,
    Berkeley, CA.
  • Plain text
    Ben Lickly, Charles Shelton, Beth Osyk. "Practical
    Ontologies with Infinite Lattices". Talk or
    presentation,  16, February, 2011; Poster presented at the
    <a
    href="http://ptolemy.eecs.berkeley.edu/conferences/11"
    >Ninth Biennial Ptolemy Miniconference</a>,
    Berkeley, CA.
  • BibTeX
    @presentation{LicklySheltonOsyk11_PracticalOntologiesWithInfiniteLattices,
        author = {Ben Lickly and Charles Shelton and Beth Osyk},
        title = {Practical Ontologies with Infinite Lattices},
        day = {16},
        month = {February},
        year = {2011},
        note = {Poster presented at the <a
                  href="http://ptolemy.eecs.berkeley.edu/conferences/11"
                  >Ninth Biennial Ptolemy Miniconference</a>,
                  Berkeley, CA.},
        abstract = {Ontology analysis is a powerful technique for
                  allowing model builders to define and run static
                  analyses dealing with any type of information that
                  they see fit for their particular domain. These
                  domains are typically represented as finite
                  lattices, but certain types of infinite lattices
                  offer more power and precision. This poster
                  presents a motivating example of one case in which
                  infinite lattices allow for a simpler, more
                  structured, and understandable analysis.},
        URL = {http://chess.eecs.berkeley.edu/pubs/828.html}
    }
    

Posted by Christopher Brooks on 18 Feb 2011.
Groups: ptolemy
For additional information, see the Publications FAQ or contact webmaster at chess eecs berkeley edu.

Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.

©2002-2018 Chess