Back to search

NJIT

Recasting Cohn's many sorted logic into a constrained logic

Abstract

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.

Degree

thesis:*
Name thesis:degree_name
Master of Science in Computer Science - (M.S.)
Discipline thesis:degree_discipline
Computer and Information Science

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Koelbl, Christopher Brendan
Contributors dc:contributor
  • Richard B. Sher
  • Thomas Featheringham
  • James A. McHugh

Subjects

dc:subject × 5

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.njit.edu/theses/856

Chain of custody

source
Harvested from
NJIT
Base URL
digitalcommons.njit.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Koelbl, Christopher Brendan. Recasting Cohn's many sorted logic into a constrained logic. https://digitalcommons.njit.edu/theses/856