Inference in {open_quotes}poor{close_quotes} languages
Abstract
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.
- Authors:
-
- Oak Ridge National Lab., TN (United States)
- Publication Date:
- OSTI Identifier:
- 466452
- Report Number(s):
- CONF-9610138-
TRN: 97:001309-0032
- Resource Type:
- Conference
- 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
- Subject:
- 99 MATHEMATICS, COMPUTERS, INFORMATION SCIENCE, MANAGEMENT, LAW, MISCELLANEOUS; ARTIFICIAL INTELLIGENCE; PROGRAMMING LANGUAGES; MATHEMATICAL LOGIC; DATA BASE MANAGEMENT
Citation Formats
Petrov, S. Inference in {open_quotes}poor{close_quotes} languages. United States: N. p., 1996.
Web.
Petrov, S. Inference in {open_quotes}poor{close_quotes} languages. United States.
Petrov, S. 1996.
"Inference in {open_quotes}poor{close_quotes} languages". United States.
@article{osti_466452,
title = {Inference in {open_quotes}poor{close_quotes} languages},
author = {Petrov, S},
abstractNote = {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.},
doi = {},
url = {https://www.osti.gov/biblio/466452},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Tue Dec 31 00:00:00 EST 1996},
month = {Tue Dec 31 00:00:00 EST 1996}
}
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.
Save to My Library
You must Sign In or Create an Account in order to save documents to your library.