Michael Dahr (5 results)
- Softcover
Seller: Midtown Scholar Bookstore, Harrisburg, PA, U.S.A.Midtown Scholar Bookstore
Contact seller5-star sellerCondition: Used - Very good
£ 6.50
£ 4.44 shippingShips within U.S.A.Quantity: 2 available
paperback. Condition: Very Good. Very Good - Crisp, clean, unread book with some shelfwear/edgewear, may have a remainder mark - NICE PAPERBACK Standard-sized.
- Softcover
Seller: Midtown Scholar Bookstore, Harrisburg, PA, U.S.A.Midtown Scholar Bookstore
Contact seller5-star sellerCondition: Used - Good
£ 6.84
£ 4.44 shippingShips within U.S.A.Quantity: 1 available
paperback. Condition: Good. Good - Bumped and creased book with tears to the extremities, but not affecting the text block, may have remainder mark or previous owner's name - GOOD PAPERBACK Standard-sized.
- Softcover
- First Edition
Seller: Verlag Dr. Kovac GmbH, Hamburg, GermanyVerlag Dr. Kovac GmbH
Contact seller5-star sellerCondition: New
£ 40.63
£ 15.12 shippingShips 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.
- Hardcover
Seller: Better World Books: West, Reno, NV, U.S.A.Better World Books: West
Contact seller5-star sellerCondition: Used - Very good
£ 87.44
Free ShippingShips within U.S.A.Quantity: 1 available
Condition: Very Good. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.
- Hardcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
£ 91.77
£ 11.98 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In English.
