Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Description Logic, Theory Combination, and All That [[electronic resource] ] : Essays Dedicated to Franz Baader on the Occasion of His 60th Birthday / / edited by Carsten Lutz, Uli Sattler, Cesare Tinelli, Anni-Yasmin Turhan, Frank Wolter
| Description Logic, Theory Combination, and All That [[electronic resource] ] : Essays Dedicated to Franz Baader on the Occasion of His 60th Birthday / / edited by Carsten Lutz, Uli Sattler, Cesare Tinelli, Anni-Yasmin Turhan, Frank Wolter |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XIII, 662 p. 1230 illus., 14 illus. in color.) |
| Disciplina | 006.332 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Artificial intelligence Computer science Information technology—Management Software engineering Computer networks Formal Languages and Automata Theory Artificial Intelligence Computer Science Logic and Foundations of Programming Computer Application in Administrative Data Processing Software Engineering Computer Communication Networks |
| ISBN | 3-030-22102-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Tour of Franz Baader's Contributions to Knowledge Representation and Automated Deduction -- Hierarchic Superposition Revisited -- Theory Combination: Beyond Equality Sharing -- Initial Steps Towards a Family of Regular-Like Plan Description Logics -- Reasoning with Justifiable Exceptions in EL_\bot Contextualized Knowledge Repositories -- Strong Explanations for Nonmonotonic Reasoning -- A KLM Perspective on Defeasible Reasoning for Description Logics -- Temporal Logic Programs with Temporal Description Logic Axioms -- The What-To-Ask Problem for Ontology-Based Peers -- From Model Completeness to Verification of Data Aware Processes -- Situation Calculus meets Description Logics -- Provenance Analysis: A Perspective for Description Logics? -- Extending EL^++ with Linear Constraints on the Probability of Axioms -- Effective query answering with Ontologies and DBoxes -- Checking the Data Complexity of Ontology-Mediated Queries: a Case Study with Non-Uniform CSPs and Polyanna -- Perceptual Context in Cognitive Hierarchies -- Do Humans Reason with E-Matchers? -- Pseudo-contractions as gentle repairs -- FunDL: A Family of Feature-Based Description Logics, with Applications in Querying Structured Data Sources -- Some Thoughts on Forward Induction in Multi-Agent-Path Finding Under Destination Uncertainty -- Temporally Attributed Description Logics -- Explaining Axiom Pinpointing -- Asymmetric Unification and Disunification -- Building and Combining Matching Algorithms -- Presburger Concept Cardinality Constraints in Very Expressive Description Logics -- A Note on Unification, Subsumption and Unification Type -- 15 Years of Consequence-Based Reasoning -- Maximum Entropy Calculations for the Probabilistic Description Logic ALC^ME -- Automating Automated Reasoning: The Case of Two Generic Automated Reasoning Tools -- On Bounded-Memory Stream Data Processing with Description Logics. |
| Record Nr. | UNISA-996466307203316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Description Logic, Theory Combination, and All That : Essays Dedicated to Franz Baader on the Occasion of His 60th Birthday / / edited by Carsten Lutz, Uli Sattler, Cesare Tinelli, Anni-Yasmin Turhan, Frank Wolter
| Description Logic, Theory Combination, and All That : Essays Dedicated to Franz Baader on the Occasion of His 60th Birthday / / edited by Carsten Lutz, Uli Sattler, Cesare Tinelli, Anni-Yasmin Turhan, Frank Wolter |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XIII, 662 p. 1230 illus., 14 illus. in color.) |
| Disciplina |
006.332
005.1015113 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Artificial intelligence Computer science Information technology—Management Software engineering Computer networks Formal Languages and Automata Theory Artificial Intelligence Computer Science Logic and Foundations of Programming Computer Application in Administrative Data Processing Software Engineering Computer Communication Networks |
| ISBN | 3-030-22102-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Tour of Franz Baader's Contributions to Knowledge Representation and Automated Deduction -- Hierarchic Superposition Revisited -- Theory Combination: Beyond Equality Sharing -- Initial Steps Towards a Family of Regular-Like Plan Description Logics -- Reasoning with Justifiable Exceptions in EL_\bot Contextualized Knowledge Repositories -- Strong Explanations for Nonmonotonic Reasoning -- A KLM Perspective on Defeasible Reasoning for Description Logics -- Temporal Logic Programs with Temporal Description Logic Axioms -- The What-To-Ask Problem for Ontology-Based Peers -- From Model Completeness to Verification of Data Aware Processes -- Situation Calculus meets Description Logics -- Provenance Analysis: A Perspective for Description Logics? -- Extending EL^++ with Linear Constraints on the Probability of Axioms -- Effective query answering with Ontologies and DBoxes -- Checking the Data Complexity of Ontology-Mediated Queries: a Case Study with Non-Uniform CSPs and Polyanna -- Perceptual Context in Cognitive Hierarchies -- Do Humans Reason with E-Matchers? -- Pseudo-contractions as gentle repairs -- FunDL: A Family of Feature-Based Description Logics, with Applications in Querying Structured Data Sources -- Some Thoughts on Forward Induction in Multi-Agent-Path Finding Under Destination Uncertainty -- Temporally Attributed Description Logics -- Explaining Axiom Pinpointing -- Asymmetric Unification and Disunification -- Building and Combining Matching Algorithms -- Presburger Concept Cardinality Constraints in Very Expressive Description Logics -- A Note on Unification, Subsumption and Unification Type -- 15 Years of Consequence-Based Reasoning -- Maximum Entropy Calculations for the Probabilistic Description Logic ALC^ME -- Automating Automated Reasoning: The Case of Two Generic Automated Reasoning Tools -- On Bounded-Memory Stream Data Processing with Description Logics. |
| Record Nr. | UNINA-9910337835703321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Frontiers of combining systems : 6th international symposium, frocos 2007, liverpool, uk, september 10-12, 2007. Proceedings / / edited by Boris Konev, Frank Wolter
| Frontiers of combining systems : 6th international symposium, frocos 2007, liverpool, uk, september 10-12, 2007. Proceedings / / edited by Boris Konev, Frank Wolter |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Germany ; ; New York, United States : , : Springer, , [2007] |
| Descrizione fisica | 1 online resource (X, 286 p.) |
| Disciplina | 511.3 |
| Collana | Lecture notes in computer science. Lecture notes in artificial intelligence ; 4720 |
| Soggetto topico |
Computer science
Logic, Symbolic and mathematical |
| ISBN | 3-540-74621-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Section 1. Invited Contributions -- Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL -- From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain -- Hierarchical and Modular Reasoning in Complex Theories: The Case of Local Theory Extensions -- Temporalising Logics: Fifteen Years After -- Section 2. Technical Papers -- Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs -- A Compressing Translation from Propositional Resolution to Natural Deduction -- Combining Algorithms for Deciding Knowledge in Security Protocols -- Combining Classical and Intuitionistic Implications -- Towards an Automatic Analysis of Web Service Security -- Certification of Automated Termination Proofs -- Temporal Logic with Capacity Constraints -- Idempotent Transductions for Modal Logics -- A Temporal Logic of Robustness -- Noetherianity and Combination Problems -- Languages Modulo Normalization -- Combining Proof-Producing Decision Procedures -- Visibly Pushdown Languages and Term Rewriting -- Proving Termination Using Recursive Path Orders and SAT Solving. |
| Altri titoli varianti | FroCos 2007 |
| Record Nr. | UNINA-9910483346103321 |
| Berlin, Germany ; ; New York, United States : , : Springer, , [2007] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Frontiers of combining systems : 6th international symposium, frocos 2007, liverpool, uk, september 10-12, 2007. Proceedings / / edited by Boris Konev, Frank Wolter
| Frontiers of combining systems : 6th international symposium, frocos 2007, liverpool, uk, september 10-12, 2007. Proceedings / / edited by Boris Konev, Frank Wolter |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Germany ; ; New York, United States : , : Springer, , [2007] |
| Descrizione fisica | 1 online resource (X, 286 p.) |
| Disciplina | 511.3 |
| Collana | Lecture notes in computer science. Lecture notes in artificial intelligence ; 4720 |
| Soggetto topico |
Computer science
Logic, Symbolic and mathematical |
| ISBN | 3-540-74621-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Section 1. Invited Contributions -- Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL -- From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain -- Hierarchical and Modular Reasoning in Complex Theories: The Case of Local Theory Extensions -- Temporalising Logics: Fifteen Years After -- Section 2. Technical Papers -- Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs -- A Compressing Translation from Propositional Resolution to Natural Deduction -- Combining Algorithms for Deciding Knowledge in Security Protocols -- Combining Classical and Intuitionistic Implications -- Towards an Automatic Analysis of Web Service Security -- Certification of Automated Termination Proofs -- Temporal Logic with Capacity Constraints -- Idempotent Transductions for Modal Logics -- A Temporal Logic of Robustness -- Noetherianity and Combination Problems -- Languages Modulo Normalization -- Combining Proof-Producing Decision Procedures -- Visibly Pushdown Languages and Term Rewriting -- Proving Termination Using Recursive Path Orders and SAT Solving. |
| Altri titoli varianti | FroCos 2007 |
| Record Nr. | UNISA-996465926103316 |
| Berlin, Germany ; ; New York, United States : , : Springer, , [2007] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Fundamentals of Computation Theory [[electronic resource] ] : 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013, Proceedings / / edited by Leszek Gąsieniec, Frank Wolter
| Fundamentals of Computation Theory [[electronic resource] ] : 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013, Proceedings / / edited by Leszek Gąsieniec, Frank Wolter |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XII, 318 p. 45 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer science—Mathematics Discrete mathematics Theory of Computation Discrete Mathematics in Computer Science |
| ISBN | 3-642-40164-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996466033203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Fundamentals of Computation Theory : 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013, Proceedings / / edited by Leszek Gąsieniec, Frank Wolter
| Fundamentals of Computation Theory : 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013, Proceedings / / edited by Leszek Gąsieniec, Frank Wolter |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XII, 318 p. 45 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer science—Mathematics Discrete mathematics Theory of Computation Discrete Mathematics in Computer Science |
| ISBN | 3-642-40164-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910483727603321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Handbook of modal logic [[electronic resource] /] / edited by Patrick Blackburn, Johan van Benthem, Frank Wolter
| Handbook of modal logic [[electronic resource] /] / edited by Patrick Blackburn, Johan van Benthem, Frank Wolter |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Amsterdam ; ; Boston, : Elsevier, 2007 |
| Descrizione fisica | 1 online resource (1261 p.) |
| Disciplina |
160
160 22 |
| Altri autori (Persone) |
BlackburnPatrick <1959->
BenthemJ. F. A. K. van <1949-> WolterFrank |
| Collana | Studies in logic and practical reasoning |
| Soggetto topico |
Modality (Logic)
Logic |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-280-72916-3
9786610729166 0-08-046666-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Front Cover; Handbook of Modal Logic; Copyright Page; Table of Contents; List of Contributors; Preface; Part 1. Basic Theory; Chapter 1 Modal Logic: A Semantic Perspective; 1 Introduction; 2 Basic modal logic; 2.1 First steps in relational semantics; 2.2 The standard translation; 3 Bisimulation and definability; 3.1 Drawing distinctions; 3.2 Bisimulation; 3.3 Invariance and definability in first-order logic; 3.4 Invariance and definability in modal logic; 3.5 Modal logic and first-order logic compared; 3.6 Bisimulation as a game; 4 Computation and complexity; 4.1 Model checking
4.2 Satisfiability and validity: decidability4.3 Satisfiability and validity: complexity; 4.4 Other reasoning tasks; 5 Richer logics; 5.1 Axioms and relational frame properties; 5.2 Frame definability and undefinability; 5.3 Frame correspondence and second-order logic; 5.4 First-order frame definability; 5.5 Correspondence in richer languages; 5.6 Remarks on computability; 6 Richer languages; 6.1 The universal modality; 6.2 Hybrid logic; 6.3 Temporal logic with Until and Since operators; 6.4 Conditional logic; 6.5 The guarded fragment; 6.6 Propositional Dynamic Logic; 6.7 The modal μ-calculus 6.8 Combined logics6.9 First-order modal logic; 6.10 General perspectives; 7 Alternative semantics; 7.1 Algebraic semantics; 7.2 Neighbourhood semantics; 7.3 Topological semantics; 8 Modal logic and its changing environment; Acknowledgements; Bibliography; Chapter 2 Modal Proof Theory; 1 Introduction; 2 Modal Axiomatics; 2.1 Normal Axiom Systems; 2.2 Soundness and Completeness; 2.3 Difficulties, and GL; 2.4 Sahlqvist Formulas; 3 Deduction, and the Deduction Theorem; 4 Natural Deduction; 4.1 Classical Natural Deduction; 4.2 Modal Natural Deduction; 5 Semantic Tableaus 5.1 A Classical Tableau System5.2 Destructive Modal Tableaus; 5.3 Soundness and Completeness; 5.4 The Logic GL; 5.5 Tableau Remarks; 6 Prefixed Tableaus; 6.1 A Prefixed System for K; 6.2 Soundness and Completeness; 6.3 Other Modal Logics; 7 Gentzen Systems; 7.1 Classical Propositional Sequents; 7.2 Modal Propositional Sequents; 8 Hypersequents; 8.1 Hypersequents for S5; 8.2 Examples; 8.3 Soundness and Completeness; 9 Logics of Knowledge; 9.1 A Basic Logic of Knowledge; 9.2 Common Knowledge; 10 Converse; 11 The Universal Modality and the Difference Modality; 12 What Are the Limitations 13 Quantified Modal Logic13.1 Syntax and Semantics; 13.2 Constant Domain Tableaus; 13.3 Soundness and Completeness; 13.4 Variations; 14 Conclusion; Bibliography; Chapter 3 Complexity of Modal Logic; 1 Introduction; 1.1 Examples of decision problems in modal logic; 1.2 A simple and a hard problem; 1.3 The model checking problem; 1.4 The consequence problem; 1.5 A tiling logic; 2 Decision algorithms; 2.1 Selection of points; 2.2 Filtration; 2.3 Hintikka set elimination; 2.4 Hintikka set elimination without constraints; 2.5 Forcing exponentially deep paths; 2.6 Tree automata; 2.7 Pseudo-models 3 Complexity |
| Record Nr. | UNINA-9910511781803321 |
| Amsterdam ; ; Boston, : Elsevier, 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Handbook of modal logic [[electronic resource] /] / edited by Patrick Blackburn, Johan van Benthem, Frank Wolter
| Handbook of modal logic [[electronic resource] /] / edited by Patrick Blackburn, Johan van Benthem, Frank Wolter |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Amsterdam ; ; Boston, : Elsevier, 2007 |
| Descrizione fisica | 1 online resource (1261 p.) |
| Disciplina |
160
160 22 |
| Altri autori (Persone) |
BlackburnPatrick <1959->
BenthemJ. F. A. K. van <1949-> WolterFrank |
| Collana | Studies in logic and practical reasoning |
| Soggetto topico |
Modality (Logic)
Logic |
| ISBN |
1-280-72916-3
9786610729166 0-08-046666-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Front Cover; Handbook of Modal Logic; Copyright Page; Table of Contents; List of Contributors; Preface; Part 1. Basic Theory; Chapter 1 Modal Logic: A Semantic Perspective; 1 Introduction; 2 Basic modal logic; 2.1 First steps in relational semantics; 2.2 The standard translation; 3 Bisimulation and definability; 3.1 Drawing distinctions; 3.2 Bisimulation; 3.3 Invariance and definability in first-order logic; 3.4 Invariance and definability in modal logic; 3.5 Modal logic and first-order logic compared; 3.6 Bisimulation as a game; 4 Computation and complexity; 4.1 Model checking
4.2 Satisfiability and validity: decidability4.3 Satisfiability and validity: complexity; 4.4 Other reasoning tasks; 5 Richer logics; 5.1 Axioms and relational frame properties; 5.2 Frame definability and undefinability; 5.3 Frame correspondence and second-order logic; 5.4 First-order frame definability; 5.5 Correspondence in richer languages; 5.6 Remarks on computability; 6 Richer languages; 6.1 The universal modality; 6.2 Hybrid logic; 6.3 Temporal logic with Until and Since operators; 6.4 Conditional logic; 6.5 The guarded fragment; 6.6 Propositional Dynamic Logic; 6.7 The modal μ-calculus 6.8 Combined logics6.9 First-order modal logic; 6.10 General perspectives; 7 Alternative semantics; 7.1 Algebraic semantics; 7.2 Neighbourhood semantics; 7.3 Topological semantics; 8 Modal logic and its changing environment; Acknowledgements; Bibliography; Chapter 2 Modal Proof Theory; 1 Introduction; 2 Modal Axiomatics; 2.1 Normal Axiom Systems; 2.2 Soundness and Completeness; 2.3 Difficulties, and GL; 2.4 Sahlqvist Formulas; 3 Deduction, and the Deduction Theorem; 4 Natural Deduction; 4.1 Classical Natural Deduction; 4.2 Modal Natural Deduction; 5 Semantic Tableaus 5.1 A Classical Tableau System5.2 Destructive Modal Tableaus; 5.3 Soundness and Completeness; 5.4 The Logic GL; 5.5 Tableau Remarks; 6 Prefixed Tableaus; 6.1 A Prefixed System for K; 6.2 Soundness and Completeness; 6.3 Other Modal Logics; 7 Gentzen Systems; 7.1 Classical Propositional Sequents; 7.2 Modal Propositional Sequents; 8 Hypersequents; 8.1 Hypersequents for S5; 8.2 Examples; 8.3 Soundness and Completeness; 9 Logics of Knowledge; 9.1 A Basic Logic of Knowledge; 9.2 Common Knowledge; 10 Converse; 11 The Universal Modality and the Difference Modality; 12 What Are the Limitations 13 Quantified Modal Logic13.1 Syntax and Semantics; 13.2 Constant Domain Tableaus; 13.3 Soundness and Completeness; 13.4 Variations; 14 Conclusion; Bibliography; Chapter 3 Complexity of Modal Logic; 1 Introduction; 1.1 Examples of decision problems in modal logic; 1.2 A simple and a hard problem; 1.3 The model checking problem; 1.4 The consequence problem; 1.5 A tiling logic; 2 Decision algorithms; 2.1 Selection of points; 2.2 Filtration; 2.3 Hintikka set elimination; 2.4 Hintikka set elimination without constraints; 2.5 Forcing exponentially deep paths; 2.6 Tree automata; 2.7 Pseudo-models 3 Complexity |
| Record Nr. | UNINA-9910784599403321 |
| Amsterdam ; ; Boston, : Elsevier, 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Handbook of modal logic / / edited by Patrick Blackburn, Johan van Benthem, Frank Wolter
| Handbook of modal logic / / edited by Patrick Blackburn, Johan van Benthem, Frank Wolter |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Amsterdam ; ; Boston, : Elsevier, 2007 |
| Descrizione fisica | 1 online resource (1261 p.) |
| Disciplina | 160 |
| Altri autori (Persone) |
BlackburnPatrick <1959->
BenthemJ. F. A. K. van <1949-> WolterFrank |
| Collana | Studies in logic and practical reasoning |
| Soggetto topico |
Modality (Logic)
Logic |
| ISBN |
1-280-72916-3
9786610729166 0-08-046666-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Front Cover; Handbook of Modal Logic; Copyright Page; Table of Contents; List of Contributors; Preface; Part 1. Basic Theory; Chapter 1 Modal Logic: A Semantic Perspective; 1 Introduction; 2 Basic modal logic; 2.1 First steps in relational semantics; 2.2 The standard translation; 3 Bisimulation and definability; 3.1 Drawing distinctions; 3.2 Bisimulation; 3.3 Invariance and definability in first-order logic; 3.4 Invariance and definability in modal logic; 3.5 Modal logic and first-order logic compared; 3.6 Bisimulation as a game; 4 Computation and complexity; 4.1 Model checking
4.2 Satisfiability and validity: decidability4.3 Satisfiability and validity: complexity; 4.4 Other reasoning tasks; 5 Richer logics; 5.1 Axioms and relational frame properties; 5.2 Frame definability and undefinability; 5.3 Frame correspondence and second-order logic; 5.4 First-order frame definability; 5.5 Correspondence in richer languages; 5.6 Remarks on computability; 6 Richer languages; 6.1 The universal modality; 6.2 Hybrid logic; 6.3 Temporal logic with Until and Since operators; 6.4 Conditional logic; 6.5 The guarded fragment; 6.6 Propositional Dynamic Logic; 6.7 The modal μ-calculus 6.8 Combined logics6.9 First-order modal logic; 6.10 General perspectives; 7 Alternative semantics; 7.1 Algebraic semantics; 7.2 Neighbourhood semantics; 7.3 Topological semantics; 8 Modal logic and its changing environment; Acknowledgements; Bibliography; Chapter 2 Modal Proof Theory; 1 Introduction; 2 Modal Axiomatics; 2.1 Normal Axiom Systems; 2.2 Soundness and Completeness; 2.3 Difficulties, and GL; 2.4 Sahlqvist Formulas; 3 Deduction, and the Deduction Theorem; 4 Natural Deduction; 4.1 Classical Natural Deduction; 4.2 Modal Natural Deduction; 5 Semantic Tableaus 5.1 A Classical Tableau System5.2 Destructive Modal Tableaus; 5.3 Soundness and Completeness; 5.4 The Logic GL; 5.5 Tableau Remarks; 6 Prefixed Tableaus; 6.1 A Prefixed System for K; 6.2 Soundness and Completeness; 6.3 Other Modal Logics; 7 Gentzen Systems; 7.1 Classical Propositional Sequents; 7.2 Modal Propositional Sequents; 8 Hypersequents; 8.1 Hypersequents for S5; 8.2 Examples; 8.3 Soundness and Completeness; 9 Logics of Knowledge; 9.1 A Basic Logic of Knowledge; 9.2 Common Knowledge; 10 Converse; 11 The Universal Modality and the Difference Modality; 12 What Are the Limitations 13 Quantified Modal Logic13.1 Syntax and Semantics; 13.2 Constant Domain Tableaus; 13.3 Soundness and Completeness; 13.4 Variations; 14 Conclusion; Bibliography; Chapter 3 Complexity of Modal Logic; 1 Introduction; 1.1 Examples of decision problems in modal logic; 1.2 A simple and a hard problem; 1.3 The model checking problem; 1.4 The consequence problem; 1.5 A tiling logic; 2 Decision algorithms; 2.1 Selection of points; 2.2 Filtration; 2.3 Hintikka set elimination; 2.4 Hintikka set elimination without constraints; 2.5 Forcing exponentially deep paths; 2.6 Tree automata; 2.7 Pseudo-models 3 Complexity |
| Record Nr. | UNINA-9910823052303321 |
| Amsterdam ; ; Boston, : Elsevier, 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Koordination im internationalen Umweltmanagement : Dargestellt an Beispielen aus der Automobilindustrie / H. Meffert, Frank Wolter
| Koordination im internationalen Umweltmanagement : Dargestellt an Beispielen aus der Automobilindustrie / H. Meffert, Frank Wolter |
| Autore | Wolter Frank |
| Edizione | [1st, New ed.] |
| Pubbl/distr/stampa | Frankfurt a.M, : PH02, 2018 |
| Descrizione fisica | 1 online resource (307 p.) : , EPDF |
| Collana | Schriften zu Marketing und Management |
| Soggetto topico |
Business studies: general
Corporate governance Organizational theory & behaviour Ecological science, the Biosphere |
| Soggetto non controllato |
Abgasskandal
Auto Automobilindustrie Beispielen Dargestellt internationalen Koordination Umwelt Umweltmanagement Wolter |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | ger |
| Nota di contenuto | Aus dem Inhalt: Ökologiebezogener Koordinationsbedarf bei internationaler Geschäftstätigkeit - Koordinationskonzeptionen im internationalen. Umweltmanagement. |
| Record Nr. | UNINA-9910563004003321 |
Wolter Frank
|
||
| Frankfurt a.M, : PH02, 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||