Pioject Pioposal: P0SL to u-P0SL

Hokinq tbe Positionol-SlotteJ lonquoqe Befeosible

1eom #1
uoolel lotlmet
noolo Almotoltl
usmoo All

losttoctot notolJ 8oley

Table of Contents
lnLroducLlon 3
Cb[ecLlves 3
MeLhodology 3
ro[ecL 1ools 4
An1L8 4
An1L8Works 1he An1L8 Cul uevelopmenL LnvlronmenL 4
Lcllpse 3
CC [u8LW 3
Modes of LxecuLlon 6
SupporLed Languages 6
8eferences 6


ntroduction
9slLlonal loLLed anguage or CSL ls a rule based language LhaL provldes a more human readable
formaL for web rules lL ls compaLlble and converLlble wlLh Lhe more generlc xml based 8uleML whlch
has a formaL more sulLed for machlne readablllLy 1he currenL verslon of CSL needs some modlflcaLlon
Lo brlng lLs synLax more ln llne wlLh Lhe new verslon of 8uleML unlform 8esource ldenLlflers (u8l) has
been renamed Lo Lhe more approprlaLe lnLerneL 8esource ldenLlfler (l8l) 1he synLax Lo Lype a varlable
or lndependenL has been changed from a colon () Lo a double haL () 1hls wlll allow us Lo use Lhe
colon as a namespace ldenLlfler as lL ls belng used ln 8uleML
Cne Lhlng CSL currenLly lacks ls a mechanlsm for deflnlng defeaslble rules uefeaslble loglc allows
cerLaln rules Lo overrlde oLher rules 8y lncludlng a superlorlLy llsL of whlch rule beaLs whlch we are able
Lo deflne Lhe prlorlLy of our rules and allow knowledgebases whlch have an lncompleLe undersLandlng
of Lhelr domaln Lo funcLlon ln an approprlaLe manner 1hls sorL of prlorlLlzaLlon of rules ls lmporLanL Lo
pracLlcal appllcaLlons such as knowledgebases ln Lhe domalns of law and buslness lL ls also useful for
onLology lnLegraLlon where confllcLlng lnformaLlon arlses naLurally" 1
b|ectives
urrenLly CSL ls aL verslon 091 our pro[ecL wlll modlfy Lhe grammar Lo allgn lL wlLh Lhe changes LhaL
occurred beLween 8uleML 091 and 10 We wlll Lhen add funcLlonallLy Lo CC [urew Lo read CSL 10
and make lLs defaulL ouLpuL when LranslaLlng 8uleML Lo CSL Lo be verslon 10
AnoLher purpose of our pro[ecL wlll be Lo wrlLe a defeaslble CSL grammar 1he grammar wlll be
creaLed by Laklng Lhe updaLed CSL 10 grammar and addlng supporL for rule labels superlorlLy
relaLlons and addlng synLax Lo denoLe wheLher a rule ls sLrlcL defeaslble or a defeaLer
Metbodology
O use Lhe An1L8Works Lo deflne Lhe orlglnal CSL grammar ln a way LhaL lL lnLeracLs wlLh !ava
lnsLead of yLhon
O updaLe Lhe grammar accordlng Lo new sLandards for CSL 10 as ln Lhe use of l8l and PA1PA1

O CeneraLe Lhe grammar`s lexer parser and Lokens and lnLegraLe Lhem lnLo CC [u8LW Lo
lmplemenL Lhe new CSL sLandard
O lmplemenL Lhe pedesLrlan (slmple) verslon of Lhe grammar ln Lhe prevlous uCSL grammar
Powever lL ls lacklng ln key areas such as rule labels and confllcLlng llLerals as well as rule
formaLs
O uevelop a new grammar for uCSL as envlsloned ln reference 3
O uevelop a uCSL grammar from scraLch Lo be able Lo Lackle uCSL sLaLemenLs however
lmplemenLaLlon of Lhe flnlshed grammar lnLo a sofLware package can be lmplemenLed ln fuLure
work

ro|ect Tools
ANTLR
-oLher @ool for anguage ecognlLlon (An1L8) ls a language Lool LhaL provldes a framework for
consLrucLlng recognlzers compllers and LranslaLors from grammaLlcal descrlpLlons conLalnlng acLlons ln
a varleLy of LargeL languages An1L8 auLomaLes Lhe consLrucLlon of language recognlzers lrom a formal
grammar An1L8 generaLes a program LhaL deLermlnes wheLher senLences conform Lo LhaL language ln
oLher words lLs a program LhaL wrlLes oLher programs 8y addlng code snlppeLs Lo Lhe grammar Lhe
recognlzer becomes a LranslaLor or lnLerpreLer An1L8 provldes excellenL supporL for lnLermedlaLeform
Lree consLrucLlon Lree walklng LranslaLlon and provldes sophlsLlcaLed auLomaLlc error recovery and
reporLlng
An1L8s popularlLy comes down Lo Lhe facL LhaL lL saLlsfles Lhe followlng fundamenLal requlremenLs
rogrammers wanL Lhe Lools Lhey choose Lo
1 Lmploy mechanlsms Lhey undersLand
2 8e sufflclenLly powerful Lo solve Lhelr problem
3 8e flexlble
4 AuLomaLe Ledlous Lasks
3 CeneraLe ouLpuL LhaL ls easlly folded lnLo Lhelr appllcaLlon
An1L8 has a conslsLenL synLax for speclfylng lexers parsers and Lree parsers
ANTLRWorks: Tbe ANTLR CU Development Environment
An1L8Works ls a novel grammar developmenL envlronmenL for An1L8 v3 grammars wrlLLen by !ean
8oveL (wlLh suggesLed use cases from 1erence arr) lL comblnes an excellenL grammaraware edlLor
wlLh an lnLerpreLer for rapld proLoLyplng and a languageagnosLlc debugger for lsolaLlng grammar
errors An1L8Works helps ellmlnaLe grammar nondeLermlnlsms one of Lhe mosL dlfflculL problems for
beglnners and experLs allke by hlghllghLlng nondeLermlnlsLlc paLhs ln Lhe synLax dlagram assoclaLed
wlLh a grammar An1L8Works goal ls Lo make grammars more accesslble Lo Lhe average programmer
lmprove malnLalnablllLy and readablllLy of grammars by provldlng excellenL grammar navlgaLlon and
refacLorlng Lools and address Lhe mosL common quesLlons and problems encounLered by grammar
developers
1 Why ls Lhls grammar fragmenL nondeLermlnlsLlc?
2 uoes Lhls rule maLch a sample lnpuL?
3 Why ls Lhls grammar lmproperly maLchlng Lhls compleLe lnpuL?
4 Why ls Lhere a synLax error glven Lhls lnpuL?
3 Why ls Lhere no synLax error glven Lhls ungrammaLlcal lnpuL?

llgure 41 An1L8Works
Eclipse
Lcllpse ls an open source communlLy whose pro[ecLs are focused on bulldlng an open developmenL
plaLform comprlsed of exLenslble frameworks Lools and runLlmes for bulldlng and for deploylng and
managlng sofLware across Lhe llfecycle
1he Lcllpse ro[ecL was orlglnally creaLed by l8M ln november 2001 and supporLed by a consorLlum
of sofLware vendors 1he Lcllpse loundaLlon was creaLed ln !anuary 2004 as an lndependenL noLfor
proflL corporaLlon Lo acL as Lhe sLeward of Lhe Lcllpse communlLy
1he Lcllpse loundaLlon provldes four servlces Lo Lhe Lcllpse communlLy
1 l1 lnfrasLrucLure
2 l ManagemenL
3 uevelopmenL rocess
4 LcosysLem uevelopmenL

|DREW
CC [u8LW ls a deducLlve reasonlng englne for Lhe 8uleML web rule language lL ls an Cb[ecL CrlenLed
exLenslon Lo [u8LW CC [u8LW lmplemenLs Cb[ecL CrlenLed exLenslons Lo 8uleML whlch lnclude
1 Crder SorLed 1ypes
2 SloLs
3 Cb[ecL ldenLlflers
CC [u8LW ls wrlLLen ln Lhe !ava programmlng language (1esLed wlLh verslon 160)

Modes of Execution
Bottom-Up
8oLLomup execuLlon ls used Lo lnfer all derlvable knowledge from a seL of clauses (forward reasonlng)
op-own
1opdown execuLlon ls used Lo solve a query on Lhe knowledge base (backward reasonlng)
upported Languages

CSL ls a oslLlonal SloLLed Language LhaL lmplemenLs 8uleML shorLhand (slmllar Lo prolog)
aW
CC [u8LW supporLs Lhe xML synLax of 8uleML

References
1 u8uLvlL A uefeaslble Loglc 8easoner for Lhe SemanLlc Web hLLp//lplscsdauLhgr/sysLems/dr
devlcehLml
2 CSL An lnLegraLed oslLlonalSloLLed Language for SemanLlc Web knowledge Parold 8oley 11
May 2004 hLLp//rulemlorg/submlsslon/rulemlshorLaLlonhLml
3 LfsLraLlos konLopoulos nlck 8asslllades Crlgorls AnLonlou vlsuallzlng SemanLlc Web proofs of
defeaslble loglc ln Lhe u8uLvlL sysLem knowledge8ased SysLem" volume 24 lssue 3 Aprll 2011
ages 406419 lSSn 09307031 101016/[knosys201012001
hLLp//wwwsclencedlrecLcom/sclence/arLlcle/pll/S0930703110001733
4 An1L8 1erence arr hLLp//wwwanLlrorg/
3 8oley Parold lnLegraLlng oslLlonal and SloLLed knowledge on Lhe SemanLlc Web
!ournal of Lmerglng 1echnologles ln Web lnLelllgence vol 2 no 4 (2010) nov 2010 343333