See this document in CiteSeerX!

Subsumption and Resolution: A New  (Make Corrections)  
Algorithm S. Ferilli, N. Di Mauro, T.M.A. Basile, and F. Esposito...



  Home/Search   Context   Related

 
View or download:
di.uniba.it/~ndm/p...ferilli03ismis.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  di.uniba.it/~ndm/publ...sort_date (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: E#ciency of the first-order logic proof procedure is a major issue when deduction systems are to be used in real environments, both on their own and as a component of larger systems (e.g., learning systems). This paper proposes a new #-subsumption algorithm that is able to return the set of all substitutions by which such a relation holds between two clauses without performing backtracking. Di#erently from others proposed in the literature, it can be extended to perform resolution, also... (Update)

Active bibliography (related documents):   More   All
1.4:   Efficient theta-Subsumption under Object Identity - Ferilli, Fanizzi, Di Mauro.. (2002)   (Correct)
0.5:   Thue Trees - Marcinkowski, Pacholski   (Correct)
0.5:   On the Semantics of Logic Program Composition - Antonio Brogi Department   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ di-subsumption,
  author = "Algorithm Ferilli Di",
  title = "Subsumption and Resolution: A New",
  url = "citeseer.ist.psu.edu/742624.html" }
Citations (may not include all citations):
1838   Foundations of Logic Programming (context) - Lloyd - 1987
634   A machine-oriented logic based on the resolution principle (context) - Robinson - 1965
309   Symbolic Logic and Mechanical Theorem Proving (context) - Chang, Lee - 1973
14   Multistrategy Theory Revision: Induction and abduction in IN.. (context) - Esposito, Semeraro et al. - 2000
5   Subsumption and connection graphs (context) - Eisinger - 1981
5   cient subsumption algorithm for inductive logic programming (context) - Kietz, Lubbe - 1994
3   subsumption based on graph algorithms (context) - Sche, Herbrich et al. - 1997
3   Implication of clauses is undecidable (context) - Schmidt-Schauss - 1988
2   The concept of weak substitution in theorem-proving (context) - Stillman - 1973
2   subsumption in a constraint satisfaction perspective (context) - Maloberti, Sebag - 2001
2   ciency of subsumption algorithms (context) - Gottlob, Leitsch - 1985

Documents on the same site (http://www.di.uniba.it/~ndm/publications/sort_date.html):   More
INTHELEX: INcremental THEory Learner from EXamples - Basile, Belsanti, Di Mauro, .. (2001)   (Correct)
Evaluation and Validation of Two Approaches to User.. - Esposito, Semeraro..   (Correct)
GRAPE: An Expert Review Assignment Component for.. - Di Mauro, Basile..   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC