Your SlideShare is downloading. ×
 PSOATransRun: Translating and Running PSOA RuleML via the TPTP Interchange Language for Theorem Provers
 PSOATransRun: Translating and Running PSOA RuleML via the TPTP Interchange Language for Theorem Provers
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×
Saving this for later? Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime – even offline.
Text the download link to your phone
Standard text messaging rates apply

PSOATransRun: Translating and Running PSOA RuleML via the TPTP Interchange Language for Theorem Provers

193

Published on

0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total Views
193
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
1
Comments
0
Likes
0
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
No notes for slide

Transcript

  • 1. PSOATransRunInvitedDemoRuleML2012 - RuleML Wiki http://wiki.ruleml.org/index.php?title=PSOATransRunInvitedDemoRule... From RuleML Wiki PSOATransRun: Translating and Running PSOA RuleML via the TPTP Interchange Language for Theorem Provers Gen Zou[1] Reuben Peter-Paul[1] Harold Boley[1,2] Alexandre Riazanov[3] [1]Faculty of Computer Science, University of New Brunswick, Fredericton, Canada [2]National Research Council Canada, Information and Communications Technologies [3]Department of Computer Science & Applied Statistics University of New Brunswick, Saint John, Canada Also see documentation, implementation, and sources: PSOA RuleML Wiki Page: http://wiki.ruleml.org/index.php/PSOA_RuleML PSOATransRun Online System: http://198.164.40.211:8082/psoa2tptp-trans/index.html Project Repository: http://psoa2tptp.googlecode.com For the online demo of the above PSOATransRun: We give examples of PSOA RuleML Rulebases and Queries, shown in PSOA Presentation Syntax and Controlled English Example 1: Input Rulebase: Document( Group( _Amy # _person([_married] [_bcs _mcs _phd] _job->_engineer) _f1 # _family(_Mike _Amy _child->_Fred _child->_Jane) ) ) Controlled English explaining Fact 1: _Amy # _person([_married] [_bcs _mcs _phd] _job->_engineer) (1) The entity with OID _Amy is of type _person; (2) _Amy is described by: a 1-tuple [_married] representing her marital status a 3-tuple [_bcs _mcs _phd] representing the degrees she obtained a _job slot with value _engineer representing her profession Controlled English explaining Fact 2: _f1 # _family(_Mike _Amy _child->_Fred _child->_Jane) (1) The entity with OID _f1 is of type _family; (2) _f1 is described by: a 2-tuple [_Mike _Amy] representing the couple of the family a _child slot with value _Fred representing a child of the family a _child slot with value _Jane representing another child of the family Query 1 with controlled English: _Amy # _person(_job->_engineer) Is _Amy of type _person and has a _job slot with value _engineer? Query 2 with controlled English: _Amy # _person(_job->?Job) Is _Amy of type _person and has a _job slot with value ?Job (show any bindings for ?Job) ?1 of 2 9/21/2012 5:32 PM
  • 2. PSOATransRunInvitedDemoRuleML2012 - RuleML Wiki http://wiki.ruleml.org/index.php?title=PSOATransRunInvitedDemoRule... Example 2: Input Rulebase: Document ( Group ( Forall ?X ?Y ( ?X # _person(_descendent->?Y) :- ?X # _person(_child->?Y) ) Forall ?X ?Y ?Z ( ?X # _person(_descendent->?Z) :- And(?X # _person(_child->?Y) ?Y # _person(_descendent->?Z)) ) _Tom # _person(_male _child->_Amy _job->_professor) _Eva # _person(_female _child->_Amy) _Amy # _person([_female] [_bcs _mcs _phd] _child->_Fred) _Fred # _person(_school->_UNB) ) ) Controlled English explaining Rule 1: Forall ?X ?Y ( ?X # _person(_descendent->?Y) :- ?X # _person(_child->?Y) ) A _person ?X has a _descendent slot with value ?Y if the _person ?X has a _child slot with value ?Y Controlled English explaining Rule 2: Forall ?X ?Y ?Z ( ?X # _person(_descendent->?Z) :- And(?X # _person(_child->?Y) ?Y # _person(_descendent->?Z)) ) A person ?X has a _descendent ?Z if the _person ?X has a _child ?Y and the _person ?Y has a _descendent ?Z Query 1 with controlled English: ?Ancestor # _person(_descendent->?Who) Is ?Ancestor of type _person and has a _descendent slot with value ?Who (show any bindings for ?Ancestor and ?Who) ? Query 2 with controlled English: And (?Ancestor1 # _person(_male _descendent->_Fred) ?Ancestor2 # _person(_female _descendent->_Fred)) Is ?Ancestor1 of type _person and has a 1-tuple [_male] and a _descendent slot with value _Fred, and ?Ancestor2 of type _person and has a 1-tuple [_female] and a _descendent slot with value _Fred (show any bindings for ?Ancestor1 and ?Ancestor2) ? Query 3 with controlled English: And (?Ancestor1 # _person(_male _descendent->?Who) ?Ancestor2 # _person(_female _descendent->?Who)) Is ?Ancestor1 of type _person and has a 1-tuple [_male] and a _descendent slot with value ?Who, and ?Ancestor2 of type _person and has a 1-tuple [_female] and a _descendent slot with value ?Who (show any bindings for ?Ancestor1, ?Ancestor2, and ?Who) ? Retrieved from "http://wiki.ruleml.org/index.php/PSOATransRunInvitedDemoRuleML2012" This page was last modified on 21 September 2012, at 20:31.2 of 2 9/21/2012 5:32 PM

×