Vai al contenuto principale della pagina

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



(Visualizza in formato marc)    (Visualizza in BIBFRAME)

Titolo: 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 Visualizza cluster
Pubblicazione: Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Edizione: 1st ed. 2019.
Descrizione fisica: 1 online resource (XIII, 662 p. 1230 illus., 14 illus. in color.)
Disciplina: 006.332
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
Persona (resp. second.): LutzCarsten
SattlerUli
TinelliCesare
TurhanAnni-Yasmin
WolterFrank
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.
Sommario/riassunto: This Festschrift has been put together on the occasion of Franz Baader's 60th birthday to celebrate his fundamental and highly influential scientific contributions. The 30 papers in this volume cover several scientific areas that Franz Baader has been working on during the last three decades, including description logics, term rewriting, and the combination of decision procedures. We hope that readers will enjoy the articles gathered in Franz's honour and appreciate the breadth and depth of his favourite areas of computer science.
Titolo autorizzato: Description Logic, Theory Combination, and All That  Visualizza cluster
ISBN: 3-030-22102-4
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 996466307203316
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Serie: Theoretical Computer Science and General Issues, . 2512-2029 ; ; 11560