Pinpointing in the Description Logic EL

A tilting disc check valve wherein a valve module containing the tilting disc is positioned adjacent the inlet of the valve into a valve chamber by a cradle formed by a portion of the interior surface of the wall of the valve chamber and an arcuate ridge formed on such interior surface and spaced a distance from the inlet. A threaded port is formed through the wall of the valve chamber opposite the ridge and a bung, screwed into the port, closes the port and bears against the valve module to seat the module in the cradle provided for the module.

[1]  Gert Smolka,et al.  Attributive Concept Descriptions with Complements , 1991, Artif. Intell..

[2]  Karem A. Sakallah,et al.  On Finding All Minimally Unsatisfiable Subformulas , 2005, SAT.

[3]  Bernhard Hollunder.  Hybrid Inferences in KL-ONE-Based Knowledge Representation Systems , 1990, GWAI.

[4]  Larry Wos,et al.  What Is Automated Reasoning? , 1987, J. Autom. Reason..

[5]  Ian Horrocks,et al.  From SHIQ and RDF to OWL: the making of a Web Ontology Language , 2003, J. Web Semant..

[6]  Franz Baader,et al.  Pushing the EL Envelope , 2005, IJCAI.

[7]  Sharad Malik,et al.  Validating SAT solvers using an independent resolution-based checker: practical implementations and other applications , 2003, 2003 Design, Automation and Test in Europe Conference and Exhibition.

[8]  Rafael Peñaloza,et al.  Axiom Pinpointing in General Tableaux , 2007, TABLEAUX.

[9]  Franz Baader,et al.  Description logic , 2007, Handbook of Modal Logic.

[10]  Kent A. Spackman,et al.  SNOMED RT: a reference terminology for health care , 1997, AMIA.

[11]  Enrico Pontelli,et al.  Practical Aspects of Declarative Languages , 2001, Lecture Notes in Computer Science.

[12]  Franz Baader,et al.  CEL - A Polynomial-Time Reasoner for Life Science Ontologies , 2006, IJCAR.

[13]  Hans Kleine Büning,et al.  An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF , 1998, Annals of Mathematics and Artificial Intelligence.

[14]  Jeff Z. Pan,et al.  Finding Maximally Satisfiable Terminologies for the Description Logic ALC , 2006, AAAI.

[15]  Mihalis Yannakakis,et al.  On Generating All Maximal Independent Sets , 1988, Inf. Process. Lett..

[16]  Martha Sideri,et al.  Generating all maximal models of a Boolean expression , 2000, Inf. Process. Lett..

[17]  Sebastian Brandt,et al.  Polynomial Time Reasoning in a Description Logic with Existential Restrictions, GCI Axioms, and - What Else? , 2004, ECAI.

[18]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[19]  Bijan Parsia,et al.  Debugging OWL ontologies , 2005, WWW '05.

[20]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[21]  Stefan Schlobach,et al.  Non-Standard Reasoning Services for the Debugging of Description Logic Terminologies , 2003, IJCAI.

[22]  M. Ashburner,et al.  Gene Ontology: tool for the unification of biology , 2000, Nature Genetics.

[23]  Franz Baader,et al.  Is Tractable Reasoning in Extensions of the Description Logic EL Useful in Practice , 2005 .

[24]  James Bailey,et al.  Discovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization , 2005, PADL.

[25]  Franz Baader,et al.  Embedding defaults into terminological knowledge representation formalisms , 1995, Journal of Automated Reasoning.

[26]  Ian Horrocks,et al.  Experience building a Large, Re-usable Medical Ontology using a Description Logic with Transitivity and Concept Inclusions , 1997 .

[27]  Jean H. Gallier,et al.  Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..

[28]  Georg Gottlob,et al.  Identifying the Minimal Transversals of a Hypergraph and Related Problems , 1995, SIAM J. Comput..