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

• p13LicklyInfiniteOntologyPoster.ppt.pdf · application/pdf · 452 kbytes

• 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.