menu
{ "item_title" : "Combining First-Order Logic and Logic Programming Using Fol-programs", "item_author" : [" Michael Felderer "], "item_description" : "The integration of knowledge bases in classical first-order logic (and in particular of ontologies in various description logics) with rule languages rooted in logic programming is receiving considerable attention in the context of current efforts around Semantic-Web languages. Towards this integration we introduce fol-programs, which combine logic programs under the answer set and the wellfounded semantics with first-order logic knowledge bases and which generalize dl-programs, a closely related approach combining description logics with rules. Therefore, we define a syntax and a semantics for fol-programs, namely we define minimal model, strong answer set, weak answer set and well-founded semantics for fol-programs, to properly generalize the semantics of ordinary logic programs to fol-programs. We then show computational properties of fol-programs and prove that fol-programs are more expressive than dl-programs. Finally, we present our implementation of the well-founded semantics of fol-programs based on the deductive database engine Ontobroker and the automated theorem prover for first-order logic Vampire and discuss representative reasoning experiments on it.", "item_img_path" : "https://covers3.booksamillion.com/covers/bam/3/63/903/325/3639033256_b.jpg", "price_data" : { "retail_price" : "52.92", "online_price" : "52.92", "our_price" : "52.92", "club_price" : "52.92", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Combining First-Order Logic and Logic Programming Using Fol-programs|Michael Felderer

Combining First-Order Logic and Logic Programming Using Fol-programs

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

The integration of knowledge bases in classical first-order logic (and in particular of ontologies in various description logics) with rule languages rooted in logic programming is receiving considerable attention in the context of current efforts around Semantic-Web languages. Towards this integration we introduce fol-programs, which combine logic programs under the answer set and the wellfounded semantics with first-order logic knowledge bases and which generalize dl-programs, a closely related approach combining description logics with rules. Therefore, we define a syntax and a semantics for fol-programs, namely we define minimal model, strong answer set, weak answer set and well-founded semantics for fol-programs, to properly generalize the semantics of ordinary logic programs to fol-programs. We then show computational properties of fol-programs and prove that fol-programs are more expressive than dl-programs. Finally, we present our implementation of the well-founded semantics of fol-programs based on the deductive database engine Ontobroker and the automated theorem prover for first-order logic Vampire and discuss representative reasoning experiments on it.

This item is Non-Returnable

Details

  • ISBN-13: 9783639033250
  • ISBN-10: 3639033256
  • Publisher: VDM Verlag Dr. Mueller E.K.
  • Publish Date: May 2008
  • Dimensions: 9 x 6 x 0.24 inches
  • Shipping Weight: 0.36 pounds
  • Page Count: 116

Related Categories

You May Also Like...

    1

BAM Customer Reviews