LEADER 06594nam 22005775 450 001 996465478703316 005 20200629125535.0 010 $a3-540-47279-7 024 7 $a10.1007/BFb0013043 035 $a(CKB)1000000000233852 035 $a(SSID)ssj0000324517 035 $a(PQKBManifestationID)11245117 035 $a(PQKBTitleCode)TC0000324517 035 $a(PQKBWorkID)10313081 035 $a(PQKB)11621998 035 $a(DE-He213)978-3-540-47279-7 035 $a(PPN)155201980 035 $a(EXLCZ)991000000000233852 100 $a20121227d1992 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aLogic Programming and Automated Reasoning$b[electronic resource] $eInternational Conference LPAR '92, St.Petersburg, Russia, July 15-20, 1992. Proceedings /$fedited by Andrei Voronkov 205 $a1st ed. 1992. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1992. 215 $a1 online resource (XVI, 516 p.) 225 1 $aLecture Notes in Artificial Intelligence ;$v624 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-55727-X 327 $aSoundness and completeness of partial deductions for well-founded semantics -- On deductive planning and the frame problem -- On resolution in fragments of classical linear logic (extended abstract) -- A procedure for automatic proof nets construction -- Free logic and infinite constraint networks -- Towards probabilistic knowledge bases -- Two-level grammar: A functional/logic query language for database and knowledge-base systems -- Extending deductive database languages by embedded implications -- Controlling redundancy in large search spaces: Argonne-style theorem proving through the years -- Resolution for many-valued logics -- An ordered theory resolution calculus -- Application of automated deduction to the search for single axioms for exponent groups -- Elementary lower bounds for the lengths of refutations -- Shortening proofs by quantifier introduction -- Reform compilation for nonlinear recursion -- Pruning infinite failure branches in programs with occur-check -- The use of planning critics in mechanizing inductive proofs -- ??-Calculus: An algorithmic interpretation of classical natural deduction -- Building proofs by analogy via the Curry-Howard Isomorphism -- On the use of the constructive omega-rule within automated deduction -- OR-parallel theorem proving with random competition -- Parallel computation of multiple sets-of-support -- Towards using the Andorra Kernel Language for industrial real-time applications -- Unification in a combination of equational theories with shared constants and its application to primal algebras -- Non-clausal resolution and superposition with selection and redundancy criteria -- Relating innermost, weak, uniform and modular termination of term rewriting systems -- A two steps semantics for logic programs with negation -- Generalized negation as failure and semantics of normal disjunctive logic programs -- General model theoretic semantics for Higher-Order horn logic programming -- Disjunctive deductive databases -- Netlog ? A concept oriented logic programming language -- From the past to the future: Executing temporal logic programs -- Computing induction axioms -- Consistency of equational enrichments -- A programming logic for a verified structured assembly language -- The unification of infinite sets of terms and its applications -- Unification in order-sorted type theory -- Infinite, canonical string rewriting systems generated by completion -- Spes: A system for logic program transformation -- Linear Objects: A logic framework for open system programming -- ISAR: An interactive system for algebraic implementation proofs -- Mathpert: Computer support for learning algebra, trig, and calculus -- MegaLog ? A platform for developing knowledge base management systems -- SPIKE, an automatic theorem prover -- An application to teaching in logic course of ATP based on natural deduction -- A generic logic environment -- ElipSys A parallel programming system based on logic -- Opium ? A high-level debugging environment -- An inductive theorem prover based on narrowing -- A cooperative answering system -- MIZ-PR: A theorem prover for polymorphic and recursive functions -- ProPre A programming language with proofs -- FRIENDLY-WAM: An interactive tool to understand the compilation of PROLOG -- SEPIA ? a Basis for Prolog extensions -- The external database in SICStus Prolog -- The KCM system: Speeding-up logic programming through hardware support -- Logician's Workbench -- EUODHILOS: A general reasoning system for a variety of logics -- The EKS-V1 system -- CHIP and Propia. 330 $aThis volume contains the proceedings of LPAR '92, the international conference on logic programming and automated reasoning held in St. Petersburg in July 1992. The aim of the conference was to bring together researchers from the Russian and the international logic programming and theorem proving communities. The topics of interest covered by papers inthe volume include automated theorem proving, non-monotonic reasoning, applications of mathematical logic to computer science, deductive databases, implementation of declarative concepts, and programming in non-classical logics. LPAR '92 is the successor of the First and Second Russian Conferences on Logic Programming held in 1990 and 1991, respectively, the proceedings of which were publishedin LNAI Vol. 592. 410 0$aLecture Notes in Artificial Intelligence ;$v624 606 $aArtificial intelligence 606 $aMathematical logic 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005 615 0$aArtificial intelligence. 615 0$aMathematical logic. 615 14$aArtificial Intelligence. 615 24$aMathematical Logic and Formal Languages. 615 24$aMathematical Logic and Foundations. 676 $a006.3 702 $aVoronkov$b Andrei$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aLPAR (Conference) 906 $aBOOK 912 $a996465478703316 996 $aLogic Programming and Automated Reasoning$92830654 997 $aUNISA LEADER 05280nam 22009135 450 001 9910483733803321 005 20251226203353.0 010 $a3-540-85538-6 024 7 $a10.1007/978-3-540-85538-5 035 $a(CKB)1000000000490855 035 $a(SSID)ssj0000319321 035 $a(PQKBManifestationID)11265733 035 $a(PQKBTitleCode)TC0000319321 035 $a(PQKBWorkID)10337092 035 $a(PQKB)11399216 035 $a(DE-He213)978-3-540-85538-5 035 $a(MiAaPQ)EBC3063536 035 $a(MiAaPQ)EBC6511627 035 $a(Au-PeEL)EBL6511627 035 $a(OCoLC)1166255366 035 $a(PPN)128126256 035 $a(EXLCZ)991000000000490855 100 $a20100301d2008 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aPairing-Based Cryptography ? Pairing 2008 $eSecond International Conference, Egham, UK, September 1-3, 2008, Proceedings /$fedited by Steven Galbraith, Kenny Paterson 205 $a1st ed. 2008. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2008. 215 $a1 online resource (XI, 377 p.) 225 1 $aSecurity and Cryptology,$x2946-1863 ;$v5209 300 $aIncludes index. 311 08$a3-540-85503-3 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- Pairings in Trusted Computing -- Pairing Lattices -- The Uber-Assumption Family -- Cryptography I -- Homomorphic Encryption and Signatures from Vector Decomposition -- Hidden-Vector Encryption with Groups of Prime Order -- Mathematics -- The Hidden Root Problem -- Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography -- Computing the Cassels Pairing on Kolyvagin Classes in the Shafarevich-Tate Group -- Constructing Pairing Friendly Curves -- Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field -- Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials -- A Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties -- Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2?=?x 5?+?ax -- Implementation of Pairings -- Integer Variable ??Based Ate Pairing -- Pairing Computation on Twisted Edwards Form Elliptic Curves -- Exponentiation in Pairing-Friendly Groups Using Homomorphisms -- Generators for the ?-Torsion Subgroup of Jacobians of Genus Two Curves -- Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms -- Pairings on Hyperelliptic Curves with a Real Model -- Hardware Implementation -- Faster Implementation of ? T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition -- A Comparison between Hardware Accelerators for the Modified Tate Pairing over and -- Cryptography II -- One-Round ID-Based Blind Signature Scheme without ROS Assumption -- Tracing Malicious Proxies in Proxy Re-encryption -- Security and Anonymity of Identity-Based Encryption with Multiple Trusted Authorities. 330 $aThis book constitutes the thoroughly refereed proceedings of the Second International Conference on Pairing-Based Cryptography, Pairing 2008, held in London, UK, in September 2008. The 20 full papers, presented together with the contributions resulting from 3 invited talks, were carefully reviewed and selected from 50 submissions. The contents are organized in topical sections on cryptography, mathematics, constructing pairing-friendly curves, implementation of pairings, and hardware implementation. 410 0$aSecurity and Cryptology,$x2946-1863 ;$v5209 606 $aCryptography 606 $aData encryption (Computer science) 606 $aComputer programming 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aData structures (Computer science) 606 $aInformation theory 606 $aCryptology 606 $aProgramming Techniques 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aData Structures and Information Theory 606 $aSymbolic and Algebraic Manipulation 615 0$aCryptography. 615 0$aData encryption (Computer science). 615 0$aComputer programming. 615 0$aAlgorithms. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aData structures (Computer science). 615 0$aInformation theory. 615 14$aCryptology. 615 24$aProgramming Techniques. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aData Structures and Information Theory. 615 24$aSymbolic and Algebraic Manipulation. 676 $a005.82 686 $a54.62$2bcl 702 $aPaterson$b Kenneth G.$f1969- 702 $aGalbraith$b Steven D. 712 12$aInternational Conference on Pairing-Based Cryptography 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483733803321 996 $aPairing-Based Cryptography – Pairing 2008$9774467 997 $aUNINA