- Format
- Häftad (Paperback / softback)
- Språk
- Engelska
- Antal sidor
- 352
- Utgivningsdatum
- 1994-06-01
- Upplaga
- 1994 ed.
- Förlag
- Springer-Verlag Berlin and Heidelberg GmbH & Co. K
- Medarbetare
- Pfenning, F. (ed.)
- Illustrationer
- XII, 352 p.
- Dimensioner
- 234 x 156 x 19 mm
- Vikt
- Antal komponenter
- 1
- Komponenter
- 1 Paperback / softback
- ISBN
- 9783540582168
- 508 g
Du kanske gillar
-
Life 3.0
Max Tegmark
HäftadLogic Programming and Automated Reasoning
5th International Conference, LPAR '94, Kiev, Ukraine, July 16 - 22, 1994. Proceedings
1114- Skickas inom 7-10 vardagar.
- Gratis frakt inom Sverige över 199 kr för privatpersoner.
Passar bra ihop
De som köpt den här boken har ofta också köpt Tomorrow, And Tomorrow, And Tomorrow av Gabrielle Zevin (häftad).
Köp båda 2 för 1283 krKundrecensioner
Har du läst boken? Sätt ditt betyg »Fler böcker av Frank Pfenning
-
Generative Programming and Component Engineering
Frank Pfenning, Yannis Smaragdakis
-
Term Rewriting and Applications
Frank Pfenning
-
Automated Deduction - CADE-21
Frank Pfenning
-
Foundations of Software Science and Computation Structures
Frank Pfenning
Innehållsförteckning
Generalization and reuse of tactic proofs.- Program tactics and logic tactics.- On the relation between the ??-calculus and the syntactic theory of sequential control.- On a proof-theoretical analysis of ? 1 1 -AC, ? 1 1 -DC and ? 1 1 -CA.- Proof plans for the correction of false conjectures.- On the value of antiprenexing.- Implementing a finite-domain CLP-language on top of Prolog: a transformational approach.- RISC-CLP(CF) constraint logic programming over complex functions.- Logical closures.- Higher-order rigid E-unification.- Program extraction in a Logical Framework setting.- Higher-Order Abstract Syntax with induction in Coq.- Towards efficient calculi for resource-oriented deductive planning.- A logic programming framework for the abductive inference of intentions in cooperative dialogues.- Constraint logic programming in the sequent calculus.- On conditional rewrite systems with extra variables and deterministic logic programs.- A bottom-up reconstruction of the well-founded semantics for disjunctive logic programs.- An efficient computation of the extended generalized closed world assumption by support-for-negation sets.- Multi-SLD resolution.- On anti-links.- A generic declarative diagnoser for normal logic programs.- Goal dependent vs. goal independent analysis of logic programs.- A kind of achievement by parts method.- Projection in temporal logic programming.