{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/72069"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/72069","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"A General Semantic Model of Negation in Natural Language: Representation and Inference","abstract":"The research contribution of this dissertation is a formal, computational model of the semantics of negation in natural language; its major components are two knowledge representation formalisms with Boolean semantics: a computable Boolean algebra for representing concepts and a computable Boolean algebra for representing the semantics of scalar predicate expressions of natural language that denote quantitative values. The UNO computer implementation demonstrates that this semantic model faithfully captures the logical inferences that people draw from English sentences with explicit negative information. The UNO natural language processing system is shown to correctly handle a substantial subset of English: knowledge from sentences involving negation as well as conjunction and disjunction of complex determiners, adjectives, adverbs, common nouns, proper nouns, noun phrases, verbs, verb phrases, prepositions, and prepositional phrases can be represented and reasoned with. Areas of future research involve extending the model to handle modal operators, sentential adverbs, pragmatics, temporal reasoning, intensionality and non-logical reasoning.","abstract_html":"The research contribution of this dissertation is a formal, computational model of the semantics of negation in natural language; its major components are two knowledge representation formalisms with Boolean semantics: a computable Boolean algebra for representing concepts and a computable Boolean algebra for representing the semantics of scalar predicate expressions of natural language that denote quantitative values. The UNO computer implementation demonstrates that this semantic model faithfully captures the logical inferences that people draw from English sentences with explicit negative information. The UNO natural language processing system is shown to correctly handle a substantial subset of English: knowledge from sentences involving negation as well as conjunction and disjunction of complex determiners, adjectives, adverbs, common nouns, proper nouns, noun phrases, verbs, verb phrases, prepositions, and prepositional phrases can be represented and reasoned with. Areas of future research involve extending the model to handle modal operators, sentential adverbs, pragmatics, temporal reasoning, intensionality and non-logical reasoning.","abstract_has_math":false,"creators":["Iwanska, Lucja Maria"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Wilkins, David C."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-12-17T20:00:29Z","date_published":"2014-12-17T20:00:29Z","updated_at":"2026-07-22T22:26:06Z","subjects":["Language, Linguistics","Computer Science"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(UMI)AAI9305564"],"render_values":[{"text":"(UMI)AAI9305564","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/72069","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Wilkins, David C."]},{"key":"dc:creator","label":"Author","values":["Iwanska, Lucja Maria"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-12-17T20:00:29Z","10000-01-01","1992"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Language, Linguistics","Computer Science"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/72069","(UMI)AAI9305564"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["The research contribution of this dissertation is a formal, computational model of the semantics of negation in natural language; its major components are two knowledge representation formalisms with Boolean semantics: a computable Boolean algebra for representing concepts and a computable Boolean algebra for representing the semantics of scalar predicate expressions of natural language that denote quantitative values. The UNO computer implementation demonstrates that this semantic model faithfully captures the logical inferences that people draw from English sentences with explicit negative information. The UNO natural language processing system is shown to correctly handle a substantial subset of English: knowledge from sentences involving negation as well as conjunction and disjunction of complex determiners, adjectives, adverbs, common nouns, proper nouns, noun phrases, verbs, verb phrases, prepositions, and prepositional phrases can be represented and reasoned with. Areas of future research involve extending the model to handle modal operators, sentential adverbs, pragmatics, temporal reasoning, intensionality and non-logical reasoning.","Made available in DSpace on 2014-12-17T20:00:29Z (GMT). No. of bitstreams: 1 9305564.pdf: 10153434 bytes, checksum: 05cdf511f45cf5cc82b8eff9630a3480 (MD5) Previous issue date: 1992","Embargo set by: Seth Robbins for item 72237 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","319 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1992."]},{"key":"dc:title","label":"Title","values":["A General Semantic Model of Negation in Natural Language: Representation and Inference"]}]}],"canonical_facts":{"dc:contributor":["Wilkins, David C."],"dc:creator":["Iwanska, Lucja Maria"],"dc:date":["2014-12-17T20:00:29Z","10000-01-01","1992"],"dc:description":["The research contribution of this dissertation is a formal, computational model of the semantics of negation in natural language; its major components are two knowledge representation formalisms with Boolean semantics: a computable Boolean algebra for representing concepts and a computable Boolean algebra for representing the semantics of scalar predicate expressions of natural language that denote quantitative values. The UNO computer implementation demonstrates that this semantic model faithfully captures the logical inferences that people draw from English sentences with explicit negative information. The UNO natural language processing system is shown to correctly handle a substantial subset of English: knowledge from sentences involving negation as well as conjunction and disjunction of complex determiners, adjectives, adverbs, common nouns, proper nouns, noun phrases, verbs, verb phrases, prepositions, and prepositional phrases can be represented and reasoned with. Areas of future research involve extending the model to handle modal operators, sentential adverbs, pragmatics, temporal reasoning, intensionality and non-logical reasoning.","Made available in DSpace on 2014-12-17T20:00:29Z (GMT). No. of bitstreams: 1 9305564.pdf: 10153434 bytes, checksum: 05cdf511f45cf5cc82b8eff9630a3480 (MD5) Previous issue date: 1992","Embargo set by: Seth Robbins for item 72237 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","319 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1992."],"dc:identifier":["http://hdl.handle.net/2142/72069","(UMI)AAI9305564"],"dc:subject":["Language, Linguistics","Computer Science"],"dc:title":["A General Semantic Model of Negation in Natural Language: Representation and Inference"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:06Z"}