Skip to main content
SpringerLink
Log in
Book cover

International Conference on Artificial Intelligence: Methodology, Systems, and Applications

AIMSA 2010: Artificial Intelligence: Methodology, Systems, and Applications pp 279–280Cite as

Semi-partitioned Horn Clauses: A Tractable Logic of Types

  • Conference paper

  • 797 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6304))

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Aït-Kaci, H., Boyer, R., Lincoln, P., Nasr, R.: Efficient implementation of lattice operations. ACM Transations on Programming Languages 11(115), 115–146 (1989)

    Article  Google Scholar 

  2. Fall, A.: Reasoning with taxonomies. PhD thesis, Simon Fraser University (1990)

    Google Scholar 

  3. Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: 39th Design Automation Conference, Las Vegas (2001)

    Google Scholar 

  4. Dowling, W.F., Gallier, J.H.: Linear-time algorithms for testing the satisfiability of propositional horn formulae. Journal of Logic Programming 1(3), 267–284 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  5. Hirst, G.: Semantic interpretation and the resolution of ambiguity. Studies in Natural Language Processing. Cambridge University Press, Cambridge (1987)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, University of Manchester, Manchester, M13 9PL, UK

    Allan Ramsay

Authors
  1. Allan Ramsay
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Winston-Salem State University, 601 S. Martin Luther King Drive, NC 27110, Winston Salem, USA

    Darina Dicheva

  2. Institute of Information Technologies, Bulgarian Academy of Sciences, 29A Acad. Bonchev Str., 1113, Sofia, Bulgaria

    Danail Dochev

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ramsay, A. (2010). Semi-partitioned Horn Clauses: A Tractable Logic of Types. In: Dicheva, D., Dochev, D. (eds) Artificial Intelligence: Methodology, Systems, and Applications. AIMSA 2010. Lecture Notes in Computer Science(), vol 6304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15431-7_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15431-7_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15430-0

  • Online ISBN: 978-3-642-15431-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation