Computing Minimal EL-unifiers is Hard

, &
In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 18-35 (1998)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,197

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Deciding Unifiability and Computing Local Unifiers in the Description Logic $mathcal{E!L}$ without Top Constructor.Franz Baader, Nguyen Thanh Binh, Stefan Borgwardt & Barbara Morawska - 2016 - Notre Dame Journal of Formal Logic 57 (4):443-476.
Algorithms for computing minimal conflicts.S. Luan, L. Magnani & G. Dai - 2006 - Logic Journal of the IGPL 14 (2):391--406.
Unification and projectivity in Fregean varieties.Katarzyna Słomczyńska - 2012 - Logic Journal of the IGPL 20 (1):73-93.
Best Unifiers in Transitive Modal Logics.Vladimir V. Rybakov - 2011 - Studia Logica 99 (1-3):321-336.
What a course on philosophy of computing is not.Vincent C. Müller - 2008 - APA Newsletter on Philosophy and Computers 8 (1):36-38.
Unification and admissible rules for paraconsistent minimal Johanssonsʼ logic J and positive intuitionistic logic IPC.Sergei Odintsov & Vladimir Rybakov - 2013 - Annals of Pure and Applied Logic 164 (7-8):771-784.
Women and the social construction of the computing culture: Evolving new forms of computing. [REVIEW]Joan Truckenbrod - 1993 - AI and Society 7 (4):345-357.
Coincident Entities and Question-Begging Predicates: an Issue in Meta-Ontology.Francesco Berto - 2013 - Metaphysica 14 (1):1-15.
A Hyperimmune Minimal Degree and an ANR 2-Minimal Degree.Mingzhong Cai - 2010 - Notre Dame Journal of Formal Logic 51 (4):443-455.
Computing as a Science: A Survey of Competing Viewpoints. [REVIEW]Matti Tedre - 2011 - Minds and Machines 21 (3):361-387.
Filtering unification and most general unifiers in modal logic.Silvio Ghilardi & Lorenzo Sacchetti - 2004 - Journal of Symbolic Logic 69 (3):879-906.
Program Verification and Functioning of Operative Computing Revisited: How about Mathematics Engineering? [REVIEW]Uri Pincas - 2011 - Minds and Machines 21 (2):337-359.
The functional account of computing mechanisms.Gualtiero Piccinini - 2004 - PhilSci Archive.
Facing Computing as Technique: Towards a History and Philosophy of Computing.Liesbeth de Mol & Giuseppe Primiero - 2014 - Philosophy and Technology 27 (3):321-326.
Ubiquitous computing, empathy and the self.Soraj Hongladarom - 2013 - AI and Society 28 (2):227-236.

Analytics

Added to PP
2018-02-17

Downloads
10 (#1,198,034)

6 months
2 (#1,205,524)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Description Logic Handbook.Franz Baader (ed.) - 2003 - Cambridge University Press.
Unification in intuitionistic logic.Silvio Ghilardi - 1999 - Journal of Symbolic Logic 64 (2):859-880.
Unification in modal and description logics.Franz Baader & Silvio Ghilardi - 2011 - Logic Journal of the IGPL 19 (6):705-730.
Proof theory for admissible rules.Rosalie Iemhoff & George Metcalfe - 2009 - Annals of Pure and Applied Logic 159 (1-2):171-186.

Add more references