Taxonomic Syntax for First-Order Inference
Most knowledge representation languages are based on classes and taxonomic relationships between classes. Taxonomic hierarchies without defaults or exceptions are semantically equivalent to a collection of formulas in first order predicate calculus. Although designers of knowledge representat...
| Main Authors: | , |
|---|---|
| Language: | en_US |
| Published: |
2004
|
| Online Access: | http://hdl.handle.net/1721.1/6507 |
| _version_ | 1811080711456686080 |
|---|---|
| author | McAllester, David Givan, Robert |
| author_facet | McAllester, David Givan, Robert |
| author_sort | McAllester, David |
| collection | MIT |
| description | Most knowledge representation languages are based on classes and taxonomic relationships between classes. Taxonomic hierarchies without defaults or exceptions are semantically equivalent to a collection of formulas in first order predicate calculus. Although designers of knowledge representation languages often express an intuitive feeling that there must be some advantage to representing facts as taxonomic relationships rather than first order formulas, there are few, if any, technical results supporting this intuition. We attempt to remedy this situation by presenting a taxonomic syntax for first order predicate calculus and a series of theorems that support the claim that taxonomic syntax is superior to classical syntax. |
| first_indexed | 2024-09-23T11:35:33Z |
| id | mit-1721.1/6507 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T11:35:33Z |
| publishDate | 2004 |
| record_format | dspace |
| spelling | mit-1721.1/65072019-04-11T05:42:48Z Taxonomic Syntax for First-Order Inference McAllester, David Givan, Robert Most knowledge representation languages are based on classes and taxonomic relationships between classes. Taxonomic hierarchies without defaults or exceptions are semantically equivalent to a collection of formulas in first order predicate calculus. Although designers of knowledge representation languages often express an intuitive feeling that there must be some advantage to representing facts as taxonomic relationships rather than first order formulas, there are few, if any, technical results supporting this intuition. We attempt to remedy this situation by presenting a taxonomic syntax for first order predicate calculus and a series of theorems that support the claim that taxonomic syntax is superior to classical syntax. 2004-10-04T15:13:17Z 2004-10-04T15:13:17Z 1989-06-01 AIM-1134 http://hdl.handle.net/1721.1/6507 en_US AIM-1134 2814691 bytes 2220235 bytes application/postscript application/pdf application/postscript application/pdf |
| spellingShingle | McAllester, David Givan, Robert Taxonomic Syntax for First-Order Inference |
| title | Taxonomic Syntax for First-Order Inference |
| title_full | Taxonomic Syntax for First-Order Inference |
| title_fullStr | Taxonomic Syntax for First-Order Inference |
| title_full_unstemmed | Taxonomic Syntax for First-Order Inference |
| title_short | Taxonomic Syntax for First-Order Inference |
| title_sort | taxonomic syntax for first order inference |
| url | http://hdl.handle.net/1721.1/6507 |
| work_keys_str_mv | AT mcallesterdavid taxonomicsyntaxforfirstorderinference AT givanrobert taxonomicsyntaxforfirstorderinference |