Inference in `poor` languages
Conference
·
OSTI ID:390412
Languages with a solvable implication problem but without complete and consistent systems of inference rules (`poor` languages) are considered. The problem of existence of finite complete and consistent inference rule system for a ``poor`` language is stated independently of the language or rules syntax. Several properties of the problem arc proved. An application of results to the language of join dependencies is given.
- Research Organization:
- Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- AC05-96OR22464
- OSTI ID:
- 390412
- Report Number(s):
- CONF-9610138-2; ON: DE96015219
- Resource Relation:
- Conference: International multi-disciplinary conference on intelligent systems: a semiotic perspective, Gaithersburg, MD (United States), 21-23 Oct 1996; Other Information: PBD: [1996]
- Country of Publication:
- United States
- Language:
- English
Similar Records
Inference in {open_quotes}poor{close_quotes} languages
NVL - a knowledge representation language based on semantic networks
The design and testing of a first-order logic-based stochastic modeling language.
Conference
·
Tue Dec 31 00:00:00 EST 1996
·
OSTI ID:390412
NVL - a knowledge representation language based on semantic networks
Miscellaneous
·
Sun Jan 01 00:00:00 EST 1989
·
OSTI ID:390412
The design and testing of a first-order logic-based stochastic modeling language.
Journal Article
·
Wed Jun 01 00:00:00 EDT 2005
· Proposed for publication in the International Journal on Artificial Intelligence Tools.
·
OSTI ID:390412
+1 more