scientific article; zbMATH DE number 2209390

MaRDI QIDQ5692352zbMATH OpenFDO

Authors Stefano Ferilli, Nicola Di Mauro, Teresa Maria Altomare Basile, Floriana Esposito

Publication date 28 September 2005

Mathematics Subject Classification ID

Logic programming (68N17) Logic in artificial intelligence (68T27)

Recommendations

• AI*IA 2003: Advances in Artificial Intelligence
• An exhaustive matching procedure for the improvement of learning efficiency.
• scientific article; zbMATH DE number 970722
• A new subsumption method in the connection graph proof procedure
• Resolution theorem proving

Cited in

(8)

• A new subsumption method in the connection graph proof procedure
• Subsumer: a Prolog -subsumption engine
• scientific article; zbMATH DE number 3862479 (Why is no real title available?)
• scientific article; zbMATH DE number 1875397 (Why is no real title available?)
• θ-Subsumption Based on Object Context
• Fast theta-subsumption with constraint satisfaction algorithms
• An exhaustive matching procedure for the improvement of learning efficiency.
• Fast theta-subsumption with constraint satisfaction algorithms

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5692352)