From posl to d posl making the positional slotted language defeasible
Download
1 / 18

From POSL to d-POSL: Making the Positional-Slotted Language Defeasible - PowerPoint PPT Presentation


  • 111 Views
  • Uploaded on

Daniel Latimer Team 1 Hanin Almutairi Chaudhry Usman Ali. From POSL to d-POSL: Making the Positional-Slotted Language Defeasible. Advisors: Nick Bassiliades, Efstratios Kontopoulos Instructor: Dr. Harold Boley. PROJECT DEVELOPMENT MODEL. POSL.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' From POSL to d-POSL: Making the Positional-Slotted Language Defeasible' - alma


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
From posl to d posl making the positional slotted language defeasible

  • Daniel Latimer

  • Team 1 HaninAlmutairi

  • Chaudhry Usman Ali

From POSL to d-POSL: Making the Positional-Slotted Language Defeasible

Advisors: Nick Bassiliades, Efstratios Kontopoulos

Instructor: Dr. Harold Boley



POSL

  • POSL integrates positional and slotted knowledge for humans e.g. Prolog’s positional and F-logic’s slotted knowledge.

Positional Notation:

shipment(PC,47.5,BostonMos,LondonSciM).(Prolog Inspired)

Slotted Notation:

shipment(cargo->PC;price->47.5,source->BostonMos;dest->LondonSciM).(F-Logic Inspired)

Positional-slotted Notation:

shipment(PC,47.5;source->BostonMos;dest->LondonSciM).

: -> ^^ URI ->IRI

POSL

POSL 1.0


Posl flow
POSL FLOW

Changes implemented in original POSL.g to tackle updates.

ANTLR

POSL

POSL 1.0


Defeasible logic
Defeasible Logic

  • “Defeasible logic, originally created by Donald Nute with a particular concern about efficiency and implementation, is a simple and efficient rule based non-monotonic formalism. Over the years the logic has been developed and extended, and several variants have been proposed”.

  • “The main intuition of the logic is to be able to derive “plausible” conclusions from partial and sometimes conflicting information”. 


Kinds of rules
Kinds of Rules

  • There are three kinds of rules in defeasible logic, each represented

  • by a different arrow:



Antlr
ANTLR

  • “ANTLR, ANother Tool for Language Recognition, is a language tool that provides a framework for constructing recognizers, interpreters, compilers, and translators from grammatical descriptions containing actions in a variety of target languages”.

Lexer

ANTLR

EBNF

Grammar

Parser


How it works
How it works

Stream of Characters

LEXER

Tokens

PARSER

Interpretation of tokens according to rules




Oo jdrew modifications
OO jDREW modifications

  • Update the Converter application

  • Current features:

  • Convert RuleML 0.88/0.91

  • to POSL 0.91

  • Convert POSL 0.91 to

  • RuleML 0.88 or 0.91


Oo jdrew modifications1
OO jDREW modifications

  • Upgraded Functionality

  • 1. Upgrade POSL

  • 0.91 to 1.0

  • 2. Convert RuleML0.88/

  • 0.91/1.0 to POSL 1.0

  • 3. Functionality to upgrade

  • POSL 0.91 to 1.0

  • 4. Convert POSL 1.0 to

  • RuleML 0.88 or 0.91/1.0


Oo jdrew modifications2
OO jDREW modifications

  • Demonstration


Oo jdrew modifications3
OO jDREW modifications

  • To accomplish this:

  • Update the POSL input field

  • - Generate LEXER and PARSER of modified grammar using ANTLR 2.7.5

  • Added support for legacy code - POSL 0.91

  • - Created a “POSL 0.91 to 1.0 button”

  • Convert RuleML to POSL 1.0 instead of 0.91


Conclusions
Conclusions

  • Changes implemented in POSL to 1.0.

  • Functionality updated in OO jDREW.

  • Current d-POSL grammar based on EBNF presented in,

  • Kontopoulos, Efstratios and Bassiliades, Nick and Antoniou, Grigoris: Visualizing Semantic Web proofs of defeasible logic in the DR-DEVICE system (April, 2011) http://dl.acm.org/citation.cfm?id=1942399

  • A test rig to label input according to specification in the grammar has been implemented.

  • http://d-posl.wikispaces.com/file/view/demoDpos_fat.jar


Future work
Future Work

  • Further work can be done in d-POSL to refine the grammar according to the requirements.

  • d-POSL grammar can be implemented into a stand alone application.


References
References

  • Boley, Harold. "Integrating Positional and Slotted Knowledge on the Semantic Web". Journal of Emerging Technologies in Web Intelligence (Nov 2010). 343-353.

  • Kontopoulos, Efstratios and Bassiliades, Nick and Antoniou, Grigoris: "Visualizing Semantic Web proofs of defeasible logic in the DR-DEVICE system". Knowledge-Based Systems (April 2011). 406-419.

  • Parr, Terrence. The Definitive ANTLR Reference: Building Domain-Specific Languages. 2007.


ad