Chris Pollett >
Students > [Bio] |
CS298 ProposalExtending OWL with Finite Automata ConstraintsJignesh Borisa(jigneshborisa@gmail.com) Advisor: Dr. Chris Pollett Description: In the last few years, there has been quite a lot of progress in the theory and practice of logic programming. In particular, a new area called answer set programming has arisen which can be viewed as a fusion of logic programming with Stable Model Semantics (SLP). Answer set programming is capable of handling practical search problems arising in applications. One recent extension to answer set programming is to allow infinite sets and constraints where membership in the sets can be computed by finite automata. New types of constraints are introduced that allow for a more compact representation of problem in answer set programming. The Web Ontology Language (OWL) is designed for use by applications that need to process the content of information instead of just presenting information to humans. The web ontology language describes the hierarchical organization of ideas in a domain in a way that can be parsed and understood by software. OWL does not support collections. The goal of this project is to create and develop an extension of OWL which can handle answer set problems with finite automata constraints and the second goal of the project is to implement finite automata closure algorithm to map. CS297 Results
Schedule:
Key Deliverables:
References: [2009] Automata and Answer Set Programming. Victor Marek, Jeffery B. Remmel. [2000] Smodels: A System for Answer Set Programming. Llkka Niemela, Patrick Simons, Tommie Syrjanen. [2005] Logic programming with infinite sets. Douglas Cenzer, Jeffery B. Remmel, Victor Marek. [2003] Putting OWL in order: Pattern for sequences in OWL. Nice Drummond, Alan Rector, Robert Stevent, Georgina Moulton. [2005] OWL-AA: Enriching OWL with instance recognition semantics for automated semantic annotation. Yihong Ding, David Embley, Stephen Liddle. |