Chris Pollett > Students >
Jignesh

    ( Print View )

    [Bio]

    [Project Blog]

    [CS297 Proposal]

    [Deliverable 1]

    [Deliverable 2]

    [Deliverable 3]

    [Deliverable 4]

    [CS297 Report - PDF]

    [CS298 Proposal]

    [CS298 Presentation-PDF]

    [CS298 Report-PDF]

                          

























CS298 Proposal

Extending OWL with Finite Automata Constraints

Jignesh 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

  • Wrote a Java program to Compute Stable Model Semantics
  • Installed smodels and implemented experiments with smodels and measured results of smodels for different logic programs.
  • Learned OWL and created a test OWL document.
  • Installed Prolog-based Thea library, a logic programming inference engine.
  • Implemented the Finite Automata Closure Algorithm

Schedule:

Week 1: Jan 24-Jan 31Writing CS298 Proposal.
Week2-3: Feb 1-Feb 14Deliverable 1- Create and extend OWL language to support collections.
Week 4-5: Feb 15-Feb 28Deliverable-1 due. Work on Deliverable 2- Implement finite automata closure algorithm
Week 6-7: Mar 1-Mar 14Deliverable 2 due
Week 8-9: Mar 15-Mar 28Work on Deliverable 3- Write a project report.
Week 10-11: Mar 28-Apr 10Deliverable 3 due
Week 12-13: Apr 11-Apr 24Make final changes in report and complete all documentation
Week 13-14: Apr 25-May 5Defense and final presentation

Key Deliverables:

  • Software
    • Deliverable-1: Create and develop an extension to OWL to support collections
    • Deliverable-2: Implement finite automata closure Algorithm
    • Deliverable-3: Write a Project Report
  • Report
    • Final report consisting the detailed description of software used, algorithms implemented, design patterns used in the project will be delivered. The report will also contain the prior work done in this field, and how this project is innovative and different than the work that is already done. It will also include detailed explanation of all the experiments conducted and the results produced.

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.