Foundations of Knowledge Representation and ReasoningGerhard Lakemeyer, Bernhard Nebel This collection of thoroughly refereed papers presents state-of-the-art research results by well-known researchers on the foundations of knowledge representation and reasoning. In addition, there are two surveys, one by the volume editors intended as a guide to this book and another by Shoham and Cousins on mental attitudes. In total, the volume provides a well-organized report on current research in knowledge representation, which is one of the central subfields of AI. Except the surveys, the papers grew out of a workshop on Theoretical Foundations of Knowledge Representation and Reasoning, held in conjunction with the 10th European Conference on Artificial Intelligence (ECAI-92) in Vienna in August 1992. |
Contents
Foundations of Knowledge Representation and Reasoning | 1 |
Collective Entities and Relations in Concept Languages | 13 |
Computing Extensions of Terminological Default Theories | 30 |
A Formalization of Intervalbased Temporal Subsumption in First Order Logic | 53 |
Normative Subjunctive and Autoepistemic Defaults | 74 |
Abductive Reasoning with Abstraction Axioms | 98 |
Queries Rules and Definitions as Epistemic Sentences in Concept Languages | 113 |
The Power of Beliefs or Translating Default Logic Into Standard Autoepistemic Logic | 133 |
Weak Autoepistemic Reasoning and WellFounded Semantics | 179 |
Forming Concepts for Fast Inference | 200 |
A CommonSense Theory of Time | 216 |
Reasoning with Analogical Representations | 229 |
Asking About Possibilities Revision and Update Semantics for Subjunctive Queries | 250 |
On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning | 275 |
Logics of Mental Attitudes in AI | 296 |
Monotonic reasoning about nested default conditionals | 310 |
Learning an Optimally Accurate Representation System | 145 |
Default Reasoning via Negation as Failure | 160 |
Revision by Expansion in Logic Programs | 333 |
Other editions - View all
Foundations of Knowledge Representation and Reasoning Gerhard Lakemeyer,Bernhard Nebel No preview available - 2014 |
Common terms and phrases
ABox acceptable algorithm analogical applied Artificial Intelligence assumption atoms autoepistemic expansion autoepistemic logic axioms beatles belief revision belief set Boutilier complete computational concept languages consider consistent constraints default logic default reasoning default rules default theory defined Definition denote diagram disjunction E₁ Elub epistemic example expansion function extension fact finite formal formula framework Gärdenfors given Horn clauses hypotheses implies inference instantaneous event instants interpretation interval knowledge base knowledge representation Lemma Logic Programming minimal modal modal logic modus ponens Morgan Kaufmann negation negation as failure nonmonotonic reasoning notion operator OPTACC Peter Gärdenfors polynomial possible postulates predicate problem Proc Proceedings Proof propositional logic propositional variables quantifiers query Ramsey test relation Representation and Reasoning representation system restricted satisfies semantics sentences stable expansion standard AEL stratified structure subjunctive subset subsumption temporal terminological logics Theorem tractable translation update