Deductive Databases by Dahr Michael (2 results)

Author: 
Title: 
Refine with Advanced Search

Refine your search

  • Books (2)

to

Custom price range (£)

to

  • Language: English

    Published by Coriolis Group, 1997

    1850321388 / 9781850321385

    • Softcover

    Seller: Better World Books, Mishawaka, IN, U.S.A.Better World Books

    5-star seller
    Contact seller

    Condition: Used - Good

    £ 21.47

     Free Shipping 
    Ships within U.S.A.

    Quantity: 1 available

    Condition: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

  • Language: English

    Published by Verlag Dr. Kovac, Hamburg, 1994

    3860641506 / 9783860641507

    • Softcover
    • First Edition

    Seller: Verlag Dr. Kovac GmbH, Hamburg, GermanyVerlag Dr. Kovac GmbH

    5-star seller
    Contact seller

    Condition: New

    £ 40.18

    £ 14.96 shipping 
    Ships from Germany to U.S.A.

    Quantity: 5 available

    Softcover. Condition: neu. 1. Auflage. Forschungsergebnisse zur Informatik, Band 13 140 pages. Joining ideas from database theory and logic programming leads to the theory of deductive databases. In addition to the data stored in a database (extensional facts), a deductive database stores rule based knowledge concerning parts of the real world which are modeled by the system. A deductive database management system (DDBMS) consists of two parts: 1) An arbitrary database management system and 2) a deduction mechanism that uses extensional as well as intensional facts and rules for deducing new data (intensional facts). Since rules can be seen as a declarative (programming, query) language, one of the main serious problems arising from logic programming and deductive databases is to find a (constructive) semantics which coincides with the user's intuitive meaning of the rules. The aim of this work is to introduce a Petri net semantics for logic programs and deductive databases which is more constructive than any currently known semantics. Logic programs and deductive databases are transformed into a Petri net class whose elements are called, according to their dynamical behaviour, fixpoint nets. The problems of non-monotonic reasoning are expressed by means of generalized conflict situations in fixpoint nets. The semantics of a logic program or a deductive database is defined by means of logical consequences of a set of (possibly three-valued) models, which can be generated from the saturated marking of the program's Petri net representation. It is shown that for stratified normal programs and for positive disjunctive programs the Petri net semantics coincides with the perfect model semantics and the Minker/Rajasekar semantics respectively.…