Expressiveness and tractability in knowledge representation and reasoning 1

@article{Levesque1987ExpressivenessAT,
  title={Expressiveness and tractability in knowledge representation and reasoning 1},
  author={Hector J. Levesque and Ronald J. Brachman},
  journal={Computational Intelligence},
  year={1987},
  volume={3}
}
A fundamental computational limit on automated reasoning and its effect on knowledge representation is examined. Basically, the problem is that it can be more difficult to reason correctly with one representational language than with another and, moreover, that this difficulty increases dramatically as the expressive power of the language increases. This leads to a tradeoff between the expressiveness of a representational language and its computational tractability. Here we show that this… 
Terminological Reasoning is Inherently Intractable
  • B. Nebel
  • Computer Science
    Artif. Intell.
  • 1989
The Complexity of Concept Languages
TLDR
A complexity analysis of concept satisfiability and subsumption for a wide class of concept languages and algorithms for these inferences that comply with the worst-case complexity of the reasoning task they perform.
Intensional subsumption in a general taxonomic knowledge representation language
TLDR
A KR language with a set of formal foundations which supports many of the features that Woods advocated is specified, and the widely accepted constraint that KR systems should be sound and complete in worst case polynomial time is upheld.
A Set Theoretic Approach for Knowledge Representation: the Representation Part
  • Yi Zhou
  • Computer Science, Philosophy
    ArXiv
  • 2016
TLDR
It is shown that the primitive form is expressive enough to define logic operators, not only propositional connectives but also quantifiers, which are special kinds of knowledge.
Reasoning with Individuals in Concept Languages Reasoning with Individuals in Concept Languages
TLDR
This paper investigates the consequences of introducing constructors of this type in the concept description language and provides a complete reasoning procedure to deal with these constructors and gets some complexity results on it.
The basics of knowledge representation and reasoning
TLDR
Some of the basics of knowledge representation and reasoning — the study of formal ways of extracting information from symbolically represented knowledge — is of central importance to the field.
KR Vocabulary and Languages
TLDR
A knowledge representation (KR) language that can model and capture intensional and extensional relations, one that potentially embraces all three kinds of inferential logic; one that is decidable;One that is compatible with a design reflective of particulars and generals; andone that is open world in keeping with the nature of knowledge.
Concept Logics
TLDR
This paper addresses the combination of the fast taxonomical reasoning algorithms that come with concept languages and reasoning in first order predicate logic, and introduces a new rule of inference, called constrained resolution.
A Terminological Knowledge Representation System with Complete Inference Algorithms
TLDR
The formal model-theoretic semantics which has been introduced for kl-one languages [BL84] provides means for investigating soundness and completeness of inference algorithms.
Managing Qualitative Temporal Information: Expressiveness vs. Complexity
TLDR
It is proved that reasoning in the ORD-Horn subclass is a polynomial-time problem and show that the path-consistency method is sufficient for deciding satisfiability.
...
...

References

SHOWING 1-10 OF 43 REFERENCES
Foundations of a Functional Approach to Knowledge Representation
  • H. Levesque
  • Computer Science, Philosophy
    Artif. Intell.
  • 1984
A Four-Valued Semantics for Frame-Based Description Languages
TLDR
A new solution to this problem is to use a weaker, four-valued semantics for frame-based description languages, thus legitimizing a smaller set of subsumption relationships and building a computationally tractable but expressively powerful knowledge representation system.
The Role of Logic in Knowledge Representation and Commonsense Reasoning
TLDR
The experiments of the late 1960s on problem-solving by theorem-proving did not show that the use of logic and deduction in AI systems was necessarily inefficient, but rather that what was needed was better control of the deduction process, combined with more attention to the computational properties of axioms.
The Logic of Incomplete Knowledge Bases
TLDR
It is argued that a language that can refer to both the application domain and to the state of the knowledge base is required to specify and to question an incomplete knowledge base.
A formal treatment of incomplete knowledge bases
TLDR
It is argued that to effectively deal with incomplete knowledge, a system must first be able to determine where the incompleteness lies, and a formal model of knowledge bases with these abilities is presented.
A Logic of Implicit and Explicit Belief
TLDR
This paper point out deficiencies in current semantic treatments of knowledge and belief and suggest a new analysis in the form of a logic that avoids these shortcomings and is also more viable computationally.
Making Believers out of Computers
Krypton: A Functional Approach to Knowledge Representation
TLDR
The authors have developed a design strategy for avoiding these types of problems and have implemented a representation system based on it, called Krypton, which clearly distinguishes between definitional and factual information.
Competence in Knowledge Representation
TLDR
Some aspects of current representation research that offer a foundation for coping with complex and incompletenesson knowledge representation systems are reviewed, and a way of integrating these ideas into a powerful, practical knowledge representation paradigm is suggested.
Reasoning About Knowledge and Action
...
...