{"id":{"repo_id":"njit","oai_identifier":"oai:digitalcommons.njit.edu:theses-1855"},"canonical_url":"https://search.ndltd.org/etd/njit/oai:digitalcommons.njit.edu:theses-1855","repository":{"repo_id":"njit","name":"NJIT","base_url":"https://digitalcommons.njit.edu/do/oai/"},"display":{"title":"Recasting Cohn's many sorted logic into a constrained logic","abstract":"The use of a many sorted logic for theorem proving carries many advantages over a traditional unsorted logic. By placing restrictions on the search space, a many sorted logic can significantly reduce the amount steps in the resolution process. However, as a logic becomes more efficient, it increases in complexity. One of these efficient log ics is Cohn's Many Sorted Logic, LLAMA. It uses complex data structures such as the sort lattice and sort arrays to maintain information about the sorts. Recasting LLAMA into Burckert's constrained logic will keep the functionality of LLAMA while using a format that reduces the complexity and maintains a more traditional resolution rule.","abstract_html":"The use of a many sorted logic for theorem proving carries many advantages over a traditional unsorted logic. By placing restrictions on the search space, a many sorted logic can significantly reduce the amount steps in the resolution process. However, as a logic becomes more efficient, it increases in complexity. One of these efficient log ics is Cohn&#x27;s Many Sorted Logic, LLAMA. It uses complex data structures such as the sort lattice and sort arrays to maintain information about the sorts. Recasting LLAMA into Burckert&#x27;s constrained logic will keep the functionality of LLAMA while using a format that reduces the complexity and maintains a more traditional resolution rule.","abstract_has_math":false,"creators":["Koelbl, Christopher Brendan"],"institution":null,"degree_name":"Master of Science in Computer Science - (M.S.)","degree_level":null,"degree_discipline":"Computer and Information Science","degree_department":null,"school":null,"contributors":["Richard B. Sher","Thomas Featheringham","James A. McHugh"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:40:14Z","subjects":["Computer science --Mathematics.","Logic","Symbolic and mathematical.","Artificial intelligence.","Computer Sciences"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.njit.edu/theses/856","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.njit.edu/theses/856","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.njit.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.njit.edu%3Atheses-1855","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Richard B. Sher","Thomas Featheringham","James A. McHugh"]},{"key":"dc:creator","label":"Author","values":["Koelbl, Christopher Brendan"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.created","label":"Dc Date Created","values":["1999-05-31T07:00:00Z"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer and Information Science"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science in Computer Science - (M.S.)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer science --Mathematics.","Logic","Symbolic and mathematical.","Artificial intelligence.","Computer Sciences"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.njit.edu/theses/856"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The use of a many sorted logic for theorem proving carries many advantages over a traditional unsorted logic. By placing restrictions on the search space, a many sorted logic can significantly reduce the amount steps in the resolution process. However, as a logic becomes more efficient, it increases in complexity. One of these efficient log ics is Cohn's Many Sorted Logic, LLAMA. It uses complex data structures such as the sort lattice and sort arrays to maintain information about the sorts. Recasting LLAMA into Burckert's constrained logic will keep the functionality of LLAMA while using a format that reduces the complexity and maintains a more traditional resolution rule."]},{"key":"dc:title","label":"Title","values":["Recasting Cohn's many sorted logic into a constrained logic"]}]}],"canonical_facts":{"dc:contributor":["Richard B. Sher","Thomas Featheringham","James A. McHugh"],"dc:creator":["Koelbl, Christopher Brendan"],"dc:date.created":["1999-05-31T07:00:00Z"],"dc:description.abstract":["The use of a many sorted logic for theorem proving carries many advantages over a traditional unsorted logic. By placing restrictions on the search space, a many sorted logic can significantly reduce the amount steps in the resolution process. However, as a logic becomes more efficient, it increases in complexity. One of these efficient log ics is Cohn's Many Sorted Logic, LLAMA. It uses complex data structures such as the sort lattice and sort arrays to maintain information about the sorts. Recasting LLAMA into Burckert's constrained logic will keep the functionality of LLAMA while using a format that reduces the complexity and maintains a more traditional resolution rule."],"dc:identifier":["https://digitalcommons.njit.edu/theses/856"],"dc:subject":["Computer science --Mathematics.","Logic","Symbolic and mathematical.","Artificial intelligence.","Computer Sciences"],"dc:title":["Recasting Cohn's many sorted logic into a constrained logic"],"dc:type":["Thesis"],"thesis:degree_discipline":["Computer and Information Science"],"thesis:degree_name":["Master of Science in Computer Science - (M.S.)"]},"updated_at":"2026-11-19T08:40:14Z"}