1 / 17

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

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

teagan
Download Presentation

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

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. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

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

  2. PROJECT DEVELOPMENT MODEL This should be POSL 0.91

  3. POSL • POSL integrates positional and slotted knowledge for humans • (e.g.: Prolog’s positional and F-logic’s slotted knowledge) POSL uses Prolog/F-logic-combining syntax, obtaining these facts: shipment(PC,47.5;source->BostonMoS;dest->LondonSciM) : -> ^^ URI -IRI POSL POSL 1.0

  4. POSL FLOW Changes implemented in original POSL.g to tackle updates. ANTLR POSL POSL 1.0

  5. 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”. 

  6. Kinds of Rules • There are three kinds of rules in defeasible logic, each represented • by a different arrow:

  7. Features of d-POSL

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

  9. How it works Stream of Characters LEXER Tokens PARSER Interpretation of tokens according to rules

  10. Interpretation

  11. Test Rig

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

  13. OO jDREW modifications • New Features • Upgrade POSL 0.91 to 1.0 • Convert RuleML0.88/0.91 • /1.0 to POSL 1.0 • Convert POSL 1.0 to • RuleML 0.88 or 0.91/1.0

  14. OO jDREW modifications • Demonstration

  15. 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” • Translate RuleML to POSL 1.0 instead of 0.91

  16. Conclusions • Changes implemented in POSL to 1.0. • Implemented d-POSL. • Further work can be done in d-POSL to refine the grammar according to the requirements. • d-POSL can be implemented into OO jDREW which would be a more logical way of implementing it into a product rather than a standalone executable.

  17. References

More Related