Name
Abstract | ||
|---|---|---|
. A method for extracting positive information from negativegoals is proposed. The method makes use of knowledge about the existenceof solutions of predicates and about the types of variables. Itstrictly generalises earlier work in this area. It can be used as a constructionrule or as a simplification rule. As a construction rule it does notinvolve an SLD-derivation of the negated sub-goal and so is applicableduring compilation. As a simplification rule it prunes unsatisfiable goals... |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1007/BFb0056629 | PLILP/ALP |
Keywords | Field | DocType |
typed existence properties,constructive negation | Discrete mathematics,Programming language,Negation,Constructive,Computer science,Satisfiability,Knowledge economy,Negation introduction,Theoretical computer science,First-order logic,Rewriting,Predicate (grammar) | Conference |
ISBN | Citations | PageRank |
3-540-65012-1 | 1 | 0.35 |
References | Authors | |
15 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| John G. Cleary | 1 | 1791 | 365.78 |
| Lunjin Lu | 2 | 229 | 26.40 |