We present various refutationally complete calculi for first-order clauses with equality that allow for arbitrary selection of negative atoms in clauses. Refutation completeness is established via the use of well-founded orderings on clauses for defining a Herbrand model for a consistent set of clauses. We also formulate an abstract notion of redundancy and show that the deletion of redundant c...

PURPOSE As consensus emerges concerning the need to extend publicly funded home- and community-based services that support the independence of seniors, studies have reported the efficacy and cost effectiveness of assistive technology (AT). This article presents the latest available national AT expenditure and participation trends (1999-2002) for Medicaid 1915(c) waivers, the largest Medicaid ho...

There are several well known possibilities which constrained clauses (= c-clauses, for short) provide in addition to standard clauses. In particular, many (even innnitely many) standard clauses can be represented by a single c-clause. Hence, many parallel inference steps on standard clauses can be encoded in a single inference step on c-clauses. The aim of this work is to investigate another po...

Several practical inductive logic programming systems eeciently learn \determinate" clauses of constant depth. Recently it has been shown that while nonrecursive constant-depth determi-nate clauses are pac-learnable, most of the obvious syntactic generalizations of this language are not pac-learnable. In this paper we introduce a new restriction on logic programs called \locality", and present ...