{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":31,"n_cols":5,"rows_kept":31,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[13,2,13,3],[14,2,14,3],[16,2,16,3],[20,2,20,3],[20,4,20,5],[21,2,21,3],[21,4,21,5],[22,2,22,3],[23,2,23,3],[24,2,24,3],[25,2,25,3],[26,2,26,3],[28,2,28,3],[29,2,29,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910508455003321"]
[null,null,"Autore",null,"Li Wei"]
[null,null,"Titolo",null,"R-CALCULUS : a logic of belief revision / / Wei Li, Yuefei Sui"]
[null,null,"Pubbl/distr/stampa",null,"Singapore : , : Springer, , [2021]"]
[{"$nulls":4},"©2021"]
[null,null,"ISBN",null,"981-16-2944-7"]
[null,null,"Descrizione fisica",null,"1 online resource (210 pages)"]
[null,null,"Collana",null,"Perspectives in Formal Induction, Revision and Evolution"]
[null,null,"Disciplina",null,"515"]
[null,null,"Soggetti",null,"Calculus"]
[{"$nulls":4},"Software"]
[{"$nulls":4},"Mathematical Concepts"]
[{"$nulls":4},"R (Computer program language)"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,"Nota di contenuto",null,"Intro -- Preface to the Series -- Preface -- Contents -- 1 Introduction -- 1.1 Belief Revision -- 1.2 R-Calculus -- 1.3 Extending R-Calculus -- 1.4 Approximate R-Calculus -- 1.5 Applications of R-Calculus -- References -- 2 Preliminaries -- 2.1 Propositional Logic -- 2.1.1 Syntax and Semantics -- 2.1.2 Gentzen Deduction System -- 2.1.3 Soundness and Completeness Theorem -- 2.2 First-Order Logic -- 2.2.1 Syntax and Semantics -- 2.2.2 Gentzen Deduction System -- 2.2.3 Soundness and Completeness Theorem -- 2.3 Description Logic -- 2.3.1 Syntax and Semantics -- 2.3.2 Gentzen Deduction System -- 2.3.3 Completeness Theorem -- References -- 3 R-Calculi for Propositional Logic -- 3.1 Minimal Changes -- 3.1.1 Subset-Minimal Change -- 3.1.2 Pseudo-Subformulas-Minimal Change -- 3.1.3 Deduction-Based Minimal Change -- 3.2 R-Calculus for subseteq-Minimal Change -- 3.2.1 R-Calculus S for a Formula -- 3.2.2 R-Calculus S for a Theory -- 3.2.3 AGM Postulates Asubseteq for subseteq-Minimal Change -- 3.3 R-Calculus for preceq-Minimal Change -- 3.3.1 R-Calculus T for a Formula -- 3.3.2 R-Calculus T for a Theory -- 3.3.3 AGM Postulates Apreceq for preceq-Minimal Change -- 3.4 R-Calculus for vdashpreceq-Minimal Change -- 3.4.1 R-Calculus U for a Formula -- 3.4.2 R-Calculus U for a Theory -- References -- 4 R-Calculi for Description Logics -- 4.1 R-Calculus for subseteq-Minimal Change -- 4.1.1 R-Calculus SDL for a Statement -- 4.1.2 R-Calculus SDL for a Set of Statements -- 4.2 R-Calculus for "]
[{"$nulls":4},"preceq-Minimal Change -- 4.2.1 Pseudo-Subconcept-Minimal Change -- 4.2.2 R-Calculus TDL for a Statement -- 4.2.3 R-Calculus TDL for a Set of Statements -- 4.3 Discussion on R-Calculus for vdashpreceq-Minimal Change -- References -- 5 R-Calculi for Modal Logic -- 5.1 Propositional Modal Logic -- 5.2 R-Calculus SM for subseteq-Minimal Change."]
[{"$nulls":4},"5.3 R-Calculus TM for preceq-Minimal Change -- 5.4 R-Modal Logic -- 5.4.1 A Logical Language of R-Modal Logic -- 5.4.2 R-Modal Logic -- References -- 6 R-Calculi for Logic Programming -- 6.1 Logic Programming -- 6.1.1 Gentzen Deduction Systems -- 6.1.2 Dual Gentzen Deduction System -- 6.1.3 Minimal Change -- 6.2 R-Calculus SLP for subset-Minimal Change -- 6.3 R-Calculus TLP for preceq-Minimal Change -- References -- 7 R-Calculi for First-Order Logic -- 7.1 R-Calculus for subseteq-Minimal Change -- 7.1.1 R-Calculus SFOL for a Formula -- 7.1.2 R-Calculus SFOL for a Theory -- 7.2 R-Calculus for preceq-Minimal Change -- 7.2.1 R-Calculus TFOL for a Formula -- 7.2.2 R-Calculus TFOL for a Theory -- References -- 8 Nonmonotonicity of R-Calculus -- 8.1 Nonmonotonic Propositional Logic -- 8.1.1 Monotonic Gentzen Deduction System G'1 -- 8.1.2 Nonmonotonic Gentzen Deduction System Logic G2 -- 8.1.3 Nonmonotonicity of G2 -- 8.2 Involvement of ΓA in a Nonmonotonic Logic -- 8.2.1 Default Logic -- 8.2.2 Circumscription -- 8.2.3 Autoepistemic Logic -- 8.2.4 Logic Programming with Negation as Failure -- 8.3 Correspondence Between R-Calculus and Default Logic -- 8.3.1 Transformation from R-Calculus to Default Logic -- 8.3.2 Transformation from Default Logic to R-Calculus -- References -- 9 Approximate R-Calculus -- 9.1 Finite Injury Priority Method -- 9.1.1 Post's Problem -- 9.1.2 Construction with Oracle -- 9.1.3 Finite Injury Priority Method -- 9.2 Approximate Deduction -- 9.2.1 Approximate Deduction System for First-Order Logic -- 9.3 R-Calculus Fapp and Finite Injury Priority Method -- 9.3.1 Construction with Oracle -- 9.3.2 Approximate Deduction System Fapp -- 9.3.3 Recursive Construction -- 9.3.4 Approximate R-Calculus Frec -- 9.4 Default Logic and Priority Method -- 9.4.1 Construction of an Extension Without Injury."]
[{"$nulls":4},"9.4.2 Construction of a Strong Extension with Finite Injury Priority Method -- References -- 10 An Application to Default Logic -- 10.1 Default Logic and Subset-Minimal Change -- 10.1.1 Deduction System SD for a Default -- 10.1.2 Deduction System SD for a Set of Defaults -- 10.2 Default Logic and Pseudo-subformula-minimal Change -- 10.2.1 Deduction System TD for a Default -- 10.2.2 Deduction System TD for a Set of Defaults -- 10.3 Default Logic and Deduction-Based Minimal Change -- 10.3.1 Deduction System UD for a Default -- 10.3.2 Deduction System UD for a Set of Defaults -- References -- 11 An Application to Semantic Networks -- 11.1 Semantic Networks -- 11.1.1 Basic Definitions -- 11.1.2 Deduction System G4 for Semantic Networks -- 11.1.3 Soundness and Completeness Theorem -- 11.2 R-Calculus for subseteq-Minimal Change -- 11.2.1 R-Calculus SSN for a Statement -- 11.2.2 Soundness and Completeness Theorem -- 11.2.3 Examples -- 11.3 R-Calculus for preceq-Minimal Change -- 11.3.1 R-Calculus TSN for a Statement -- 11.3.2 Soundness and Completeness Theorem of TSN -- References -- Index."]
[null,"2.","Record Nr.",null,"UNIORUON00016297"]
[null,null,"Titolo",null,"Vita di Milarepa : i suoi delitti, le sue prove, la sua liberazione / a cura di Jacques Bacot"]
[null,null,"Pubbl/distr/stampa",null,"XVI, 228 p. ; 22 cm"]
[null,null,"Edizione",null,"[Milano : Adephi]"]
[null,null,"Descrizione fisica",null,"Trad. ital. di Anna Devoto"]
[null,null,"Classificazione",null,"TIB VII"]
[null,null,"Soggetti",null,"Letteratura tibetana - Sec. 12"]
[{"$nulls":4},"RELIGIONE E FILOSOFIA - TIBET"]
[null,null,"Lingua di pubblicazione",null,"Italiano"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]