Elmar eder (13 risultati)

Broschiert. Condizione: 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.

Condizione: New. Series: Kunstliche Intelligenz. BIC Classification: PB. Dimension: 0 x 0. Weight in Grams: 328. . 1992. Paperback. . . . .

Leske + Budrich, Opladen, 1991/1995. 313 S./323 S. mit Figuren, kartonierte Einbände, (mit farbigen Marginalien)---- Biographie und Gesellschaft, Band 12 u. Band 21, herausgegeben von Werner Fuchs-Heinritz, Martin Kohli u. Fritz Schütze/ unter Mitarbeit von Irene Kühnlein, Angelika Poferl und F. A. van Santen - 828 Gramm. …

Taschenbuch. Condizione: 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.…

Condizione: New. pp. 184.

Condizione: New. Series: Kunstliche Intelligenz. BIC Classification: PB. Dimension: 0 x 0. Weight in Grams: 328. . 1992. Paperback. . . . . Books ship from the US and Ireland.

PF. Condizione: 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.

Taschenbuch. Condizione: 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.…

Condizione: 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.

Condizione: New. PRINT ON DEMAND pp. 184.

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 1 Calculi for First Order Logic.- 1.1 Basic Concepts and General Remarks.- 1.1.1 First Order Predicate Logic.- 1.1.2 Substitutions and Unification.- 1.2 Resolution.- 1.3 The Connection Method.- 1.3.1 The Connection Method in Propositional Logic.- 1.3.2 The .…

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. 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.Vieweg+Teubner Verlag, Abraham-Lincoln-Straße 46, 65189 Wiesbaden 184 pp. Deutsch.…

Taschenbuch. Condizione: Neu. Relative Complexities of First Order Calculi | Elmar Eder | Taschenbuch | 173 S. | Deutsch | 1992 | De Gruyter Saur | EAN 9783528051228 | Verantwortliche Person für die EU: Springer Vieweg in Springer Science + Business Media, Abraham-Lincoln-Str. 46, 65189 Wiesbaden, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. …