LEADER 02502oam 22005414a 450 001 9910456769803321 005 20220218233612.0 010 $a0-8132-1106-9 035 $a(CKB)2550000000016864 035 $a(EBL)3134832 035 $a(SSID)ssj0000967808 035 $a(PQKBManifestationID)11508523 035 $a(PQKBTitleCode)TC0000967808 035 $a(PQKBWorkID)10977855 035 $a(PQKB)10525888 035 $a(OCoLC)647919781 035 $a(MdBmJHUP)muse24164 035 $a(MiAaPQ)EBC3134832 035 $a(EXLCZ)992550000000016864 100 $a20130712e20131948 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 14$aThe First Apology, The Second Apology, Dialogue with Trypho, Exhortation to the Greeks, Discourse to the Greeks, The Monarchy or The Rule of God (The Fathers of the Church, Volume 6)$b[electronic resource] /$fby Thomas B. Falls 210 $aWashington [D.C.] $cCatholic University of America Press$d[1965], c1948 215 $a1 online resource (487 p.) 225 1 $aFathers of the Church, a new translation,$vv. 6 300 $aDescription based upon print version of record. 311 $a0-8132-1552-8 320 $aIncludes bibliographical references and index. 327 $aThe first apology -- The second apology -- Dialogue with Trypho -- Exhortation to the Greeks -- Discourse to the Greeks -- The monarchy, or, the rule of God. 330 3 $aSt. Justin Martyr is known as the outstanding apologist of the second century. While the Apostolic Fathers like St. Clement of Rome, St. Ignatius of Antioch, and St. Polycarp had addressed their letters and admonitions to communities and members within the Christian fold, St. Justin is considered to be the first prominent defender of the Christian faith against non-Christians and the enemies of the Church. 410 0$aFathers of the church ;$vv. 6. 606 $aTheology$vEarly works to 1800 608 $aElectronic books. 615 0$aTheology 676 $a281.3 700 $aJustin$cMartyr, Saint.$0742176 701 $aFalls$b Thomas B$01044999 712 02$aebrary, Inc 801 0$bMdBmJHUP 801 1$bMdBmJHUP 906 $aBOOK 912 $a9910456769803321 996 $aThe First Apology, The Second Apology, Dialogue with Trypho, Exhortation to the Greeks, Discourse to the Greeks, The Monarchy or The Rule of God (The Fathers of the Church, Volume 6)$92470943 997 $aUNINA LEADER 03452nam 2200697Ia 450 001 9910778077003321 005 20230721021750.0 010 $a1-4416-1678-0 010 $a1-60750-376-X 010 $a600-00-1439-2 035 $a(CKB)1000000000765302 035 $a(EBL)448770 035 $a(OCoLC)491253312 035 $a(SSID)ssj0000338455 035 $a(PQKBManifestationID)11254932 035 $a(PQKBTitleCode)TC0000338455 035 $a(PQKBWorkID)10295806 035 $a(PQKB)10382127 035 $a(MiAaPQ)EBC448770 035 $a(Au-PeEL)EBL448770 035 $a(CaPaEBR)ebr10309230 035 $a(CaONFJC)MIL577647 035 $a(OCoLC)935268045 035 $a(EXLCZ)991000000000765302 100 $a20081220d2009 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 00$aHandbook of satisfiability$b[electronic resource] /$fedited by Armin Biere ... [et al.] 210 $aAmsterdam, The Netherlands ;$aWashington, DC $cIOS Press$dc2009 215 $a1 online resource (980 p.) 225 1 $aFrontiers in artificial intelligence and applications,$x0922-6389 ;$vv. 185 300 $aDescription based upon print version of record. 311 $a1-58603-929-6 320 $aIncludes bibliographical references and indexes. 327 $aTitle page; Contents; Part I. Theory and Algorithms; Chapter 1. A History of Satisfiability; Chapter 2. CNF Encodings; Chapter 3. Complete Algorithms; Chapter 4. CDCL Solvers; Chapter 5. Look-Ahead Based SAT Solvers; Chapter 6. Incomplete Algorithms; Chapter 7. Fundaments of Branching Heuristics; Chapter 8. Random Satisfiability; Chapter 9. Exploiting Runtime Variation in Complete Solvers; Chapter 10. Symmetry and Satisfiability; Chapter 11. Minimal Unsatisfiability and Autarkies; Chapter 12. Worst-Case Upper Bounds; Chapter 13. Fixed-Parameter Tractability 327 $aPart II. Applications and ExtensionsChapter 14. Bounded Model Checking; Chapter 15. Planning and SAT; Chapter 16. Software Verification; Chapter 17. Combinatorial Designs by SAT Solvers; Chapter 18. Connections to Statistical Physics; Chapter 19. MaxSAT; Chapter 20. Model Counting; Chapter 21. Non-Clausal SAT and ATPG; Chapter 22. Pseudo-Boolean and Cardinality Constraints; Chapter 23. QBF Theory; Chapter 24. QBFs reasoning; Chapter 25. SAT Techniques for Modal and Description Logics; Chapter 26. Satisfiability Modulo Theories; Chapter 27. Stochastic Boolean Satisfiability; Subject Index 327 $aCited Author IndexContributing Authors and Affiliations 330 $aA collection of papers on various theoretical and practical aspects of SAT solving. It is suitable for students and researchers. 410 0$aFrontiers in artificial intelligence and applications ;$vv. 185. 606 $aPropositional calculus$vCongresses 606 $aDecision making$vCongresses 606 $aComputer algorithms$vCongresses 606 $aAlgebra, Boolean$vCongresses 615 0$aPropositional calculus 615 0$aDecision making 615 0$aComputer algorithms 615 0$aAlgebra, Boolean 676 $a006.3 686 $aST 125$2rvk 686 $aST 300$2rvk 701 $aBiere$b Armin$01193224 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910778077003321 996 $aHandbook of satisfiability$93730670 997 $aUNINA