Semi-partitioned horn clauses: a tractable logic of types

Authors:
Allan Ramsay
Affiliations:
School of Computer Science, University of Manchester, Manchester, UK
Venue:
AIMSA'10 Proceedings of the 14th international conference on Artificial intelligence: methodology, systems, and applications
Year:
2010

Citing 4
Cited 0

Semantic interpretation and the resolution of ambiguity

Semantic interpretation and the resolution of ambiguity
Efficient implementation of lattice operations

ACM Transactions on Programming Languages and Systems (TOPLAS)
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Reasoning with taxonomies

Reasoning with taxonomies

Quantified Score

Hi-index	0.00

Visualization

Abstract

Reasoning about types is a common task, and there are a number of logics that have been developed for this purpose [1,2]. The problem is that type logics with efficient proof procedures are not very expressive, and logics with more expressive power are not tractable. The current paper presents a logic which is considerably more expressive than using a simple taxonomy, but for which the proof procedure is nonetheless linear.