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] 

                          

























CS297 Proposal

Extending OWL with Finite Automata Constraints

Jignesh Borisa(jigneshborisa@gmail.com)

Advisor: Dr. Chris Pollett

Description:

In last few years, there has been quite 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 set constraints where membership in the sets can be computed by finite automata. These new types of constraints are introduced to allow for a more compact representation of problems in answer set programming. The Web Ontology Language (OWL) is designed for use by web applications that act more as intelligent agents -- they 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. The first goal of this project is to develop an extension of OWL which can handle answer set problems with finite automata constraints. The second goal is to develop an inference engine for the resulting language.

Schedule:

Week 1-2: Jan 25- Feb 6Writing CS 297 Proposal.Reading a book named Nonmonotonic Logic. Work on Deliverable 1-Write a java program to compute stable model semantics.
Week 3: Feb 7- Feb 13Deliverable 1 due
Week 4-5: Feb 14-Feb 27Work on Deliverable 2: Install and experiment with smodels
Week 6: Feb 28-Mar 6Deliverable 2 due
Week 7-8: Mar 7-Mar 20Work on Deliverable 3: Create test OWL documents and try to find a logic programming inference engine.
Week 9: Mar 21- Mar 28Deliverable 3 due
Week 10: Mar 29-Apr 5Work on Deliverable 4: Implement finite automata closure algorithm
Week 11-12: Apr 6-Apr 20Work on Deliverable 4: Implement finite automata closure algorithm
Week 13: Apr 20-May 4Deliverable 4 due
Week 14: May 5-May 12Working on Deliverable 5: Preparing CS297 Report.
Week 15: May 13-May 19CS297 Report due

Deliverables:

The full project will be done when CS298 is completed. The following will be done by the end of CS297:

1. Write a Java program to compute stable model semantics.

2. Install and experiment with smodels.

3. Create test OWL documents and try to find a logic programming inference engine.

4. Implement finite automata closure algorithms.

5. Write a CS297 report.

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.