Name
Abstract | ||
|---|---|---|
Suppose a knowledge base contains information on how the world generally behaves and in particular contains the information that birds, normally fly. Suppose that we obtain the information that Tweety is a bird, why should we conclude that it is plausible that Tweety flies? The answer to this question is unexpectedly sophisticated since the obvious substitution rule has to be rejected. Our answer to this question is based on an extension to predicate calculus of the ideas presented in [7]. Preferential consequence relations over predicate calculi are defined. In addition to the rules satisfied by those relations in the propositional case, they satisfy two rules dealing with quantifiers. These rules are not enough to enable us to conclude that Tweety flies. The rational closure construction defined in [7] should be generalized to the predicate calculus case and, in the rational closure, Tweety should fly. |
Year | Venue | Keywords |
|---|---|---|
1990 | TARK | propositional case,predicate calculus case,obvious substitution rule,preferential logic,rational closure,knowledge base,preferential logics,predicate calculus,preferential consequence relation,rational closure construction,satisfiability |
Field | DocType | ISBN |
Discrete mathematics,Computer science,First-order logic,Knowledge base,Predicate (grammar),Integration by substitution | Conference | 1-55860-105-8 |
Citations | PageRank | References |
16 | 1.04 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel J. Lehmann | 1 | 1270 | 330.79 |
| Menachem Magidor | 2 | 1369 | 140.76 |