Items related to Relative Complexities of First Order Calculi (Künstliche...
Synopsis
In this paper, a comparison is made of several proof calculi in terms of the lengths of shortest proofs for some given formula of first order predicate logic with function symbols. In particular, we address the question whether, given two calculi, any derivation in one of them can be simulated in the other in polynomial time. The analogous question for propositional logic has been intensively studied by various authors because of its implications for complexity theory. And it seems there has not been as much endeavour in this field in first order logic as there has been in propositional logic. On the other hand, fOr most of the practical applications of logic, a powerful tool such as the language of first order logic is needed. The main interest of this investigation lies in the calculi most frequently used in automated theorem proving, the resolution calculus, and analytic calculi such as the tableau calculus and the connection method. In automated theorem proving there are two important aspects of complexity. In order to have a good theorem proving system, we must first have some calculus in which we can express our derivations in concise form. And second, there must be an efficient search strategy. This book deals mainly with the first aspect which is a necessary condition for the second since the length of a shortest proof always also gives a lower bound to the complexity of any strategy.
"synopsis" may belong to another edition of this title.
Search results for Relative Complexities of First Order Calculi (Künstliche...
Seller Image
Relative complexities of first order calculi. Artificial intelligence
Seller: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Germany
Seller rating 5 out of 5 stars
Broschiert. Condition: Gut. 173 Seiten; Der Erhaltungszustand des hier angebotenen Werks ist trotz seiner Bibliotheksnutzung sehr sauber. Es befindet sich lediglich ein Bibliotheksstempel im Buch; ordnungsgemäß entwidmet. Sprache: Englisch Gewicht in Gramm: 300. Seller Inventory # 1452557
Buy Used
US$ 28.74
US$ 11.13 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available
Stock Image
Relative Complexities of First Order Calculi
Print on DemandSeller: Chiron Media, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
PF. Condition: New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely. Seller Inventory # 6666-IUK-9783528051228
Buy New
US$ 61.45
US$ 6.68 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 20 available
Stock Image
Relative Complexities of First Order Calculi (Künstliche Intelligenz) (German Edition)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In English. Seller Inventory # ria9783528051228_new
Buy New
US$ 72.43
US$ 12.54 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Seller Image
Relative Complexities of First Order Calculi
Published by
Vieweg+Teubner, Vieweg+Teubner Verlag Jan 1992, 1992
ISBN 10: 3528051221
ISBN 13: 9783528051228
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -In this paper, a comparison is made of several proof calculi in terms of the lengths of shortest proofs for some given formula of first order predicate logic with function symbols. In particular, we address the question whether, given two calculi, any derivation in one of them can be simulated in the other in polynomial time. The analogous question for propositional logic has been intensively studied by various authors because of its implications for complexity theory. And it seems there has not been as much endeavour in this field in first order logic as there has been in propositional logic. On the other hand, fOr most of the practical applications of logic, a powerful tool such as the language of first order logic is needed. The main interest of this investigation lies in the calculi most frequently used in automated theorem proving, the resolution calculus, and analytic calculi such as the tableau calculus and the connection method. In automated theorem proving there are two important aspects of complexity. In order to have a good theorem proving system, we must first have some calculus in which we can express our derivations in concise form. And second, there must be an efficient search strategy. This book deals mainly with the first aspect which is a necessary condition for the second since the length of a shortest proof always also gives a lower bound to the complexity of any strategy. 173 pp. Englisch. Seller Inventory # 9783528051228
Buy New
US$ 63.34
US$ 25.72 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 2 available
Stock Image
Relative Complexities of First Order Calculi
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Seller rating 5 out of 5 stars
Condition: New. Series: Kunstliche Intelligenz. BIC Classification: PB. Dimension: 0 x 0. Weight in Grams: 328. . 1992. Paperback. . . . . Seller Inventory # V9783528051228
Buy New
US$ 84.71
US$ 10.62 shipping
Ships from Ireland to U.S.A.
Ships from Ireland to U.S.A.
Quantity: 15 available
Stock Image
Relative Complexities of First Order Calculi
Published by
Vieweg Verlag, Friedr, & Sohn Verlagsgesellschaft mbH, 1992
ISBN 10: 3528051221
ISBN 13: 9783528051228
New
Softcover
Seller: Books Puddle, Woodside, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 184. Seller Inventory # 2654511700
Seller Image
Relative Complexities of First Order Calculi
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - In this paper, a comparison is made of several proof calculi in terms of the lengths of shortest proofs for some given formula of first order predicate logic with function symbols. In particular, we address the question whether, given two calculi, any derivation in one of them can be simulated in the other in polynomial time. The analogous question for propositional logic has been intensively studied by various authors because of its implications for complexity theory. And it seems there has not been as much endeavour in this field in first order logic as there has been in propositional logic. On the other hand, fOr most of the practical applications of logic, a powerful tool such as the language of first order logic is needed. The main interest of this investigation lies in the calculi most frequently used in automated theorem proving, the resolution calculus, and analytic calculi such as the tableau calculus and the connection method. In automated theorem proving there are two important aspects of complexity. In order to have a good theorem proving system, we must first have some calculus in which we can express our derivations in concise form. And second, there must be an efficient search strategy. This book deals mainly with the first aspect which is a necessary condition for the second since the length of a shortest proof always also gives a lower bound to the complexity of any strategy. Seller Inventory # 9783528051228
Buy New
US$ 63.34
US$ 39.14 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available
Stock Image
Relative Complexities of First Order Calculi
Published by
Vieweg Verlag, Friedr, & Sohn Verlagsgesellschaft mbH, 1992
ISBN 10: 3528051221
ISBN 13: 9783528051228
New
Softcover
Seller: Majestic Books, Hounslow, United Kingdom
Seller rating 4 out of 5 stars
Condition: New. Print on Demand pp. 184 67:B&W 6.69 x 9.61 in or 244 x 170 mm (Pinched Crown) Perfect Bound on White w/Gloss Lam. Seller Inventory # 55080843
Buy New
US$ 98.83
US$ 8.70 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 4 available
Stock Image
Relative Complexities of First Order Calculi
Seller: Kennys Bookstore, Olney, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Series: Kunstliche Intelligenz. BIC Classification: PB. Dimension: 0 x 0. Weight in Grams: 328. . 1992. Paperback. . . . . Books ship from the US and Ireland. Seller Inventory # V9783528051228
Stock Image
Relative Complexities of First Order Calculi
Published by
Vieweg Verlag, Friedr, & Sohn Verlagsgesellschaft mbH, 1992
ISBN 10: 3528051221
ISBN 13: 9783528051228
New
Softcover
Seller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 4 out of 5 stars
Condition: New. PRINT ON DEMAND pp. 184. Seller Inventory # 1854511710
Buy New
US$ 105.96
US$ 11.13 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 4 available