To ascertain whether LP was justifiable in cases of first simple febrile seizure, the records of128 such patients were critically reviewed in this study. It was evident that in 90% of those who received cerebrospinal fluid examination as a routine work up, lumbar puncture could have been avoided if the definition of simple febrile seizure was adhered to and the history and clinical finding...

We introduce LIMBO, a reasoning system for limited belief. The system features a highly expressive language with first-order quantification, functions and equality, sorts, and introspective belief modalities. Reasoning is based on clause subsumption, unit propagation, and case splits. Decidability and sometimes even tractability is achieved by limiting the number of case splits. This demo illus...

We describe a logic-based AI architecture based on Brooks’ subsumption architecture. In this architecture, we axiomatize different layers of control in First-Order Logic (FOL) and use independent theorem provers to derive each layer’s outputs given its inputs. We implement the subsumption of lower layers by higher layers using circumscription to make assumptions in lower layers, and nonmonotoni...

Transitive propagation along properties can be modelled in various ways in the OWL description logic. Doing so allows existing description logic reasoners based on the tableaux algorithm to make inferences based on such transitive constructs. This is espectially useful for medical knowledge bases, where such constructs are common. This paper compares, contrasts and evaluates a variety of differ...

A description classifier organizes concepts and relations into a taxonomy based on the results of subsumption computations applied to pairs of relation definitions. Until now, description classifiers have only been designed to operate over definitions phrased in highly restricted subsets of the predicate calculus. This paper describes a classifier able to reason with definitions phrased in the ...

This paper extends the notion of prime implicates to first order logic formulas without equality which are assumed to be in Skolem Conjunctive Normal Form. Using the extended notions of consensus and subsumption it is shown that the consensus-subsumption algorithm for computing prime implicates well known for propositional formulas can be conditionally lifted to first order formulas.

In this paper, we consider an ontology as a set of terms together with three binary relations on terms, called synonymy, subsumption and crossreference. We present a model-theoretic interpretation of ontologies and we show that this approach although appropriate for deciding the soundness of an ontology, is not sufficient for providing a sound and complete inference procedure for checking the v...

We propose a bottom-up variant of Earley deduction. Bottom-up deduction is preferable to top-down deduction because it allows incrementai processing (even for head-driven grammars), it is data-driven, no subsumption check is needed, and preference values attached to lexical items can be used to guide best-first search. We discuss the scanning step for bottom-up Earley deduction and indexing sch...