On the efficiency of subsumption algorithms
From MaRDI portal
Publication:3771609
DOI10.1145/3149.214118zbMath0633.68028DBLPjournals/jacm/GottlobL85OpenAlexW2112827998WikidataQ59259788 ScholiaQ59259788MaRDI QIDQ3771609
Georg Gottlob, Alexander Leitsch
Publication date: 1985
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3149.214118
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (14)
Subsumption and implication ⋮ The anatomy of vampire. Implementing bottom-up procedures with code trees ⋮ Deciding expressive description logics in the framework of resolution ⋮ Reduction rules for resolution-based systems ⋮ Fully abstract compositional semantics for an algebra of logic programs ⋮ Removing redundancy from a clause ⋮ A new subsumption method in the connection graph proof procedure ⋮ Recursive query processing: The power of logic ⋮ Subsumption Algorithms for Three-Valued Geometric Resolution ⋮ European Summer Meeting of the Association for Symbolic Logic, Paris, 1985 ⋮ An efficient subsumption test pipeline for BS(LRA) clauses ⋮ Generating efficient diagnostic procedures from model-based knowledge using logic programming techniques ⋮ Thue trees ⋮ Subsumption algorithms based on search trees
This page was built for publication: On the efficiency of subsumption algorithms
