• Home
  • Alerts
  • About
  • Services
SafeSearch:  On

Download 11_uebung_rule_systems.pdf

Contents : Semantic Web Rule Systems P. Siehndel and D. Krause IVS Semantic Web Group 13.01.2011 Exercise 1: Defeasible Rules Hans wants to buy one new Lego toy from eBay. The toy should be a Technic model und should contain a least 300 bricks. He is willing to pay up to 30 Euro if the toy has pneumatic he would pay up to 5 Euro more. If more toys ful ll his requirements he will buy the cheapest toy. If more toys are equal cheap he will buy the pneumatic toy. Create a defeasible logic program which represents these constraints/preferences. Siehndel Krause Rule Systems 13.01.2011 2/4 Solution: Defeasible Rules technicmodel(L) numberOfBricks(L Z) price(L X) pneumatic(L) cheapest(L) L L L L L is a Lego Technic toy has Z bricks has price X is a pneumatic toy is the cheapest (of the remaining) toys acceptable(L) toy L satisfies conditions r1 : acceptable(L) r 2 : technicmodel(L) acceptable(L) r 3 : numberOfBricks(L Z ) Z 300 acceptable(L) r 4 : price(L X ) X 35 acceptable(L) r 5 : price(L X ) X 30 pneumatic(L) acceptable(L) Where: r2 r1 r3 r1 r4 r1 r5 r1 Siehndel Krause Rule Systems 13.01.2011 3/4 Solution: Defeasible Rules r 6 : acceptable(L) buy (L) r 7 : cheapest(L) buy (L) r 8 : cheapest(L) pneumatic(L) buy (L) Where: r8 r7 r6 r8 Siehndel Krause Rule Systems 13.01.2011 4/4
  • Rating :      
  • Get Online Jobs!
  • File Type : .pdf
  •    
  • Length : 4 pages
  • File Size: 51 kb
  • Virus Tested : No
  • Verified : 2012-07-11
  • Source: www.kbs.uni-hannover.de
 Email File   

INFO HASH : 1da7c70e199715156fefd90bfbeacc9d6ada295e
blog comments powered by Disqus
Download now

File Size: 51 kb

Document Preview

    Other Downloads

  • 10_proof_trust_w...eb_services.pdf1.3 mb
  • 13_uebungruleml.pdf60.3 kb
  • 13_uebungrulemlsolution.pdf74.3 kb
  • uebung13_web_services.pdf70.4 kb
  • uebung14_owl-rdf-rdfs.pdf96.2 kb

    Related Keywords

  • lehre  semweb10  

  • Add Media
  • |
  • Terms of Use
  • |
  • FAQ / Help

© 2012 all rights reserved