M. Paramasivam, David A. Plaisted  Home/Search
Context Related
| unc.edu/pub/users/parama/...class.ps.gz unc.edu/pub/projects/prover/class.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: unc.edu (more) From: unc.edu (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Mechanical theorem provers are becoming increasingly more powerful, and we believe that it is time to examine whether certain tasks that have formerly been accomplished by other means, can now be performed efficiently by a theorem prover. One such task is classification in description logic-based knowledge representation systems or Concept Language systems. Concept Language systems provide a formalism for expressing knowledge based on concepts and roles. Subsumption checking is one important... (Update)
Context of citations to this paper: More
.... which provides evidence that resolution theorem provers can serve as reasonable and efficient inference tools for description logics [11,15]. In this paper we consider an expressive description logic, which we believe has not been considered before in the literature on...
.... translation and a combination of a first order theorem prover augmented with a finite model finder are described in [ Paramasivam and Plaisted, 1998 ] The problem of empirical investigations based on competitive testing is the difficulty in identifying the major factors having...
Cited by: More
Let's Plan It Deductively - Bibel (1997) (Correct)
Positive Unit Hyperresolution Tableaux and Their Application to .. - Bry, Yahya (2000) (Correct)
On the Relation of Resolution and Tableaux Proof Systems for .. - Hustadt, Schmidt (1999) (Correct)
Similar documents (at the sentence level):
48.5%: Automated Deduction Techniques for Classification in.. - Paramasivam, Plaisted (1995) (Correct)
Active bibliography (related documents): More All
2.0: Automated Deduction Techniques for Classification in.. - Paramasivam, Plaisted (1997) (Correct)
0.3: Proving First-Order Equality Theorems with Hyper-Linking - Alexander (1995) (Correct)
0.3: Semantically Guided Proof Planning - Choi (Correct)
Similar documents based on text: More All
0.1: Ordered Semantic Hyper Linking - Plaisted, Zhu (1997) (Correct)
0.1: An Improved Propositional Approach to First-Order Theorem Proving - Swaha Das And (Correct)
0.1: Evaluating Natural Language Systems: - Sourcebook Approach Walter (Correct)
Related documents from co-citation: More All
4: A Deductive Solution for Plan Generation (context) - Bibel - 1986
3: On Evaluating Decision Procedures for Modal Logic - Hustadt, Schmidt - 1997
3: Decidability by Resolution for Propositional Modal Logics (context) - Schmidt
BibTeX entry: (Update)
M. Paramasivam and D. Plaisted. Automated Deduction Techniques for Classification in Description Logic Systems. J. of Automated Reasoning, 20(3), 1998. http://citeseer.ist.psu.edu/article/paramasivam95automated.html More
@article{ paramasivam98automated,
author = "M. Paramasivam and David A. Plaisted",
title = "Automated Deduction Techniques for Classification in Description Logic Systems",
journal = "Journal of Automated Reasoning",
volume = "20",
number = "3",
pages = "337-364",
year = "1998",
url = "citeseer.ist.psu.edu/article/paramasivam95automated.html" }
Citations (may not include all citations):322 First-Order Logic and Automated Theorem Proving (context) - Fitting - 1990
193 Reasoning and Revision in Hybrid Representation Systems (context) - Nebel - 1990
152 Decidable reasoning in terminological knowledge representati.. - Buchheit, Donini et al. - 1993
116 A semantics and complete algorithm for subsumption in the cl.. - Borgida, Patel-Schneider - 1994
89 KRIS: Knowledge Representation and Inference System (context) - Baader, Hollunder - 1991
80 Argonne National Laboratory (context) - McCune, Users - 1990
70 An empirical analysis of optimization techniques for termino.. - Baader, Hollunder et al. - 1992
63 Inside the LOOM description classifier (context) - MacGregor - 1991
41 Non-Horn clause logic programming without contrapositives (context) - Plaisted - 1988
40 The CLASSIC knowledge representation system: Guiding princip.. (context) - Patel-Schneider, McGuiness et al. - 1991
14 Personal Communication (context) - Zhang
11 German Research Center for Artificial Intelligence (context) - Hollunder, Nutt et al. - 1990
11 The BACK system --- an overview (context) - Petalson - 1991
9 User's Manual (context) - Chu - 1994
8 Eliminating duplication with the hyper-linking strategy (context) - Lee, Plaisted - 1992
7 Lecture Notes in Artificial Intelligence (context) - Fermuller, Leitsch et al. - 1993
6 CLIN: An Automated Reasoning System Using Clause Linking (context) - Lee - 1990
5 Model finding in semantically guided instancebased theorem p.. (context) - Chu, Plaisted - 1994
4 Generating unit consequences of a ground clause set (context) - Chu, Plaisted - 1992
4 An emperical analysis of terminological representation syste.. (context) - Heinsohn, Kudenko et al. - 1992
4 An overview of the KL-ONE knoweldge representation system (context) - Brachman, Schmolze - 1985
4 Theorem Proving and Semantic Trees (context) - Plaisted - 1976
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.unc.edu.html): More
Managing Latency in Complex Augmented Reality Systems - Jacobs, Livingston, State (1997) (Correct)
N-body Methods on MIMD Supercomputers: Astrophysics on.. - Fullagar, Quinn.. (1992) (Correct)
Real-Time Computing with Lock-Free Shared Objects - Anderson, Ramamurthy, Jeffay (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC