This introduction presents the main motivations for the development of Description Logics (DLs) as a formalism for representing knowledge, as well as some important basic notions underlying all systems that have been created in the DL tradition. In addition, we provide the reader with an overview of the entire book and some guidelines for reading it. We first address the relationship between Description Logics and earlier semantic network and frame systems, which represent the original heritage of the field. We delve into some of the key problems encountered with the older efforts. Subsequently, we introduce the basic features of DL languages and related reasoning techniques. DL languages are then viewed as the core of knowledge representation systems, considering both the structure of a DL knowledge base and its associated reasoning services. The development of some implemented knowledge representation systems based on Description Logics and the first applications built with such systems are then reviewed. Finally, we address the relationship of Description Logics to other fields of Computer Science.We also discuss some extensions of the basic representation language machinery; these include features proposed for incorporation in the formalism that originally arose in implemented systems, and features proposed to cope with the needs of certain application domains.

https://assets.cambridge.org/97805218/76254/frontmatter/9780521876254_frontmatter.pdf

The Description Logic Handbook

Intelligent agents are employed as the central characters in this new introductory text. Beginning with elementary reactive agents, Nilsson gradually increases their cognitive horsepower to illustrate the most important and lasting ideas in AI. Neural networks, genetic programming, computer vision, heuristic search, knowledge representation and reasoning, Bayes networks, planning, and language understanding are each revealed through the growing capabilities of these agents. The book provides a refreshing and motivating new synthesis of the field by one of AI's master expositors and leading researchers. Artificial Intelligence: A New Synthesis takes the reader on a complete tour of this intriguing new world of AI.

* An evolutionary approach provides a unifying theme 
* Thorough coverage of important AI ideas, old and new
* Frequent use of examples and illustrative diagrams
* Extensive coverage of machine learning methods throughout the text
* Citations to over 500 references
* Comprehensive index

Table of Contents

1 Introduction
2 Stimulus-Response Agents
3 Neural Networks 
4 Machine Evolution 
5 State Machines 
6 Robot Vision 
7 Agents that Plan 
8 Uninformed Search 
9 Heuristic Search 
10 Planning, Acting, and Learning 
11 Alternative Search Formulations and Applications 
12 Adversarial Search 
13 The Propositional Calculus 
14 Resolution in The Propositional Calculus 
15 The Predicate Calculus 
16 Resolution in the Predicate Calculus 
17 Knowledge-Based Systems 
18 Representing Commonsense Knowledge 
19 Reasoning with Uncertain Information 
20 Learning and Acting with Bayes Nets 
21 The Situation Calculus 
22 Planning 
23 Multiple Agents 
24 Communication Among Agents 
25 Agent Architectures

/pdf/artificial-intelligence-a-new-synthesis-1mm7uhqtx9.pdf

Artificial Intelligence: A New Synthesis

RACER implements a TBox and ABox reasoner for the logic SHIQ. RACER was the first full-fledged ABox description logic system for a very expressive logic and is based on optimized sound and complete algorithms. RACER also implements a decision procedure for modal logic satisfiability problems (possibly with global axioms).

/pdf/racer-system-description-1u9umxdsta.pdf

RACER System Description

'Satisfiability (SAT) related topics have attracted researchers from various disciplines: logic, applied areas such as planning, scheduling, operations research and combinatorial optimization, but also theoretical issues on the theme of complexity and much more, they all are connected through SAT. My personal interest in SAT stems from actual solving: The increase in power of modern SAT solvers over the past 15 years has been phenomenal. It has become the key enabling technology in automated verification of both computer hardware and software' - Edmund M. Clarke (FORE Systems University Professor of Computer Science and Professor of Electrical and Computer Engineering at Carnegie Mellon University). 'Bounded Model Checking (BMC) of computer hardware is now probably the most widely used model checking technique. The counterexamples that it finds are just satisfying instances of a Boolean formula obtained by unwinding to some fixed depth a sequential circuit and its specification in linear temporal logic. Extending model checking to software verification is a much more difficult problem on the frontier of current research. One promising approach for languages like C with finite word-length integers is to use the same idea as in BMC but with a decision procedure for the theory of bit-vectors instead of SAT. All decision procedures for bit-vectors that I am familiar with ultimately make use of a fast SAT solver to handle complex formulas' - Edmund M. Clarke (FORE Systems University Professor of Computer Science and Professor of Electrical and Computer Engineering at Carnegie Mellon University). 'Decision procedures for more complicated theories, like linear real and integer arithmetic, are also used in program verification. Most of them use powerful SAT solvers in an essential way. Clearly, efficient SAT solving is a key technology for 21st century computer science. I expect this collection of papers on all theoretical and practical aspects of SAT solving will be extremely useful to both students and researchers and will lead to many further advances in the field' - Edmund M. Clarke (FORE Systems University Professor of Computer Science and Professor of Electrical and Computer Engineering at Carnegie Mellon University).

/pdf/handbook-of-satisfiability-2dsvkz551d.pdf

Handbook of Satisfiability

https://www.inf.unibz.it/%7ecalvanese/papers/bera-calv-degi-AIJ-2005.pdf

Reasoning on UML class diagrams

We consider different methods of optimizing the classification process of terminological representation systems, and evaluate their effect on three different types of test data Though these techniques can probably be found in many existing systems, until now there has been no coherent description of these techniques and their impact on the performance of a system One goal of this paper is to make such a description available for future implementors of terminological systems Building the optimizations that came off best into the KRIS system greatly enhanced its efficiency

An empirical analysis of optimization techniques for terminological representation systems : or: 'Making KRIS get a move on'

Multimodal interfaces combining natural language and graphics take advantage of both the individual strength of each communication mode and the fact that several modes can be employed in parallel. The central claim of this paper is that the generation of a multimodal presentation can be considered as an incremental planning process that aims to achieve a given communicative goal. We describe the multimodal presentation system WIP which allows the generation of alternate presentations of the same content taking into account various contextual factors. We discuss how the plan-based approach to presentation design can be exploited so that graphics generation influences the production of text and vice versa. We show that well-known concepts from the area of natural language processing like speech acts, anaphora, and rhetorical relations take on an extended meaning in the context of multimodal communication. Finally, we discuss two detailed examples illustrating and reinforcing our theoretical claims.

Plan-based integration of natural language and graphics generation

http://www.wolfgang-wahlster.de/wordpress/wp-content/uploads/Plan-based_integration_of_natural_language_and_graphics_generation.pdf

We consider different methods of optimizing the classification process of terminological representation systems and evaluate their effect on three different types of test data. Though these techniques can probably be found in many existing systems, until now there has been no coherent description of these techniques and their impact on the performance of a system. One goal of this article is to make such a description available for future implementors of terminological systems. Building the optimizations that came off best into theKRIS system greatly enhanced its efficiency.

Hans-Jürgen Profitlich

Papers

An empirical analysis of optimization techniques for terminological representation systems : or: 'Making KRIS get a move on'

Plan-based integration of natural language and graphics generation

Plan-based integration of natural language and graphics generation

Am empirical analysis of optimization techniques for terminological representation systems

An empirical analysis of terminological representation systems