منابع مشابه
Extensional Reasoning
Relational databases have had great industrial success in computer science, their power evidenced by theoretical analysis and widespread adoption. Often, automated theorem provers do not take advantage of database query engines and therefore do not routinely leverage that source of power. Extensional Reasoning is a novel approach to automated theorem proving where the system automatically trans...
متن کاملExtensional Higher-Order Datalog
We define a higher-order extension of Datalog based on the Horn fragment of higher-order logic introduced in [Wad91]. Programs of Higher-Order Datalog can be understood declaratively as formulas in extensional higher-order logic, in which (for example) a unary predicate of unary predicates is a set of sets of data objects. The language retains all the basic principles of first-order logic progr...
متن کاملSub-extensional type theory
Martin-Löf’s type theory is the basis of a variety of formal systems underlying many proof assistants. There are a lot of variants of type theory, among which two classes can be identified: intensional and extensional type theory. The difference between the two lies in the manner in which the equality is dealt with, but this results in huge differences. Intensional type theory requires the user...
متن کاملReformulation for Extensional Reasoning
Relational databases have had great industrial success in computer science. The power of the paradigm is made clear both by its widespread adoption and by theoretical analysis. Today, automated theorem provers are not able to take advantage of database query engines and therefore do not routinely leverage that source of power. Extensional Reasoning (ER) is an approach to automated theorem provi...
متن کاملExtensional Higher-Order Resolution
In this paper we present an extensional higher-order resolution calculus that is complete relative to Henkin model semantics. The treatment of the extensionality principles – necessary for the completeness result – by specialized (goal-directed) inference rules is of practical applicability, as an implentation of the calculus in the Leo-System shows. Furthermore, we prove the long-standing conj...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1951
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1951-0041421-2