Inference in {open_quotes}poor{close_quotes} languages
Conference
·
OSTI ID:466452
- Oak Ridge National Lab., TN (United States)
Languages with a solvable implication problem but without complete and consistent systems of inference rules ({open_quote}poor{close_quote} languages) are considered. The problem of existence of a finite, complete, and consistent inference rule system for a {open_quotes}poor{close_quotes} language is stated independently of the language or the rule syntax. Several properties of the problem are proved. An application of the results to the language of join dependencies is given.
- OSTI ID:
- 466452
- Report Number(s):
- CONF-9610138-; TRN: 97:001309-0032
- 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; Related Information: Is Part Of Intelligent systems: A semiotic perspective. Volume I: Theoretical semiotics; Albus, J.; Meystel, A.; Quintero, R.; PB: 303 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Inference in `poor` languages
Can a {open_quote}{open_quote}natural{close_quote}{close_quote} three-generation neutrino mixing scheme satisfy everything?
Comments on {open_quotes}datalog: A self-contained tutorial{close_quotes} by S. Ceri, G. Gottlob, and L. Tanca
Conference
·
Tue Oct 01 00:00:00 EDT 1996
·
OSTI ID:466452
Can a {open_quote}{open_quote}natural{close_quote}{close_quote} three-generation neutrino mixing scheme satisfy everything?
Journal Article
·
Mon Apr 01 00:00:00 EST 1996
· Physical Review, D
·
OSTI ID:466452
Comments on {open_quotes}datalog: A self-contained tutorial{close_quotes} by S. Ceri, G. Gottlob, and L. Tanca
Journal Article
·
Fri May 01 00:00:00 EDT 1992
· Programming and Computer Software
·
OSTI ID:466452