Semi-partitioned horn clauses: A tractable logic of types

Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Authors:
  • Allan Ramsay

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. © 2010 Springer-Verlag.

Bibliographical metadata

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.
Place of PublicationBerlin
PublisherSpringer Nature
Pages279-280
Number of pages1
Volume6304
ISBN (Print)3642154301, 9783642154300
Publication statusPublished - 2010
Event14th International Conference on Artificial Intelligence: Methodology, Systems, and Applications, AIMSA 2010 - Varna
Event duration: 1 Jul 2010 → …

Conference

Conference14th International Conference on Artificial Intelligence: Methodology, Systems, and Applications, AIMSA 2010
CityVarna
Period1/07/10 → …